1 `/* Implementation of the RESHAPE intrinsic
2 Copyright 2002, 2006, 2007, 2009 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 3 of the License, or (at your option) any later version.
12 Libgfortran is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 Under Section 7 of GPL version 3, you are granted additional
18 permissions described in the GCC Runtime Library Exception, version
19 3.1, as published by the Free Software Foundation.
21 You should have received a copy of the GNU General Public License and
22 a copy of the GCC Runtime Library Exception along with this program;
23 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 <http://www.gnu.org/licenses/>. */
26 #include "libgfortran.h"
32 `#if defined (HAVE_'rtype_name`)
34 typedef GFC_ARRAY_DESCRIPTOR(1, 'index_type`) 'shape_type`;'
36 dnl For integer routines, only the kind (ie size) is used to name the
37 dnl function. The same function will be used for integer and logical
38 dnl arrays of the same kind.
40 `extern void reshape_'rtype_ccode` ('rtype` * const restrict,
41 'rtype` * const restrict,
42 'shape_type` * const restrict,
43 'rtype` * const restrict,
44 'shape_type` * const restrict);
45 export_proto(reshape_'rtype_ccode`);
48 reshape_'rtype_ccode` ('rtype` * const restrict ret,
49 'rtype` * const restrict source,
50 'shape_type` * const restrict shape,
51 'rtype` * const restrict pad,
52 'shape_type` * const restrict order)
54 /* r.* indicates the return array. */
55 index_type rcount[GFC_MAX_DIMENSIONS];
56 index_type rextent[GFC_MAX_DIMENSIONS];
57 index_type rstride[GFC_MAX_DIMENSIONS];
64 /* s.* indicates the source array. */
65 index_type scount[GFC_MAX_DIMENSIONS];
66 index_type sextent[GFC_MAX_DIMENSIONS];
67 index_type sstride[GFC_MAX_DIMENSIONS];
71 const 'rtype_name` *sptr;
72 /* p.* indicates the pad array. */
73 index_type pcount[GFC_MAX_DIMENSIONS];
74 index_type pextent[GFC_MAX_DIMENSIONS];
75 index_type pstride[GFC_MAX_DIMENSIONS];
78 const 'rtype_name` *pptr;
80 const 'rtype_name` *src;
83 int sempty, pempty, shape_empty;
84 index_type shape_data[GFC_MAX_DIMENSIONS];
86 rdim = GFC_DESCRIPTOR_EXTENT(shape,0);
87 if (rdim != GFC_DESCRIPTOR_RANK(ret))
88 runtime_error("rank of return array incorrect in RESHAPE intrinsic");
92 for (n = 0; n < rdim; n++)
94 shape_data[n] = shape->data[n * GFC_DESCRIPTOR_STRIDE(shape,0)];
95 if (shape_data[n] <= 0)
102 if (ret->data == NULL)
105 for (n = 0; n < rdim; n++)
109 GFC_DIMENSION_SET(ret->dim[n], 0, rex - 1, rs);
114 ret->data = internal_malloc_size ( rs * sizeof ('rtype_name`));
115 ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
123 pdim = GFC_DESCRIPTOR_RANK (pad);
126 for (n = 0; n < pdim; n++)
129 pstride[n] = GFC_DESCRIPTOR_STRIDE(pad,n);
130 pextent[n] = GFC_DESCRIPTOR_EXTENT(pad,n);
137 if (psize == pstride[n])
152 if (unlikely (compile_options.bounds_check))
154 index_type ret_extent, source_extent;
157 for (n = 0; n < rdim; n++)
160 ret_extent = GFC_DESCRIPTOR_EXTENT(ret,n);
161 if (ret_extent != shape_data[n])
162 runtime_error("Incorrect extent in return value of RESHAPE"
163 " intrinsic in dimension %ld: is %ld,"
164 " should be %ld", (long int) n+1,
165 (long int) ret_extent, (long int) shape_data[n]);
169 sdim = GFC_DESCRIPTOR_RANK (source);
170 for (n = 0; n < sdim; n++)
173 se = GFC_DESCRIPTOR_EXTENT(source,n);
174 source_extent *= se > 0 ? se : 0;
177 if (rs > source_extent && (!pad || pempty))
178 runtime_error("Incorrect size in SOURCE argument to RESHAPE"
179 " intrinsic: is %ld, should be %ld",
180 (long int) source_extent, (long int) rs);
184 int seen[GFC_MAX_DIMENSIONS];
187 for (n = 0; n < rdim; n++)
190 for (n = 0; n < rdim; n++)
192 v = order->data[n * GFC_DESCRIPTOR_STRIDE(order,0)] - 1;
194 if (v < 0 || v >= rdim)
195 runtime_error("Value %ld out of range in ORDER argument"
196 " to RESHAPE intrinsic", (long int) v + 1);
199 runtime_error("Duplicate value %ld in ORDER argument to"
200 " RESHAPE intrinsic", (long int) v + 1);
208 for (n = 0; n < rdim; n++)
211 dim = order->data[n * GFC_DESCRIPTOR_STRIDE(order,0)] - 1;
216 rstride[n] = GFC_DESCRIPTOR_STRIDE(ret,dim);
217 rextent[n] = GFC_DESCRIPTOR_EXTENT(ret,dim);
221 if (rextent[n] != shape_data[dim])
222 runtime_error ("shape and target do not conform");
224 if (rsize == rstride[n])
232 sdim = GFC_DESCRIPTOR_RANK (source);
235 for (n = 0; n < sdim; n++)
238 sstride[n] = GFC_DESCRIPTOR_STRIDE(source,n);
239 sextent[n] = GFC_DESCRIPTOR_EXTENT(source,n);
246 if (ssize == sstride[n])
252 if (rsize != 0 && ssize != 0 && psize != 0)
254 rsize *= sizeof ('rtype_name`);
255 ssize *= sizeof ('rtype_name`);
256 psize *= sizeof ('rtype_name`);
257 reshape_packed ((char *)ret->data, rsize, (char *)source->data,
258 ssize, pad ? (char *)pad->data : NULL, psize);
262 src = sptr = source->data;
263 rstride0 = rstride[0];
264 sstride0 = sstride[0];
266 if (sempty && pempty)
271 /* Pretend we are using the pad array the first time around, too. */
275 for (dim = 0; dim < pdim; dim++)
277 scount[dim] = pcount[dim];
278 sextent[dim] = pextent[dim];
279 sstride[dim] = pstride[dim];
280 sstride0 = pstride[0];
286 /* Select between the source and pad arrays. */
288 /* Advance to the next element. */
294 /* Advance to the next destination element. */
296 while (rcount[n] == rextent[n])
298 /* When we get to the end of a dimension, reset it and increment
299 the next dimension. */
301 /* We could precalculate these products, but this is a less
302 frequently used path so probably not worth it. */
303 rptr -= rstride[n] * rextent[n];
307 /* Break out of the loop. */
317 /* Advance to the next source element. */
319 while (scount[n] == sextent[n])
321 /* When we get to the end of a dimension, reset it and increment
322 the next dimension. */
324 /* We could precalculate these products, but this is a less
325 frequently used path so probably not worth it. */
326 src -= sstride[n] * sextent[n];
332 /* Switch to the pad array. */
335 for (dim = 0; dim < pdim; dim++)
337 scount[dim] = pcount[dim];
338 sextent[dim] = pextent[dim];
339 sstride[dim] = pstride[dim];
340 sstride0 = sstride[0];
343 /* We now start again from the beginning of the pad array. */