]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/intrinsics/reshape_generic.c
1 /* Generic implementation of the RESHAPE intrinsic
2 Copyright 2002 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 Ligbfortran 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., 59 Temple Place - Suite 330,
29 Boston, MA 02111-1307, USA. */
35 #include "libgfortran.h"
37 typedef GFC_ARRAY_DESCRIPTOR(1, index_type
) shape_type
;
38 typedef GFC_ARRAY_DESCRIPTOR(GFC_MAX_DIMENSIONS
, char) parray
;
40 extern void reshape (parray
*, parray
*, shape_type
*, parray
*, shape_type
*);
41 export_proto(reshape
);
43 /* The shape parameter is ignored. We can currently deduce the shape from the
47 reshape (parray
*ret
, parray
*source
, shape_type
*shape
,
48 parray
*pad
, shape_type
*order
)
50 /* r.* indicates the return array. */
51 index_type rcount
[GFC_MAX_DIMENSIONS
];
52 index_type rextent
[GFC_MAX_DIMENSIONS
];
53 index_type rstride
[GFC_MAX_DIMENSIONS
];
58 /* s.* indicates the source array. */
59 index_type scount
[GFC_MAX_DIMENSIONS
];
60 index_type sextent
[GFC_MAX_DIMENSIONS
];
61 index_type sstride
[GFC_MAX_DIMENSIONS
];
66 /* p.* indicates the pad array. */
67 index_type pcount
[GFC_MAX_DIMENSIONS
];
68 index_type pextent
[GFC_MAX_DIMENSIONS
];
69 index_type pstride
[GFC_MAX_DIMENSIONS
];
79 size
= GFC_DESCRIPTOR_SIZE (ret
);
80 if (ret
->dim
[0].stride
== 0)
81 ret
->dim
[0].stride
= 1;
82 if (source
->dim
[0].stride
== 0)
83 source
->dim
[0].stride
= 1;
84 if (shape
->dim
[0].stride
== 0)
85 shape
->dim
[0].stride
= 1;
86 if (pad
&& pad
->dim
[0].stride
== 0)
87 pad
->dim
[0].stride
= 1;
88 if (order
&& order
->dim
[0].stride
== 0)
89 order
->dim
[0].stride
= 1;
91 rdim
= GFC_DESCRIPTOR_RANK (ret
);
93 for (n
= 0; n
< rdim
; n
++)
96 dim
= order
->data
[n
* order
->dim
[0].stride
] - 1;
101 rstride
[n
] = ret
->dim
[dim
].stride
;
102 rextent
[n
] = ret
->dim
[dim
].ubound
+ 1 - ret
->dim
[dim
].lbound
;
104 if (rextent
[n
] != shape
->data
[dim
* shape
->dim
[0].stride
])
105 runtime_error ("shape and target do not conform");
107 if (rsize
== rstride
[n
])
111 if (rextent
[dim
] <= 0)
115 sdim
= GFC_DESCRIPTOR_RANK (source
);
117 for (n
= 0; n
< sdim
; n
++)
120 sstride
[n
] = source
->dim
[n
].stride
;
121 sextent
[n
] = source
->dim
[n
].ubound
+ 1 - source
->dim
[n
].lbound
;
125 if (rsize
== sstride
[n
])
133 if (pad
->dim
[0].stride
== 0)
134 pad
->dim
[0].stride
= 1;
135 pdim
= GFC_DESCRIPTOR_RANK (pad
);
137 for (n
= 0; n
< pdim
; n
++)
140 pstride
[n
] = pad
->dim
[n
].stride
;
141 pextent
[n
] = pad
->dim
[n
].ubound
+ 1 - pad
->dim
[n
].lbound
;
144 if (psize
== pstride
[n
])
158 if (rsize
!= 0 && ssize
!= 0 && psize
!= 0)
163 reshape_packed (ret
->data
, rsize
, source
->data
, ssize
,
164 pad
? pad
->data
: NULL
, psize
);
168 src
= sptr
= source
->data
;
169 rstride0
= rstride
[0] * size
;
170 sstride0
= sstride
[0] * size
;
174 /* Select between the source and pad arrays. */
175 memcpy(rptr
, src
, size
);
176 /* Advance to the next element. */
181 /* Advance to the next destination element. */
183 while (rcount
[n
] == rextent
[n
])
185 /* When we get to the end of a dimension, reset it and increment
186 the next dimension. */
188 /* We could precalculate these products, but this is a less
189 frequently used path so proabably not worth it. */
190 rptr
-= rstride
[n
] * rextent
[n
] * size
;
194 /* Break out of the loop. */
201 rptr
+= rstride
[n
] * size
;
204 /* Advance to the next source element. */
206 while (scount
[n
] == sextent
[n
])
208 /* When we get to the end of a dimension, reset it and increment
209 the next dimension. */
211 /* We could precalculate these products, but this is a less
212 frequently used path so proabably not worth it. */
213 src
-= sstride
[n
] * sextent
[n
] * size
;
219 /* Switch to the pad array. */
222 for (dim
= 0; dim
< pdim
; dim
++)
224 scount
[dim
] = pcount
[dim
];
225 sextent
[dim
] = pextent
[dim
];
226 sstride
[dim
] = pstride
[dim
];
227 sstride0
= sstride
[0] * size
;
230 /* We now start again from the beginning of the pad array. */
237 sptr
+= sstride
[n
] * size
;