e33e218bad
2005-05-04 Thomas Koenig <Thomas.Koenig@online.de> PR libfortran/21354 * m4/cshift1.m4: Change dimension of auxiliary arrays from GFC_MAX_DIMENSION - 1 to GFC_MAX_DIMENSION. * m4/eoshift1.m4: Likewise. * m4/eoshift3.m4: Likewise. * m4/ifunction.m4: Likewise. * m4/in_pack.m4: Likewise. * m4/in_unpack.m4: Likewise. * intrinsics/cshift0.c: Likewise. * intrinsics/eoshift0.c: Likewise. * intrinsics/eoshift2.c: Likewise. * intrinsics/random.c: Likewise. * intrinsics/spread_generic.c: Likewise. * intrinsics/stat.c: Likewise. * generated/all_l4.c: Regenerated. * generated/all_l8.c: Regenerated. * generated/any_l4.c: Regenerated. * generated/any_l8.c: Regenerated. * generated/count_4_l4.c: Regenerated. * generated/count_4_l8.c: Regenerated. * generated/count_8_l4.c: Regenerated. * generated/count_8_l8.c: Regenerated. * generated/cshift1_4.c: Regenerated. * generated/cshift1_8.c: Regenerated. * generated/eoshift1_4.c: Regenerated. * generated/eoshift1_8.c: Regenerated. * generated/eoshift3_4.c: Regenerated. * generated/eoshift3_8.c: Regenerated. * generated/in_pack_i4.c: Regenerated. * generated/in_pack_i8.c: Regenerated. * generated/in_unpack_i4.c: Regenerated. * generated/in_unpack_i8.c: Regenerated. * generated/maxloc0_4_i4.c: Regenerated. * generated/maxloc0_4_i8.c: Regenerated. * generated/maxloc0_4_r4.c: Regenerated. * generated/maxloc0_4_r8.c: Regenerated. * generated/maxloc0_8_i4.c: Regenerated. * generated/maxloc0_8_i8.c: Regenerated. * generated/maxloc0_8_r4.c: Regenerated. * generated/maxloc0_8_r8.c: Regenerated. * generated/maxloc1_4_i4.c: Regenerated. * generated/maxloc1_4_i8.c: Regenerated. * generated/maxloc1_4_r4.c: Regenerated. * generated/maxloc1_4_r8.c: Regenerated. * generated/maxloc1_8_i4.c: Regenerated. * generated/maxloc1_8_i8.c: Regenerated. * generated/maxloc1_8_r4.c: Regenerated. * generated/maxloc1_8_r8.c: Regenerated. * generated/maxval_i4.c: Regenerated. * generated/maxval_i8.c: Regenerated. * generated/maxval_r4.c: Regenerated. * generated/maxval_r8.c: Regenerated. * generated/minloc0_4_i4.c: Regenerated. * generated/minloc0_4_i8.c: Regenerated. * generated/minloc0_4_r4.c: Regenerated. * generated/minloc0_4_r8.c: Regenerated. * generated/minloc0_8_i4.c: Regenerated. * generated/minloc0_8_i8.c: Regenerated. * generated/minloc0_8_r4.c: Regenerated. * generated/minloc0_8_r8.c: Regenerated. * generated/minloc1_4_i4.c: Regenerated. * generated/minloc1_4_i8.c: Regenerated. * generated/minloc1_4_r4.c: Regenerated. * generated/minloc1_4_r8.c: Regenerated. * generated/minloc1_8_i4.c: Regenerated. * generated/minloc1_8_i8.c: Regenerated. * generated/minloc1_8_r4.c: Regenerated. * generated/minloc1_8_r8.c: Regenerated. * generated/minval_i4.c: Regenerated. * generated/minval_i8.c: Regenerated. * generated/minval_r4.c: Regenerated. * generated/minval_r8.c: Regenerated. * generated/product_c4.c: Regenerated. * generated/product_c8.c: Regenerated. * generated/product_i4.c: Regenerated. * generated/product_i8.c: Regenerated. * generated/product_r4.c: Regenerated. * generated/product_r8.c: Regenerated. * generated/sum_c4.c: Regenerated. * generated/sum_c8.c: Regenerated. * generated/sum_i4.c: Regenerated. * generated/sum_i8.c: Regenerated. * generated/sum_r4.c: Regenerated. * generated/sum_r8.c: Regenerated. 2005-05-04 Thomas Koenig <Thomas.Koenig@online.de> PR libfortran/21354 gfortran.dg/in_pack_rank7.f90: New test. From-SVN: r99232
186 lines
5.1 KiB
Plaintext
186 lines
5.1 KiB
Plaintext
`/* Implementation of the CSHIFT intrinsic
|
|
Copyright 2003 Free Software Foundation, Inc.
|
|
Contributed by Feng Wang <wf_cs@yahoo.com>
|
|
|
|
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.)
|
|
|
|
Ligbfortran 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., 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#include "config.h"
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include "libgfortran.h"'
|
|
include(iparm.m4)dnl
|
|
|
|
void cshift1_`'atype_kind (const gfc_array_char * ret,
|
|
const gfc_array_char * array,
|
|
const atype * h, const atype_name * pwhich);
|
|
export_proto(cshift1_`'atype_kind);
|
|
|
|
void
|
|
cshift1_`'atype_kind (const gfc_array_char * ret,
|
|
const gfc_array_char * array,
|
|
const atype * h, const atype_name * pwhich)
|
|
{
|
|
/* 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 atype_name *hptr;
|
|
|
|
index_type count[GFC_MAX_DIMENSIONS];
|
|
index_type extent[GFC_MAX_DIMENSIONS];
|
|
index_type dim;
|
|
index_type size;
|
|
index_type len;
|
|
index_type n;
|
|
int which;
|
|
atype_name sh;
|
|
|
|
if (pwhich)
|
|
which = *pwhich - 1;
|
|
else
|
|
which = 0;
|
|
|
|
if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
|
|
runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
|
|
|
|
size = GFC_DESCRIPTOR_SIZE (ret);
|
|
|
|
extent[0] = 1;
|
|
count[0] = 0;
|
|
size = GFC_DESCRIPTOR_SIZE (array);
|
|
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 = 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;
|
|
sh = (div (sh, len)).rem;
|
|
if (sh < 0)
|
|
sh += len;
|
|
|
|
src = &sptr[sh * soffset];
|
|
dest = rptr;
|
|
|
|
for (n = 0; n < len; n++)
|
|
{
|
|
memcpy (dest, src, size);
|
|
dest += roffset;
|
|
if (n == len - sh - 1)
|
|
src = sptr;
|
|
else
|
|
src += soffset;
|
|
}
|
|
|
|
/* 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];
|
|
}
|
|
}
|
|
}
|
|
}
|