1 /* Implementation of the CSHIFT intrinsic
2 Copyright 2003 Free Software Foundation, Inc.
3 Contributed by Feng Wang <wf_cs@yahoo.com>
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 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 __cshift1_4 (const gfc_array_char * ret, const gfc_array_char * array,
30 const gfc_array_i4 * h, const GFC_INTEGER_4 * pwhich)
32 /* r.* indicates the return array. */
33 index_type rstride[GFC_MAX_DIMENSIONS - 1];
38 /* s.* indicates the source array. */
39 index_type sstride[GFC_MAX_DIMENSIONS - 1];
44 /* h.* indicates the shift array. */
45 index_type hstride[GFC_MAX_DIMENSIONS - 1];
47 const GFC_INTEGER_4 *hptr;
49 index_type count[GFC_MAX_DIMENSIONS - 1];
50 index_type extent[GFC_MAX_DIMENSIONS - 1];
63 if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
64 runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
66 size = GFC_DESCRIPTOR_SIZE (ret);
70 size = GFC_DESCRIPTOR_SIZE (array);
73 /* Initialized for avoiding compiler warnings. */
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;
108 dim = GFC_DESCRIPTOR_RANK (array);
109 rstride0 = rstride[0];
110 sstride0 = sstride[0];
111 hstride0 = hstride[0];
118 /* Do the shift for this dimension. */
120 sh = (div (sh, len)).rem;
124 src = &sptr[sh * soffset];
127 for (n = 0; n < len; n++)
129 memcpy (dest, src, size);
131 if (n == len - sh - 1)
137 /* Advance to the next section. */
143 while (count[n] == extent[n])
145 /* When we get to the end of a dimension, reset it and increment
146 the next dimension. */
148 /* We could precalculate these products, but this is a less
149 frequently used path so proabably not worth it. */
150 rptr -= rstride[n] * extent[n];
151 sptr -= sstride[n] * extent[n];
152 hptr -= hstride[n] * extent[n];
156 /* Break out of the loop. */