1 `/* Implementation of the RESHAPE
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 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. */
31 #include "libgfortran.h"
37 `#if defined (HAVE_'rtype_name`)
39 typedef GFC_ARRAY_DESCRIPTOR(1, 'index_type`) 'shape_type`;'
41 dnl For integer routines, only the kind (ie size) is used to name the
42 dnl function. The same function will be used for integer and logical
43 dnl arrays of the same kind.
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;
88 int sempty, pempty, shape_empty;
89 index_type shape_data[GFC_MAX_DIMENSIONS];
91 rdim = shape->dim[0].ubound - shape->dim[0].lbound + 1;
92 if (rdim != GFC_DESCRIPTOR_RANK(ret))
93 runtime_error("rank of return array incorrect in RESHAPE intrinsic");
97 for (n = 0; n < rdim; n++)
99 shape_data[n] = shape->data[n * shape->dim[0].stride];
100 if (shape_data[n] <= 0)
107 if (ret->data == NULL)
110 for (n = 0; n < rdim; n++)
112 ret->dim[n].lbound = 0;
114 ret->dim[n].ubound = rex - 1;
115 ret->dim[n].stride = rs;
119 ret->data = internal_malloc_size ( rs * sizeof ('rtype_name`));
120 ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
126 if (unlikely (compile_options.bounds_check))
128 index_type ret_extent, source_extent;
131 for (n = 0; n < rdim; n++)
134 ret_extent = ret->dim[n].ubound + 1 - ret->dim[n].lbound;
135 if (ret_extent != shape_data[n])
136 runtime_error("Incorrect extent in return value of RESHAPE"
137 " intrinsic in dimension %ld: is %ld,"
138 " should be %ld", (long int) n+1,
139 (long int) ret_extent, (long int) shape_data[n]);
142 source_extent = source->dim[0].ubound + 1 - source->dim[0].lbound;
144 if (rs < source_extent || (rs > source_extent && !pad))
145 runtime_error("Incorrect size in SOURCE argument to RESHAPE"
146 " intrinsic: is %ld, should be %ld",
147 (long int) source_extent, (long int) rs);
151 int seen[GFC_MAX_DIMENSIONS];
154 for (n = 0; n < rdim; n++)
157 for (n = 0; n < rdim; n++)
159 v = order->data[n * order->dim[0].stride] - 1;
161 if (v < 0 || v >= rdim)
162 runtime_error("Value %ld out of range in ORDER argument"
163 " to RESHAPE intrinsic", (long int) v + 1);
166 runtime_error("Duplicate value %ld in ORDER argument to"
167 " RESHAPE intrinsic", (long int) v + 1);
175 for (n = 0; n < rdim; n++)
178 dim = order->data[n * order->dim[0].stride] - 1;
183 rstride[n] = ret->dim[dim].stride;
184 rextent[n] = ret->dim[dim].ubound + 1 - ret->dim[dim].lbound;
188 if (rextent[n] != shape_data[dim])
189 runtime_error ("shape and target do not conform");
191 if (rsize == rstride[n])
199 sdim = GFC_DESCRIPTOR_RANK (source);
202 for (n = 0; n < sdim; n++)
205 sstride[n] = source->dim[n].stride;
206 sextent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
213 if (ssize == sstride[n])
221 pdim = GFC_DESCRIPTOR_RANK (pad);
224 for (n = 0; n < pdim; n++)
227 pstride[n] = pad->dim[n].stride;
228 pextent[n] = pad->dim[n].ubound + 1 - pad->dim[n].lbound;
235 if (psize == pstride[n])
250 if (rsize != 0 && ssize != 0 && psize != 0)
252 rsize *= sizeof ('rtype_name`);
253 ssize *= sizeof ('rtype_name`);
254 psize *= sizeof ('rtype_name`);
255 reshape_packed ((char *)ret->data, rsize, (char *)source->data,
256 ssize, pad ? (char *)pad->data : NULL, psize);
260 src = sptr = source->data;
261 rstride0 = rstride[0];
262 sstride0 = sstride[0];
264 if (sempty && pempty)
269 /* Pretend we are using the pad array the first time around, too. */
273 for (dim = 0; dim < pdim; dim++)
275 scount[dim] = pcount[dim];
276 sextent[dim] = pextent[dim];
277 sstride[dim] = pstride[dim];
278 sstride0 = pstride[0];
284 /* Select between the source and pad arrays. */
286 /* Advance to the next element. */
292 /* Advance to the next destination element. */
294 while (rcount[n] == rextent[n])
296 /* When we get to the end of a dimension, reset it and increment
297 the next dimension. */
299 /* We could precalculate these products, but this is a less
300 frequently used path so probably not worth it. */
301 rptr -= rstride[n] * rextent[n];
305 /* Break out of the loop. */
315 /* Advance to the next source element. */
317 while (scount[n] == sextent[n])
319 /* When we get to the end of a dimension, reset it and increment
320 the next dimension. */
322 /* We could precalculate these products, but this is a less
323 frequently used path so probably not worth it. */
324 src -= sstride[n] * sextent[n];
330 /* Switch to the pad array. */
333 for (dim = 0; dim < pdim; dim++)
335 scount[dim] = pcount[dim];
336 sextent[dim] = pextent[dim];
337 sstride[dim] = pstride[dim];
338 sstride0 = sstride[0];
341 /* We now start again from the beginning of the pad array. */