1 `/* Implementation of the RESHAPE
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 Libgfortran 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. */
34 #include "libgfortran.h"'
37 `#if defined (HAVE_'rtype_name`)'
39 typedef GFC_ARRAY_DESCRIPTOR(1, index_type) shape_type;
41 /* The shape parameter is ignored. We can currently deduce the shape from the
43 dnl Only the kind (ie size) is used to name the function.
45 extern void reshape_`'rtype_ccode (rtype * const restrict,
46 rtype * const restrict,
47 shape_type * const restrict,
48 rtype * const restrict,
49 shape_type * const restrict);
50 export_proto(reshape_`'rtype_ccode);
53 reshape_`'rtype_ccode (rtype * const restrict ret,
54 rtype * const restrict source,
55 shape_type * const restrict shape,
56 rtype * const restrict pad,
57 shape_type * const restrict order)
59 /* r.* indicates the return array. */
60 index_type rcount[GFC_MAX_DIMENSIONS];
61 index_type rextent[GFC_MAX_DIMENSIONS];
62 index_type rstride[GFC_MAX_DIMENSIONS];
69 /* s.* indicates the source array. */
70 index_type scount[GFC_MAX_DIMENSIONS];
71 index_type sextent[GFC_MAX_DIMENSIONS];
72 index_type sstride[GFC_MAX_DIMENSIONS];
76 const rtype_name *sptr;
77 /* p.* indicates the pad array. */
78 index_type pcount[GFC_MAX_DIMENSIONS];
79 index_type pextent[GFC_MAX_DIMENSIONS];
80 index_type pstride[GFC_MAX_DIMENSIONS];
83 const rtype_name *pptr;
85 const rtype_name *src;
89 if (ret->data == NULL)
91 rdim = shape->dim[0].ubound - shape->dim[0].lbound + 1;
93 for (n=0; n < rdim; n++)
95 ret->dim[n].lbound = 0;
96 rex = shape->data[n * shape->dim[0].stride];
97 ret->dim[n].ubound = rex - 1;
98 ret->dim[n].stride = rs;
102 ret->data = internal_malloc_size ( rs * sizeof (rtype_name));
103 ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
107 rdim = GFC_DESCRIPTOR_RANK (ret);
111 for (n = 0; n < rdim; n++)
114 dim = order->data[n * order->dim[0].stride] - 1;
119 rstride[n] = ret->dim[dim].stride;
120 rextent[n] = ret->dim[dim].ubound + 1 - ret->dim[dim].lbound;
122 if (rextent[n] != shape->data[dim * shape->dim[0].stride])
123 runtime_error ("shape and target do not conform");
125 if (rsize == rstride[n])
133 sdim = GFC_DESCRIPTOR_RANK (source);
135 for (n = 0; n < sdim; n++)
138 sstride[n] = source->dim[n].stride;
139 sextent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
143 if (ssize == sstride[n])
151 pdim = GFC_DESCRIPTOR_RANK (pad);
153 for (n = 0; n < pdim; n++)
156 pstride[n] = pad->dim[n].stride;
157 pextent[n] = pad->dim[n].ubound + 1 - pad->dim[n].lbound;
160 if (psize == pstride[n])
174 if (rsize != 0 && ssize != 0 && psize != 0)
176 rsize *= sizeof (rtype_name);
177 ssize *= sizeof (rtype_name);
178 psize *= sizeof (rtype_name);
179 reshape_packed ((char *)ret->data, rsize, (char *)source->data,
180 ssize, pad ? (char *)pad->data : NULL, psize);
184 src = sptr = source->data;
185 rstride0 = rstride[0];
186 sstride0 = sstride[0];
190 /* Select between the source and pad arrays. */
192 /* Advance to the next element. */
197 /* Advance to the next destination element. */
199 while (rcount[n] == rextent[n])
201 /* When we get to the end of a dimension, reset it and increment
202 the next dimension. */
204 /* We could precalculate these products, but this is a less
205 frequently used path so proabably not worth it. */
206 rptr -= rstride[n] * rextent[n];
210 /* Break out of the loop. */
220 /* Advance to the next source element. */
222 while (scount[n] == sextent[n])
224 /* When we get to the end of a dimension, reset it and increment
225 the next dimension. */
227 /* We could precalculate these products, but this is a less
228 frequently used path so proabably not worth it. */
229 src -= sstride[n] * sextent[n];
235 /* Switch to the pad array. */
238 for (dim = 0; dim < pdim; dim++)
240 scount[dim] = pcount[dim];
241 sextent[dim] = pextent[dim];
242 sstride[dim] = pstride[dim];
243 sstride0 = sstride[0];
246 /* We now start again from the beginning of the pad array. */