/* Helper function for cshift functions.
|
/* Helper function for cshift functions.
|
Copyright 2008, 2009 Free Software Foundation, Inc.
|
Copyright 2008, 2009 Free Software Foundation, Inc.
|
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
This file is part of the GNU Fortran 95 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 <string.h>
|
#include <string.h>
|
|
|
|
|
#if defined (HAVE_GFC_INTEGER_4)
|
#if defined (HAVE_GFC_INTEGER_4)
|
|
|
void
|
void
|
cshift0_i4 (gfc_array_i4 *ret, const gfc_array_i4 *array, ptrdiff_t shift,
|
cshift0_i4 (gfc_array_i4 *ret, const gfc_array_i4 *array, ptrdiff_t shift,
|
int which)
|
int which)
|
{
|
{
|
/* r.* indicates the return array. */
|
/* r.* indicates the return array. */
|
index_type rstride[GFC_MAX_DIMENSIONS];
|
index_type rstride[GFC_MAX_DIMENSIONS];
|
index_type rstride0;
|
index_type rstride0;
|
index_type roffset;
|
index_type roffset;
|
GFC_INTEGER_4 *rptr;
|
GFC_INTEGER_4 *rptr;
|
|
|
/* s.* indicates the source array. */
|
/* s.* indicates the source array. */
|
index_type sstride[GFC_MAX_DIMENSIONS];
|
index_type sstride[GFC_MAX_DIMENSIONS];
|
index_type sstride0;
|
index_type sstride0;
|
index_type soffset;
|
index_type soffset;
|
const GFC_INTEGER_4 *sptr;
|
const GFC_INTEGER_4 *sptr;
|
|
|
index_type count[GFC_MAX_DIMENSIONS];
|
index_type count[GFC_MAX_DIMENSIONS];
|
index_type extent[GFC_MAX_DIMENSIONS];
|
index_type extent[GFC_MAX_DIMENSIONS];
|
index_type dim;
|
index_type dim;
|
index_type len;
|
index_type len;
|
index_type n;
|
index_type n;
|
|
|
which = which - 1;
|
which = which - 1;
|
sstride[0] = 0;
|
sstride[0] = 0;
|
rstride[0] = 0;
|
rstride[0] = 0;
|
|
|
extent[0] = 1;
|
extent[0] = 1;
|
count[0] = 0;
|
count[0] = 0;
|
n = 0;
|
n = 0;
|
/* Initialized for avoiding compiler warnings. */
|
/* Initialized for avoiding compiler warnings. */
|
roffset = 1;
|
roffset = 1;
|
soffset = 1;
|
soffset = 1;
|
len = 0;
|
len = 0;
|
|
|
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
|
{
|
{
|
if (dim == which)
|
if (dim == which)
|
{
|
{
|
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
roffset = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
if (roffset == 0)
|
if (roffset == 0)
|
roffset = 1;
|
roffset = 1;
|
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
soffset = GFC_DESCRIPTOR_STRIDE(array,dim);
|
if (soffset == 0)
|
if (soffset == 0)
|
soffset = 1;
|
soffset = 1;
|
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
len = GFC_DESCRIPTOR_EXTENT(array,dim);
|
}
|
}
|
else
|
else
|
{
|
{
|
count[n] = 0;
|
count[n] = 0;
|
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
|
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
|
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,dim);
|
n++;
|
n++;
|
}
|
}
|
}
|
}
|
if (sstride[0] == 0)
|
if (sstride[0] == 0)
|
sstride[0] = 1;
|
sstride[0] = 1;
|
if (rstride[0] == 0)
|
if (rstride[0] == 0)
|
rstride[0] = 1;
|
rstride[0] = 1;
|
|
|
dim = GFC_DESCRIPTOR_RANK (array);
|
dim = GFC_DESCRIPTOR_RANK (array);
|
rstride0 = rstride[0];
|
rstride0 = rstride[0];
|
sstride0 = sstride[0];
|
sstride0 = sstride[0];
|
rptr = ret->data;
|
rptr = ret->data;
|
sptr = array->data;
|
sptr = array->data;
|
|
|
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
|
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
|
if (shift < 0)
|
if (shift < 0)
|
shift += len;
|
shift += len;
|
|
|
while (rptr)
|
while (rptr)
|
{
|
{
|
/* Do the shift for this dimension. */
|
/* Do the shift for this dimension. */
|
|
|
/* If elements are contiguous, perform the operation
|
/* If elements are contiguous, perform the operation
|
in two block moves. */
|
in two block moves. */
|
if (soffset == 1 && roffset == 1)
|
if (soffset == 1 && roffset == 1)
|
{
|
{
|
size_t len1 = shift * sizeof (GFC_INTEGER_4);
|
size_t len1 = shift * sizeof (GFC_INTEGER_4);
|
size_t len2 = (len - shift) * sizeof (GFC_INTEGER_4);
|
size_t len2 = (len - shift) * sizeof (GFC_INTEGER_4);
|
memcpy (rptr, sptr + shift, len2);
|
memcpy (rptr, sptr + shift, len2);
|
memcpy (rptr + (len - shift), sptr, len1);
|
memcpy (rptr + (len - shift), sptr, len1);
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Otherwise, we will have to perform the copy one element at
|
/* Otherwise, we will have to perform the copy one element at
|
a time. */
|
a time. */
|
GFC_INTEGER_4 *dest = rptr;
|
GFC_INTEGER_4 *dest = rptr;
|
const GFC_INTEGER_4 *src = &sptr[shift * soffset];
|
const GFC_INTEGER_4 *src = &sptr[shift * soffset];
|
|
|
for (n = 0; n < len - shift; n++)
|
for (n = 0; n < len - shift; n++)
|
{
|
{
|
*dest = *src;
|
*dest = *src;
|
dest += roffset;
|
dest += roffset;
|
src += soffset;
|
src += soffset;
|
}
|
}
|
for (src = sptr, n = 0; n < shift; n++)
|
for (src = sptr, n = 0; n < shift; n++)
|
{
|
{
|
*dest = *src;
|
*dest = *src;
|
dest += roffset;
|
dest += roffset;
|
src += soffset;
|
src += soffset;
|
}
|
}
|
}
|
}
|
|
|
/* Advance to the next section. */
|
/* Advance to the next section. */
|
rptr += rstride0;
|
rptr += rstride0;
|
sptr += sstride0;
|
sptr += sstride0;
|
count[0]++;
|
count[0]++;
|
n = 0;
|
n = 0;
|
while (count[n] == extent[n])
|
while (count[n] == extent[n])
|
{
|
{
|
/* When we get to the end of a dimension, reset it and increment
|
/* When we get to the end of a dimension, reset it and increment
|
the next dimension. */
|
the next dimension. */
|
count[n] = 0;
|
count[n] = 0;
|
/* We could precalculate these products, but this is a less
|
/* We could precalculate these products, but this is a less
|
frequently used path so probably not worth it. */
|
frequently used path so probably not worth it. */
|
rptr -= rstride[n] * extent[n];
|
rptr -= rstride[n] * extent[n];
|
sptr -= sstride[n] * extent[n];
|
sptr -= sstride[n] * extent[n];
|
n++;
|
n++;
|
if (n >= dim - 1)
|
if (n >= dim - 1)
|
{
|
{
|
/* Break out of the loop. */
|
/* Break out of the loop. */
|
rptr = NULL;
|
rptr = NULL;
|
break;
|
break;
|
}
|
}
|
else
|
else
|
{
|
{
|
count[n]++;
|
count[n]++;
|
rptr += rstride[n];
|
rptr += rstride[n];
|
sptr += sstride[n];
|
sptr += sstride[n];
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
return;
|
return;
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
