libgfortran/generated/reshape_i16.c

   1 /* Implementation of the RESHAPE
   2    Copyright 2002, 2006 Free Software Foundation, Inc.
   3    Contributed by Paul Brook <paul@nowt.org>
   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 Libgfortran 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 "libgfortran.h"
  35
  36 #if defined (HAVE_GFC_INTEGER_16)
  37
  38 typedef GFC_ARRAY_DESCRIPTOR(1, index_type) shape_type;
  39
  40 /* The shape parameter is ignored. We can currently deduce the shape from the
  41    return array.  */
  42
  43 extern void reshape_16 (gfc_array_i16 * const restrict,
  44         gfc_array_i16 * const restrict,
  45         shape_type * const restrict,
  46         gfc_array_i16 * const restrict,
  47         shape_type * const restrict);
  48 export_proto(reshape_16);
  49
  50 void
  51 reshape_16 (gfc_array_i16 * const restrict ret,
  52         gfc_array_i16 * const restrict source,
  53         shape_type * const restrict shape,
  54         gfc_array_i16 * const restrict pad,
  55         shape_type * const restrict order)
  56 {
  57   /* r.* indicates the return array.  */
  58   index_type rcount[GFC_MAX_DIMENSIONS];
  59   index_type rextent[GFC_MAX_DIMENSIONS];
  60   index_type rstride[GFC_MAX_DIMENSIONS];
  61   index_type rstride0;
  62   index_type rdim;
  63   index_type rsize;
  64   index_type rs;
  65   index_type rex;
  66   GFC_INTEGER_16 *rptr;
  67   /* s.* indicates the source array.  */
  68   index_type scount[GFC_MAX_DIMENSIONS];
  69   index_type sextent[GFC_MAX_DIMENSIONS];
  70   index_type sstride[GFC_MAX_DIMENSIONS];
  71   index_type sstride0;
  72   index_type sdim;
  73   index_type ssize;
  74   const GFC_INTEGER_16 *sptr;
  75   /* p.* indicates the pad array.  */
  76   index_type pcount[GFC_MAX_DIMENSIONS];
  77   index_type pextent[GFC_MAX_DIMENSIONS];
  78   index_type pstride[GFC_MAX_DIMENSIONS];
  79   index_type pdim;
  80   index_type psize;
  81   const GFC_INTEGER_16 *pptr;
  82
  83   const GFC_INTEGER_16 *src;
  84   int n;
  85   int dim;
  86
  87   if (ret->data == NULL)
  88     {
  89       rdim = shape->dim[0].ubound - shape->dim[0].lbound + 1;
  90       rs = 1;
  91       for (n=0; n < rdim; n++)
  92         {
  93           ret->dim[n].lbound = 0;
  94           rex = shape->data[n * shape->dim[0].stride];
  95           ret->dim[n].ubound =  rex - 1;
  96           ret->dim[n].stride = rs;
  97           rs *= rex;
  98         }
  99       ret->offset = 0;
 100       ret->data = internal_malloc_size ( rs * sizeof (GFC_INTEGER_16));
 101       ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
 102     }
 103   else
 104     {
 105       rdim = GFC_DESCRIPTOR_RANK (ret);
 106     }
 107
 108   rsize = 1;
 109   for (n = 0; n < rdim; n++)
 110     {
 111       if (order)
 112         dim = order->data[n * order->dim[0].stride] - 1;
 113       else
 114         dim = n;
 115
 116       rcount[n] = 0;
 117       rstride[n] = ret->dim[dim].stride;
 118       rextent[n] = ret->dim[dim].ubound + 1 - ret->dim[dim].lbound;
 119
 120       if (rextent[n] != shape->data[dim * shape->dim[0].stride])
 121         runtime_error ("shape and target do not conform");
 122
 123       if (rsize == rstride[n])
 124         rsize *= rextent[n];
 125       else
 126         rsize = 0;
 127       if (rextent[n] <= 0)
 128         return;
 129     }
 130
 131   sdim = GFC_DESCRIPTOR_RANK (source);
 132   ssize = 1;
 133   for (n = 0; n < sdim; n++)
 134     {
 135       scount[n] = 0;
 136       sstride[n] = source->dim[n].stride;
 137       sextent[n] = source->dim[n].ubound + 1 - source->dim[n].lbound;
 138       if (sextent[n] <= 0)
 139         abort ();
 140
 141       if (ssize == sstride[n])
 142         ssize *= sextent[n];
 143       else
 144         ssize = 0;
 145     }
 146
 147   if (pad)
 148     {
 149       pdim = GFC_DESCRIPTOR_RANK (pad);
 150       psize = 1;
 151       for (n = 0; n < pdim; n++)
 152         {
 153           pcount[n] = 0;
 154           pstride[n] = pad->dim[n].stride;
 155           pextent[n] = pad->dim[n].ubound + 1 - pad->dim[n].lbound;
 156           if (pextent[n] <= 0)
 157             abort ();
 158           if (psize == pstride[n])
 159             psize *= pextent[n];
 160           else
 161             psize = 0;
 162         }
 163       pptr = pad->data;
 164     }
 165   else
 166     {
 167       pdim = 0;
 168       psize = 1;
 169       pptr = NULL;
 170     }
 171
 172   if (rsize != 0 && ssize != 0 && psize != 0)
 173     {
 174       rsize *= sizeof (GFC_INTEGER_16);
 175       ssize *= sizeof (GFC_INTEGER_16);
 176       psize *= sizeof (GFC_INTEGER_16);
 177       reshape_packed ((char *)ret->data, rsize, (char *)source->data,
 178                       ssize, pad ? (char *)pad->data : NULL, psize);
 179       return;
 180     }
 181   rptr = ret->data;
 182   src = sptr = source->data;
 183   rstride0 = rstride[0];
 184   sstride0 = sstride[0];
 185
 186   while (rptr)
 187     {
 188       /* Select between the source and pad arrays.  */
 189       *rptr = *src;
 190       /* Advance to the next element.  */
 191       rptr += rstride0;
 192       src += sstride0;
 193       rcount[0]++;
 194       scount[0]++;
 195       /* Advance to the next destination element.  */
 196       n = 0;
 197       while (rcount[n] == rextent[n])
 198         {
 199           /* When we get to the end of a dimension, reset it and increment
 200              the next dimension.  */
 201           rcount[n] = 0;
 202           /* We could precalculate these products, but this is a less
 203              frequently used path so proabably not worth it.  */
 204           rptr -= rstride[n] * rextent[n];
 205           n++;
 206           if (n == rdim)
 207             {
 208               /* Break out of the loop.  */
 209               rptr = NULL;
 210               break;
 211             }
 212           else
 213             {
 214               rcount[n]++;
 215               rptr += rstride[n];
 216             }
 217         }
 218       /* Advance to the next source element.  */
 219       n = 0;
 220       while (scount[n] == sextent[n])
 221         {
 222           /* When we get to the end of a dimension, reset it and increment
 223              the next dimension.  */
 224           scount[n] = 0;
 225           /* We could precalculate these products, but this is a less
 226              frequently used path so proabably not worth it.  */
 227           src -= sstride[n] * sextent[n];
 228           n++;
 229           if (n == sdim)
 230             {
 231               if (sptr && pad)
 232                 {
 233                   /* Switch to the pad array.  */
 234                   sptr = NULL;
 235                   sdim = pdim;
 236                   for (dim = 0; dim < pdim; dim++)
 237                     {
 238                       scount[dim] = pcount[dim];
 239                       sextent[dim] = pextent[dim];
 240                       sstride[dim] = pstride[dim];
 241                       sstride0 = sstride[0];
 242                     }
 243                 }
 244               /* We now start again from the beginning of the pad array.  */
 245               src = pptr;
 246               break;
 247             }
 248           else
 249             {
 250               scount[n]++;
 251               src += sstride[n];
 252             }
 253         }
 254     }
 255 }
 256
 257 #endif