1 `/* Implementation of the EOSHIFT 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"'
29 static const char zeros[16] =
30 {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
33 `__eoshift3_'atype_kind (gfc_array_char * ret, gfc_array_char * array,
34 atype * h, const gfc_array_char * bound, atype_name * pwhich)
36 /* r.* indicates the return array. */
37 index_type rstride[GFC_MAX_DIMENSIONS - 1];
42 /* s.* indicates the source array. */
43 index_type sstride[GFC_MAX_DIMENSIONS - 1];
48 ` /* h.* indicates the shift array. */'
49 index_type hstride[GFC_MAX_DIMENSIONS - 1];
51 const atype_name *hptr;
52 /* b.* indicates the bound array. */
53 index_type bstride[GFC_MAX_DIMENSIONS - 1];
57 index_type count[GFC_MAX_DIMENSIONS - 1];
58 index_type extent[GFC_MAX_DIMENSIONS - 1];
72 size = GFC_DESCRIPTOR_SIZE (ret);
76 size = GFC_DESCRIPTOR_SIZE (array);
78 for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
82 roffset = ret->dim[dim].stride * size;
85 soffset = array->dim[dim].stride * size;
88 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
93 extent[n] = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
94 rstride[n] = ret->dim[dim].stride * size;
95 sstride[n] = array->dim[dim].stride * size;
97 hstride[n] = h->dim[n].stride;
99 bstride[n] = bound->dim[n].stride;
111 if (bound && bstride[0] == 0)
114 dim = GFC_DESCRIPTOR_RANK (array);
115 rstride0 = rstride[0];
116 sstride0 = sstride[0];
117 hstride0 = hstride[0];
118 bstride0 = bstride[0];
129 ` /* Do the shift for this dimension. */'
131 delta = (sh >= 0) ? sh: -sh;
134 src = &sptr[delta * soffset];
140 dest = &rptr[delta * roffset];
142 for (n = 0; n < len - delta; n++)
144 memcpy (dest, src, size);
154 memcpy (dest, bptr, size);
158 /* Advance to the next section. */
165 while (count[n] == extent[n])
167 /* When we get to the end of a dimension, reset it and increment
168 the next dimension. */
170 /* We could precalculate these products, but this is a less
171 frequently used path so proabably not worth it. */
172 rptr -= rstride[n] * extent[n];
173 sptr -= sstride[n] * extent[n];
174 hptr -= hstride[n] * extent[n];
175 bptr -= bstride[n] * extent[n];
179 /* Break out of the loop. */