`/* Implementation of the BESSEL_JN and BESSEL_YN transformational
|
`/* Implementation of the BESSEL_JN and BESSEL_YN transformational
|
function using a recurrence algorithm.
|
function using a recurrence algorithm.
|
Copyright 2010 Free Software Foundation, Inc.
|
Copyright 2010 Free Software Foundation, Inc.
|
Contributed by Tobias Burnus <burnus@net-b.de>
|
Contributed by Tobias Burnus <burnus@net-b.de>
|
|
|
This file is part of the GNU Fortran runtime library (libgfortran).
|
This file is part of the GNU Fortran runtime library (libgfortran).
|
|
|
Libgfortran is free software; you can redistribute it and/or
|
Libgfortran is free software; you can redistribute it and/or
|
modify it under the terms of the GNU General Public
|
modify it under the terms of the GNU General Public
|
License as published by the Free Software Foundation; either
|
License as published by the Free Software Foundation; either
|
version 3 of the License, or (at your option) any later version.
|
version 3 of the License, or (at your option) any later version.
|
|
|
Libgfortran is distributed in the hope that it will be useful,
|
Libgfortran is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
Under Section 7 of GPL version 3, you are granted additional
|
Under Section 7 of GPL version 3, you are granted additional
|
permissions described in the GCC Runtime Library Exception, version
|
permissions described in the GCC Runtime Library Exception, version
|
3.1, as published by the Free Software Foundation.
|
3.1, as published by the Free Software Foundation.
|
|
|
You should have received a copy of the GNU General Public License and
|
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;
|
a copy of the GCC Runtime Library Exception along with this program;
|
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#include "libgfortran.h"
|
#include "libgfortran.h"
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#include <assert.h>'
|
#include <assert.h>'
|
|
|
include(iparm.m4)dnl
|
include(iparm.m4)dnl
|
include(`mtype.m4')dnl
|
include(`mtype.m4')dnl
|
|
|
mathfunc_macro
|
mathfunc_macro
|
|
|
`#if defined (HAVE_'rtype_name`)
|
`#if defined (HAVE_'rtype_name`)
|
|
|
|
|
|
|
#if 'hasmathfunc(jn)`
|
#if 'hasmathfunc(jn)`
|
extern void bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1,
|
extern void bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1,
|
int n2, 'rtype_name` x);
|
int n2, 'rtype_name` x);
|
export_proto(bessel_jn_r'rtype_kind`);
|
export_proto(bessel_jn_r'rtype_kind`);
|
|
|
void
|
void
|
bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1, int n2, 'rtype_name` x)
|
bessel_jn_r'rtype_kind` ('rtype` * const restrict ret, int n1, int n2, 'rtype_name` x)
|
{
|
{
|
int i;
|
int i;
|
index_type stride;
|
index_type stride;
|
|
|
'rtype_name` last1, last2, x2rev;
|
'rtype_name` last1, last2, x2rev;
|
|
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
|
|
if (ret->data == NULL)
|
if (ret->data == NULL)
|
{
|
{
|
size_t size = n2 < n1 ? 0 : n2-n1+1;
|
size_t size = n2 < n1 ? 0 : n2-n1+1;
|
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
|
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
|
ret->data = internal_malloc_size (sizeof ('rtype_name`) * size);
|
ret->data = internal_malloc_size (sizeof ('rtype_name`) * size);
|
ret->offset = 0;
|
ret->offset = 0;
|
}
|
}
|
|
|
if (unlikely (n2 < n1))
|
if (unlikely (n2 < n1))
|
return;
|
return;
|
|
|
if (unlikely (compile_options.bounds_check)
|
if (unlikely (compile_options.bounds_check)
|
&& GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
|
&& GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
|
runtime_error("Incorrect extent in return value of BESSEL_JN "
|
runtime_error("Incorrect extent in return value of BESSEL_JN "
|
"(%ld vs. %ld)", (long int) n2-n1,
|
"(%ld vs. %ld)", (long int) n2-n1,
|
(long int) GFC_DESCRIPTOR_EXTENT(ret,0));
|
(long int) GFC_DESCRIPTOR_EXTENT(ret,0));
|
|
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
|
|
if (unlikely (x == 0))
|
if (unlikely (x == 0))
|
{
|
{
|
ret->data[0] = 1;
|
ret->data[0] = 1;
|
for (i = 1; i <= n2-n1; i++)
|
for (i = 1; i <= n2-n1; i++)
|
ret->data[i*stride] = 0;
|
ret->data[i*stride] = 0;
|
return;
|
return;
|
}
|
}
|
|
|
ret->data = ret->data;
|
ret->data = ret->data;
|
last1 = MATHFUNC(jn) (n2, x);
|
last1 = MATHFUNC(jn) (n2, x);
|
ret->data[(n2-n1)*stride] = last1;
|
ret->data[(n2-n1)*stride] = last1;
|
|
|
if (n1 == n2)
|
if (n1 == n2)
|
return;
|
return;
|
|
|
last2 = MATHFUNC(jn) (n2 - 1, x);
|
last2 = MATHFUNC(jn) (n2 - 1, x);
|
ret->data[(n2-n1-1)*stride] = last2;
|
ret->data[(n2-n1-1)*stride] = last2;
|
|
|
if (n1 + 1 == n2)
|
if (n1 + 1 == n2)
|
return;
|
return;
|
|
|
x2rev = GFC_REAL_'rtype_kind`_LITERAL(2.)/x;
|
x2rev = GFC_REAL_'rtype_kind`_LITERAL(2.)/x;
|
|
|
for (i = n2-n1-2; i >= 0; i--)
|
for (i = n2-n1-2; i >= 0; i--)
|
{
|
{
|
ret->data[i*stride] = x2rev * (i+1+n1) * last2 - last1;
|
ret->data[i*stride] = x2rev * (i+1+n1) * last2 - last1;
|
last1 = last2;
|
last1 = last2;
|
last2 = ret->data[i*stride];
|
last2 = ret->data[i*stride];
|
}
|
}
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
#if 'hasmathfunc(yn)`
|
#if 'hasmathfunc(yn)`
|
extern void bessel_yn_r'rtype_kind` ('rtype` * const restrict ret,
|
extern void bessel_yn_r'rtype_kind` ('rtype` * const restrict ret,
|
int n1, int n2, 'rtype_name` x);
|
int n1, int n2, 'rtype_name` x);
|
export_proto(bessel_yn_r'rtype_kind`);
|
export_proto(bessel_yn_r'rtype_kind`);
|
|
|
void
|
void
|
bessel_yn_r'rtype_kind` ('rtype` * const restrict ret, int n1, int n2,
|
bessel_yn_r'rtype_kind` ('rtype` * const restrict ret, int n1, int n2,
|
'rtype_name` x)
|
'rtype_name` x)
|
{
|
{
|
int i;
|
int i;
|
index_type stride;
|
index_type stride;
|
|
|
'rtype_name` last1, last2, x2rev;
|
'rtype_name` last1, last2, x2rev;
|
|
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
|
|
if (ret->data == NULL)
|
if (ret->data == NULL)
|
{
|
{
|
size_t size = n2 < n1 ? 0 : n2-n1+1;
|
size_t size = n2 < n1 ? 0 : n2-n1+1;
|
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
|
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
|
ret->data = internal_malloc_size (sizeof ('rtype_name`) * size);
|
ret->data = internal_malloc_size (sizeof ('rtype_name`) * size);
|
ret->offset = 0;
|
ret->offset = 0;
|
}
|
}
|
|
|
if (unlikely (n2 < n1))
|
if (unlikely (n2 < n1))
|
return;
|
return;
|
|
|
if (unlikely (compile_options.bounds_check)
|
if (unlikely (compile_options.bounds_check)
|
&& GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
|
&& GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
|
runtime_error("Incorrect extent in return value of BESSEL_JN "
|
runtime_error("Incorrect extent in return value of BESSEL_JN "
|
"(%ld vs. %ld)", (long int) n2-n1,
|
"(%ld vs. %ld)", (long int) n2-n1,
|
(long int) GFC_DESCRIPTOR_EXTENT(ret,0));
|
(long int) GFC_DESCRIPTOR_EXTENT(ret,0));
|
|
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
|
|
if (unlikely (x == 0))
|
if (unlikely (x == 0))
|
{
|
{
|
for (i = 0; i <= n2-n1; i++)
|
for (i = 0; i <= n2-n1; i++)
|
#if defined('rtype_name`_INFINITY)
|
#if defined('rtype_name`_INFINITY)
|
ret->data[i*stride] = -'rtype_name`_INFINITY;
|
ret->data[i*stride] = -'rtype_name`_INFINITY;
|
#else
|
#else
|
ret->data[i*stride] = -'rtype_name`_HUGE;
|
ret->data[i*stride] = -'rtype_name`_HUGE;
|
#endif
|
#endif
|
return;
|
return;
|
}
|
}
|
|
|
ret->data = ret->data;
|
ret->data = ret->data;
|
last1 = MATHFUNC(yn) (n1, x);
|
last1 = MATHFUNC(yn) (n1, x);
|
ret->data[0] = last1;
|
ret->data[0] = last1;
|
|
|
if (n1 == n2)
|
if (n1 == n2)
|
return;
|
return;
|
|
|
last2 = MATHFUNC(yn) (n1 + 1, x);
|
last2 = MATHFUNC(yn) (n1 + 1, x);
|
ret->data[1*stride] = last2;
|
ret->data[1*stride] = last2;
|
|
|
if (n1 + 1 == n2)
|
if (n1 + 1 == n2)
|
return;
|
return;
|
|
|
x2rev = GFC_REAL_'rtype_kind`_LITERAL(2.)/x;
|
x2rev = GFC_REAL_'rtype_kind`_LITERAL(2.)/x;
|
|
|
for (i = 2; i <= n1+n2; i++)
|
for (i = 2; i <= n1+n2; i++)
|
{
|
{
|
#if defined('rtype_name`_INFINITY)
|
#if defined('rtype_name`_INFINITY)
|
if (unlikely (last2 == -'rtype_name`_INFINITY))
|
if (unlikely (last2 == -'rtype_name`_INFINITY))
|
{
|
{
|
ret->data[i*stride] = -'rtype_name`_INFINITY;
|
ret->data[i*stride] = -'rtype_name`_INFINITY;
|
}
|
}
|
else
|
else
|
#endif
|
#endif
|
{
|
{
|
ret->data[i*stride] = x2rev * (i-1+n1) * last2 - last1;
|
ret->data[i*stride] = x2rev * (i-1+n1) * last2 - last1;
|
last1 = last2;
|
last1 = last2;
|
last2 = ret->data[i*stride];
|
last2 = ret->data[i*stride];
|
}
|
}
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
#endif'
|
#endif'
|
|
|
|
|
