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 static const char zeros
[16] =
29 {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
31 /* TODO: make this work for large shifts when
32 sizeof(int) < sizeof (index_type). */
35 __eoshift2 (const gfc_array_char
* ret
, const gfc_array_char
* array
,
36 int shift
, const gfc_array_char
* bound
, int which
)
38 /* r.* indicates the return array. */
39 index_type rstride
[GFC_MAX_DIMENSIONS
- 1];
44 /* s.* indicates the source array. */
45 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
50 /* b.* indicates the bound array. */
51 index_type bstride
[GFC_MAX_DIMENSIONS
- 1];
55 index_type count
[GFC_MAX_DIMENSIONS
- 1];
56 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
62 size
= GFC_DESCRIPTOR_SIZE (ret
);
68 size
= GFC_DESCRIPTOR_SIZE (array
);
70 for (dim
= 0; dim
< GFC_DESCRIPTOR_RANK (array
); dim
++)
74 roffset
= ret
->dim
[dim
].stride
* size
;
77 soffset
= array
->dim
[dim
].stride
* size
;
80 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
85 extent
[n
] = array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
86 rstride
[n
] = ret
->dim
[dim
].stride
* size
;
87 sstride
[n
] = array
->dim
[dim
].stride
* size
;
89 bstride
[n
] = bound
->dim
[n
].stride
* size
;
99 if (bound
&& bstride
[0] == 0)
102 dim
= GFC_DESCRIPTOR_RANK (array
);
103 rstride0
= rstride
[0];
104 sstride0
= sstride
[0];
105 bstride0
= bstride
[0];
120 /* Do the shift for this dimension. */
123 src
= &sptr
[shift
* soffset
];
129 dest
= &rptr
[-shift
* roffset
];
131 for (n
= 0; n
< len
; n
++)
133 memcpy (dest
, src
, size
);
149 memcpy (dest
, bptr
, size
);
153 /* Advance to the next section. */
159 while (count
[n
] == extent
[n
])
161 /* When we get to the end of a dimension, reset it and increment
162 the next dimension. */
164 /* We could precalculate these products, but this is a less
165 frequently used path so proabably not worth it. */
166 rptr
-= rstride
[n
] * extent
[n
];
167 sptr
-= sstride
[n
] * extent
[n
];
168 bptr
-= bstride
[n
] * extent
[n
];
172 /* Break out of the loop. */
189 __eoshift2_4 (const gfc_array_char
* ret
, const gfc_array_char
* array
,
190 const GFC_INTEGER_4
* pshift
, const gfc_array_char
* bound
,
191 const GFC_INTEGER_4
* pdim
)
193 __eoshift2 (ret
, array
, *pshift
, bound
, pdim
? *pdim
: 1);
198 __eoshift2_8 (const gfc_array_char
* ret
, const gfc_array_char
* array
,
199 const GFC_INTEGER_8
* pshift
, const gfc_array_char
* bound
,
200 const GFC_INTEGER_8
* pdim
)
202 __eoshift2 (ret
, array
, *pshift
, bound
, pdim
? *pdim
: 1);