libgfortran/generated/reshape_c10.c

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