7f68c75fb3
gcc/fortran/
* iresolve.c (gfc_resolve_all, gfc_resolve_any, gfc_resolve_count,
gfc_resolve_cshift, gfc_resolve_dot_product, gfc_resolve_eoshift,
gfc_resolve_matmul, gfc_resolve_maxloc, gfc_resolve_maxval,
gfc_resolve_minloc, gfc_resolve_minval, gfc_resolve_pack,
gfc_resolve_product, gfc_resolve_reshape, gfc_resolve_shape,
gfc_resolve_spread, gfc_resolve_sum, gfc_resolve_transpose,
gfc_resolve_unpack: Use PREFIX.
libgfortran/
* intrinsics/cshift0.c, intrinsics/eoshift0.c, intrinsics/eoshift2.c,
intrinsics/pack_generic.c, intrinsics/reshape_generic.c,
intrinsics/spread_generic.c, intrinsics/transpose_generic.c,
intrinsics/unpack_generic.c, m4/cshift1.m4, m4/dotprod.m4,
m4/dotprodc.m4, m4/dotprodl.m4, m4/eoshift1.m4, m4/eoshift3.m4,
m4/iforeach.m4, m4/ifunction.m4, m4/matmul.m4, m4/matmull.m4,
m4/reshape.m4, m4/shape.m4, m4/transpose.m4: Use standard prefix
instead of "__".
* generated/*: Rebuild.
From-SVN: r92075
90 lines
2.6 KiB
C
90 lines
2.6 KiB
C
/* Implementation of the TRANSPOSE intrinsic
|
|
Copyright 2003 Free Software Foundation, Inc.
|
|
Contributed by Tobias Schlüter
|
|
|
|
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 <assert.h>
|
|
#include "libgfortran.h"
|
|
|
|
extern void transpose_8 (gfc_array_i8 * ret, gfc_array_i8 * source);
|
|
export_proto(transpose_8);
|
|
|
|
void
|
|
transpose_8 (gfc_array_i8 * ret, gfc_array_i8 * source)
|
|
{
|
|
/* r.* indicates the return array. */
|
|
index_type rxstride, rystride;
|
|
GFC_INTEGER_8 *rptr;
|
|
/* s.* indicates the source array. */
|
|
index_type sxstride, systride;
|
|
const GFC_INTEGER_8 *sptr;
|
|
|
|
index_type xcount, ycount;
|
|
index_type x, y;
|
|
|
|
assert (GFC_DESCRIPTOR_RANK (source) == 2);
|
|
|
|
if (ret->data == NULL)
|
|
{
|
|
assert (GFC_DESCRIPTOR_RANK (ret) == 2);
|
|
assert (ret->dtype == source->dtype);
|
|
|
|
ret->dim[0].lbound = 0;
|
|
ret->dim[0].ubound = source->dim[1].ubound - source->dim[1].lbound;
|
|
ret->dim[0].stride = 1;
|
|
|
|
ret->dim[1].lbound = 0;
|
|
ret->dim[1].ubound = source->dim[0].ubound - source->dim[0].lbound;
|
|
ret->dim[1].stride = ret->dim[0].ubound+1;
|
|
|
|
ret->data = internal_malloc_size (sizeof (GFC_INTEGER_8) * size0 (ret));
|
|
ret->base = 0;
|
|
}
|
|
|
|
if (ret->dim[0].stride == 0)
|
|
ret->dim[0].stride = 1;
|
|
if (source->dim[0].stride == 0)
|
|
source->dim[0].stride = 1;
|
|
|
|
sxstride = source->dim[0].stride;
|
|
systride = source->dim[1].stride;
|
|
xcount = source->dim[0].ubound + 1 - source->dim[0].lbound;
|
|
ycount = source->dim[1].ubound + 1 - source->dim[1].lbound;
|
|
|
|
rxstride = ret->dim[0].stride;
|
|
rystride = ret->dim[1].stride;
|
|
|
|
rptr = ret->data;
|
|
sptr = source->data;
|
|
|
|
for (y=0; y < ycount; y++)
|
|
{
|
|
for (x=0; x < xcount; x++)
|
|
{
|
|
*rptr = *sptr;
|
|
|
|
sptr += sxstride;
|
|
rptr += rystride;
|
|
}
|
|
sptr += systride - (sxstride * xcount);
|
|
rptr += rxstride - (rystride * xcount);
|
|
}
|
|
}
|