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"
36 #if defined (HAVE_GFC_REAL_10)
38 typedef GFC_ARRAY_DESCRIPTOR(1, index_type
) shape_type
;
40 /* The shape parameter is ignored. We can currently deduce the shape from the
43 extern void reshape_r10 (gfc_array_r10
* const restrict
,
44 gfc_array_r10
* const restrict
,
45 shape_type
* const restrict
,
46 gfc_array_r10
* const restrict
,
47 shape_type
* const restrict
);
48 export_proto(reshape_r10
);
51 reshape_r10 (gfc_array_r10
* const restrict ret
,
52 gfc_array_r10
* const restrict source
,
53 shape_type
* const restrict shape
,
54 gfc_array_r10
* const restrict pad
,
55 shape_type
* const restrict order
)
57 /* r.* indicates the return array. */
58 index_type rcount
[GFC_MAX_DIMENSIONS
];
59 index_type rextent
[GFC_MAX_DIMENSIONS
];
60 index_type rstride
[GFC_MAX_DIMENSIONS
];
67 /* s.* indicates the source array. */
68 index_type scount
[GFC_MAX_DIMENSIONS
];
69 index_type sextent
[GFC_MAX_DIMENSIONS
];
70 index_type sstride
[GFC_MAX_DIMENSIONS
];
74 const GFC_REAL_10
*sptr
;
75 /* p.* indicates the pad array. */
76 index_type pcount
[GFC_MAX_DIMENSIONS
];
77 index_type pextent
[GFC_MAX_DIMENSIONS
];
78 index_type pstride
[GFC_MAX_DIMENSIONS
];
81 const GFC_REAL_10
*pptr
;
83 const GFC_REAL_10
*src
;
87 if (ret
->data
== NULL
)
89 rdim
= shape
->dim
[0].ubound
- shape
->dim
[0].lbound
+ 1;
91 for (n
=0; n
< rdim
; n
++)
93 ret
->dim
[n
].lbound
= 0;
94 rex
= shape
->data
[n
* shape
->dim
[0].stride
];
95 ret
->dim
[n
].ubound
= rex
- 1;
96 ret
->dim
[n
].stride
= rs
;
100 ret
->data
= internal_malloc_size ( rs
* sizeof (GFC_REAL_10
));
101 ret
->dtype
= (source
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rdim
;
105 rdim
= GFC_DESCRIPTOR_RANK (ret
);
109 for (n
= 0; n
< rdim
; n
++)
112 dim
= order
->data
[n
* order
->dim
[0].stride
] - 1;
117 rstride
[n
] = ret
->dim
[dim
].stride
;
118 rextent
[n
] = ret
->dim
[dim
].ubound
+ 1 - ret
->dim
[dim
].lbound
;
120 if (rextent
[n
] != shape
->data
[dim
* shape
->dim
[0].stride
])
121 runtime_error ("shape and target do not conform");
123 if (rsize
== rstride
[n
])
131 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
;
141 if (ssize
== sstride
[n
])
149 pdim
= GFC_DESCRIPTOR_RANK (pad
);
151 for (n
= 0; n
< pdim
; n
++)
154 pstride
[n
] = pad
->dim
[n
].stride
;
155 pextent
[n
] = pad
->dim
[n
].ubound
+ 1 - pad
->dim
[n
].lbound
;
158 if (psize
== pstride
[n
])
172 if (rsize
!= 0 && ssize
!= 0 && psize
!= 0)
174 rsize
*= sizeof (GFC_REAL_10
);
175 ssize
*= sizeof (GFC_REAL_10
);
176 psize
*= sizeof (GFC_REAL_10
);
177 reshape_packed ((char *)ret
->data
, rsize
, (char *)source
->data
,
178 ssize
, pad
? (char *)pad
->data
: NULL
, psize
);
182 src
= sptr
= source
->data
;
183 rstride0
= rstride
[0];
184 sstride0
= sstride
[0];
188 /* Select between the source and pad arrays. */
190 /* Advance to the next element. */
195 /* Advance to the next destination element. */
197 while (rcount
[n
] == rextent
[n
])
199 /* When we get to the end of a dimension, reset it and increment
200 the next dimension. */
202 /* We could precalculate these products, but this is a less
203 frequently used path so probably not worth it. */
204 rptr
-= rstride
[n
] * rextent
[n
];
208 /* Break out of the loop. */
218 /* Advance to the next source element. */
220 while (scount
[n
] == sextent
[n
])
222 /* When we get to the end of a dimension, reset it and increment
223 the next dimension. */
225 /* We could precalculate these products, but this is a less
226 frequently used path so probably not worth it. */
227 src
-= sstride
[n
] * sextent
[n
];
233 /* Switch to the pad array. */
236 for (dim
= 0; dim
< pdim
; dim
++)
238 scount
[dim
] = pcount
[dim
];
239 sextent
[dim
] = pextent
[dim
];
240 sstride
[dim
] = pstride
[dim
];
241 sstride0
= sstride
[0];
244 /* We now start again from the beginning of the pad array. */