Daily bump.
[official-gcc.git] / libgfortran / intrinsics / eoshift2.c
blobb0973a7399b1a6ed9862816f819e517a18af7a29
1 /* Generic implementation of the EOSHIFT intrinsic
2 Copyright (C) 2002-2013 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 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 Ligbfortran 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"
27 #include <stdlib.h>
28 #include <assert.h>
29 #include <string.h>
31 /* TODO: make this work for large shifts when
32 sizeof(int) < sizeof (index_type). */
34 static void
35 eoshift2 (gfc_array_char *ret, const gfc_array_char *array,
36 int shift, const gfc_array_char *bound, int which,
37 const char *filler, index_type filler_len)
39 /* r.* indicates the return array. */
40 index_type rstride[GFC_MAX_DIMENSIONS];
41 index_type rstride0;
42 index_type roffset;
43 char * restrict rptr;
44 char *dest;
45 /* s.* indicates the source array. */
46 index_type sstride[GFC_MAX_DIMENSIONS];
47 index_type sstride0;
48 index_type soffset;
49 const char *sptr;
50 const char *src;
51 /* b.* indicates the bound array. */
52 index_type bstride[GFC_MAX_DIMENSIONS];
53 index_type bstride0;
54 const char *bptr;
56 index_type count[GFC_MAX_DIMENSIONS];
57 index_type extent[GFC_MAX_DIMENSIONS];
58 index_type dim;
59 index_type len;
60 index_type n;
61 index_type arraysize;
62 index_type size;
64 /* The compiler cannot figure out that these are set, initialize
65 them to avoid warnings. */
66 len = 0;
67 soffset = 0;
68 roffset = 0;
70 size = GFC_DESCRIPTOR_SIZE (array);
72 arraysize = size0 ((array_t *) array);
74 if (ret->base_addr == NULL)
76 int i;
78 ret->offset = 0;
79 ret->dtype = array->dtype;
81 /* xmalloc allocates a single byte for zero size. */
82 ret->base_addr = xmalloc (size * arraysize);
84 for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
86 index_type ub, str;
88 ub = GFC_DESCRIPTOR_EXTENT(array,i) - 1;
90 if (i == 0)
91 str = 1;
92 else
93 str = GFC_DESCRIPTOR_EXTENT(ret,i-1)
94 * GFC_DESCRIPTOR_STRIDE(ret,i-1);
96 GFC_DIMENSION_SET(ret->dim[i], 0, ub, str);
99 else if (unlikely (compile_options.bounds_check))
101 bounds_equal_extents ((array_t *) ret, (array_t *) array,
102 "return value", "EOSHIFT");
105 if (arraysize == 0)
106 return;
108 which = which - 1;
110 extent[0] = 1;
111 count[0] = 0;
112 sstride[0] = -1;
113 rstride[0] = -1;
114 bstride[0] = -1;
115 n = 0;
116 for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
118 if (dim == which)
120 roffset = GFC_DESCRIPTOR_STRIDE_BYTES(ret,dim);
121 if (roffset == 0)
122 roffset = size;
123 soffset = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
124 if (soffset == 0)
125 soffset = size;
126 len = GFC_DESCRIPTOR_EXTENT(array,dim);
128 else
130 count[n] = 0;
131 extent[n] = GFC_DESCRIPTOR_EXTENT(array,dim);
132 rstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(ret,dim);
133 sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
134 if (bound)
135 bstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(bound,n);
136 else
137 bstride[n] = 0;
138 n++;
141 if (sstride[0] == 0)
142 sstride[0] = size;
143 if (rstride[0] == 0)
144 rstride[0] = size;
145 if (bound && bstride[0] == 0)
146 bstride[0] = size;
148 dim = GFC_DESCRIPTOR_RANK (array);
149 rstride0 = rstride[0];
150 sstride0 = sstride[0];
151 bstride0 = bstride[0];
152 rptr = ret->base_addr;
153 sptr = array->base_addr;
155 if ((shift >= 0 ? shift : -shift ) > len)
157 shift = len;
158 len = 0;
160 else
162 if (shift > 0)
163 len = len - shift;
164 else
165 len = len + shift;
168 if (bound)
169 bptr = bound->base_addr;
170 else
171 bptr = NULL;
173 while (rptr)
175 /* Do the shift for this dimension. */
176 if (shift > 0)
178 src = &sptr[shift * soffset];
179 dest = rptr;
181 else
183 src = sptr;
184 dest = &rptr[-shift * roffset];
186 for (n = 0; n < len; n++)
188 memcpy (dest, src, size);
189 dest += roffset;
190 src += soffset;
192 if (shift >= 0)
194 n = shift;
196 else
198 dest = rptr;
199 n = -shift;
202 if (bptr)
203 while (n--)
205 memcpy (dest, bptr, size);
206 dest += roffset;
208 else
209 while (n--)
211 index_type i;
213 if (filler_len == 1)
214 memset (dest, filler[0], size);
215 else
216 for (i = 0; i < size ; i += filler_len)
217 memcpy (&dest[i], filler, filler_len);
219 dest += roffset;
222 /* Advance to the next section. */
223 rptr += rstride0;
224 sptr += sstride0;
225 bptr += bstride0;
226 count[0]++;
227 n = 0;
228 while (count[n] == extent[n])
230 /* When we get to the end of a dimension, reset it and increment
231 the next dimension. */
232 count[n] = 0;
233 /* We could precalculate these products, but this is a less
234 frequently used path so probably not worth it. */
235 rptr -= rstride[n] * extent[n];
236 sptr -= sstride[n] * extent[n];
237 bptr -= bstride[n] * extent[n];
238 n++;
239 if (n >= dim - 1)
241 /* Break out of the loop. */
242 rptr = NULL;
243 break;
245 else
247 count[n]++;
248 rptr += rstride[n];
249 sptr += sstride[n];
250 bptr += bstride[n];
257 #define DEFINE_EOSHIFT(N) \
258 extern void eoshift2_##N (gfc_array_char *, const gfc_array_char *, \
259 const GFC_INTEGER_##N *, const gfc_array_char *, \
260 const GFC_INTEGER_##N *); \
261 export_proto(eoshift2_##N); \
263 void \
264 eoshift2_##N (gfc_array_char *ret, const gfc_array_char *array, \
265 const GFC_INTEGER_##N *pshift, const gfc_array_char *pbound, \
266 const GFC_INTEGER_##N *pdim) \
268 eoshift2 (ret, array, *pshift, pbound, pdim ? *pdim : 1, \
269 "\0", 1); \
272 extern void eoshift2_##N##_char (gfc_array_char *, GFC_INTEGER_4, \
273 const gfc_array_char *, \
274 const GFC_INTEGER_##N *, \
275 const gfc_array_char *, \
276 const GFC_INTEGER_##N *, \
277 GFC_INTEGER_4, GFC_INTEGER_4); \
278 export_proto(eoshift2_##N##_char); \
280 void \
281 eoshift2_##N##_char (gfc_array_char *ret, \
282 GFC_INTEGER_4 ret_length __attribute__((unused)), \
283 const gfc_array_char *array, \
284 const GFC_INTEGER_##N *pshift, \
285 const gfc_array_char *pbound, \
286 const GFC_INTEGER_##N *pdim, \
287 GFC_INTEGER_4 array_length __attribute__((unused)), \
288 GFC_INTEGER_4 bound_length __attribute__((unused))) \
290 eoshift2 (ret, array, *pshift, pbound, pdim ? *pdim : 1, \
291 " ", 1); \
294 extern void eoshift2_##N##_char4 (gfc_array_char *, GFC_INTEGER_4, \
295 const gfc_array_char *, \
296 const GFC_INTEGER_##N *, \
297 const gfc_array_char *, \
298 const GFC_INTEGER_##N *, \
299 GFC_INTEGER_4, GFC_INTEGER_4); \
300 export_proto(eoshift2_##N##_char4); \
302 void \
303 eoshift2_##N##_char4 (gfc_array_char *ret, \
304 GFC_INTEGER_4 ret_length __attribute__((unused)), \
305 const gfc_array_char *array, \
306 const GFC_INTEGER_##N *pshift, \
307 const gfc_array_char *pbound, \
308 const GFC_INTEGER_##N *pdim, \
309 GFC_INTEGER_4 array_length __attribute__((unused)), \
310 GFC_INTEGER_4 bound_length __attribute__((unused))) \
312 static const gfc_char4_t space = (unsigned char) ' '; \
313 eoshift2 (ret, array, *pshift, pbound, pdim ? *pdim : 1, \
314 (const char *) &space, \
315 sizeof (gfc_char4_t)); \
318 DEFINE_EOSHIFT (1);
319 DEFINE_EOSHIFT (2);
320 DEFINE_EOSHIFT (4);
321 DEFINE_EOSHIFT (8);
322 #ifdef HAVE_GFC_INTEGER_16
323 DEFINE_EOSHIFT (16);
324 #endif