644cb69f80
PR libfortran/19308 PR fortran/20120 PR libfortran/22437 * Makefile.am: Add generated files for large real and integers kinds. Add a rule to create the kinds.inc c99_protos.inc files. Use kinds.inc to preprocess Fortran generated files. * libgfortran.h: Add macro definitions for GFC_INTEGER_16_HUGE, GFC_REAL_10_HUGE and GFC_REAL_16_HUGE. Add types gfc_array_i16, gfc_array_r10, gfc_array_r16, gfc_array_c10, gfc_array_c16, gfc_array_l16. * mk-kinds-h.sh: Define macros HAVE_GFC_LOGICAL_* and HAVE_GFC_COMPLEX_* when these types are available. * intrinsics/ishftc.c (ishftc16): New function for GFC_INTEGER_16. * m4/all.m4, m4/any.m4, m4/count.m4, m4/cshift1.m4, m4/dotprod.m4, m4/dotprodc.m4, m4/dotprodl.m4, m4/eoshift1.m4, m4/eoshift3.m4, m4/exponent.m4, m4/fraction.m4, m4/in_pack.m4, m4/in_unpack.m4, m4/matmul.m4, m4/matmull.m4, m4/maxloc0.m4, m4/maxloc1.m4, m4/maxval.m4, m4/minloc0.m4, m4/minloc1.m4, m4/minval.m4, m4/mtype.m4, m4/nearest.m4, m4/pow.m4, m4/product.m4, m4/reshape.m4, m4/set_exponent.m4, m4/shape.m4, m4/specific.m4, m4/specific2.m4, m4/sum.m4, m4/transpose.m4: Protect generated functions with appropriate "#if defined (HAVE_GFC_type_kind)" preprocessor directives. * Makefile.in: Regenerate. * all files in generated/: Regenerate. * f95-lang.c (DO_DEFINE_MATH_BUILTIN): Add support for long double builtin function. (gfc_init_builtin_functions): Add mfunc_longdouble, mfunc_clongdouble and func_clongdouble_longdouble trees. Build them for round, trunc, cabs, copysign and pow functions. * iresolve.c (gfc_resolve_reshape, gfc_resolve_transpose): Add case for kind 10 and 16. * trans-decl.c: Add trees for cpowl10, cpowl16, ishftc16, exponent10 and exponent16. (gfc_build_intrinsic_function_decls): Build nodes for int16, real10, real16, complex10 and complex16 types. Build all possible combinations for function _gfortran_pow_?n_?n. Build function calls cpowl10, cpowl16, ishftc16, exponent10 and exponent16. * trans-expr.c (gfc_conv_power_op): Add case for integer(16), real(10) and real(16). * trans-intrinsic.c: Add suppport for long double builtin functions in BUILT_IN_FUNCTION, LIBM_FUNCTION and LIBF_FUNCTION macros. (gfc_conv_intrinsic_aint): Add case for integer(16), real(10) and real(16) kinds. (gfc_build_intrinsic_lib_fndecls): Add support for real10_decl and real16_decl in library functions. (gfc_get_intrinsic_lib_fndecl): Add cases for real and complex kinds 10 and 16. (gfc_conv_intrinsic_exponent): Add cases for real(10) and real(16) kinds. (gfc_conv_intrinsic_sign): Likewise. (gfc_conv_intrinsic_ishftc): Add case for integer(16) kind. * trans-types.c (gfc_get_int_type, gfc_get_real_type, gfc_get_complex_type, gfc_get_logical_type): Doesn't error out in the case of kinds not available. * trans.h: Declare trees for cpowl10, cpowl16, ishftc16, exponent10 and exponent16. * gfortran.dg/large_real_kind_2.F90: New test. * gfortran.dg/large_integer_kind_2.f90: New test. From-SVN: r104889
252 lines
6.7 KiB
C
252 lines
6.7 KiB
C
/* Implementation of the EOSHIFT intrinsic
|
|
Copyright 2002, 2005 Free Software Foundation, Inc.
|
|
Contributed by Paul Brook <paul@nowt.org>
|
|
|
|
This file is part of the GNU Fortran 95 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 2 of the License, or (at your option) any later version.
|
|
|
|
In addition to the permissions in the GNU General Public License, the
|
|
Free Software Foundation gives you unlimited permission to link the
|
|
compiled version of this file into combinations with other programs,
|
|
and to distribute those combinations without any restriction coming
|
|
from the use of this file. (The General Public License restrictions
|
|
do apply in other respects; for example, they cover modification of
|
|
the file, and distribution when not linked into a combine
|
|
executable.)
|
|
|
|
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.
|
|
|
|
You should have received a copy of the GNU General Public
|
|
License along with libgfortran; see the file COPYING. If not,
|
|
write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
Boston, MA 02110-1301, USA. */
|
|
|
|
#include "config.h"
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include "libgfortran.h"
|
|
|
|
#if defined (HAVE_GFC_INTEGER_8)
|
|
|
|
static void
|
|
eoshift1 (gfc_array_char *ret, const gfc_array_char *array, const gfc_array_i8 *h,
|
|
const char *pbound, const GFC_INTEGER_8 *pwhich, index_type size,
|
|
char filler)
|
|
{
|
|
/* r.* indicates the return array. */
|
|
index_type rstride[GFC_MAX_DIMENSIONS];
|
|
index_type rstride0;
|
|
index_type roffset;
|
|
char *rptr;
|
|
char *dest;
|
|
/* s.* indicates the source array. */
|
|
index_type sstride[GFC_MAX_DIMENSIONS];
|
|
index_type sstride0;
|
|
index_type soffset;
|
|
const char *sptr;
|
|
const char *src;
|
|
/* h.* indicates the shift array. */
|
|
index_type hstride[GFC_MAX_DIMENSIONS];
|
|
index_type hstride0;
|
|
const GFC_INTEGER_8 *hptr;
|
|
|
|
index_type count[GFC_MAX_DIMENSIONS];
|
|
index_type extent[GFC_MAX_DIMENSIONS];
|
|
index_type dim;
|
|
index_type len;
|
|
index_type n;
|
|
int which;
|
|
GFC_INTEGER_8 sh;
|
|
GFC_INTEGER_8 delta;
|
|
|
|
/* The compiler cannot figure out that these are set, initialize
|
|
them to avoid warnings. */
|
|
len = 0;
|
|
soffset = 0;
|
|
roffset = 0;
|
|
|
|
if (pwhich)
|
|
which = *pwhich - 1;
|
|
else
|
|
which = 0;
|
|
|
|
extent[0] = 1;
|
|
count[0] = 0;
|
|
|
|
if (ret->data == NULL)
|
|
{
|
|
int i;
|
|
|
|
ret->data = internal_malloc_size (size * size0 ((array_t *)array));
|
|
ret->offset = 0;
|
|
ret->dtype = array->dtype;
|
|
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
|
|
{
|
|
ret->dim[i].lbound = 0;
|
|
ret->dim[i].ubound = array->dim[i].ubound - array->dim[i].lbound;
|
|
|
|
if (i == 0)
|
|
ret->dim[i].stride = 1;
|
|
else
|
|
ret->dim[i].stride = (ret->dim[i-1].ubound + 1) * ret->dim[i-1].stride;
|
|
}
|
|
}
|
|
|
|
n = 0;
|
|
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
|
{
|
|
if (dim == which)
|
|
{
|
|
roffset = ret->dim[dim].stride * size;
|
|
if (roffset == 0)
|
|
roffset = size;
|
|
soffset = array->dim[dim].stride * size;
|
|
if (soffset == 0)
|
|
soffset = size;
|
|
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
|
}
|
|
else
|
|
{
|
|
count[n] = 0;
|
|
extent[n] = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
|
rstride[n] = ret->dim[dim].stride * size;
|
|
sstride[n] = array->dim[dim].stride * size;
|
|
|
|
hstride[n] = h->dim[n].stride;
|
|
n++;
|
|
}
|
|
}
|
|
if (sstride[0] == 0)
|
|
sstride[0] = size;
|
|
if (rstride[0] == 0)
|
|
rstride[0] = size;
|
|
if (hstride[0] == 0)
|
|
hstride[0] = 1;
|
|
|
|
dim = GFC_DESCRIPTOR_RANK (array);
|
|
rstride0 = rstride[0];
|
|
sstride0 = sstride[0];
|
|
hstride0 = hstride[0];
|
|
rptr = ret->data;
|
|
sptr = array->data;
|
|
hptr = h->data;
|
|
|
|
while (rptr)
|
|
{
|
|
/* Do the shift for this dimension. */
|
|
sh = *hptr;
|
|
if (( sh >= 0 ? sh : -sh ) > len)
|
|
{
|
|
delta = len;
|
|
sh = len;
|
|
}
|
|
else
|
|
delta = (sh >= 0) ? sh: -sh;
|
|
|
|
if (sh > 0)
|
|
{
|
|
src = &sptr[delta * soffset];
|
|
dest = rptr;
|
|
}
|
|
else
|
|
{
|
|
src = sptr;
|
|
dest = &rptr[delta * roffset];
|
|
}
|
|
for (n = 0; n < len - delta; n++)
|
|
{
|
|
memcpy (dest, src, size);
|
|
dest += roffset;
|
|
src += soffset;
|
|
}
|
|
if (sh < 0)
|
|
dest = rptr;
|
|
n = delta;
|
|
|
|
if (pbound)
|
|
while (n--)
|
|
{
|
|
memcpy (dest, pbound, size);
|
|
dest += roffset;
|
|
}
|
|
else
|
|
while (n--)
|
|
{
|
|
memset (dest, filler, size);
|
|
dest += roffset;
|
|
}
|
|
|
|
/* Advance to the next section. */
|
|
rptr += rstride0;
|
|
sptr += sstride0;
|
|
hptr += hstride0;
|
|
count[0]++;
|
|
n = 0;
|
|
while (count[n] == extent[n])
|
|
{
|
|
/* When we get to the end of a dimension, reset it and increment
|
|
the next dimension. */
|
|
count[n] = 0;
|
|
/* We could precalculate these products, but this is a less
|
|
frequently used path so proabably not worth it. */
|
|
rptr -= rstride[n] * extent[n];
|
|
sptr -= sstride[n] * extent[n];
|
|
hptr -= hstride[n] * extent[n];
|
|
n++;
|
|
if (n >= dim - 1)
|
|
{
|
|
/* Break out of the loop. */
|
|
rptr = NULL;
|
|
break;
|
|
}
|
|
else
|
|
{
|
|
count[n]++;
|
|
rptr += rstride[n];
|
|
sptr += sstride[n];
|
|
hptr += hstride[n];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void eoshift1_8 (gfc_array_char *, const gfc_array_char *,
|
|
const gfc_array_i8 *, const char *, const GFC_INTEGER_8 *);
|
|
export_proto(eoshift1_8);
|
|
|
|
void
|
|
eoshift1_8 (gfc_array_char *ret, const gfc_array_char *array,
|
|
const gfc_array_i8 *h, const char *pbound,
|
|
const GFC_INTEGER_8 *pwhich)
|
|
{
|
|
eoshift1 (ret, array, h, pbound, pwhich, GFC_DESCRIPTOR_SIZE (array), 0);
|
|
}
|
|
|
|
void eoshift1_8_char (gfc_array_char *, GFC_INTEGER_4,
|
|
const gfc_array_char *, const gfc_array_i8 *,
|
|
const char *, const GFC_INTEGER_8 *,
|
|
GFC_INTEGER_4, GFC_INTEGER_4);
|
|
export_proto(eoshift1_8_char);
|
|
|
|
void
|
|
eoshift1_8_char (gfc_array_char *ret,
|
|
GFC_INTEGER_4 ret_length __attribute__((unused)),
|
|
const gfc_array_char *array, const gfc_array_i8 *h,
|
|
const char *pbound, const GFC_INTEGER_8 *pwhich,
|
|
GFC_INTEGER_4 array_length,
|
|
GFC_INTEGER_4 bound_length
|
|
__attribute__((unused)))
|
|
{
|
|
eoshift1 (ret, array, h, pbound, pwhich, array_length, ' ');
|
|
}
|
|
|
|
#endif
|