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"
28 void cshift1_8 (const gfc_array_char * ret,
29 const gfc_array_char * array,
30 const gfc_array_i8 * h, const GFC_INTEGER_8 * pwhich);
31 export_proto(cshift1_8);
34 cshift1_8 (const gfc_array_char * ret,
35 const gfc_array_char * array,
36 const gfc_array_i8 * h, const GFC_INTEGER_8 * pwhich)
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 /* h.* indicates the array. */
51 index_type hstride[GFC_MAX_DIMENSIONS - 1];
53 const GFC_INTEGER_8 *hptr;
55 index_type count[GFC_MAX_DIMENSIONS - 1];
56 index_type extent[GFC_MAX_DIMENSIONS - 1];
69 if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
70 runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
72 size = GFC_DESCRIPTOR_SIZE (ret);
76 size = GFC_DESCRIPTOR_SIZE (array);
79 /* Initialized for avoiding compiler warnings. */
84 for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
88 roffset = ret->dim[dim].stride * size;
91 soffset = array->dim[dim].stride * size;
94 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
99 extent[n] = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
100 rstride[n] = ret->dim[dim].stride * size;
101 sstride[n] = array->dim[dim].stride * size;
103 hstride[n] = h->dim[n].stride;
114 dim = GFC_DESCRIPTOR_RANK (array);
115 rstride0 = rstride[0];
116 sstride0 = sstride[0];
117 hstride0 = hstride[0];
124 /* Do the for this dimension. */
126 sh = (div (sh, len)).rem;
130 src = &sptr[sh * soffset];
133 for (n = 0; n < len; n++)
135 memcpy (dest, src, size);
137 if (n == len - sh - 1)
143 /* Advance to the next section. */
149 while (count[n] == extent[n])
151 /* When we get to the end of a dimension, reset it and increment
152 the next dimension. */
154 /* We could precalculate these products, but this is a less
155 frequently used path so proabably not worth it. */
156 rptr -= rstride[n] * extent[n];
157 sptr -= sstride[n] * extent[n];
158 hptr -= hstride[n] * extent[n];
162 /* Break out of the loop. */