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 (libgfor).
7 Libgfor is free software; you can redistribute it and/or
8 modify it under the terms of the GNU Lesser General Public
9 License as published by the Free Software Foundation; either
10 version 2.1 of the License, or (at your option) any later version.
12 Ligbfor 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 Lesser General Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with libgfor; see the file COPYING.LIB. If not,
19 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
26 #include "libgfortran.h"
28 extern void __unpack1 (const gfc_array_char *, const gfc_array_char *,
29 const gfc_array_l4 *, const gfc_array_char *);
30 export_proto_np(__unpack1);
33 __unpack1 (const gfc_array_char * ret, const gfc_array_char * vector,
34 const gfc_array_l4 * mask, const gfc_array_char * field)
36 /* r.* indicates the return array. */
37 index_type rstride[GFC_MAX_DIMENSIONS];
40 /* v.* indicates the vector array. */
43 /* f.* indicates the field array. */
44 index_type fstride[GFC_MAX_DIMENSIONS];
47 /* m.* indicates the mask array. */
48 index_type mstride[GFC_MAX_DIMENSIONS];
50 const GFC_LOGICAL_4 *mptr;
52 index_type count[GFC_MAX_DIMENSIONS];
53 index_type extent[GFC_MAX_DIMENSIONS];
59 size = GFC_DESCRIPTOR_SIZE (ret);
60 /* A field element size of 0 actually means this is a scalar. */
61 fsize = GFC_DESCRIPTOR_SIZE (field);
62 dim = GFC_DESCRIPTOR_RANK (ret);
63 for (n = 0; n < dim; n++)
66 extent[n] = ret->dim[n].ubound + 1 - ret->dim[n].lbound;
67 rstride[n] = ret->dim[n].stride * size;
68 fstride[n] = field->dim[n].stride * fsize;
69 mstride[n] = mask->dim[n].stride;
78 vstride0 = vector->dim[0].stride * size;
81 rstride0 = rstride[0];
82 fstride0 = fstride[0];
83 mstride0 = mstride[0];
89 /* Use the same loop for both logical types. */
90 if (GFC_DESCRIPTOR_SIZE (mask) != 4)
92 if (GFC_DESCRIPTOR_SIZE (mask) != 8)
93 runtime_error ("Funny sized logical array");
94 for (n = 0; n < dim; n++)
97 mptr = GFOR_POINTER_L8_TO_L4 (mptr);
105 memcpy (rptr, vptr, size);
111 memcpy (rptr, fptr, size);
113 /* Advance to the next element. */
119 while (count[n] == extent[n])
121 /* When we get to the end of a dimension, reset it and increment
122 the next dimension. */
124 /* We could precalculate these products, but this is a less
125 frequently used path so proabably not worth it. */
126 rptr -= rstride[n] * extent[n];
127 fptr -= fstride[n] * extent[n];
128 mptr -= mstride[n] * extent[n];
132 /* Break out of the loop. */
147 extern void __unpack0 (const gfc_array_char *, const gfc_array_char *,
148 const gfc_array_l4 *, char *);
149 export_proto_np(__unpack0);
152 __unpack0 (const gfc_array_char * ret, const gfc_array_char * vector,
153 const gfc_array_l4 * mask, char * field)
159 __unpack1 (ret, vector, mask, &tmp);