libgfortran/generated/cshift1_4.c

   1 /* Implementation of the CSHIFT intrinsic
   2    Copyright 2003 Free Software Foundation, Inc.
   3    Contributed by Feng Wang <wf_cs@yahoo.com>
   4
   5 This file is part of the GNU Fortran 95 runtime library (libgfortran).
   6
   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 2 of the License, or (at your option) any later version.
  11
  12 In addition to the permissions in the GNU General Public License, the
  13 Free Software Foundation gives you unlimited permission to link the
  14 compiled version of this file into combinations with other programs,
  15 and to distribute those combinations without any restriction coming
  16 from the use of this file.  (The General Public License restrictions
  17 do apply in other respects; for example, they cover modification of
  18 the file, and distribution when not linked into a combine
  19 executable.)
  20
  21 Ligbfortran is distributed in the hope that it will be useful,
  22 but WITHOUT ANY WARRANTY; without even the implied warranty of
  23 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  24 GNU General Public License for more details.
  25
  26 You should have received a copy of the GNU General Public
  27 License along with libgfortran; see the file COPYING.  If not,
  28 write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  29 Boston, MA 02110-1301, USA.  */
  30
  31 #include "config.h"
  32 #include <stdlib.h>
  33 #include <assert.h>
  34 #include <string.h>
  35 #include "libgfortran.h"
  36
  37 #if defined (HAVE_GFC_INTEGER_4)
  38
  39 static void
  40 cshift1 (gfc_array_char * ret, const gfc_array_char * array,
  41          const gfc_array_i4 * h, const GFC_INTEGER_4 * pwhich, index_type size)
  42 {
  43   /* r.* indicates the return array.  */
  44   index_type rstride[GFC_MAX_DIMENSIONS];
  45   index_type rstride0;
  46   index_type roffset;
  47   char *rptr;
  48   char *dest;
  49   /* s.* indicates the source array.  */
  50   index_type sstride[GFC_MAX_DIMENSIONS];
  51   index_type sstride0;
  52   index_type soffset;
  53   const char *sptr;
  54   const char *src;
  55   /* h.* indicates the  array.  */
  56   index_type hstride[GFC_MAX_DIMENSIONS];
  57   index_type hstride0;
  58   const GFC_INTEGER_4 *hptr;
  59
  60   index_type count[GFC_MAX_DIMENSIONS];
  61   index_type extent[GFC_MAX_DIMENSIONS];
  62   index_type dim;
  63   index_type len;
  64   index_type n;
  65   int which;
  66   GFC_INTEGER_4 sh;
  67
  68   if (pwhich)
  69     which = *pwhich - 1;
  70   else
  71     which = 0;
  72
  73   if (which < 0 || (which + 1) > GFC_DESCRIPTOR_RANK (array))
  74     runtime_error ("Argument 'DIM' is out of range in call to 'CSHIFT'");
  75
  76   if (ret->data == NULL)
  77     {
  78       int i;
  79
  80       ret->data = internal_malloc_size (size * size0 ((array_t *)array));
  81       ret->offset = 0;
  82       ret->dtype = array->dtype;
  83       for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
  84         {
  85           ret->dim[i].lbound = 0;
  86           ret->dim[i].ubound = array->dim[i].ubound - array->dim[i].lbound;
  87
  88           if (i == 0)
  89             ret->dim[i].stride = 1;
  90           else
  91             ret->dim[i].stride = (ret->dim[i-1].ubound + 1) * ret->dim[i-1].stride;
  92         }
  93     }
  94
  95   extent[0] = 1;
  96   count[0] = 0;
  97   n = 0;
  98
  99   /* Initialized for avoiding compiler warnings.  */
 100   roffset = size;
 101   soffset = size;
 102   len = 0;
 103
 104   for (dim = 0; dim < GFC_DESCRIPTOR_RANK (array); dim++)
 105     {
 106       if (dim == which)
 107         {
 108           roffset = ret->dim[dim].stride * size;
 109           if (roffset == 0)
 110             roffset = size;
 111           soffset = array->dim[dim].stride * size;
 112           if (soffset == 0)
 113             soffset = size;
 114           len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
 115         }
 116       else
 117         {
 118           count[n] = 0;
 119           extent[n] = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
 120           rstride[n] = ret->dim[dim].stride * size;
 121           sstride[n] = array->dim[dim].stride * size;
 122
 123           hstride[n] = h->dim[n].stride;
 124           n++;
 125         }
 126     }
 127   if (sstride[0] == 0)
 128     sstride[0] = size;
 129   if (rstride[0] == 0)
 130     rstride[0] = size;
 131   if (hstride[0] == 0)
 132     hstride[0] = 1;
 133
 134   dim = GFC_DESCRIPTOR_RANK (array);
 135   rstride0 = rstride[0];
 136   sstride0 = sstride[0];
 137   hstride0 = hstride[0];
 138   rptr = ret->data;
 139   sptr = array->data;
 140   hptr = h->data;
 141
 142   while (rptr)
 143     {
 144       /* Do the  for this dimension.  */
 145       sh = *hptr;
 146       sh = (div (sh, len)).rem;
 147       if (sh < 0)
 148         sh += len;
 149
 150       src = &sptr[sh * soffset];
 151       dest = rptr;
 152
 153       for (n = 0; n < len; n++)
 154         {
 155           memcpy (dest, src, size);
 156           dest += roffset;
 157           if (n == len - sh - 1)
 158             src = sptr;
 159           else
 160             src += soffset;
 161         }
 162
 163       /* Advance to the next section.  */
 164       rptr += rstride0;
 165       sptr += sstride0;
 166       hptr += hstride0;
 167       count[0]++;
 168       n = 0;
 169       while (count[n] == extent[n])
 170         {
 171           /* When we get to the end of a dimension, reset it and increment
 172              the next dimension.  */
 173           count[n] = 0;
 174           /* We could precalculate these products, but this is a less
 175              frequently used path so proabably not worth it.  */
 176           rptr -= rstride[n] * extent[n];
 177           sptr -= sstride[n] * extent[n];
 178           hptr -= hstride[n] * extent[n];
 179           n++;
 180           if (n >= dim - 1)
 181             {
 182               /* Break out of the loop.  */
 183               rptr = NULL;
 184               break;
 185             }
 186           else
 187             {
 188               count[n]++;
 189               rptr += rstride[n];
 190               sptr += sstride[n];
 191               hptr += hstride[n];
 192             }
 193         }
 194     }
 195 }
 196
 197 void cshift1_4 (gfc_array_char *, const gfc_array_char *,
 198                            const gfc_array_i4 *, const GFC_INTEGER_4 *);
 199 export_proto(cshift1_4);
 200
 201 void
 202 cshift1_4 (gfc_array_char * ret,
 203                       const gfc_array_char * array,
 204                       const gfc_array_i4 * h, const GFC_INTEGER_4 * pwhich)
 205 {
 206   cshift1 (ret, array, h, pwhich, GFC_DESCRIPTOR_SIZE (array));
 207 }
 208
 209 void cshift1_4_char (gfc_array_char * ret, GFC_INTEGER_4,
 210                                   const gfc_array_char * array,
 211                                   const gfc_array_i4 * h, const GFC_INTEGER_4 * pwhich,
 212                                   GFC_INTEGER_4);
 213 export_proto(cshift1_4_char);
 214
 215 void
 216 cshift1_4_char (gfc_array_char * ret,
 217                              GFC_INTEGER_4 ret_length __attribute__((unused)),
 218                              const gfc_array_char * array,
 219                              const gfc_array_i4 * h, const GFC_INTEGER_4 * pwhich,
 220                              GFC_INTEGER_4 array_length)
 221 {
 222   cshift1 (ret, array, h, pwhich, array_length);
 223 }
 224
 225 #endif