8b6dba81f0
2006-10-16 Tobias Burnus <burnus@net-b.de>
* m4/in_pack.m4: Fixed a typo.
* m4/iforeach.m4: Fixed a typo.
* m4/eoshift1.m4: Fixed a typo.
* m4/eoshift3.m4: Fixed a typo.
* m4/cshift1.m4: Fixed a typo.
* m4/in_unpack.m4: Fixed a typo.
* m4/reshape.m4: Fixed a typo.
* m4/ifunction.m4: Fixed a typo.
* runtime/environ.c: Fixed a typo.
* runtime/in_pack_generic.c: Fixed a typo.
* runtime/in_unpack_generic.c: Fixed a typo.
* runtime/memory.c: Fixed a typo.
* intrinsics/cshift0.c: Fixed a typo.
* intrinsics/cpu_time.c: Fixed a typo.
* intrinsics/pack_generic.c: Fixed a typo.
* intrinsics/unpack_generic.c: Fixed a typo.
* intrinsics/eoshift0.c: Fixed a typo.
* intrinsics/eoshift2.c: Fixed a typo.
* intrinsics/reshape_generic.c: Fixed a typo.
* io/open.c: Fixed a typo.
* io/list_read.c: Fixed a typo.
* io/io.h: Fixed a typo.
* io/transfer.c: Fixed a typo.
* io/write.c: Fixed a typo.
From-SVN: r117857
127 lines
3.6 KiB
Plaintext
127 lines
3.6 KiB
Plaintext
`/* Helper function for repacking arrays.
|
|
Copyright 2003, 2006 Free Software Foundation, Inc.
|
|
Contributed by Paul Brook <paul@nowt.org>
|
|
|
|
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.)
|
|
|
|
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.
|
|
|
|
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., 51 Franklin Street, Fifth Floor,
|
|
Boston, MA 02110-1301, USA. */
|
|
|
|
#include "config.h"
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include "libgfortran.h"'
|
|
include(iparm.m4)dnl
|
|
|
|
`#if defined (HAVE_'rtype_name`)'
|
|
|
|
/* Allocates a block of memory with internal_malloc if the array needs
|
|
repacking. */
|
|
|
|
dnl The kind (ie size) is used to name the function for logicals, integers
|
|
dnl and reals. For complex, it's c4 or c8.
|
|
rtype_name *
|
|
`internal_pack_'rtype_ccode (rtype * source)
|
|
{
|
|
index_type count[GFC_MAX_DIMENSIONS];
|
|
index_type extent[GFC_MAX_DIMENSIONS];
|
|
index_type stride[GFC_MAX_DIMENSIONS];
|
|
index_type stride0;
|
|
index_type dim;
|
|
index_type ssize;
|
|
const rtype_name *src;
|
|
rtype_name *dest;
|
|
rtype_name *destptr;
|
|
int n;
|
|
int packed;
|
|
|
|
/* TODO: Investigate how we can figure out if this is a temporary
|
|
since the stride=0 thing has been removed from the frontend. */
|
|
|
|
dim = GFC_DESCRIPTOR_RANK (source);
|
|
ssize = 1;
|
|
packed = 1;
|
|
for (n = 0; n < dim; n++)
|
|
{
|
|
count[n] = 0;
|
|
stride[n] = source->dim[n].stride;
|
|
extent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
|
|
if (extent[n] <= 0)
|
|
{
|
|
/* Do nothing. */
|
|
packed = 1;
|
|
break;
|
|
}
|
|
|
|
if (ssize != stride[n])
|
|
packed = 0;
|
|
|
|
ssize *= extent[n];
|
|
}
|
|
|
|
if (packed)
|
|
return source->data;
|
|
|
|
/* Allocate storage for the destination. */
|
|
destptr = (rtype_name *)internal_malloc_size (ssize * sizeof (rtype_name));
|
|
dest = destptr;
|
|
src = source->data;
|
|
stride0 = stride[0];
|
|
|
|
|
|
while (src)
|
|
{
|
|
/* Copy the data. */
|
|
*(dest++) = *src;
|
|
/* Advance to the next element. */
|
|
src += 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 probably not worth it. */
|
|
src -= stride[n] * extent[n];
|
|
n++;
|
|
if (n == dim)
|
|
{
|
|
src = NULL;
|
|
break;
|
|
}
|
|
else
|
|
{
|
|
count[n]++;
|
|
src += stride[n];
|
|
}
|
|
}
|
|
}
|
|
return destptr;
|
|
}
|
|
|
|
#endif
|