1 /* Generic 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"
28 /* TODO: make this work for large shifts when
29 sizeof(int) < sizeof (index_type). */
32 __cshift0 (const gfc_array_char * ret, const gfc_array_char * array,
35 /* r.* indicates the return array. */
36 index_type rstride[GFC_MAX_DIMENSIONS - 1];
41 /* s.* indicates the source array. */
42 index_type sstride[GFC_MAX_DIMENSIONS - 1];
48 index_type count[GFC_MAX_DIMENSIONS - 1];
49 index_type extent[GFC_MAX_DIMENSIONS - 1];
55 if (which < 1 || which > GFC_DESCRIPTOR_RANK (array))
56 runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
58 size = GFC_DESCRIPTOR_SIZE (ret);
64 size = GFC_DESCRIPTOR_SIZE (array);
67 /* Initialized for avoiding compiler warnings. */
72 for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
76 roffset = ret->dim[dim].stride * size;
79 soffset = array->dim[dim].stride * size;
82 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
87 extent[n] = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
88 rstride[n] = ret->dim[dim].stride * size;
89 sstride[n] = array->dim[dim].stride * size;
98 dim = GFC_DESCRIPTOR_RANK (array);
99 rstride0 = rstride[0];
100 sstride0 = sstride[0];
104 shift = (div (shift, len)).rem;
110 /* Do the shift for this dimension. */
111 src = &sptr[shift * soffset];
113 for (n = 0; n < len; n++)
115 memcpy (dest, src, size);
117 if (n == len - shift - 1)
123 /* Advance to the next section. */
128 while (count[n] == extent[n])
130 /* When we get to the end of a dimension, reset it and increment
131 the next dimension. */
133 /* We could precalculate these products, but this is a less
134 frequently used path so proabably not worth it. */
135 rptr -= rstride[n] * extent[n];
136 sptr -= sstride[n] * extent[n];
140 /* Break out of the loop. */
156 __cshift0_4 (const gfc_array_char * ret, const gfc_array_char * array,
157 const GFC_INTEGER_4 * pshift, const GFC_INTEGER_4 * pdim)
159 __cshift0 (ret, array, *pshift, pdim ? *pdim : 1);
164 __cshift0_8 (const gfc_array_char * ret, const gfc_array_char * array,
165 const GFC_INTEGER_8 * pshift, const GFC_INTEGER_8 * pdim)
167 __cshift0 (ret, array, *pshift, pdim ? *pdim : 1);