121 lines
3.0 KiB
C
121 lines
3.0 KiB
C
/* Generic helper function for repacking arrays.
|
|
Copyright 2003 Free Software Foundation, Inc.
|
|
Contributed by Paul Brook <paul@nowt.org>
|
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfor).
|
|
|
|
Libgfor is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
Ligbfor 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 Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with libgfor; see the file COPYING.LIB. 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"
|
|
|
|
void
|
|
internal_unpack (gfc_array_char * d, const void * s)
|
|
{
|
|
index_type count[GFC_MAX_DIMENSIONS - 1];
|
|
index_type extent[GFC_MAX_DIMENSIONS - 1];
|
|
index_type stride[GFC_MAX_DIMENSIONS - 1];
|
|
index_type stride0;
|
|
index_type dim;
|
|
index_type dsize;
|
|
char *dest;
|
|
const char *src;
|
|
int n;
|
|
int size;
|
|
|
|
dest = d->data;
|
|
/* This check may be redundant, but do it anyway. */
|
|
if (s == dest || !s)
|
|
return;
|
|
|
|
size = GFC_DESCRIPTOR_SIZE (d);
|
|
switch (size)
|
|
{
|
|
case 4:
|
|
internal_unpack_4 ((gfc_array_i4 *)d, (const GFC_INTEGER_4 *)s);
|
|
return;
|
|
|
|
case 8:
|
|
internal_unpack_8 ((gfc_array_i8 *)d, (const GFC_INTEGER_8 *)s);
|
|
return;
|
|
}
|
|
|
|
if (d->dim[0].stride == 0)
|
|
d->dim[0].stride = 1;
|
|
|
|
dim = GFC_DESCRIPTOR_RANK (d);
|
|
dsize = 1;
|
|
for (n = 0; n < dim; n++)
|
|
{
|
|
count[n] = 0;
|
|
stride[n] = d->dim[n].stride;
|
|
extent[n] = d->dim[n].ubound + 1 - d->dim[n].lbound;
|
|
if (extent[n] <= 0)
|
|
abort ();
|
|
|
|
if (dsize == stride[n])
|
|
dsize *= extent[n];
|
|
else
|
|
dsize = 0;
|
|
}
|
|
|
|
src = s;
|
|
|
|
if (dsize != 0)
|
|
{
|
|
memcpy (dest, src, dsize * size);
|
|
return;
|
|
}
|
|
|
|
stride0 = stride[0] * size;
|
|
|
|
while (dest)
|
|
{
|
|
/* Copy the data. */
|
|
memcpy (dest, src, size);
|
|
/* Advance to the next element. */
|
|
src += size;
|
|
dest += stride0;
|
|
count[0]++;
|
|
/* Advance to the next source element. */
|
|
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. */
|
|
dest -= stride[n] * extent[n] * size;
|
|
n++;
|
|
if (n == dim)
|
|
{
|
|
dest = NULL;
|
|
break;
|
|
}
|
|
else
|
|
{
|
|
count[n]++;
|
|
dest += stride[n] * size;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|