2004-05-13 08:41:07 +02:00
|
|
|
/* Generic helper function for repacking arrays.
|
2005-05-27 21:00:50 +02:00
|
|
|
Copyright 2003, 2004, 2005 Free Software Foundation, Inc.
|
2004-05-13 08:41:07 +02:00
|
|
|
Contributed by Paul Brook <paul@nowt.org>
|
|
|
|
|
2005-01-12 22:27:33 +01:00
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
2004-05-13 08:41:07 +02:00
|
|
|
|
2005-01-12 22:27:33 +01:00
|
|
|
Libgfortran is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU General Public
|
2004-05-13 08:41:07 +02:00
|
|
|
License as published by the Free Software Foundation; either
|
2005-01-12 22:27:33 +01:00
|
|
|
version 2 of the License, or (at your option) any later version.
|
2004-05-13 08:41:07 +02:00
|
|
|
|
2005-01-12 22:27:33 +01:00
|
|
|
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,
|
2004-05-13 08:41:07 +02:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2005-01-12 22:27:33 +01:00
|
|
|
GNU General Public License for more details.
|
2004-05-13 08:41:07 +02:00
|
|
|
|
2005-01-12 22:27:33 +01:00
|
|
|
You should have received a copy of the GNU General Public
|
|
|
|
License along with libgfortran; see the file COPYING. If not,
|
2005-08-17 04:49:08 +02:00
|
|
|
write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
|
|
Boston, MA 02110-1301, USA. */
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <assert.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include "libgfortran.h"
|
|
|
|
|
acinclude.m4 (LIBGFOR_CHECK_ATTRIBUTE_VISIBILITY): New.
* acinclude.m4 (LIBGFOR_CHECK_ATTRIBUTE_VISIBILITY): New.
(LIBGFOR_CHECK_ATTRIBUTE_DLLEXPORT): New.
(LIBGFOR_CHECK_ATTRIBUTE_ALIAS): New.
* configure.ac: Use them.
* configure, config.h.in, aclocal.m4: Rebuild.
* libgfortran.h (prefix): Remove.
(PREFIX, IPREFIX): New.
(sym_rename, sym_rename1, sym_rename2): New.
(internal_proto, export_proto, export_proto_np): New.
(iexport_proto, iexport): New.
(iexport_data_proto, iexport_data): New.
* intrinsics/abort.c, intrinsics/args.c, intrinsics/associated.c,
intrinsics/cpu_time.c, intrinsics/cshift0.c,
intrinsics/date_and_time.c, intrinsics/env.c, intrinsics/eoshift0.c,
intrinsics/eoshift2.c, intrinsics/etime.c, intrinsics/exit.c,
intrinsics/flush.c, intrinsics/fnum.c, intrinsics/getXid.c,
intrinsics/getcwd.c, intrinsics/ishftc.c, intrinsics/mvbits.c,
intrinsics/pack_generic.c, intrinsics/rand.c, intrinsics/random.c,
intrinsics/reshape_generic.c, intrinsics/size.c,
intrinsics/spread_generic.c, intrinsics/stat.c,
intrinsics/string_intrinsics.c, intrinsics/system.c,
intrinsics/system_clock.c, intrinsics/transpose_generic.c,
intrinsics/umask.c, intrinsics/unlink.c, intrinsics/unpack_generic.c,
io/backspace.c, io/close.c, io/endfile.c, io/inquire.c, io/io.h,
io/open.c, io/rewind.c, io/transfer.c, libgfortran.h, m4/cshift1.m4,
m4/dotprod.m4, m4/dotprodc.m4, m4/dotprodl.m4, m4/eoshift1.m4,
m4/eoshift3.m4, m4/exponent.m4, m4/fraction.m4, m4/iforeach.m4,
m4/ifunction.m4, m4/matmul.m4, m4/matmull.m4, m4/nearest.m4,
m4/pow.m4, m4/reshape.m4, m4/set_exponent.m4, m4/shape.m4,
m4/transpose.m4, runtime/environ.c, runtime/error.c,
runtime/in_pack_generic.c, runtime/in_unpack_generic.c,
runtime/main.c, runtime/memory.c, runtime/pause.c, runtime/select.c,
runtime/stop.c: Use them to mark symbols internal or external.
* generated/*: Rebuild.
From-SVN: r92045
2004-12-12 09:59:05 +01:00
|
|
|
extern void *internal_pack (gfc_array_char *);
|
|
|
|
export_proto(internal_pack);
|
|
|
|
|
2004-05-13 08:41:07 +02:00
|
|
|
void *
|
|
|
|
internal_pack (gfc_array_char * source)
|
|
|
|
{
|
2005-05-27 21:00:50 +02:00
|
|
|
index_type count[GFC_MAX_DIMENSIONS];
|
|
|
|
index_type extent[GFC_MAX_DIMENSIONS];
|
|
|
|
index_type stride[GFC_MAX_DIMENSIONS];
|
2004-05-13 08:41:07 +02:00
|
|
|
index_type stride0;
|
|
|
|
index_type dim;
|
|
|
|
index_type ssize;
|
|
|
|
const char *src;
|
|
|
|
char *dest;
|
|
|
|
void *destptr;
|
|
|
|
int n;
|
|
|
|
int packed;
|
|
|
|
index_type size;
|
2005-06-11 21:39:13 +02:00
|
|
|
int type;
|
2004-05-13 08:41:07 +02:00
|
|
|
|
|
|
|
if (source->dim[0].stride == 0)
|
|
|
|
{
|
|
|
|
source->dim[0].stride = 1;
|
|
|
|
return source->data;
|
|
|
|
}
|
|
|
|
|
2005-06-11 21:39:13 +02:00
|
|
|
type = GFC_DESCRIPTOR_TYPE (source);
|
2004-05-13 08:41:07 +02:00
|
|
|
size = GFC_DESCRIPTOR_SIZE (source);
|
2005-06-11 21:39:13 +02:00
|
|
|
switch (type)
|
2004-05-13 08:41:07 +02:00
|
|
|
{
|
2005-06-11 21:39:13 +02:00
|
|
|
case GFC_DTYPE_INTEGER:
|
|
|
|
case GFC_DTYPE_LOGICAL:
|
|
|
|
case GFC_DTYPE_REAL:
|
|
|
|
switch (size)
|
|
|
|
{
|
|
|
|
case 4:
|
|
|
|
return internal_pack_4 ((gfc_array_i4 *)source);
|
|
|
|
|
|
|
|
case 8:
|
|
|
|
return internal_pack_8 ((gfc_array_i8 *)source);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case GFC_DTYPE_COMPLEX:
|
|
|
|
switch (size)
|
|
|
|
{
|
|
|
|
case 8:
|
|
|
|
return internal_pack_c4 ((gfc_array_c4 *)source);
|
|
|
|
|
|
|
|
case 16:
|
|
|
|
return internal_pack_c8 ((gfc_array_c8 *)source);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
2004-05-13 08:41:07 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
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 = internal_malloc_size (ssize * size);
|
|
|
|
dest = (char *)destptr;
|
|
|
|
src = source->data;
|
|
|
|
stride0 = stride[0] * size;
|
|
|
|
|
|
|
|
while (src)
|
|
|
|
{
|
|
|
|
/* Copy the data. */
|
|
|
|
memcpy(dest, src, size);
|
|
|
|
/* Advance to the next element. */
|
|
|
|
dest += size;
|
|
|
|
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 proabably not worth it. */
|
|
|
|
src -= stride[n] * extent[n] * size;
|
|
|
|
n++;
|
|
|
|
if (n == dim)
|
|
|
|
{
|
|
|
|
src = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
count[n]++;
|
|
|
|
src += stride[n] * size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return destptr;
|
|
|
|
}
|