1 /* Generic helper function for repacking arrays.
2 Copyright 2003, 2004, 2005, 2007, 2009 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 3 of the License, or (at your option) any later version.
12 Libgfortran 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 General Public License for more details.
17 Under Section 7 of GPL version 3, you are granted additional
18 permissions described in the GCC Runtime Library Exception, version
19 3.1, as published by the Free Software Foundation.
21 You should have received a copy of the GNU General Public License and
22 a copy of the GCC Runtime Library Exception along with this program;
23 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 <http://www.gnu.org/licenses/>. */
26 #include "libgfortran.h"
31 extern void internal_unpack (gfc_array_char *, const void *);
32 export_proto(internal_unpack);
35 internal_unpack (gfc_array_char * d, const void * s)
37 index_type count[GFC_MAX_DIMENSIONS];
38 index_type extent[GFC_MAX_DIMENSIONS];
39 index_type stride[GFC_MAX_DIMENSIONS];
50 /* This check may be redundant, but do it anyway. */
54 type_size = GFC_DTYPE_TYPE_SIZE (d);
57 case GFC_DTYPE_INTEGER_1:
58 case GFC_DTYPE_LOGICAL_1:
59 case GFC_DTYPE_DERIVED_1:
60 internal_unpack_1 ((gfc_array_i1 *) d, (const GFC_INTEGER_1 *) s);
63 case GFC_DTYPE_INTEGER_2:
64 case GFC_DTYPE_LOGICAL_2:
65 internal_unpack_2 ((gfc_array_i2 *) d, (const GFC_INTEGER_2 *) s);
68 case GFC_DTYPE_INTEGER_4:
69 case GFC_DTYPE_LOGICAL_4:
70 internal_unpack_4 ((gfc_array_i4 *) d, (const GFC_INTEGER_4 *) s);
73 case GFC_DTYPE_INTEGER_8:
74 case GFC_DTYPE_LOGICAL_8:
75 internal_unpack_8 ((gfc_array_i8 *) d, (const GFC_INTEGER_8 *) s);
78 #if defined (HAVE_GFC_INTEGER_16)
79 case GFC_DTYPE_INTEGER_16:
80 case GFC_DTYPE_LOGICAL_16:
81 internal_unpack_16 ((gfc_array_i16 *) d, (const GFC_INTEGER_16 *) s);
84 case GFC_DTYPE_REAL_4:
85 internal_unpack_r4 ((gfc_array_r4 *) d, (const GFC_REAL_4 *) s);
88 case GFC_DTYPE_REAL_8:
89 internal_unpack_r8 ((gfc_array_r8 *) d, (const GFC_REAL_8 *) s);
92 #if defined(HAVE_GFC_REAL_10)
93 case GFC_DTYPE_REAL_10:
94 internal_unpack_r10 ((gfc_array_r10 *) d, (const GFC_REAL_10 *) s);
98 #if defined(HAVE_GFC_REAL_16)
99 case GFC_DTYPE_REAL_16:
100 internal_unpack_r16 ((gfc_array_r16 *) d, (const GFC_REAL_16 *) s);
103 case GFC_DTYPE_COMPLEX_4:
104 internal_unpack_c4 ((gfc_array_c4 *)d, (const GFC_COMPLEX_4 *)s);
107 case GFC_DTYPE_COMPLEX_8:
108 internal_unpack_c8 ((gfc_array_c8 *)d, (const GFC_COMPLEX_8 *)s);
111 #if defined(HAVE_GFC_COMPLEX_10)
112 case GFC_DTYPE_COMPLEX_10:
113 internal_unpack_c10 ((gfc_array_c10 *) d, (const GFC_COMPLEX_10 *) s);
117 #if defined(HAVE_GFC_COMPLEX_16)
118 case GFC_DTYPE_COMPLEX_16:
119 internal_unpack_c16 ((gfc_array_c16 *) d, (const GFC_COMPLEX_16 *) s);
122 case GFC_DTYPE_DERIVED_2:
123 if (GFC_UNALIGNED_2(d->data) || GFC_UNALIGNED_2(s))
127 internal_unpack_2 ((gfc_array_i2 *) d, (const GFC_INTEGER_2 *) s);
130 case GFC_DTYPE_DERIVED_4:
131 if (GFC_UNALIGNED_4(d->data) || GFC_UNALIGNED_4(s))
135 internal_unpack_4 ((gfc_array_i4 *) d, (const GFC_INTEGER_4 *) s);
139 case GFC_DTYPE_DERIVED_8:
140 if (GFC_UNALIGNED_8(d->data) || GFC_UNALIGNED_8(s))
144 internal_unpack_8 ((gfc_array_i8 *) d, (const GFC_INTEGER_8 *) s);
148 #ifdef HAVE_GFC_INTEGER_16
149 case GFC_DTYPE_DERIVED_16:
150 if (GFC_UNALIGNED_16(d->data) || GFC_UNALIGNED_16(s))
154 internal_unpack_16 ((gfc_array_i16 *) d, (const GFC_INTEGER_16 *) s);
163 size = GFC_DESCRIPTOR_SIZE (d);
165 dim = GFC_DESCRIPTOR_RANK (d);
167 for (n = 0; n < dim; n++)
170 stride[n] = GFC_DESCRIPTOR_STRIDE(d,n);
171 extent[n] = GFC_DESCRIPTOR_EXTENT(d,n);
175 if (dsize == stride[n])
185 memcpy (dest, src, dsize * size);
189 stride0 = stride[0] * size;
194 memcpy (dest, src, size);
195 /* Advance to the next element. */
199 /* Advance to the next source element. */
201 while (count[n] == extent[n])
203 /* When we get to the end of a dimension, reset it and increment
204 the next dimension. */
206 /* We could precalculate these products, but this is a less
207 frequently used path so probably not worth it. */
208 dest -= stride[n] * extent[n] * size;
218 dest += stride[n] * size;