]>
Commit | Line | Data |
---|---|---|
b74d1e69 | 1 | /* Special implementation of the SPREAD intrinsic |
fbd26352 | 2 | Copyright (C) 2008-2019 Free Software Foundation, Inc. |
b74d1e69 | 3 | Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>, based on |
4 | spread_generic.c written by Paul Brook <paul@nowt.org> | |
5 | ||
553877d9 | 6 | This file is part of the GNU Fortran runtime library (libgfortran). |
b74d1e69 | 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 | |
6bc9506f | 11 | version 3 of the License, or (at your option) any later version. |
b74d1e69 | 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 | ||
6bc9506f | 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/>. */ | |
b74d1e69 | 26 | |
27 | #include "libgfortran.h" | |
b74d1e69 | 28 | #include <string.h> |
29 | ||
30 | ||
31 | #if defined (HAVE_GFC_COMPLEX_10) | |
32 | ||
33 | void | |
34 | spread_c10 (gfc_array_c10 *ret, const gfc_array_c10 *source, | |
35 | const index_type along, const index_type pncopies) | |
36 | { | |
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_COMPLEX_10 *rptr; | |
9d259edf | 44 | GFC_COMPLEX_10 * restrict dest; |
b74d1e69 | 45 | /* s.* indicates the source array. */ |
46 | index_type sstride[GFC_MAX_DIMENSIONS]; | |
47 | index_type sstride0; | |
48 | index_type srank; | |
49 | const GFC_COMPLEX_10 *sptr; | |
50 | ||
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; | |
56 | ||
57 | srank = GFC_DESCRIPTOR_RANK(source); | |
58 | ||
59 | rrank = srank + 1; | |
60 | if (rrank > GFC_MAX_DIMENSIONS) | |
61 | runtime_error ("return rank too large in spread()"); | |
62 | ||
63 | if (along > rrank) | |
64 | runtime_error ("dim outside of rank in spread()"); | |
65 | ||
66 | ncopies = pncopies; | |
67 | ||
553877d9 | 68 | if (ret->base_addr == NULL) |
b74d1e69 | 69 | { |
827aef63 | 70 | |
71 | size_t ub, stride; | |
72 | ||
b74d1e69 | 73 | /* The front end has signalled that we need to populate the |
74 | return array descriptor. */ | |
0bb0be20 | 75 | ret->dtype.rank = rrank; |
76 | ||
b74d1e69 | 77 | dim = 0; |
78 | rs = 1; | |
79 | for (n = 0; n < rrank; n++) | |
80 | { | |
827aef63 | 81 | stride = rs; |
b74d1e69 | 82 | if (n == along - 1) |
83 | { | |
827aef63 | 84 | ub = ncopies - 1; |
b74d1e69 | 85 | rdelta = rs; |
86 | rs *= ncopies; | |
87 | } | |
88 | else | |
89 | { | |
90 | count[dim] = 0; | |
827aef63 | 91 | extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim); |
92 | sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim); | |
b74d1e69 | 93 | rstride[dim] = rs; |
94 | ||
827aef63 | 95 | ub = extent[dim] - 1; |
b74d1e69 | 96 | rs *= extent[dim]; |
97 | dim++; | |
98 | } | |
827aef63 | 99 | GFC_DIMENSION_SET(ret->dim[n], 0, ub, stride); |
b74d1e69 | 100 | } |
101 | ret->offset = 0; | |
0248e4c1 | 102 | |
af1e9051 | 103 | /* xmallocarray allocates a single byte for zero size. */ |
104 | ret->base_addr = xmallocarray (rs, sizeof(GFC_COMPLEX_10)); | |
0248e4c1 | 105 | if (rs <= 0) |
106 | return; | |
b74d1e69 | 107 | } |
108 | else | |
109 | { | |
110 | int zero_sized; | |
111 | ||
112 | zero_sized = 0; | |
113 | ||
114 | dim = 0; | |
115 | if (GFC_DESCRIPTOR_RANK(ret) != rrank) | |
116 | runtime_error ("rank mismatch in spread()"); | |
117 | ||
c7fb575f | 118 | if (unlikely (compile_options.bounds_check)) |
b74d1e69 | 119 | { |
120 | for (n = 0; n < rrank; n++) | |
121 | { | |
122 | index_type ret_extent; | |
123 | ||
827aef63 | 124 | ret_extent = GFC_DESCRIPTOR_EXTENT(ret,n); |
b74d1e69 | 125 | if (n == along - 1) |
126 | { | |
827aef63 | 127 | rdelta = GFC_DESCRIPTOR_STRIDE(ret,n); |
b74d1e69 | 128 | |
129 | if (ret_extent != ncopies) | |
130 | runtime_error("Incorrect extent in return value of SPREAD" | |
131 | " intrinsic in dimension %ld: is %ld," | |
132 | " should be %ld", (long int) n+1, | |
133 | (long int) ret_extent, (long int) ncopies); | |
134 | } | |
135 | else | |
136 | { | |
137 | count[dim] = 0; | |
827aef63 | 138 | extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim); |
b74d1e69 | 139 | if (ret_extent != extent[dim]) |
140 | runtime_error("Incorrect extent in return value of SPREAD" | |
141 | " intrinsic in dimension %ld: is %ld," | |
142 | " should be %ld", (long int) n+1, | |
143 | (long int) ret_extent, | |
144 | (long int) extent[dim]); | |
145 | ||
146 | if (extent[dim] <= 0) | |
147 | zero_sized = 1; | |
827aef63 | 148 | sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim); |
149 | rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n); | |
b74d1e69 | 150 | dim++; |
151 | } | |
152 | } | |
153 | } | |
154 | else | |
155 | { | |
156 | for (n = 0; n < rrank; n++) | |
157 | { | |
158 | if (n == along - 1) | |
159 | { | |
827aef63 | 160 | rdelta = GFC_DESCRIPTOR_STRIDE(ret,n); |
b74d1e69 | 161 | } |
162 | else | |
163 | { | |
164 | count[dim] = 0; | |
827aef63 | 165 | extent[dim] = GFC_DESCRIPTOR_EXTENT(source,dim); |
b74d1e69 | 166 | if (extent[dim] <= 0) |
167 | zero_sized = 1; | |
827aef63 | 168 | sstride[dim] = GFC_DESCRIPTOR_STRIDE(source,dim); |
169 | rstride[dim] = GFC_DESCRIPTOR_STRIDE(ret,n); | |
b74d1e69 | 170 | dim++; |
171 | } | |
172 | } | |
173 | } | |
174 | ||
175 | if (zero_sized) | |
176 | return; | |
177 | ||
178 | if (sstride[0] == 0) | |
179 | sstride[0] = 1; | |
180 | } | |
181 | sstride0 = sstride[0]; | |
182 | rstride0 = rstride[0]; | |
553877d9 | 183 | rptr = ret->base_addr; |
184 | sptr = source->base_addr; | |
b74d1e69 | 185 | |
186 | while (sptr) | |
187 | { | |
188 | /* Spread this element. */ | |
189 | dest = rptr; | |
190 | for (n = 0; n < ncopies; n++) | |
191 | { | |
192 | *dest = *sptr; | |
193 | dest += rdelta; | |
194 | } | |
195 | /* Advance to the next element. */ | |
196 | sptr += sstride0; | |
197 | rptr += rstride0; | |
198 | count[0]++; | |
199 | n = 0; | |
200 | while (count[n] == extent[n]) | |
201 | { | |
202 | /* When we get to the end of a dimension, reset it and increment | |
203 | the next dimension. */ | |
204 | count[n] = 0; | |
205 | /* We could precalculate these products, but this is a less | |
206 | frequently used path so probably not worth it. */ | |
207 | sptr -= sstride[n] * extent[n]; | |
208 | rptr -= rstride[n] * extent[n]; | |
209 | n++; | |
210 | if (n >= srank) | |
211 | { | |
212 | /* Break out of the loop. */ | |
213 | sptr = NULL; | |
214 | break; | |
215 | } | |
216 | else | |
217 | { | |
218 | count[n]++; | |
219 | sptr += sstride[n]; | |
220 | rptr += rstride[n]; | |
221 | } | |
222 | } | |
223 | } | |
224 | } | |
225 | ||
226 | /* This version of spread_internal treats the special case of a scalar | |
227 | source. This is much simpler than the more general case above. */ | |
228 | ||
229 | void | |
230 | spread_scalar_c10 (gfc_array_c10 *ret, const GFC_COMPLEX_10 *source, | |
df52c9a4 | 231 | const index_type along, const index_type ncopies) |
b74d1e69 | 232 | { |
9d259edf | 233 | GFC_COMPLEX_10 * restrict dest; |
b74d1e69 | 234 | index_type stride; |
235 | ||
236 | if (GFC_DESCRIPTOR_RANK (ret) != 1) | |
237 | runtime_error ("incorrect destination rank in spread()"); | |
238 | ||
239 | if (along > 1) | |
240 | runtime_error ("dim outside of rank in spread()"); | |
241 | ||
553877d9 | 242 | if (ret->base_addr == NULL) |
b74d1e69 | 243 | { |
af1e9051 | 244 | ret->base_addr = xmallocarray (ncopies, sizeof (GFC_COMPLEX_10)); |
b74d1e69 | 245 | ret->offset = 0; |
827aef63 | 246 | GFC_DIMENSION_SET(ret->dim[0], 0, ncopies - 1, 1); |
b74d1e69 | 247 | } |
248 | else | |
249 | { | |
827aef63 | 250 | if (ncopies - 1 > (GFC_DESCRIPTOR_EXTENT(ret,0) - 1) |
251 | / GFC_DESCRIPTOR_STRIDE(ret,0)) | |
b74d1e69 | 252 | runtime_error ("dim too large in spread()"); |
253 | } | |
254 | ||
553877d9 | 255 | dest = ret->base_addr; |
827aef63 | 256 | stride = GFC_DESCRIPTOR_STRIDE(ret,0); |
b74d1e69 | 257 | |
df52c9a4 | 258 | for (index_type n = 0; n < ncopies; n++) |
b74d1e69 | 259 | { |
260 | *dest = *source; | |
261 | dest += stride; | |
262 | } | |
263 | } | |
264 | ||
265 | #endif | |
9d259edf | 266 |