1 /* Generic implementation of the RESHAPE intrinsic
2 Copyright 2002, 2006 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 95 runtime library (libgfortran).
7 Libgfortran is free software; you can redistribute it and/or
8 modify it under the terms of the GNU General Public
9 License as published by the Free Software Foundation; either
10 version 2 of the License, or (at your option) any later version.
12 In addition to the permissions in the GNU General Public License, the
13 Free Software Foundation gives you unlimited permission to link the
14 compiled version of this file into combinations with other programs,
15 and to distribute those combinations without any restriction coming
16 from the use of this file. (The General Public License restrictions
17 do apply in other respects; for example, they cover modification of
18 the file, and distribution when not linked into a combine
21 Ligbfortran is distributed in the hope that it will be useful,
22 but WITHOUT ANY WARRANTY; without even the implied warranty of
23 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 GNU General Public License for more details.
26 You should have received a copy of the GNU General Public
27 License along with libgfortran; see the file COPYING. If not,
28 write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
29 Boston, MA 02110-1301, USA. */
35 #include "libgfortran.h"
37 typedef GFC_ARRAY_DESCRIPTOR(1, index_type) shape_type;
38 typedef GFC_ARRAY_DESCRIPTOR(GFC_MAX_DIMENSIONS, char) parray;
40 /* The shape parameter is ignored. We can currently deduce the shape from the
44 reshape_internal (parray *ret, parray *source, shape_type *shape,
45 parray *pad, shape_type *order, index_type size)
47 /* r.* indicates the return array. */
48 index_type rcount[GFC_MAX_DIMENSIONS];
49 index_type rextent[GFC_MAX_DIMENSIONS];
50 index_type rstride[GFC_MAX_DIMENSIONS];
57 /* s.* indicates the source array. */
58 index_type scount[GFC_MAX_DIMENSIONS];
59 index_type sextent[GFC_MAX_DIMENSIONS];
60 index_type sstride[GFC_MAX_DIMENSIONS];
65 /* p.* indicates the pad array. */
66 index_type pcount[GFC_MAX_DIMENSIONS];
67 index_type pextent[GFC_MAX_DIMENSIONS];
68 index_type pstride[GFC_MAX_DIMENSIONS];
77 if (ret->data == NULL)
79 rdim = shape->dim[0].ubound - shape->dim[0].lbound + 1;
81 for (n=0; n < rdim; n++)
83 ret->dim[n].lbound = 0;
84 rex = shape->data[n * shape->dim[0].stride];
85 ret->dim[n].ubound = rex - 1;
86 ret->dim[n].stride = rs;
90 ret->data = internal_malloc_size ( rs * size );
91 ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
95 rdim = GFC_DESCRIPTOR_RANK (ret);
99 for (n = 0; n < rdim; n++)
102 dim = order->data[n * order->dim[0].stride] - 1;
107 rstride[n] = ret->dim[dim].stride;
108 rextent[n] = ret->dim[dim].ubound + 1 - ret->dim[dim].lbound;
110 if (rextent[n] != shape->data[dim * shape->dim[0].stride])
111 runtime_error ("shape and target do not conform");
113 if (rsize == rstride[n])
121 sdim = GFC_DESCRIPTOR_RANK (source);
123 for (n = 0; n < sdim; n++)
126 sstride[n] = source->dim[n].stride;
127 sextent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
131 if (ssize == sstride[n])
139 pdim = GFC_DESCRIPTOR_RANK (pad);
141 for (n = 0; n < pdim; n++)
144 pstride[n] = pad->dim[n].stride;
145 pextent[n] = pad->dim[n].ubound + 1 - pad->dim[n].lbound;
148 if (psize == pstride[n])
162 if (rsize != 0 && ssize != 0 && psize != 0)
167 reshape_packed (ret->data, rsize, source->data, ssize,
168 pad ? pad->data : NULL, psize);
172 src = sptr = source->data;
173 rstride0 = rstride[0] * size;
174 sstride0 = sstride[0] * size;
178 /* Select between the source and pad arrays. */
179 memcpy(rptr, src, size);
180 /* Advance to the next element. */
185 /* Advance to the next destination element. */
187 while (rcount[n] == rextent[n])
189 /* When we get to the end of a dimension, reset it and increment
190 the next dimension. */
192 /* We could precalculate these products, but this is a less
193 frequently used path so probably not worth it. */
194 rptr -= rstride[n] * rextent[n] * size;
198 /* Break out of the loop. */
205 rptr += rstride[n] * size;
208 /* Advance to the next source element. */
210 while (scount[n] == sextent[n])
212 /* When we get to the end of a dimension, reset it and increment
213 the next dimension. */
215 /* We could precalculate these products, but this is a less
216 frequently used path so probably not worth it. */
217 src -= sstride[n] * sextent[n] * size;
223 /* Switch to the pad array. */
226 for (dim = 0; dim < pdim; dim++)
228 scount[dim] = pcount[dim];
229 sextent[dim] = pextent[dim];
230 sstride[dim] = pstride[dim];
231 sstride0 = sstride[0] * size;
234 /* We now start again from the beginning of the pad array. */
241 sptr += sstride[n] * size;
247 extern void reshape (parray *, parray *, shape_type *, parray *, shape_type *);
248 export_proto(reshape);
251 reshape (parray *ret, parray *source, shape_type *shape, parray *pad,
254 reshape_internal (ret, source, shape, pad, order,
255 GFC_DESCRIPTOR_SIZE (source));
258 extern void reshape_char (parray *, GFC_INTEGER_4, parray *, shape_type *,
259 parray *, shape_type *, GFC_INTEGER_4,
261 export_proto(reshape_char);
264 reshape_char (parray *ret, GFC_INTEGER_4 ret_length __attribute__((unused)),
265 parray *source, shape_type *shape, parray *pad,
266 shape_type *order, GFC_INTEGER_4 source_length,
267 GFC_INTEGER_4 pad_length __attribute__((unused)))
269 reshape_internal (ret, source, shape, pad, order, source_length);