1 /* Generic implementation of the RESHAPE intrinsic
2 Copyright 2002, 2006, 2007 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. */
31 #include "libgfortran.h"
36 typedef GFC_ARRAY_DESCRIPTOR(1, index_type) shape_type;
37 typedef GFC_ARRAY_DESCRIPTOR(GFC_MAX_DIMENSIONS, char) parray;
40 reshape_internal (parray *ret, parray *source, shape_type *shape,
41 parray *pad, shape_type *order, index_type size)
43 /* r.* indicates the return array. */
44 index_type rcount[GFC_MAX_DIMENSIONS];
45 index_type rextent[GFC_MAX_DIMENSIONS];
46 index_type rstride[GFC_MAX_DIMENSIONS];
53 /* s.* indicates the source array. */
54 index_type scount[GFC_MAX_DIMENSIONS];
55 index_type sextent[GFC_MAX_DIMENSIONS];
56 index_type sstride[GFC_MAX_DIMENSIONS];
61 /* p.* indicates the pad array. */
62 index_type pcount[GFC_MAX_DIMENSIONS];
63 index_type pextent[GFC_MAX_DIMENSIONS];
64 index_type pstride[GFC_MAX_DIMENSIONS];
74 if (ret->data == NULL)
76 rdim = shape->dim[0].ubound - shape->dim[0].lbound + 1;
78 for (n = 0; n < rdim; n++)
80 ret->dim[n].lbound = 0;
81 rex = shape->data[n * shape->dim[0].stride];
82 ret->dim[n].ubound = rex - 1;
83 ret->dim[n].stride = rs;
87 ret->data = internal_malloc_size ( rs * size );
88 ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
92 rdim = GFC_DESCRIPTOR_RANK (ret);
96 for (n = 0; n < rdim; n++)
99 dim = order->data[n * order->dim[0].stride] - 1;
104 rstride[n] = ret->dim[dim].stride;
105 rextent[n] = ret->dim[dim].ubound + 1 - ret->dim[dim].lbound;
107 if (rextent[n] != shape->data[dim * shape->dim[0].stride])
108 runtime_error ("shape and target do not conform");
110 if (rsize == rstride[n])
118 sdim = GFC_DESCRIPTOR_RANK (source);
121 for (n = 0; n < sdim; n++)
124 sstride[n] = source->dim[n].stride;
125 sextent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
132 if (ssize == sstride[n])
140 pdim = GFC_DESCRIPTOR_RANK (pad);
143 for (n = 0; n < pdim; n++)
146 pstride[n] = pad->dim[n].stride;
147 pextent[n] = pad->dim[n].ubound + 1 - pad->dim[n].lbound;
154 if (psize == pstride[n])
169 if (rsize != 0 && ssize != 0 && psize != 0)
174 reshape_packed (ret->data, rsize, source->data, ssize,
175 pad ? pad->data : NULL, psize);
179 src = sptr = source->data;
180 rstride0 = rstride[0] * size;
181 sstride0 = sstride[0] * size;
183 if (sempty && pempty)
188 /* Switch immediately to the pad array. */
192 for (dim = 0; dim < pdim; dim++)
194 scount[dim] = pcount[dim];
195 sextent[dim] = pextent[dim];
196 sstride[dim] = pstride[dim];
197 sstride0 = sstride[0] * size;
203 /* Select between the source and pad arrays. */
204 memcpy(rptr, src, size);
205 /* Advance to the next element. */
211 /* Advance to the next destination element. */
213 while (rcount[n] == rextent[n])
215 /* When we get to the end of a dimension, reset it and increment
216 the next dimension. */
218 /* We could precalculate these products, but this is a less
219 frequently used path so probably not worth it. */
220 rptr -= rstride[n] * rextent[n] * size;
224 /* Break out of the loop. */
231 rptr += rstride[n] * size;
235 /* Advance to the next source element. */
237 while (scount[n] == sextent[n])
239 /* When we get to the end of a dimension, reset it and increment
240 the next dimension. */
242 /* We could precalculate these products, but this is a less
243 frequently used path so probably not worth it. */
244 src -= sstride[n] * sextent[n] * size;
250 /* Switch to the pad array. */
253 for (dim = 0; dim < pdim; dim++)
255 scount[dim] = pcount[dim];
256 sextent[dim] = pextent[dim];
257 sstride[dim] = pstride[dim];
258 sstride0 = sstride[0] * size;
261 /* We now start again from the beginning of the pad array. */
268 src += sstride[n] * size;
274 extern void reshape (parray *, parray *, shape_type *, parray *, shape_type *);
275 export_proto(reshape);
278 reshape (parray *ret, parray *source, shape_type *shape, parray *pad,
281 reshape_internal (ret, source, shape, pad, order,
282 GFC_DESCRIPTOR_SIZE (source));
285 extern void reshape_char (parray *, GFC_INTEGER_4, parray *, shape_type *,
286 parray *, shape_type *, GFC_INTEGER_4,
288 export_proto(reshape_char);
291 reshape_char (parray *ret, GFC_INTEGER_4 ret_length __attribute__((unused)),
292 parray *source, shape_type *shape, parray *pad,
293 shape_type *order, GFC_INTEGER_4 source_length,
294 GFC_INTEGER_4 pad_length __attribute__((unused)))
296 reshape_internal (ret, source, shape, pad, order, source_length);