1 `/* Special implementation of the SPREAD intrinsic
2 Copyright 2008 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>
6 This file is part of the GNU Fortran 95 runtime library (libgfortran).
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 2 of the License, or (at your option) any later version.
13 In addition to the permissions in the GNU General Public License, the
14 Free Software Foundation gives you unlimited permission to link the
15 compiled version of this file into combinations with other programs,
16 and to distribute those combinations without any restriction coming
17 from the use of this file. (The General Public License restrictions
18 do apply in other respects; for example, they cover modification of
19 the file, and distribution when not linked into a combine
22 Ligbfortran is distributed in the hope that it will be useful,
23 but WITHOUT ANY WARRANTY; without even the implied warranty of
24 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
25 GNU General Public License for more details.
27 You should have received a copy of the GNU General Public
28 License along with libgfortran; see the file COPYING. If not,
29 write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
30 Boston, MA 02110-1301, USA. */
32 #include "libgfortran.h"
39 `#if defined (HAVE_'rtype_name`)
42 spread_'rtype_code` ('rtype` *ret, const 'rtype` *source,
43 const index_type along, const index_type pncopies)
45 /* r.* indicates the return array. */
46 index_type rstride[GFC_MAX_DIMENSIONS];
48 index_type rdelta = 0;
52 'rtype_name` * restrict dest;
53 /* s.* indicates the source array. */
54 index_type sstride[GFC_MAX_DIMENSIONS];
57 const 'rtype_name` *sptr;
59 index_type count[GFC_MAX_DIMENSIONS];
60 index_type extent[GFC_MAX_DIMENSIONS];
65 srank = GFC_DESCRIPTOR_RANK(source);
68 if (rrank > GFC_MAX_DIMENSIONS)
69 runtime_error ("return rank too large in spread()");
72 runtime_error ("dim outside of rank in spread()");
76 if (ret->data == NULL)
78 /* The front end has signalled that we need to populate the
79 return array descriptor. */
80 ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rrank;
83 for (n = 0; n < rrank; n++)
85 ret->dim[n].stride = rs;
86 ret->dim[n].lbound = 0;
89 ret->dim[n].ubound = ncopies - 1;
96 extent[dim] = source->dim[dim].ubound + 1
97 - source->dim[dim].lbound;
98 sstride[dim] = source->dim[dim].stride;
101 ret->dim[n].ubound = extent[dim]-1;
108 ret->data = internal_malloc_size (rs * sizeof('rtype_name`));
111 ret->data = internal_malloc_size (1);
122 if (GFC_DESCRIPTOR_RANK(ret) != rrank)
123 runtime_error ("rank mismatch in spread()");
125 if (unlikely (compile_options.bounds_check))
127 for (n = 0; n < rrank; n++)
129 index_type ret_extent;
131 ret_extent = ret->dim[n].ubound + 1 - ret->dim[n].lbound;
134 rdelta = ret->dim[n].stride;
136 if (ret_extent != ncopies)
137 runtime_error("Incorrect extent in return value of SPREAD"
138 " intrinsic in dimension %ld: is %ld,"
139 " should be %ld", (long int) n+1,
140 (long int) ret_extent, (long int) ncopies);
145 extent[dim] = source->dim[dim].ubound + 1
146 - source->dim[dim].lbound;
147 if (ret_extent != extent[dim])
148 runtime_error("Incorrect extent in return value of SPREAD"
149 " intrinsic in dimension %ld: is %ld,"
150 " should be %ld", (long int) n+1,
151 (long int) ret_extent,
152 (long int) extent[dim]);
154 if (extent[dim] <= 0)
156 sstride[dim] = source->dim[dim].stride;
157 rstride[dim] = ret->dim[n].stride;
164 for (n = 0; n < rrank; n++)
168 rdelta = ret->dim[n].stride;
173 extent[dim] = source->dim[dim].ubound + 1
174 - source->dim[dim].lbound;
175 if (extent[dim] <= 0)
177 sstride[dim] = source->dim[dim].stride;
178 rstride[dim] = ret->dim[n].stride;
190 sstride0 = sstride[0];
191 rstride0 = rstride[0];
197 /* Spread this element. */
199 for (n = 0; n < ncopies; n++)
204 /* Advance to the next element. */
209 while (count[n] == extent[n])
211 /* When we get to the end of a dimension, reset it and increment
212 the next dimension. */
214 /* We could precalculate these products, but this is a less
215 frequently used path so probably not worth it. */
216 sptr -= sstride[n] * extent[n];
217 rptr -= rstride[n] * extent[n];
221 /* Break out of the loop. */
235 /* This version of spread_internal treats the special case of a scalar
236 source. This is much simpler than the more general case above. */
239 spread_scalar_'rtype_code` ('rtype` *ret, const 'rtype_name` *source,
240 const index_type along, const index_type pncopies)
243 int ncopies = pncopies;
244 'rtype_name` * restrict dest;
247 if (GFC_DESCRIPTOR_RANK (ret) != 1)
248 runtime_error ("incorrect destination rank in spread()");
251 runtime_error ("dim outside of rank in spread()");
253 if (ret->data == NULL)
255 ret->data = internal_malloc_size (ncopies * sizeof ('rtype_name`));
257 ret->dim[0].stride = 1;
258 ret->dim[0].lbound = 0;
259 ret->dim[0].ubound = ncopies - 1;
263 if (ncopies - 1 > (ret->dim[0].ubound - ret->dim[0].lbound)
264 / ret->dim[0].stride)
265 runtime_error ("dim too large in spread()");
269 stride = ret->dim[0].stride;
271 for (n = 0; n < ncopies; n++)