libgfortran/generated/spread_i16.c

   1 /* Special implementation of the SPREAD intrinsic
   2    Copyright 2008, 2009 Free Software Foundation, Inc.
   3    Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>, based on
   4    spread_generic.c written by Paul Brook <paul@nowt.org>
   5
   6 This file is part of the GNU Fortran 95 runtime library (libgfortran).
   7
   8 Libgfortran is free software; you can redistribute it and/or
   9 modify it under the terms of the GNU General Public
  10 License as published by the Free Software Foundation; either
  11 version 3 of the License, or (at your option) any later version.
  12
  13 Ligbfortran is distributed in the hope that it will be useful,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public License for more details.
  17
  18 Under Section 7 of GPL version 3, you are granted additional
  19 permissions described in the GCC Runtime Library Exception, version
  20 3.1, as published by the Free Software Foundation.
  21
  22 You should have received a copy of the GNU General Public License and
  23 a copy of the GCC Runtime Library Exception along with this program;
  24 see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
  25 <http://www.gnu.org/licenses/>.  */
  26
  27 #include "libgfortran.h"
  28 #include <stdlib.h>
  29 #include <assert.h>
  30 #include <string.h>
  31
  32
  33 #if defined (HAVE_GFC_INTEGER_16)
  34
  35 void
  36 spread_i16 (gfc_array_i16 *ret, const gfc_array_i16 *source,
  37                  const index_type along, const index_type pncopies)
  38 {
  39   /* r.* indicates the return array.  */
  40   index_type rstride[GFC_MAX_DIMENSIONS];
  41   index_type rstride0;
  42   index_type rdelta = 0;
  43   index_type rrank;
  44   index_type rs;
  45   GFC_INTEGER_16 *rptr;
  46   GFC_INTEGER_16 * restrict dest;
  47   /* s.* indicates the source array.  */
  48   index_type sstride[GFC_MAX_DIMENSIONS];
  49   index_type sstride0;
  50   index_type srank;
  51   const GFC_INTEGER_16 *sptr;
  52
  53   index_type count[GFC_MAX_DIMENSIONS];
  54   index_type extent[GFC_MAX_DIMENSIONS];
  55   index_type n;
  56   index_type dim;
  57   index_type ncopies;
  58
  59   srank = GFC_DESCRIPTOR_RANK(source);
  60
  61   rrank = srank + 1;
  62   if (rrank > GFC_MAX_DIMENSIONS)
  63     runtime_error ("return rank too large in spread()");
  64
  65   if (along > rrank)
  66       runtime_error ("dim outside of rank in spread()");
  67
  68   ncopies = pncopies;
  69
  70   if (ret->data == NULL)
  71     {
  72       /* The front end has signalled that we need to populate the
  73          return array descriptor.  */
  74       ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rrank;
  75       dim = 0;
  76       rs = 1;
  77       for (n = 0; n < rrank; n++)
  78         {
  79           ret->dim[n].stride = rs;
  80           ret->dim[n].lbound = 0;
  81           if (n == along - 1)
  82             {
  83               ret->dim[n].ubound = ncopies - 1;
  84               rdelta = rs;
  85               rs *= ncopies;
  86             }
  87           else
  88             {
  89               count[dim] = 0;
  90               extent[dim] = source->dim[dim].ubound + 1
  91                 - source->dim[dim].lbound;
  92               sstride[dim] = source->dim[dim].stride;
  93               rstride[dim] = rs;
  94
  95               ret->dim[n].ubound = extent[dim]-1;
  96               rs *= extent[dim];
  97               dim++;
  98             }
  99         }
 100       ret->offset = 0;
 101       if (rs > 0)
 102         ret->data = internal_malloc_size (rs * sizeof(GFC_INTEGER_16));
 103       else
 104         {
 105           ret->data = internal_malloc_size (1);
 106           return;
 107         }
 108     }
 109   else
 110     {
 111       int zero_sized;
 112
 113       zero_sized = 0;
 114
 115       dim = 0;
 116       if (GFC_DESCRIPTOR_RANK(ret) != rrank)
 117         runtime_error ("rank mismatch in spread()");
 118
 119       if (unlikely (compile_options.bounds_check))
 120         {
 121           for (n = 0; n < rrank; n++)
 122             {
 123               index_type ret_extent;
 124
 125               ret_extent = ret->dim[n].ubound + 1 - ret->dim[n].lbound;
 126               if (n == along - 1)
 127                 {
 128                   rdelta = ret->dim[n].stride;
 129
 130                   if (ret_extent != ncopies)
 131                     runtime_error("Incorrect extent in return value of SPREAD"
 132                                   " intrinsic in dimension %ld: is %ld,"
 133                                   " should be %ld", (long int) n+1,
 134                                   (long int) ret_extent, (long int) ncopies);
 135                 }
 136               else
 137                 {
 138                   count[dim] = 0;
 139                   extent[dim] = source->dim[dim].ubound + 1
 140                     - source->dim[dim].lbound;
 141                   if (ret_extent != extent[dim])
 142                     runtime_error("Incorrect extent in return value of SPREAD"
 143                                   " intrinsic in dimension %ld: is %ld,"
 144                                   " should be %ld", (long int) n+1,
 145                                   (long int) ret_extent,
 146                                   (long int) extent[dim]);
 147
 148                   if (extent[dim] <= 0)
 149                     zero_sized = 1;
 150                   sstride[dim] = source->dim[dim].stride;
 151                   rstride[dim] = ret->dim[n].stride;
 152                   dim++;
 153                 }
 154             }
 155         }
 156       else
 157         {
 158           for (n = 0; n < rrank; n++)
 159             {
 160               if (n == along - 1)
 161                 {
 162                   rdelta = ret->dim[n].stride;
 163                 }
 164               else
 165                 {
 166                   count[dim] = 0;
 167                   extent[dim] = source->dim[dim].ubound + 1
 168                     - source->dim[dim].lbound;
 169                   if (extent[dim] <= 0)
 170                     zero_sized = 1;
 171                   sstride[dim] = source->dim[dim].stride;
 172                   rstride[dim] = ret->dim[n].stride;
 173                   dim++;
 174                 }
 175             }
 176         }
 177
 178       if (zero_sized)
 179         return;
 180
 181       if (sstride[0] == 0)
 182         sstride[0] = 1;
 183     }
 184   sstride0 = sstride[0];
 185   rstride0 = rstride[0];
 186   rptr = ret->data;
 187   sptr = source->data;
 188
 189   while (sptr)
 190     {
 191       /* Spread this element.  */
 192       dest = rptr;
 193       for (n = 0; n < ncopies; n++)
 194         {
 195           *dest = *sptr;
 196           dest += rdelta;
 197         }
 198       /* Advance to the next element.  */
 199       sptr += sstride0;
 200       rptr += rstride0;
 201       count[0]++;
 202       n = 0;
 203       while (count[n] == extent[n])
 204         {
 205           /* When we get to the end of a dimension, reset it and increment
 206              the next dimension.  */
 207           count[n] = 0;
 208           /* We could precalculate these products, but this is a less
 209              frequently used path so probably not worth it.  */
 210           sptr -= sstride[n] * extent[n];
 211           rptr -= rstride[n] * extent[n];
 212           n++;
 213           if (n >= srank)
 214             {
 215               /* Break out of the loop.  */
 216               sptr = NULL;
 217               break;
 218             }
 219           else
 220             {
 221               count[n]++;
 222               sptr += sstride[n];
 223               rptr += rstride[n];
 224             }
 225         }
 226     }
 227 }
 228
 229 /* This version of spread_internal treats the special case of a scalar
 230    source.  This is much simpler than the more general case above.  */
 231
 232 void
 233 spread_scalar_i16 (gfc_array_i16 *ret, const GFC_INTEGER_16 *source,
 234                         const index_type along, const index_type pncopies)
 235 {
 236   int n;
 237   int ncopies = pncopies;
 238   GFC_INTEGER_16 * restrict dest;
 239   index_type stride;
 240
 241   if (GFC_DESCRIPTOR_RANK (ret) != 1)
 242     runtime_error ("incorrect destination rank in spread()");
 243
 244   if (along > 1)
 245     runtime_error ("dim outside of rank in spread()");
 246
 247   if (ret->data == NULL)
 248     {
 249       ret->data = internal_malloc_size (ncopies * sizeof (GFC_INTEGER_16));
 250       ret->offset = 0;
 251       ret->dim[0].stride = 1;
 252       ret->dim[0].lbound = 0;
 253       ret->dim[0].ubound = ncopies - 1;
 254     }
 255   else
 256     {
 257       if (ncopies - 1 > (ret->dim[0].ubound - ret->dim[0].lbound)
 258                            / ret->dim[0].stride)
 259         runtime_error ("dim too large in spread()");
 260     }
 261
 262   dest = ret->data;
 263   stride = ret->dim[0].stride;
 264
 265   for (n = 0; n < ncopies; n++)
 266     {
 267       *dest = *source;
 268       dest += stride;
 269     }
 270 }
 271
 272 #endif
 273