117 lines
3.6 KiB
C
117 lines
3.6 KiB
C
/* Implementation of the TRANSPOSE intrinsic
|
|
Copyright 2003, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
|
|
Contributed by Tobias Schlüter
|
|
|
|
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 3 of the License, or (at your option) any later version.
|
|
|
|
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.
|
|
|
|
Under Section 7 of GPL version 3, you are granted additional
|
|
permissions described in the GCC Runtime Library Exception, version
|
|
3.1, as published by the Free Software Foundation.
|
|
|
|
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;
|
|
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|
<http://www.gnu.org/licenses/>. */
|
|
|
|
#include "libgfortran.h"
|
|
#include <assert.h>
|
|
|
|
|
|
#if defined (HAVE_GFC_INTEGER_8)
|
|
|
|
extern void transpose_i8 (gfc_array_i8 * const restrict ret,
|
|
gfc_array_i8 * const restrict source);
|
|
export_proto(transpose_i8);
|
|
|
|
void
|
|
transpose_i8 (gfc_array_i8 * const restrict ret,
|
|
gfc_array_i8 * const restrict source)
|
|
{
|
|
/* r.* indicates the return array. */
|
|
index_type rxstride, rystride;
|
|
GFC_INTEGER_8 * restrict 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 ((array_t *) ret));
|
|
ret->offset = 0;
|
|
} else if (unlikely (compile_options.bounds_check))
|
|
{
|
|
index_type ret_extent, src_extent;
|
|
|
|
ret_extent = ret->dim[0].ubound + 1 - ret->dim[0].lbound;
|
|
src_extent = source->dim[1].ubound + 1 - source->dim[1].lbound;
|
|
|
|
if (src_extent != ret_extent)
|
|
runtime_error ("Incorrect extent in return value of TRANSPOSE"
|
|
" intrinsic in dimension 1: is %ld,"
|
|
" should be %ld", (long int) src_extent,
|
|
(long int) ret_extent);
|
|
|
|
ret_extent = ret->dim[1].ubound + 1 - ret->dim[1].lbound;
|
|
src_extent = source->dim[0].ubound + 1 - source->dim[0].lbound;
|
|
|
|
if (src_extent != ret_extent)
|
|
runtime_error ("Incorrect extent in return value of TRANSPOSE"
|
|
" intrinsic in dimension 2: is %ld,"
|
|
" should be %ld", (long int) src_extent,
|
|
(long int) ret_extent);
|
|
|
|
}
|
|
|
|
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);
|
|
}
|
|
}
|
|
|
|
#endif
|