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_16)
38 typedef GFC_ARRAY_DESCRIPTOR(1, index_type
) shape_type
;
41 extern void reshape_r16 (gfc_array_r16
* const restrict
,
42 gfc_array_r16
* const restrict
,
43 shape_type
* const restrict
,
44 gfc_array_r16
* const restrict
,
45 shape_type
* const restrict
);
46 export_proto(reshape_r16
);
49 reshape_r16 (gfc_array_r16
* const restrict ret
,
50 gfc_array_r16
* const restrict source
,
51 shape_type
* const restrict shape
,
52 gfc_array_r16
* 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_16
*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_16
*pptr
;
81 const GFC_REAL_16
*src
;
86 if (ret
->data
== NULL
)
88 rdim
= shape
->dim
[0].ubound
- shape
->dim
[0].lbound
+ 1;
90 for (n
= 0; n
< rdim
; n
++)
92 ret
->dim
[n
].lbound
= 0;
93 rex
= shape
->data
[n
* shape
->dim
[0].stride
];
94 ret
->dim
[n
].ubound
= rex
- 1;
95 ret
->dim
[n
].stride
= rs
;
99 ret
->data
= internal_malloc_size ( rs
* sizeof (GFC_REAL_16
));
100 ret
->dtype
= (source
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rdim
;
104 rdim
= GFC_DESCRIPTOR_RANK (ret
);
108 for (n
= 0; n
< rdim
; n
++)
111 dim
= order
->data
[n
* order
->dim
[0].stride
] - 1;
116 rstride
[n
] = ret
->dim
[dim
].stride
;
117 rextent
[n
] = ret
->dim
[dim
].ubound
+ 1 - ret
->dim
[dim
].lbound
;
119 if (rextent
[n
] != shape
->data
[dim
* shape
->dim
[0].stride
])
120 runtime_error ("shape and target do not conform");
122 if (rsize
== rstride
[n
])
130 sdim
= GFC_DESCRIPTOR_RANK (source
);
133 for (n
= 0; n
< sdim
; n
++)
136 sstride
[n
] = source
->dim
[n
].stride
;
137 sextent
[n
] = source
->dim
[n
].ubound
+ 1 - source
->dim
[n
].lbound
;
144 if (ssize
== sstride
[n
])
152 pdim
= GFC_DESCRIPTOR_RANK (pad
);
155 for (n
= 0; n
< pdim
; n
++)
158 pstride
[n
] = pad
->dim
[n
].stride
;
159 pextent
[n
] = pad
->dim
[n
].ubound
+ 1 - pad
->dim
[n
].lbound
;
166 if (psize
== pstride
[n
])
181 if (rsize
!= 0 && ssize
!= 0 && psize
!= 0)
183 rsize
*= sizeof (GFC_REAL_16
);
184 ssize
*= sizeof (GFC_REAL_16
);
185 psize
*= sizeof (GFC_REAL_16
);
186 reshape_packed ((char *)ret
->data
, rsize
, (char *)source
->data
,
187 ssize
, pad
? (char *)pad
->data
: NULL
, psize
);
191 src
= sptr
= source
->data
;
192 rstride0
= rstride
[0];
193 sstride0
= sstride
[0];
195 if (sempty
&& pempty
)
200 /* Switch immediately to the pad array. */
204 for (dim
= 0; dim
< pdim
; dim
++)
206 scount
[dim
] = pcount
[dim
];
207 sextent
[dim
] = pextent
[dim
];
208 sstride
[dim
] = pstride
[dim
];
209 sstride0
= sstride
[0] * sizeof (GFC_REAL_16
);
215 /* Select between the source and pad arrays. */
217 /* Advance to the next element. */
223 /* Advance to the next destination element. */
225 while (rcount
[n
] == rextent
[n
])
227 /* When we get to the end of a dimension, reset it and increment
228 the next dimension. */
230 /* We could precalculate these products, but this is a less
231 frequently used path so probably not worth it. */
232 rptr
-= rstride
[n
] * rextent
[n
];
236 /* Break out of the loop. */
246 /* Advance to the next source element. */
248 while (scount
[n
] == sextent
[n
])
250 /* When we get to the end of a dimension, reset it and increment
251 the next dimension. */
253 /* We could precalculate these products, but this is a less
254 frequently used path so probably not worth it. */
255 src
-= sstride
[n
] * sextent
[n
];
261 /* Switch to the pad array. */
264 for (dim
= 0; dim
< pdim
; dim
++)
266 scount
[dim
] = pcount
[dim
];
267 sextent
[dim
] = pextent
[dim
];
268 sstride
[dim
] = pstride
[dim
];
269 sstride0
= sstride
[0];
272 /* We now start again from the beginning of the pad array. */