21d1335b2a
2012-03-10 Tobias Burnus <burnus@net-b.de> * libgfortran.h (descriptor_dimension, GFC_DIMENSION_LBOUND, GFC_DIMENSION_EXTENT, GFC_DIMENSION_SET, GFC_DESCRIPTOR_DATA, GFC_ARRAY_DESCRIPTOR): Rename _lbound to lower_bound and data to base_addr. * intrinsics/cshift0.c (size0, cshift0): Handle data to base_addr rename. * intrinsics/date_and_time.c (date_and_time, secnds, itime_i4, itime_i8, gmtime_i4, gmtime_i8, ltime_i4, ltime_i8): Ditto. * intrinsics/dtime.c (dtime_sub): Ditto. * intrinsics/eoshift0.c (eoshift0): Ditto. * intrinsics/eoshift2.c (eoshift2): Ditto. * intrinsics/etime.c (etime_sub): Ditto. * intrinsics/iso_c_binding.c (c_f_pointer_u0): Ditto. * intrinsics/move_alloc.c (move_alloc): Ditto. * intrinsics/pack_generic.c (pack_internal, pack, pack_s_internal): Ditto. * intrinsics/random.c (arandom_r4, arandom_r8, arandom_r10, arandom_r16, random_seed_i4, random_seed_i8): Ditto. * intrinsics/reshape_generic.c (reshape_internal): Ditto. * intrinsics/spread_generic.c (spread_internal, spread_internal_scalar, spread, spread_scalar): Ditto. * intrinsics/stat.c (stat_i4_sub_0, stat_i8_sub_0, fstat_i4_sub, fstat_i8_sub): Ditto. * intrinsics/transpose_generic.c (transpose_internal): Ditto. * intrinsics/unpack_generic.c (unpack_bounds, unpack_internal, unpack1, unpack0, unpack0_char4): Ditto. * m4/bessel.m4 (bessel_jn_r'rtype_kind`, * bessel_yn_r'rtype_kind`): Ditto. * m4/cshift0.m4 (cshift0_'rtype_code`): Ditto. * m4/cshift1.m4 (cshift1): Ditto. * m4/eoshift1.m4 (eoshift1): Ditto. * m4/eoshift3.m4 (eoshift3): Ditto. * m4/iforeach.m4 (name`'rtype_qual`_'atype_code): Ditto. * m4/ifunction.m4 (name`'rtype_qual`_'atype_code): Ditto. * m4/ifunction_logical.m4 (name`'rtype_qual`_'atype_code): * Ditto. * m4/in_pack.m4 (internal_pack_'rtype_ccode`): Ditto. * m4/in_unpack.m4 (internal_unpack_'rtype_ccode`): Ditto. * m4/matmul.m4 (matmul_'rtype_code`): Ditto. * m4/matmull.m4 (matmul_'rtype_code`): Ditto. * m4/pack.m4 (pack_'rtype_code`): Ditto. * m4/reshape.m4 (reshape_'rtype_ccode`): Ditto. * m4/shape.m4 (shape_'rtype_kind`): Ditto. * m4/spread.m4 (spread_'rtype_code`): Ditto. * m4/transpose.m4 (transpose_'rtype_code`): Ditto. * m4/unpack.m4 (unpack0_'rtype_code`, unpack1_'rtype_code`): * Ditto. * runtime/bounds.c (count_0): Ditto. * runtime/in_pack_generic.c (internal_pack): Ditto. * runtime/in_unpack_generic.c (internal_unpack): Ditto. * generated/cshift0_r4.c: Regenerated. * generated/unpack_r8.c: Regenerated. * generated/cshift0_c10.c: Regenerated. * generated/in_unpack_i1.c: Regenerated. * generated/eoshift1_16.c: Regenerated. * generated/iany_i16.c: Regenerated. * generated/reshape_i4.c: Regenerated. * generated/parity_l16.c: Regenerated. * generated/in_unpack_r16.c: Regenerated. * generated/iparity_i1.c: Regenerated. * generated/minloc0_16_r10.c: Regenerated. * generated/minloc1_16_i8.c: Regenerated. * generated/bessel_r8.c: Regenerated. * generated/maxloc0_4_i8.c: Regenerated. * generated/maxloc1_8_i1.c: Regenerated. * generated/sum_c10.c: Regenerated. * generated/maxloc0_8_r10.c: Regenerated. * generated/unpack_r16.c: Regenerated. * generated/maxloc1_16_i1.c: Regenerated. * generated/minloc1_4_i1.c: Regenerated. * generated/unpack_i4.c: Regenerated. * generated/in_pack_i1.c: Regenerated. * generated/cshift0_i1.c: Regenerated. * generated/minloc0_16_i4.c: Regenerated. * generated/minloc1_8_r8.c: Regenerated. * generated/maxval_r8.c: Regenerated. * generated/unpack_i2.c: Regenerated. * generated/matmul_r16.c: Regenerated. * generated/maxloc0_16_r8.c: Regenerated. * generated/maxloc1_8_i16.c: Regenerated. * generated/maxloc0_4_r4.c: Regenerated. * generated/pack_c10.c: Regenerated. * generated/in_unpack_c8.c: Regenerated. * generated/maxloc1_8_i8.c: Regenerated. * generated/in_pack_c16.c: Regenerated. * generated/parity_l1.c: Regenerated. * generated/in_pack_i2.c: Regenerated. * generated/maxloc0_4_r8.c: Regenerated. * generated/pack_r4.c: Regenerated. * generated/matmul_r8.c: Regenerated. * generated/pack_i1.c: Regenerated. * generated/minloc0_16_r16.c: Regenerated. * generated/cshift0_c8.c: Regenerated. * generated/minloc1_4_i16.c: Regenerated. * generated/minloc0_4_r4.c: Regenerated. * generated/product_i2.c: Regenerated. * generated/maxval_r10.c: Regenerated. * generated/minloc0_16_r8.c: Regenerated. * generated/in_pack_i8.c: Regenerated. * generated/all_l8.c: Regenerated. * generated/minloc0_8_i16.c: Regenerated. * generated/minloc1_8_i2.c: Regenerated. * generated/matmul_l8.c: Regenerated. * generated/spread_r10.c: Regenerated. * generated/product_c4.c: Regenerated. * generated/reshape_r16.c: Regenerated. * generated/cshift0_i16.c: Regenerated. * generated/minloc1_8_r10.c: Regenerated. * generated/iparity_i8.c: Regenerated. * generated/minloc0_16_i8.c: Regenerated. * generated/minloc1_8_i1.c: Regenerated. * generated/maxloc0_16_r10.c: Regenerated. * generated/maxloc1_8_i4.c: Regenerated. * generated/maxloc0_16_i8.c: Regenerated. * generated/maxloc1_16_i16.c: Regenerated. * generated/reshape_i8.c: Regenerated. * generated/all_l16.c: Regenerated. * generated/cshift1_8.c: Regenerated. * generated/matmul_c10.c: Regenerated. * generated/pack_r16.c: Regenerated. * generated/transpose_r10.c: Regenerated. * generated/maxloc1_16_i2.c: Regenerated. * generated/minloc1_4_r4.c: Regenerated. * generated/reshape_r8.c: Regenerated. * generated/product_r10.c: Regenerated. * generated/spread_c10.c: Regenerated. * generated/reshape_r4.c: Regenerated. * generated/in_unpack_i4.c: Regenerated. * generated/minval_r4.c: Regenerated. * generated/minloc1_16_r16.c: Regenerated. * generated/norm2_r8.c: Regenerated. * generated/iany_i2.c: Regenerated. * generated/eoshift3_8.c: Regenerated. * generated/maxloc1_16_r8.c: Regenerated. * generated/maxloc0_16_r16.c: Regenerated. * generated/cshift0_i8.c: Regenerated. * generated/all_l1.c: Regenerated. * generated/minloc1_16_r10.c: Regenerated. * generated/spread_i16.c: Regenerated. * generated/minloc1_8_r16.c: Regenerated. * generated/spread_r16.c: Regenerated. * generated/matmul_c8.c: Regenerated. * generated/pack_r10.c: Regenerated. * generated/reshape_r10.c: Regenerated. * generated/sum_r10.c: Regenerated. * generated/count_8_l.c: Regenerated. * generated/minloc1_16_i16.c: Regenerated. * generated/maxloc0_16_i2.c: Regenerated. * generated/count_1_l.c: Regenerated. * generated/unpack_c16.c: Regenerated. * generated/any_l8.c: Regenerated. * generated/minloc1_16_i1.c: Regenerated. * generated/sum_r4.c: Regenerated. * generated/in_unpack_r8.c: Regenerated. * generated/product_r8.c: Regenerated. * generated/in_unpack_r4.c: Regenerated. * generated/unpack_i1.c: Regenerated. * generated/cshift0_r8.c: Regenerated. * generated/spread_i2.c: Regenerated. * generated/minloc1_4_r10.c: Regenerated. * generated/minloc1_16_i2.c: Regenerated. * generated/minloc0_16_i2.c: Regenerated. * generated/eoshift3_16.c: Regenerated. * generated/maxloc0_8_i4.c: Regenerated. * generated/maxloc1_16_r10.c: Regenerated. * generated/maxloc1_4_i16.c: Regenerated. * generated/maxloc1_4_r8.c: Regenerated. * generated/parity_l2.c: Regenerated. * generated/maxloc0_16_i16.c: Regenerated. * generated/product_r4.c: Regenerated. * generated/in_unpack_r10.c: Regenerated. * generated/maxloc1_8_i2.c: Regenerated. * generated/iparity_i2.c: Regenerated. * generated/maxloc1_8_r4.c: Regenerated. * generated/maxloc1_8_r8.c: Regenerated. * generated/iall_i4.c: Regenerated. * generated/maxloc0_4_i16.c: Regenerated. * generated/cshift0_i4.c: Regenerated. * generated/in_unpack_c10.c: Regenerated. * generated/unpack_c8.c: Regenerated. * generated/transpose_c8.c: Regenerated. * generated/in_unpack_c16.c: Regenerated. * generated/product_c16.c: Regenerated. * generated/minval_r8.c: Regenerated. * generated/minloc0_4_i1.c: Regenerated. * generated/minloc0_8_r16.c: Regenerated. * generated/in_unpack_i16.c: Regenerated. * generated/reshape_c16.c: Regenerated. * generated/pack_i4.c: Regenerated. * generated/minval_r10.c: Regenerated. * generated/maxloc0_4_r10.c: Regenerated. * generated/unpack_i8.c: Regenerated. * generated/minloc1_16_r8.c: Regenerated. * generated/pack_c16.c: Regenerated. * generated/maxval_r4.c: Regenerated. * generated/spread_r8.c: Regenerated. * generated/minloc0_16_r4.c: Regenerated. * generated/maxval_i4.c: Regenerated. * generated/matmul_r4.c: Regenerated. * generated/product_c8.c: Regenerated. * generated/maxloc1_4_i4.c: Regenerated. * generated/any_l4.c: Regenerated. * generated/cshift0_r16.c: Regenerated. * generated/maxloc1_16_r4.c: Regenerated. * generated/in_pack_r10.c: Regenerated. * generated/iall_i1.c: Regenerated. * generated/product_i1.c: Regenerated. * generated/maxloc0_4_i1.c: Regenerated. * generated/maxloc0_8_r16.c: Regenerated. * generated/minloc1_8_i16.c: Regenerated. * generated/reshape_c10.c: Regenerated. * generated/matmul_l4.c: Regenerated. * generated/cshift0_c16.c: Regenerated. * generated/spread_r4.c: Regenerated. * generated/sum_r16.c: Regenerated. * generated/in_unpack_c4.c: Regenerated. * generated/maxval_i8.c: Regenerated. * generated/maxloc0_8_r8.c: Regenerated. * generated/unpack_i16.c: Regenerated. * generated/norm2_r4.c: Regenerated. * generated/maxloc1_4_r16.c: Regenerated. * generated/in_pack_r4.c: Regenerated. * generated/sum_c8.c: Regenerated. * generated/parity_l8.c: Regenerated. * generated/minval_i2.c: Regenerated. * generated/transpose_c10.c: Regenerated. * generated/cshift0_r10.c: Regenerated. * generated/cshift0_i2.c: Regenerated. * generated/spread_c4.c: Regenerated. * generated/maxval_r16.c: Regenerated. * generated/unpack_c10.c: Regenerated. * generated/bessel_r4.c: Regenerated. * generated/minloc0_8_i1.c: Regenerated. * generated/product_c10.c: Regenerated. * generated/minloc1_4_i4.c: Regenerated. * generated/minloc1_4_i2.c: Regenerated. * generated/transpose_c4.c: Regenerated. * generated/in_pack_c8.c: Regenerated. * generated/minval_i8.c: Regenerated. * generated/maxloc1_4_i2.c: Regenerated. * generated/maxloc1_4_i1.c: Regenerated. * generated/iall_i8.c: Regenerated. * generated/iany_i8.c: Regenerated. * generated/sum_c16.c: Regenerated. * generated/spread_i8.c: Regenerated. * generated/sum_i8.c: Regenerated. * generated/pack_i2.c: Regenerated. * generated/unpack_r10.c: Regenerated. * generated/minloc0_4_i4.c: Regenerated. * generated/iany_i4.c: Regenerated. * generated/maxloc0_4_i4.c: Regenerated. * generated/in_pack_r8.c: Regenerated. * generated/spread_i1.c: Regenerated. * generated/maxval_i16.c: Regenerated. * generated/pack_c8.c: Regenerated. * generated/iparity_i16.c: Regenerated. * generated/matmul_c16.c: Regenerated. * generated/eoshift1_8.c: Regenerated. * generated/any_l16.c: Regenerated. * generated/maxloc1_4_i8.c: Regenerated. * generated/minloc0_8_r4.c: Regenerated. * generated/transpose_c16.c: Regenerated. * generated/reshape_c4.c: Regenerated. * generated/minloc0_8_r8.c: Regenerated. * generated/count_16_l.c: Regenerated. * generated/minloc0_16_i1.c: Regenerated. * generated/minloc1_16_r4.c: Regenerated. * generated/maxloc0_8_i1.c: Regenerated. * generated/matmul_i1.c: Regenerated. * generated/sum_i2.c: Regenerated. * generated/cshift1_4.c: Regenerated. * generated/minloc0_4_i2.c: Regenerated. * generated/bessel_r10.c: Regenerated. * generated/matmul_c4.c: Regenerated. * generated/parity_l4.c: Regenerated. * generated/in_unpack_i2.c: Regenerated. * generated/product_i16.c: Regenerated. * generated/maxloc0_16_i4.c: Regenerated. * generated/minloc0_4_r10.c: Regenerated. * generated/transpose_i16.c: Regenerated. * generated/matmul_l16.c: Regenerated. * generated/any_l1.c: Regenerated. * generated/minval_r16.c: Regenerated. * generated/shape_i16.c: Regenerated. * generated/in_pack_c4.c: Regenerated. * generated/minloc1_8_r4.c: Regenerated. * generated/iany_i1.c: Regenerated. * generated/matmul_i16.c: Regenerated. * generated/maxloc0_16_r4.c: Regenerated. * generated/spread_c8.c: Regenerated. * generated/product_i8.c: Regenerated. * generated/minloc1_8_i4.c: Regenerated. * generated/product_i4.c: Regenerated. * generated/minval_i16.c: Regenerated. * generated/pack_r8.c: Regenerated. * generated/matmul_r10.c: Regenerated. * generated/shape_i8.c: Regenerated. * generated/eoshift1_4.c: Regenerated. * generated/minloc1_16_i4.c: Regenerated. * generated/transpose_r16.c: Regenerated. * generated/spread_c16.c: Regenerated. * generated/maxloc0_8_i16.c: Regenerated. * generated/minval_i1.c: Regenerated. * generated/sum_i4.c: Regenerated. * generated/in_pack_r16.c: Regenerated. * generated/iall_i16.c: Regenerated. * generated/minloc0_8_r10.c: Regenerated. * generated/maxloc0_8_i8.c: Regenerated. * generated/transpose_i4.c: Regenerated. * generated/maxloc0_4_i2.c: Regenerated. * generated/iall_i2.c: Regenerated. * generated/maxloc0_8_r4.c: Regenerated. * generated/minloc0_4_r16.c: Regenerated. * generated/minloc1_4_r8.c: Regenerated. * generated/minloc0_4_i8.c: Regenerated. * generated/minval_i4.c: Regenerated. * generated/minloc1_8_i8.c: Regenerated. * generated/in_pack_i16.c: Regenerated. * generated/spread_i4.c: Regenerated. * generated/cshift0_c4.c: Regenerated. * generated/minloc0_4_i16.c: Regenerated. * generated/sum_r8.c: Regenerated. * generated/minloc0_16_i16.c: Regenerated. * generated/sum_i1.c: Regenerated. * generated/all_l2.c: Regenerated. * generated/sum_c4.c: Regenerated. * generated/shape_i4.c: Regenerated. * generated/maxval_i1.c: Regenerated. * generated/norm2_r10.c: Regenerated. * generated/unpack_c4.c: Regenerated. * generated/maxloc0_16_i1.c: Regenerated. * generated/all_l4.c: Regenerated. * generated/maxloc1_16_i8.c: Regenerated. * generated/sum_i16.c: Regenerated. * generated/maxloc1_8_r16.c: Regenerated. * generated/minloc1_4_r16.c: Regenerated. * generated/maxloc1_16_r16.c: Regenerated. * generated/transpose_i8.c: Regenerated. * generated/minloc0_8_i2.c: Regenerated. * generated/product_r16.c: Regenerated. * generated/in_pack_c10.c: Regenerated. * generated/maxloc0_4_r16.c: Regenerated. * generated/pack_c4.c: Regenerated. * generated/bessel_r16.c: Regenerated. * generated/norm2_r16.c: Regenerated. * generated/in_unpack_i8.c: Regenerated. * generated/maxloc1_16_i4.c: Regenerated. * generated/minloc1_4_i8.c: Regenerated. * generated/eoshift3_4.c: Regenerated. * generated/maxloc1_8_r10.c: Regenerated. * generated/matmul_i8.c: Regenerated. * generated/matmul_i4.c: Regenerated. * generated/reshape_i16.c: Regenerated. * generated/matmul_i2.c: Regenerated. * generated/transpose_r8.c: Regenerated. * generated/transpose_r4.c: Regenerated. * generated/cshift1_16.c: Regenerated. * generated/maxloc1_4_r10.c: Regenerated. * generated/iparity_i4.c: Regenerated. * generated/in_pack_i4.c: Regenerated. * generated/maxloc0_8_i2.c: Regenerated. * generated/unpack_r4.c: Regenerated. * generated/count_4_l.c: Regenerated. * generated/maxloc1_4_r4.c: Regenerated. * generated/minloc0_8_i8.c: Regenerated. * generated/any_l2.c: Regenerated. * generated/minloc0_8_i4.c: Regenerated. * generated/pack_i8.c: Regenerated. * generated/count_2_l.c: Regenerated. * generated/reshape_c8.c: Regenerated. * generated/maxval_i2.c: Regenerated. * generated/minloc0_4_r8.c: Regenerated. From-SVN: r185177
457 lines
13 KiB
C
457 lines
13 KiB
C
/* Generic implementation of the CSHIFT intrinsic
|
|
Copyright 2003, 2005, 2006, 2007, 2010, 2012 Free Software Foundation, Inc.
|
|
Contributed by Feng Wang <wf_cs@yahoo.com>
|
|
|
|
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"
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
|
|
static void
|
|
cshift0 (gfc_array_char * ret, const gfc_array_char * array,
|
|
ptrdiff_t shift, int which, index_type size)
|
|
{
|
|
/* r.* indicates the return array. */
|
|
index_type rstride[GFC_MAX_DIMENSIONS];
|
|
index_type rstride0;
|
|
index_type roffset;
|
|
char *rptr;
|
|
|
|
/* s.* indicates the source array. */
|
|
index_type sstride[GFC_MAX_DIMENSIONS];
|
|
index_type sstride0;
|
|
index_type soffset;
|
|
const char *sptr;
|
|
|
|
index_type count[GFC_MAX_DIMENSIONS];
|
|
index_type extent[GFC_MAX_DIMENSIONS];
|
|
index_type dim;
|
|
index_type len;
|
|
index_type n;
|
|
index_type arraysize;
|
|
|
|
index_type type_size;
|
|
|
|
if (which < 1 || which > GFC_DESCRIPTOR_RANK (array))
|
|
runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
|
|
|
|
arraysize = size0 ((array_t *) array);
|
|
|
|
if (ret->base_addr == NULL)
|
|
{
|
|
int i;
|
|
|
|
ret->offset = 0;
|
|
ret->dtype = array->dtype;
|
|
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
|
|
{
|
|
index_type ub, str;
|
|
|
|
ub = GFC_DESCRIPTOR_EXTENT(array,i) - 1;
|
|
|
|
if (i == 0)
|
|
str = 1;
|
|
else
|
|
str = GFC_DESCRIPTOR_EXTENT(ret,i-1) *
|
|
GFC_DESCRIPTOR_STRIDE(ret,i-1);
|
|
|
|
GFC_DIMENSION_SET(ret->dim[i], 0, ub, str);
|
|
}
|
|
|
|
/* internal_malloc_size allocates a single byte for zero size. */
|
|
ret->base_addr = internal_malloc_size (size * arraysize);
|
|
}
|
|
else if (unlikely (compile_options.bounds_check))
|
|
{
|
|
bounds_equal_extents ((array_t *) ret, (array_t *) array,
|
|
"return value", "CSHIFT");
|
|
}
|
|
|
|
if (arraysize == 0)
|
|
return;
|
|
|
|
type_size = GFC_DTYPE_TYPE_SIZE (array);
|
|
|
|
switch(type_size)
|
|
{
|
|
case GFC_DTYPE_LOGICAL_1:
|
|
case GFC_DTYPE_INTEGER_1:
|
|
case GFC_DTYPE_DERIVED_1:
|
|
cshift0_i1 ((gfc_array_i1 *)ret, (gfc_array_i1 *) array, shift, which);
|
|
return;
|
|
|
|
case GFC_DTYPE_LOGICAL_2:
|
|
case GFC_DTYPE_INTEGER_2:
|
|
cshift0_i2 ((gfc_array_i2 *)ret, (gfc_array_i2 *) array, shift, which);
|
|
return;
|
|
|
|
case GFC_DTYPE_LOGICAL_4:
|
|
case GFC_DTYPE_INTEGER_4:
|
|
cshift0_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array, shift, which);
|
|
return;
|
|
|
|
case GFC_DTYPE_LOGICAL_8:
|
|
case GFC_DTYPE_INTEGER_8:
|
|
cshift0_i8 ((gfc_array_i8 *)ret, (gfc_array_i8 *) array, shift, which);
|
|
return;
|
|
|
|
#ifdef HAVE_GFC_INTEGER_16
|
|
case GFC_DTYPE_LOGICAL_16:
|
|
case GFC_DTYPE_INTEGER_16:
|
|
cshift0_i16 ((gfc_array_i16 *)ret, (gfc_array_i16 *) array, shift,
|
|
which);
|
|
return;
|
|
#endif
|
|
|
|
case GFC_DTYPE_REAL_4:
|
|
cshift0_r4 ((gfc_array_r4 *)ret, (gfc_array_r4 *) array, shift, which);
|
|
return;
|
|
|
|
case GFC_DTYPE_REAL_8:
|
|
cshift0_r8 ((gfc_array_r8 *)ret, (gfc_array_r8 *) array, shift, which);
|
|
return;
|
|
|
|
/* FIXME: This here is a hack, which will have to be removed when
|
|
the array descriptor is reworked. Currently, we don't store the
|
|
kind value for the type, but only the size. Because on targets with
|
|
__float128, we have sizeof(logn double) == sizeof(__float128),
|
|
we cannot discriminate here and have to fall back to the generic
|
|
handling (which is suboptimal). */
|
|
#if !defined(GFC_REAL_16_IS_FLOAT128)
|
|
# ifdef HAVE_GFC_REAL_10
|
|
case GFC_DTYPE_REAL_10:
|
|
cshift0_r10 ((gfc_array_r10 *)ret, (gfc_array_r10 *) array, shift,
|
|
which);
|
|
return;
|
|
# endif
|
|
|
|
# ifdef HAVE_GFC_REAL_16
|
|
case GFC_DTYPE_REAL_16:
|
|
cshift0_r16 ((gfc_array_r16 *)ret, (gfc_array_r16 *) array, shift,
|
|
which);
|
|
return;
|
|
# endif
|
|
#endif
|
|
|
|
case GFC_DTYPE_COMPLEX_4:
|
|
cshift0_c4 ((gfc_array_c4 *)ret, (gfc_array_c4 *) array, shift, which);
|
|
return;
|
|
|
|
case GFC_DTYPE_COMPLEX_8:
|
|
cshift0_c8 ((gfc_array_c8 *)ret, (gfc_array_c8 *) array, shift, which);
|
|
return;
|
|
|
|
/* FIXME: This here is a hack, which will have to be removed when
|
|
the array descriptor is reworked. Currently, we don't store the
|
|
kind value for the type, but only the size. Because on targets with
|
|
__float128, we have sizeof(logn double) == sizeof(__float128),
|
|
we cannot discriminate here and have to fall back to the generic
|
|
handling (which is suboptimal). */
|
|
#if !defined(GFC_REAL_16_IS_FLOAT128)
|
|
# ifdef HAVE_GFC_COMPLEX_10
|
|
case GFC_DTYPE_COMPLEX_10:
|
|
cshift0_c10 ((gfc_array_c10 *)ret, (gfc_array_c10 *) array, shift,
|
|
which);
|
|
return;
|
|
# endif
|
|
|
|
# ifdef HAVE_GFC_COMPLEX_16
|
|
case GFC_DTYPE_COMPLEX_16:
|
|
cshift0_c16 ((gfc_array_c16 *)ret, (gfc_array_c16 *) array, shift,
|
|
which);
|
|
return;
|
|
# endif
|
|
#endif
|
|
|
|
default:
|
|
break;
|
|
}
|
|
|
|
switch (size)
|
|
{
|
|
/* Let's check the actual alignment of the data pointers. If they
|
|
are suitably aligned, we can safely call the unpack functions. */
|
|
|
|
case sizeof (GFC_INTEGER_1):
|
|
cshift0_i1 ((gfc_array_i1 *) ret, (gfc_array_i1 *) array, shift,
|
|
which);
|
|
break;
|
|
|
|
case sizeof (GFC_INTEGER_2):
|
|
if (GFC_UNALIGNED_2(ret->base_addr) || GFC_UNALIGNED_2(array->base_addr))
|
|
break;
|
|
else
|
|
{
|
|
cshift0_i2 ((gfc_array_i2 *) ret, (gfc_array_i2 *) array, shift,
|
|
which);
|
|
return;
|
|
}
|
|
|
|
case sizeof (GFC_INTEGER_4):
|
|
if (GFC_UNALIGNED_4(ret->base_addr) || GFC_UNALIGNED_4(array->base_addr))
|
|
break;
|
|
else
|
|
{
|
|
cshift0_i4 ((gfc_array_i4 *)ret, (gfc_array_i4 *) array, shift,
|
|
which);
|
|
return;
|
|
}
|
|
|
|
case sizeof (GFC_INTEGER_8):
|
|
if (GFC_UNALIGNED_8(ret->base_addr) || GFC_UNALIGNED_8(array->base_addr))
|
|
{
|
|
/* Let's try to use the complex routines. First, a sanity
|
|
check that the sizes match; this should be optimized to
|
|
a no-op. */
|
|
if (sizeof(GFC_INTEGER_8) != sizeof(GFC_COMPLEX_4))
|
|
break;
|
|
|
|
if (GFC_UNALIGNED_C4(ret->base_addr)
|
|
|| GFC_UNALIGNED_C4(array->base_addr))
|
|
break;
|
|
|
|
cshift0_c4 ((gfc_array_c4 *) ret, (gfc_array_c4 *) array, shift,
|
|
which);
|
|
return;
|
|
}
|
|
else
|
|
{
|
|
cshift0_i8 ((gfc_array_i8 *)ret, (gfc_array_i8 *) array, shift,
|
|
which);
|
|
return;
|
|
}
|
|
|
|
#ifdef HAVE_GFC_INTEGER_16
|
|
case sizeof (GFC_INTEGER_16):
|
|
if (GFC_UNALIGNED_16(ret->base_addr)
|
|
|| GFC_UNALIGNED_16(array->base_addr))
|
|
{
|
|
/* Let's try to use the complex routines. First, a sanity
|
|
check that the sizes match; this should be optimized to
|
|
a no-op. */
|
|
if (sizeof(GFC_INTEGER_16) != sizeof(GFC_COMPLEX_8))
|
|
break;
|
|
|
|
if (GFC_UNALIGNED_C8(ret->base_addr)
|
|
|| GFC_UNALIGNED_C8(array->base_addr))
|
|
break;
|
|
|
|
cshift0_c8 ((gfc_array_c8 *) ret, (gfc_array_c8 *) array, shift,
|
|
which);
|
|
return;
|
|
}
|
|
else
|
|
{
|
|
cshift0_i16 ((gfc_array_i16 *) ret, (gfc_array_i16 *) array,
|
|
shift, which);
|
|
return;
|
|
}
|
|
#else
|
|
case sizeof (GFC_COMPLEX_8):
|
|
|
|
if (GFC_UNALIGNED_C8(ret->base_addr)
|
|
|| GFC_UNALIGNED_C8(array->base_addr))
|
|
break;
|
|
else
|
|
{
|
|
cshift0_c8 ((gfc_array_c8 *) ret, (gfc_array_c8 *) array, shift,
|
|
which);
|
|
return;
|
|
}
|
|
#endif
|
|
|
|
default:
|
|
break;
|
|
}
|
|
|
|
|
|
which = which - 1;
|
|
sstride[0] = 0;
|
|
rstride[0] = 0;
|
|
|
|
extent[0] = 1;
|
|
count[0] = 0;
|
|
n = 0;
|
|
/* Initialized for avoiding compiler warnings. */
|
|
roffset = size;
|
|
soffset = size;
|
|
len = 0;
|
|
|
|
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
|
{
|
|
if (dim == which)
|
|
{
|
|
roffset = GFC_DESCRIPTOR_STRIDE_BYTES(ret,dim);
|
|
if (roffset == 0)
|
|
roffset = size;
|
|
soffset = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
|
|
if (soffset == 0)
|
|
soffset = size;
|
|
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
|
}
|
|
else
|
|
{
|
|
count[n] = 0;
|
|
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
|
rstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(ret,dim);
|
|
sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
|
|
n++;
|
|
}
|
|
}
|
|
if (sstride[0] == 0)
|
|
sstride[0] = size;
|
|
if (rstride[0] == 0)
|
|
rstride[0] = size;
|
|
|
|
dim = GFC_DESCRIPTOR_RANK (array);
|
|
rstride0 = rstride[0];
|
|
sstride0 = sstride[0];
|
|
rptr = ret->base_addr;
|
|
sptr = array->base_addr;
|
|
|
|
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
|
|
if (shift < 0)
|
|
shift += len;
|
|
|
|
while (rptr)
|
|
{
|
|
/* Do the shift for this dimension. */
|
|
|
|
/* If elements are contiguous, perform the operation
|
|
in two block moves. */
|
|
if (soffset == size && roffset == size)
|
|
{
|
|
size_t len1 = shift * size;
|
|
size_t len2 = (len - shift) * size;
|
|
memcpy (rptr, sptr + len1, len2);
|
|
memcpy (rptr + len2, sptr, len1);
|
|
}
|
|
else
|
|
{
|
|
/* Otherwise, we'll have to perform the copy one element at
|
|
a time. */
|
|
char *dest = rptr;
|
|
const char *src = &sptr[shift * soffset];
|
|
|
|
for (n = 0; n < len - shift; n++)
|
|
{
|
|
memcpy (dest, src, size);
|
|
dest += roffset;
|
|
src += soffset;
|
|
}
|
|
for (src = sptr, n = 0; n < shift; n++)
|
|
{
|
|
memcpy (dest, src, size);
|
|
dest += roffset;
|
|
src += soffset;
|
|
}
|
|
}
|
|
|
|
/* Advance to the next section. */
|
|
rptr += rstride0;
|
|
sptr += sstride0;
|
|
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 probably not worth it. */
|
|
rptr -= rstride[n] * extent[n];
|
|
sptr -= sstride[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];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#define DEFINE_CSHIFT(N) \
|
|
extern void cshift0_##N (gfc_array_char *, const gfc_array_char *, \
|
|
const GFC_INTEGER_##N *, const GFC_INTEGER_##N *); \
|
|
export_proto(cshift0_##N); \
|
|
\
|
|
void \
|
|
cshift0_##N (gfc_array_char *ret, const gfc_array_char *array, \
|
|
const GFC_INTEGER_##N *pshift, const GFC_INTEGER_##N *pdim) \
|
|
{ \
|
|
cshift0 (ret, array, *pshift, pdim ? *pdim : 1, \
|
|
GFC_DESCRIPTOR_SIZE (array)); \
|
|
} \
|
|
\
|
|
extern void cshift0_##N##_char (gfc_array_char *, GFC_INTEGER_4, \
|
|
const gfc_array_char *, \
|
|
const GFC_INTEGER_##N *, \
|
|
const GFC_INTEGER_##N *, GFC_INTEGER_4); \
|
|
export_proto(cshift0_##N##_char); \
|
|
\
|
|
void \
|
|
cshift0_##N##_char (gfc_array_char *ret, \
|
|
GFC_INTEGER_4 ret_length __attribute__((unused)), \
|
|
const gfc_array_char *array, \
|
|
const GFC_INTEGER_##N *pshift, \
|
|
const GFC_INTEGER_##N *pdim, \
|
|
GFC_INTEGER_4 array_length) \
|
|
{ \
|
|
cshift0 (ret, array, *pshift, pdim ? *pdim : 1, array_length); \
|
|
} \
|
|
\
|
|
extern void cshift0_##N##_char4 (gfc_array_char *, GFC_INTEGER_4, \
|
|
const gfc_array_char *, \
|
|
const GFC_INTEGER_##N *, \
|
|
const GFC_INTEGER_##N *, GFC_INTEGER_4); \
|
|
export_proto(cshift0_##N##_char4); \
|
|
\
|
|
void \
|
|
cshift0_##N##_char4 (gfc_array_char *ret, \
|
|
GFC_INTEGER_4 ret_length __attribute__((unused)), \
|
|
const gfc_array_char *array, \
|
|
const GFC_INTEGER_##N *pshift, \
|
|
const GFC_INTEGER_##N *pdim, \
|
|
GFC_INTEGER_4 array_length) \
|
|
{ \
|
|
cshift0 (ret, array, *pshift, pdim ? *pdim : 1, \
|
|
array_length * sizeof (gfc_char4_t)); \
|
|
}
|
|
|
|
DEFINE_CSHIFT (1);
|
|
DEFINE_CSHIFT (2);
|
|
DEFINE_CSHIFT (4);
|
|
DEFINE_CSHIFT (8);
|
|
#ifdef HAVE_GFC_INTEGER_16
|
|
DEFINE_CSHIFT (16);
|
|
#endif
|