libgfortran/generated/spread_i1.c

   1 /* Special implementation of the SPREAD intrinsic
   2    Copyright (C) 2008-2016 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 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_1)
  34
  35 void
  36 spread_i1 (gfc_array_i1 *ret, const gfc_array_i1 *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_1 *rptr;
  46   GFC_INTEGER_1 * 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_1 *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->base_addr == NULL)
  71     {
  72
  73       size_t ub, stride;
  74
  75       /* The front end has signalled that we need to populate the
  76          return array descriptor.  */
  77       ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rrank;
  78       dim = 0;
  79       rs = 1;
  80       for (n = 0; n < rrank; n++)
  81         {
  82           stride = rs;
  83           if (n == along - 1)
  84             {
  85               ub = ncopies - 1;
  86               rdelta = rs;
  87               rs *= ncopies;
  88             }
  89           else
  90             {
  91               count[dim] = 0;
  92               extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
  93               sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
  94               rstride[dim] = rs;
  95
  96               ub = extent[dim] - 1;
  97               rs *= extent[dim];
  98               dim++;
  99             }
 100           GFC_DIMENSION_SET(ret->dim[n], 0, ub, stride);
 101         }
 102       ret->offset = 0;
 103
 104       /* xmallocarray allocates a single byte for zero size.  */
 105       ret->base_addr = xmallocarray (rs, sizeof(GFC_INTEGER_1));
 106       if (rs <= 0)
 107         return;
 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 = GFC_DESCRIPTOR_EXTENT(ret,n);
 126               if (n == along - 1)
 127                 {
 128                   rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
 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] = GFC_DESCRIPTOR_EXTENT(source,dim);
 140                   if (ret_extent != extent[dim])
 141                     runtime_error("Incorrect extent in return value of SPREAD"
 142                                   " intrinsic in dimension %ld: is %ld,"
 143                                   " should be %ld", (long int) n+1,
 144                                   (long int) ret_extent,
 145                                   (long int) extent[dim]);
 146
 147                   if (extent[dim] <= 0)
 148                     zero_sized = 1;
 149                   sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
 150                   rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
 151                   dim++;
 152                 }
 153             }
 154         }
 155       else
 156         {
 157           for (n = 0; n < rrank; n++)
 158             {
 159               if (n == along - 1)
 160                 {
 161                   rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
 162                 }
 163               else
 164                 {
 165                   count[dim] = 0;
 166                   extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
 167                   if (extent[dim] <= 0)
 168                     zero_sized = 1;
 169                   sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
 170                   rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
 171                   dim++;
 172                 }
 173             }
 174         }
 175
 176       if (zero_sized)
 177         return;
 178
 179       if (sstride[0] == 0)
 180         sstride[0] = 1;
 181     }
 182   sstride0 = sstride[0];
 183   rstride0 = rstride[0];
 184   rptr = ret->base_addr;
 185   sptr = source->base_addr;
 186
 187   while (sptr)
 188     {
 189       /* Spread this element.  */
 190       dest = rptr;
 191       for (n = 0; n < ncopies; n++)
 192         {
 193           *dest = *sptr;
 194           dest += rdelta;
 195         }
 196       /* Advance to the next element.  */
 197       sptr += sstride0;
 198       rptr += rstride0;
 199       count[0]++;
 200       n = 0;
 201       while (count[n] == extent[n])
 202         {
 203           /* When we get to the end of a dimension, reset it and increment
 204              the next dimension.  */
 205           count[n] = 0;
 206           /* We could precalculate these products, but this is a less
 207              frequently used path so probably not worth it.  */
 208           sptr -= sstride[n] * extent[n];
 209           rptr -= rstride[n] * extent[n];
 210           n++;
 211           if (n >= srank)
 212             {
 213               /* Break out of the loop.  */
 214               sptr = NULL;
 215               break;
 216             }
 217           else
 218             {
 219               count[n]++;
 220               sptr += sstride[n];
 221               rptr += rstride[n];
 222             }
 223         }
 224     }
 225 }
 226
 227 /* This version of spread_internal treats the special case of a scalar
 228    source.  This is much simpler than the more general case above.  */
 229
 230 void
 231 spread_scalar_i1 (gfc_array_i1 *ret, const GFC_INTEGER_1 *source,
 232                         const index_type along, const index_type pncopies)
 233 {
 234   int n;
 235   int ncopies = pncopies;
 236   GFC_INTEGER_1 * restrict dest;
 237   index_type stride;
 238
 239   if (GFC_DESCRIPTOR_RANK (ret) != 1)
 240     runtime_error ("incorrect destination rank in spread()");
 241
 242   if (along > 1)
 243     runtime_error ("dim outside of rank in spread()");
 244
 245   if (ret->base_addr == NULL)
 246     {
 247       ret->base_addr = xmallocarray (ncopies, sizeof (GFC_INTEGER_1));
 248       ret->offset = 0;
 249       GFC_DIMENSION_SET(ret->dim[0], 0, ncopies - 1, 1);
 250     }
 251   else
 252     {
 253       if (ncopies - 1 > (GFC_DESCRIPTOR_EXTENT(ret,0) - 1)
 254                            / GFC_DESCRIPTOR_STRIDE(ret,0))
 255         runtime_error ("dim too large in spread()");
 256     }
 257
 258   dest = ret->base_addr;
 259   stride = GFC_DESCRIPTOR_STRIDE(ret,0);
 260
 261   for (n = 0; n < ncopies; n++)
 262     {
 263       *dest = *source;
 264       dest += stride;
 265     }
 266 }
 267
 268 #endif
 269