spread_r10.c 6.67 KB
Newer Older
1
/* Special implementation of the SPREAD intrinsic
2
   Copyright (C) 2008-2018 Free Software Foundation, Inc.
3 4 5
   Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>, based on
   spread_generic.c written by Paul Brook <paul@nowt.org>

6
This file is part of the GNU Fortran runtime library (libgfortran).
7 8 9 10

Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License as published by the Free Software Foundation; either
11
version 3 of the License, or (at your option) any later version.
12 13 14 15 16 17

Ligbfortran is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

18 19 20 21 22 23 24 25
Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.

You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
<http://www.gnu.org/licenses/>.  */
26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43

#include "libgfortran.h"
#include <string.h>


#if defined (HAVE_GFC_REAL_10)

void
spread_r10 (gfc_array_r10 *ret, const gfc_array_r10 *source,
		 const index_type along, const index_type pncopies)
{
  /* r.* indicates the return array.  */
  index_type rstride[GFC_MAX_DIMENSIONS];
  index_type rstride0;
  index_type rdelta = 0;
  index_type rrank;
  index_type rs;
  GFC_REAL_10 *rptr;
44
  GFC_REAL_10 * restrict dest;
45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
  /* s.* indicates the source array.  */
  index_type sstride[GFC_MAX_DIMENSIONS];
  index_type sstride0;
  index_type srank;
  const GFC_REAL_10 *sptr;

  index_type count[GFC_MAX_DIMENSIONS];
  index_type extent[GFC_MAX_DIMENSIONS];
  index_type n;
  index_type dim;
  index_type ncopies;

  srank = GFC_DESCRIPTOR_RANK(source);

  rrank = srank + 1;
  if (rrank > GFC_MAX_DIMENSIONS)
    runtime_error ("return rank too large in spread()");

  if (along > rrank)
      runtime_error ("dim outside of rank in spread()");

  ncopies = pncopies;

68
  if (ret->base_addr == NULL)
69
    {
70 71 72

      size_t ub, stride;

73 74
      /* The front end has signalled that we need to populate the
	 return array descriptor.  */
75 76
      ret->dtype.rank = rrank;

77 78 79 80
      dim = 0;
      rs = 1;
      for (n = 0; n < rrank; n++)
	{
81
	  stride = rs;
82 83
	  if (n == along - 1)
	    {
84
	      ub = ncopies - 1;
85 86 87 88 89 90
	      rdelta = rs;
	      rs *= ncopies;
	    }
	  else
	    {
	      count[dim] = 0;
91 92
	      extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
	      sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
93 94
	      rstride[dim] = rs;

95
	      ub = extent[dim] - 1;
96 97 98
	      rs *= extent[dim];
	      dim++;
	    }
99
	  GFC_DIMENSION_SET(ret->dim[n], 0, ub, stride);
100 101
	}
      ret->offset = 0;
102

103 104
      /* xmallocarray allocates a single byte for zero size.  */
      ret->base_addr = xmallocarray (rs, sizeof(GFC_REAL_10));
105 106
      if (rs <= 0)
        return;
107 108 109 110 111 112 113 114 115 116 117
    }
  else
    {
      int zero_sized;

      zero_sized = 0;

      dim = 0;
      if (GFC_DESCRIPTOR_RANK(ret) != rrank)
	runtime_error ("rank mismatch in spread()");

118
      if (unlikely (compile_options.bounds_check))
119 120 121 122 123
	{
	  for (n = 0; n < rrank; n++)
	    {
	      index_type ret_extent;

124
	      ret_extent = GFC_DESCRIPTOR_EXTENT(ret,n);
125 126
	      if (n == along - 1)
		{
127
		  rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
128 129 130 131 132 133 134 135 136 137

		  if (ret_extent != ncopies)
		    runtime_error("Incorrect extent in return value of SPREAD"
				  " intrinsic in dimension %ld: is %ld,"
				  " should be %ld", (long int) n+1,
				  (long int) ret_extent, (long int) ncopies);
		}
	      else
		{
		  count[dim] = 0;
138
		  extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
139 140 141 142 143 144 145 146 147
		  if (ret_extent != extent[dim])
		    runtime_error("Incorrect extent in return value of SPREAD"
				  " intrinsic in dimension %ld: is %ld,"
				  " should be %ld", (long int) n+1,
				  (long int) ret_extent,
				  (long int) extent[dim]);
		    
		  if (extent[dim] <= 0)
		    zero_sized = 1;
148 149
		  sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
		  rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
150 151 152 153 154 155 156 157 158 159
		  dim++;
		}
	    }
	}
      else
	{
	  for (n = 0; n < rrank; n++)
	    {
	      if (n == along - 1)
		{
160
		  rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
161 162 163 164
		}
	      else
		{
		  count[dim] = 0;
165
		  extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
166 167
		  if (extent[dim] <= 0)
		    zero_sized = 1;
168 169
		  sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
		  rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
170 171 172 173 174 175 176 177 178 179 180 181 182
		  dim++;
		}
	    }
	}

      if (zero_sized)
	return;

      if (sstride[0] == 0)
	sstride[0] = 1;
    }
  sstride0 = sstride[0];
  rstride0 = rstride[0];
183 184
  rptr = ret->base_addr;
  sptr = source->base_addr;
185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230

  while (sptr)
    {
      /* Spread this element.  */
      dest = rptr;
      for (n = 0; n < ncopies; n++)
        {
	  *dest = *sptr;
          dest += rdelta;
        }
      /* Advance to the next element.  */
      sptr += sstride0;
      rptr += rstride0;
      count[0]++;
      n = 0;
      while (count[n] == extent[n])
        {
          /* When we get to the end of a dimension, reset it and increment
             the next dimension.  */
          count[n] = 0;
          /* We could precalculate these products, but this is a less
             frequently used path so probably not worth it.  */
          sptr -= sstride[n] * extent[n];
          rptr -= rstride[n] * extent[n];
          n++;
          if (n >= srank)
            {
              /* Break out of the loop.  */
              sptr = NULL;
              break;
            }
          else
            {
              count[n]++;
              sptr += sstride[n];
              rptr += rstride[n];
            }
        }
    }
}

/* This version of spread_internal treats the special case of a scalar
   source.  This is much simpler than the more general case above.  */

void
spread_scalar_r10 (gfc_array_r10 *ret, const GFC_REAL_10 *source,
231
			const index_type along, const index_type ncopies)
232
{
233
  GFC_REAL_10 * restrict dest;
234 235 236 237 238 239 240 241
  index_type stride;

  if (GFC_DESCRIPTOR_RANK (ret) != 1)
    runtime_error ("incorrect destination rank in spread()");

  if (along > 1)
    runtime_error ("dim outside of rank in spread()");

242
  if (ret->base_addr == NULL)
243
    {
244
      ret->base_addr = xmallocarray (ncopies, sizeof (GFC_REAL_10));
245
      ret->offset = 0;
246
      GFC_DIMENSION_SET(ret->dim[0], 0, ncopies - 1, 1);
247 248 249
    }
  else
    {
250 251
      if (ncopies - 1 > (GFC_DESCRIPTOR_EXTENT(ret,0) - 1)
			   / GFC_DESCRIPTOR_STRIDE(ret,0))
252 253 254
	runtime_error ("dim too large in spread()");
    }

255
  dest = ret->base_addr;
256
  stride = GFC_DESCRIPTOR_STRIDE(ret,0);
257

258
  for (index_type n = 0; n < ncopies; n++)
259 260 261 262 263 264 265
    {
      *dest = *source;
      dest += stride;
    }
}

#endif
266