/* Special implementation of the SPREAD intrinsic
|
/* Special implementation of the SPREAD intrinsic
|
Copyright 2008, 2009 Free Software Foundation, Inc.
|
Copyright 2008, 2009 Free Software Foundation, Inc.
|
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>, based on
|
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>, based on
|
spread_generic.c written by Paul Brook <paul@nowt.org>
|
spread_generic.c written by Paul Brook <paul@nowt.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.
|
|
|
Ligbfortran is distributed in the hope that it will be useful,
|
Ligbfortran 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_COMPLEX_4)
|
#if defined (HAVE_GFC_COMPLEX_4)
|
|
|
void
|
void
|
spread_c4 (gfc_array_c4 *ret, const gfc_array_c4 *source,
|
spread_c4 (gfc_array_c4 *ret, const gfc_array_c4 *source,
|
const index_type along, const index_type pncopies)
|
const index_type along, const index_type pncopies)
|
{
|
{
|
/* 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 rdelta = 0;
|
index_type rdelta = 0;
|
index_type rrank;
|
index_type rrank;
|
index_type rs;
|
index_type rs;
|
GFC_COMPLEX_4 *rptr;
|
GFC_COMPLEX_4 *rptr;
|
GFC_COMPLEX_4 * restrict dest;
|
GFC_COMPLEX_4 * restrict dest;
|
/* 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 srank;
|
index_type srank;
|
const GFC_COMPLEX_4 *sptr;
|
const GFC_COMPLEX_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 n;
|
index_type n;
|
index_type dim;
|
index_type dim;
|
index_type ncopies;
|
index_type ncopies;
|
|
|
srank = GFC_DESCRIPTOR_RANK(source);
|
srank = GFC_DESCRIPTOR_RANK(source);
|
|
|
rrank = srank + 1;
|
rrank = srank + 1;
|
if (rrank > GFC_MAX_DIMENSIONS)
|
if (rrank > GFC_MAX_DIMENSIONS)
|
runtime_error ("return rank too large in spread()");
|
runtime_error ("return rank too large in spread()");
|
|
|
if (along > rrank)
|
if (along > rrank)
|
runtime_error ("dim outside of rank in spread()");
|
runtime_error ("dim outside of rank in spread()");
|
|
|
ncopies = pncopies;
|
ncopies = pncopies;
|
|
|
if (ret->data == NULL)
|
if (ret->data == NULL)
|
{
|
{
|
|
|
size_t ub, stride;
|
size_t ub, stride;
|
|
|
/* The front end has signalled that we need to populate the
|
/* The front end has signalled that we need to populate the
|
return array descriptor. */
|
return array descriptor. */
|
ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rrank;
|
ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rrank;
|
dim = 0;
|
dim = 0;
|
rs = 1;
|
rs = 1;
|
for (n = 0; n < rrank; n++)
|
for (n = 0; n < rrank; n++)
|
{
|
{
|
stride = rs;
|
stride = rs;
|
if (n == along - 1)
|
if (n == along - 1)
|
{
|
{
|
ub = ncopies - 1;
|
ub = ncopies - 1;
|
rdelta = rs;
|
rdelta = rs;
|
rs *= ncopies;
|
rs *= ncopies;
|
}
|
}
|
else
|
else
|
{
|
{
|
count[dim] = 0;
|
count[dim] = 0;
|
extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
|
extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
|
sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
|
sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
|
rstride[dim] = rs;
|
rstride[dim] = rs;
|
|
|
ub = extent[dim] - 1;
|
ub = extent[dim] - 1;
|
rs *= extent[dim];
|
rs *= extent[dim];
|
dim++;
|
dim++;
|
}
|
}
|
GFC_DIMENSION_SET(ret->dim[n], 0, ub, stride);
|
GFC_DIMENSION_SET(ret->dim[n], 0, ub, stride);
|
}
|
}
|
ret->offset = 0;
|
ret->offset = 0;
|
|
|
/* internal_malloc_size allocates a single byte for zero size. */
|
/* internal_malloc_size allocates a single byte for zero size. */
|
ret->data = internal_malloc_size (rs * sizeof(GFC_COMPLEX_4));
|
ret->data = internal_malloc_size (rs * sizeof(GFC_COMPLEX_4));
|
if (rs <= 0)
|
if (rs <= 0)
|
return;
|
return;
|
}
|
}
|
else
|
else
|
{
|
{
|
int zero_sized;
|
int zero_sized;
|
|
|
zero_sized = 0;
|
zero_sized = 0;
|
|
|
dim = 0;
|
dim = 0;
|
if (GFC_DESCRIPTOR_RANK(ret) != rrank)
|
if (GFC_DESCRIPTOR_RANK(ret) != rrank)
|
runtime_error ("rank mismatch in spread()");
|
runtime_error ("rank mismatch in spread()");
|
|
|
if (unlikely (compile_options.bounds_check))
|
if (unlikely (compile_options.bounds_check))
|
{
|
{
|
for (n = 0; n < rrank; n++)
|
for (n = 0; n < rrank; n++)
|
{
|
{
|
index_type ret_extent;
|
index_type ret_extent;
|
|
|
ret_extent = GFC_DESCRIPTOR_EXTENT(ret,n);
|
ret_extent = GFC_DESCRIPTOR_EXTENT(ret,n);
|
if (n == along - 1)
|
if (n == along - 1)
|
{
|
{
|
rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
|
rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
|
|
|
if (ret_extent != ncopies)
|
if (ret_extent != ncopies)
|
runtime_error("Incorrect extent in return value of SPREAD"
|
runtime_error("Incorrect extent in return value of SPREAD"
|
" intrinsic in dimension %ld: is %ld,"
|
" intrinsic in dimension %ld: is %ld,"
|
" should be %ld", (long int) n+1,
|
" should be %ld", (long int) n+1,
|
(long int) ret_extent, (long int) ncopies);
|
(long int) ret_extent, (long int) ncopies);
|
}
|
}
|
else
|
else
|
{
|
{
|
count[dim] = 0;
|
count[dim] = 0;
|
extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
|
extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
|
if (ret_extent != extent[dim])
|
if (ret_extent != extent[dim])
|
runtime_error("Incorrect extent in return value of SPREAD"
|
runtime_error("Incorrect extent in return value of SPREAD"
|
" intrinsic in dimension %ld: is %ld,"
|
" intrinsic in dimension %ld: is %ld,"
|
" should be %ld", (long int) n+1,
|
" should be %ld", (long int) n+1,
|
(long int) ret_extent,
|
(long int) ret_extent,
|
(long int) extent[dim]);
|
(long int) extent[dim]);
|
|
|
if (extent[dim] <= 0)
|
if (extent[dim] <= 0)
|
zero_sized = 1;
|
zero_sized = 1;
|
sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
|
sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
|
rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
|
rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
|
dim++;
|
dim++;
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
for (n = 0; n < rrank; n++)
|
for (n = 0; n < rrank; n++)
|
{
|
{
|
if (n == along - 1)
|
if (n == along - 1)
|
{
|
{
|
rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
|
rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
|
}
|
}
|
else
|
else
|
{
|
{
|
count[dim] = 0;
|
count[dim] = 0;
|
extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
|
extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
|
if (extent[dim] <= 0)
|
if (extent[dim] <= 0)
|
zero_sized = 1;
|
zero_sized = 1;
|
sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
|
sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
|
rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
|
rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
|
dim++;
|
dim++;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
if (zero_sized)
|
if (zero_sized)
|
return;
|
return;
|
|
|
if (sstride[0] == 0)
|
if (sstride[0] == 0)
|
sstride[0] = 1;
|
sstride[0] = 1;
|
}
|
}
|
sstride0 = sstride[0];
|
sstride0 = sstride[0];
|
rstride0 = rstride[0];
|
rstride0 = rstride[0];
|
rptr = ret->data;
|
rptr = ret->data;
|
sptr = source->data;
|
sptr = source->data;
|
|
|
while (sptr)
|
while (sptr)
|
{
|
{
|
/* Spread this element. */
|
/* Spread this element. */
|
dest = rptr;
|
dest = rptr;
|
for (n = 0; n < ncopies; n++)
|
for (n = 0; n < ncopies; n++)
|
{
|
{
|
*dest = *sptr;
|
*dest = *sptr;
|
dest += rdelta;
|
dest += rdelta;
|
}
|
}
|
/* Advance to the next element. */
|
/* Advance to the next element. */
|
sptr += sstride0;
|
sptr += sstride0;
|
rptr += rstride0;
|
rptr += rstride0;
|
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. */
|
sptr -= sstride[n] * extent[n];
|
sptr -= sstride[n] * extent[n];
|
rptr -= rstride[n] * extent[n];
|
rptr -= rstride[n] * extent[n];
|
n++;
|
n++;
|
if (n >= srank)
|
if (n >= srank)
|
{
|
{
|
/* Break out of the loop. */
|
/* Break out of the loop. */
|
sptr = NULL;
|
sptr = NULL;
|
break;
|
break;
|
}
|
}
|
else
|
else
|
{
|
{
|
count[n]++;
|
count[n]++;
|
sptr += sstride[n];
|
sptr += sstride[n];
|
rptr += rstride[n];
|
rptr += rstride[n];
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* This version of spread_internal treats the special case of a scalar
|
/* This version of spread_internal treats the special case of a scalar
|
source. This is much simpler than the more general case above. */
|
source. This is much simpler than the more general case above. */
|
|
|
void
|
void
|
spread_scalar_c4 (gfc_array_c4 *ret, const GFC_COMPLEX_4 *source,
|
spread_scalar_c4 (gfc_array_c4 *ret, const GFC_COMPLEX_4 *source,
|
const index_type along, const index_type pncopies)
|
const index_type along, const index_type pncopies)
|
{
|
{
|
int n;
|
int n;
|
int ncopies = pncopies;
|
int ncopies = pncopies;
|
GFC_COMPLEX_4 * restrict dest;
|
GFC_COMPLEX_4 * restrict dest;
|
index_type stride;
|
index_type stride;
|
|
|
if (GFC_DESCRIPTOR_RANK (ret) != 1)
|
if (GFC_DESCRIPTOR_RANK (ret) != 1)
|
runtime_error ("incorrect destination rank in spread()");
|
runtime_error ("incorrect destination rank in spread()");
|
|
|
if (along > 1)
|
if (along > 1)
|
runtime_error ("dim outside of rank in spread()");
|
runtime_error ("dim outside of rank in spread()");
|
|
|
if (ret->data == NULL)
|
if (ret->data == NULL)
|
{
|
{
|
ret->data = internal_malloc_size (ncopies * sizeof (GFC_COMPLEX_4));
|
ret->data = internal_malloc_size (ncopies * sizeof (GFC_COMPLEX_4));
|
ret->offset = 0;
|
ret->offset = 0;
|
GFC_DIMENSION_SET(ret->dim[0], 0, ncopies - 1, 1);
|
GFC_DIMENSION_SET(ret->dim[0], 0, ncopies - 1, 1);
|
}
|
}
|
else
|
else
|
{
|
{
|
if (ncopies - 1 > (GFC_DESCRIPTOR_EXTENT(ret,0) - 1)
|
if (ncopies - 1 > (GFC_DESCRIPTOR_EXTENT(ret,0) - 1)
|
/ GFC_DESCRIPTOR_STRIDE(ret,0))
|
/ GFC_DESCRIPTOR_STRIDE(ret,0))
|
runtime_error ("dim too large in spread()");
|
runtime_error ("dim too large in spread()");
|
}
|
}
|
|
|
dest = ret->data;
|
dest = ret->data;
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
|
|
|
for (n = 0; n < ncopies; n++)
|
for (n = 0; n < ncopies; n++)
|
{
|
{
|
*dest = *source;
|
*dest = *source;
|
dest += stride;
|
dest += stride;
|
}
|
}
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
|
|
