2018-23-01 Paul Thomas <pault@gcc.gnu.org>
[official-gcc.git] / libgfortran / generated / spread_r8.c
blobca5b2f27b35c154aa94da4d68313dbeea9d35fcb
1 /* Special implementation of the SPREAD intrinsic
2 Copyright (C) 2008-2018 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 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 3 of the License, or (at your option) any later version.
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.
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.
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/>. */
27 #include "libgfortran.h"
28 #include <string.h>
31 #if defined (HAVE_GFC_REAL_8)
33 void
34 spread_r8 (gfc_array_r8 *ret, const gfc_array_r8 *source,
35 const index_type along, const index_type pncopies)
37 /* r.* indicates the return array. */
38 index_type rstride[GFC_MAX_DIMENSIONS];
39 index_type rstride0;
40 index_type rdelta = 0;
41 index_type rrank;
42 index_type rs;
43 GFC_REAL_8 *rptr;
44 GFC_REAL_8 * restrict dest;
45 /* s.* indicates the source array. */
46 index_type sstride[GFC_MAX_DIMENSIONS];
47 index_type sstride0;
48 index_type srank;
49 const GFC_REAL_8 *sptr;
51 index_type count[GFC_MAX_DIMENSIONS];
52 index_type extent[GFC_MAX_DIMENSIONS];
53 index_type n;
54 index_type dim;
55 index_type ncopies;
57 srank = GFC_DESCRIPTOR_RANK(source);
59 rrank = srank + 1;
60 if (rrank > GFC_MAX_DIMENSIONS)
61 runtime_error ("return rank too large in spread()");
63 if (along > rrank)
64 runtime_error ("dim outside of rank in spread()");
66 ncopies = pncopies;
68 if (ret->base_addr == NULL)
71 size_t ub, stride;
73 /* The front end has signalled that we need to populate the
74 return array descriptor. */
75 GFC_DTYPE_COPY_SETRANK(ret,source,rrank);
76 dim = 0;
77 rs = 1;
78 for (n = 0; n < rrank; n++)
80 stride = rs;
81 if (n == along - 1)
83 ub = ncopies - 1;
84 rdelta = rs;
85 rs *= ncopies;
87 else
89 count[dim] = 0;
90 extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
91 sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
92 rstride[dim] = rs;
94 ub = extent[dim] - 1;
95 rs *= extent[dim];
96 dim++;
98 GFC_DIMENSION_SET(ret->dim[n], 0, ub, stride);
100 ret->offset = 0;
102 /* xmallocarray allocates a single byte for zero size. */
103 ret->base_addr = xmallocarray (rs, sizeof(GFC_REAL_8));
104 if (rs <= 0)
105 return;
107 else
109 int zero_sized;
111 zero_sized = 0;
113 dim = 0;
114 if (GFC_DESCRIPTOR_RANK(ret) != rrank)
115 runtime_error ("rank mismatch in spread()");
117 if (unlikely (compile_options.bounds_check))
119 for (n = 0; n < rrank; n++)
121 index_type ret_extent;
123 ret_extent = GFC_DESCRIPTOR_EXTENT(ret,n);
124 if (n == along - 1)
126 rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
128 if (ret_extent != ncopies)
129 runtime_error("Incorrect extent in return value of SPREAD"
130 " intrinsic in dimension %ld: is %ld,"
131 " should be %ld", (long int) n+1,
132 (long int) ret_extent, (long int) ncopies);
134 else
136 count[dim] = 0;
137 extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
138 if (ret_extent != extent[dim])
139 runtime_error("Incorrect extent in return value of SPREAD"
140 " intrinsic in dimension %ld: is %ld,"
141 " should be %ld", (long int) n+1,
142 (long int) ret_extent,
143 (long int) extent[dim]);
145 if (extent[dim] <= 0)
146 zero_sized = 1;
147 sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
148 rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
149 dim++;
153 else
155 for (n = 0; n < rrank; n++)
157 if (n == along - 1)
159 rdelta = GFC_DESCRIPTOR_STRIDE(ret,n);
161 else
163 count[dim] = 0;
164 extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim);
165 if (extent[dim] <= 0)
166 zero_sized = 1;
167 sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim);
168 rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n);
169 dim++;
174 if (zero_sized)
175 return;
177 if (sstride[0] == 0)
178 sstride[0] = 1;
180 sstride0 = sstride[0];
181 rstride0 = rstride[0];
182 rptr = ret->base_addr;
183 sptr = source->base_addr;
185 while (sptr)
187 /* Spread this element. */
188 dest = rptr;
189 for (n = 0; n < ncopies; n++)
191 *dest = *sptr;
192 dest += rdelta;
194 /* Advance to the next element. */
195 sptr += sstride0;
196 rptr += rstride0;
197 count[0]++;
198 n = 0;
199 while (count[n] == extent[n])
201 /* When we get to the end of a dimension, reset it and increment
202 the next dimension. */
203 count[n] = 0;
204 /* We could precalculate these products, but this is a less
205 frequently used path so probably not worth it. */
206 sptr -= sstride[n] * extent[n];
207 rptr -= rstride[n] * extent[n];
208 n++;
209 if (n >= srank)
211 /* Break out of the loop. */
212 sptr = NULL;
213 break;
215 else
217 count[n]++;
218 sptr += sstride[n];
219 rptr += rstride[n];
225 /* This version of spread_internal treats the special case of a scalar
226 source. This is much simpler than the more general case above. */
228 void
229 spread_scalar_r8 (gfc_array_r8 *ret, const GFC_REAL_8 *source,
230 const index_type along, const index_type pncopies)
232 int n;
233 int ncopies = pncopies;
234 GFC_REAL_8 * restrict dest;
235 index_type stride;
237 if (GFC_DESCRIPTOR_RANK (ret) != 1)
238 runtime_error ("incorrect destination rank in spread()");
240 if (along > 1)
241 runtime_error ("dim outside of rank in spread()");
243 if (ret->base_addr == NULL)
245 ret->base_addr = xmallocarray (ncopies, sizeof (GFC_REAL_8));
246 ret->offset = 0;
247 GFC_DIMENSION_SET(ret->dim[0], 0, ncopies - 1, 1);
249 else
251 if (ncopies - 1 > (GFC_DESCRIPTOR_EXTENT(ret,0) - 1)
252 / GFC_DESCRIPTOR_STRIDE(ret,0))
253 runtime_error ("dim too large in spread()");
256 dest = ret->base_addr;
257 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
259 for (n = 0; n < ncopies; n++)
261 *dest = *source;
262 dest += stride;
266 #endif