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"
36 #if defined (HAVE_GFC_REAL_10)
38 typedef GFC_ARRAY_DESCRIPTOR(1, index_type
) shape_type
;
41 extern void reshape_r10 (gfc_array_r10
* const restrict
,
42 gfc_array_r10
* const restrict
,
43 shape_type
* const restrict
,
44 gfc_array_r10
* const restrict
,
45 shape_type
* const restrict
);
46 export_proto(reshape_r10
);
49 reshape_r10 (gfc_array_r10
* const restrict ret
,
50 gfc_array_r10
* const restrict source
,
51 shape_type
* const restrict shape
,
52 gfc_array_r10
* const restrict pad
,
53 shape_type
* const restrict order
)
55 /* r.* indicates the return array. */
56 index_type rcount
[GFC_MAX_DIMENSIONS
];
57 index_type rextent
[GFC_MAX_DIMENSIONS
];
58 index_type rstride
[GFC_MAX_DIMENSIONS
];
65 /* s.* indicates the source array. */
66 index_type scount
[GFC_MAX_DIMENSIONS
];
67 index_type sextent
[GFC_MAX_DIMENSIONS
];
68 index_type sstride
[GFC_MAX_DIMENSIONS
];
72 const GFC_REAL_10
*sptr
;
73 /* p.* indicates the pad array. */
74 index_type pcount
[GFC_MAX_DIMENSIONS
];
75 index_type pextent
[GFC_MAX_DIMENSIONS
];
76 index_type pstride
[GFC_MAX_DIMENSIONS
];
79 const GFC_REAL_10
*pptr
;
81 const GFC_REAL_10
*src
;
84 int sempty
, pempty
, shape_empty
;
85 index_type shape_data
[GFC_MAX_DIMENSIONS
];
87 rdim
= shape
->dim
[0].ubound
- shape
->dim
[0].lbound
+ 1;
88 if (rdim
!= GFC_DESCRIPTOR_RANK(ret
))
89 runtime_error("rank of return array incorrect in RESHAPE intrinsic");
93 for (n
= 0; n
< rdim
; n
++)
95 shape_data
[n
] = shape
->data
[n
* shape
->dim
[0].stride
];
96 if (shape_data
[n
] <= 0)
103 if (ret
->data
== NULL
)
106 for (n
= 0; n
< rdim
; n
++)
108 ret
->dim
[n
].lbound
= 0;
110 ret
->dim
[n
].ubound
= rex
- 1;
111 ret
->dim
[n
].stride
= rs
;
115 ret
->data
= internal_malloc_size ( rs
* sizeof (GFC_REAL_10
));
116 ret
->dtype
= (source
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rdim
;
122 if (unlikely (compile_options
.bounds_check
))
124 index_type ret_extent
, source_extent
;
127 for (n
= 0; n
< rdim
; n
++)
130 ret_extent
= ret
->dim
[n
].ubound
+ 1 - ret
->dim
[n
].lbound
;
131 if (ret_extent
!= shape_data
[n
])
132 runtime_error("Incorrect extent in return value of RESHAPE"
133 " intrinsic in dimension %ld: is %ld,"
134 " should be %ld", (long int) n
+1,
135 (long int) ret_extent
, (long int) shape_data
[n
]);
138 source_extent
= source
->dim
[0].ubound
+ 1 - source
->dim
[0].lbound
;
140 if (rs
!= source_extent
)
141 runtime_error("Incorrect size in SOURCE argument to RESHAPE"
142 " intrinsic: is %ld, should be %ld",
143 (long int) source_extent
, (long int) rs
);
147 int seen
[GFC_MAX_DIMENSIONS
];
150 for (n
= 0; n
< rdim
; n
++)
153 for (n
= 0; n
< rdim
; n
++)
155 v
= order
->data
[n
* order
->dim
[0].stride
] - 1;
157 if (v
< 0 || v
>= rdim
)
158 runtime_error("Value %ld out of range in ORDER argument"
159 " to RESHAPE intrinsic", (long int) v
+ 1);
162 runtime_error("Duplicate value %ld in ORDER argument to"
163 " RESHAPE intrinsic", (long int) v
+ 1);
171 for (n
= 0; n
< rdim
; n
++)
174 dim
= order
->data
[n
* order
->dim
[0].stride
] - 1;
179 rstride
[n
] = ret
->dim
[dim
].stride
;
180 rextent
[n
] = ret
->dim
[dim
].ubound
+ 1 - ret
->dim
[dim
].lbound
;
184 if (rextent
[n
] != shape_data
[dim
])
185 runtime_error ("shape and target do not conform");
187 if (rsize
== rstride
[n
])
195 sdim
= GFC_DESCRIPTOR_RANK (source
);
198 for (n
= 0; n
< sdim
; n
++)
201 sstride
[n
] = source
->dim
[n
].stride
;
202 sextent
[n
] = source
->dim
[n
].ubound
+ 1 - source
->dim
[n
].lbound
;
209 if (ssize
== sstride
[n
])
217 pdim
= GFC_DESCRIPTOR_RANK (pad
);
220 for (n
= 0; n
< pdim
; n
++)
223 pstride
[n
] = pad
->dim
[n
].stride
;
224 pextent
[n
] = pad
->dim
[n
].ubound
+ 1 - pad
->dim
[n
].lbound
;
231 if (psize
== pstride
[n
])
246 if (rsize
!= 0 && ssize
!= 0 && psize
!= 0)
248 rsize
*= sizeof (GFC_REAL_10
);
249 ssize
*= sizeof (GFC_REAL_10
);
250 psize
*= sizeof (GFC_REAL_10
);
251 reshape_packed ((char *)ret
->data
, rsize
, (char *)source
->data
,
252 ssize
, pad
? (char *)pad
->data
: NULL
, psize
);
256 src
= sptr
= source
->data
;
257 rstride0
= rstride
[0];
258 sstride0
= sstride
[0];
260 if (sempty
&& pempty
)
265 /* Switch immediately to the pad array. */
269 for (dim
= 0; dim
< pdim
; dim
++)
271 scount
[dim
] = pcount
[dim
];
272 sextent
[dim
] = pextent
[dim
];
273 sstride
[dim
] = pstride
[dim
];
274 sstride0
= sstride
[0] * sizeof (GFC_REAL_10
);
280 /* Select between the source and pad arrays. */
282 /* Advance to the next element. */
288 /* Advance to the next destination element. */
290 while (rcount
[n
] == rextent
[n
])
292 /* When we get to the end of a dimension, reset it and increment
293 the next dimension. */
295 /* We could precalculate these products, but this is a less
296 frequently used path so probably not worth it. */
297 rptr
-= rstride
[n
] * rextent
[n
];
301 /* Break out of the loop. */
311 /* Advance to the next source element. */
313 while (scount
[n
] == sextent
[n
])
315 /* When we get to the end of a dimension, reset it and increment
316 the next dimension. */
318 /* We could precalculate these products, but this is a less
319 frequently used path so probably not worth it. */
320 src
-= sstride
[n
] * sextent
[n
];
326 /* Switch to the pad array. */
329 for (dim
= 0; dim
< pdim
; dim
++)
331 scount
[dim
] = pcount
[dim
];
332 sextent
[dim
] = pextent
[dim
];
333 sstride
[dim
] = pstride
[dim
];
334 sstride0
= sstride
[0];
337 /* We now start again from the beginning of the pad array. */