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"
38 #if defined (HAVE_GFC_REAL_8)
41 spread_r8 (gfc_array_r8
*ret
, const gfc_array_r8
*source
,
42 const index_type along
, const index_type pncopies
)
44 /* r.* indicates the return array. */
45 index_type rstride
[GFC_MAX_DIMENSIONS
];
47 index_type rdelta
= 0;
52 /* s.* indicates the source array. */
53 index_type sstride
[GFC_MAX_DIMENSIONS
];
56 const GFC_REAL_8
*sptr
;
58 index_type count
[GFC_MAX_DIMENSIONS
];
59 index_type extent
[GFC_MAX_DIMENSIONS
];
64 srank
= GFC_DESCRIPTOR_RANK(source
);
67 if (rrank
> GFC_MAX_DIMENSIONS
)
68 runtime_error ("return rank too large in spread()");
71 runtime_error ("dim outside of rank in spread()");
75 if (ret
->data
== NULL
)
77 /* The front end has signalled that we need to populate the
78 return array descriptor. */
79 ret
->dtype
= (source
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rrank
;
82 for (n
= 0; n
< rrank
; n
++)
84 ret
->dim
[n
].stride
= rs
;
85 ret
->dim
[n
].lbound
= 0;
88 ret
->dim
[n
].ubound
= ncopies
- 1;
95 extent
[dim
] = source
->dim
[dim
].ubound
+ 1
96 - source
->dim
[dim
].lbound
;
97 sstride
[dim
] = source
->dim
[dim
].stride
;
100 ret
->dim
[n
].ubound
= extent
[dim
]-1;
107 ret
->data
= internal_malloc_size (rs
* sizeof(GFC_REAL_8
));
110 ret
->data
= internal_malloc_size (1);
121 if (GFC_DESCRIPTOR_RANK(ret
) != rrank
)
122 runtime_error ("rank mismatch in spread()");
124 if (compile_options
.bounds_check
)
126 for (n
= 0; n
< rrank
; n
++)
128 index_type ret_extent
;
130 ret_extent
= ret
->dim
[n
].ubound
+ 1 - ret
->dim
[n
].lbound
;
133 rdelta
= ret
->dim
[n
].stride
;
135 if (ret_extent
!= ncopies
)
136 runtime_error("Incorrect extent in return value of SPREAD"
137 " intrinsic in dimension %ld: is %ld,"
138 " should be %ld", (long int) n
+1,
139 (long int) ret_extent
, (long int) ncopies
);
144 extent
[dim
] = source
->dim
[dim
].ubound
+ 1
145 - source
->dim
[dim
].lbound
;
146 if (ret_extent
!= extent
[dim
])
147 runtime_error("Incorrect extent in return value of SPREAD"
148 " intrinsic in dimension %ld: is %ld,"
149 " should be %ld", (long int) n
+1,
150 (long int) ret_extent
,
151 (long int) extent
[dim
]);
153 if (extent
[dim
] <= 0)
155 sstride
[dim
] = source
->dim
[dim
].stride
;
156 rstride
[dim
] = ret
->dim
[n
].stride
;
163 for (n
= 0; n
< rrank
; n
++)
167 rdelta
= ret
->dim
[n
].stride
;
172 extent
[dim
] = source
->dim
[dim
].ubound
+ 1
173 - source
->dim
[dim
].lbound
;
174 if (extent
[dim
] <= 0)
176 sstride
[dim
] = source
->dim
[dim
].stride
;
177 rstride
[dim
] = ret
->dim
[n
].stride
;
189 sstride0
= sstride
[0];
190 rstride0
= rstride
[0];
196 /* Spread this element. */
198 for (n
= 0; n
< ncopies
; n
++)
203 /* Advance to the next element. */
208 while (count
[n
] == extent
[n
])
210 /* When we get to the end of a dimension, reset it and increment
211 the next dimension. */
213 /* We could precalculate these products, but this is a less
214 frequently used path so probably not worth it. */
215 sptr
-= sstride
[n
] * extent
[n
];
216 rptr
-= rstride
[n
] * extent
[n
];
220 /* Break out of the loop. */
234 /* This version of spread_internal treats the special case of a scalar
235 source. This is much simpler than the more general case above. */
238 spread_scalar_r8 (gfc_array_r8
*ret
, const GFC_REAL_8
*source
,
239 const index_type along
, const index_type pncopies
)
242 int ncopies
= pncopies
;
246 if (GFC_DESCRIPTOR_RANK (ret
) != 1)
247 runtime_error ("incorrect destination rank in spread()");
250 runtime_error ("dim outside of rank in spread()");
252 if (ret
->data
== NULL
)
254 ret
->data
= internal_malloc_size (ncopies
* sizeof (GFC_REAL_8
));
256 ret
->dim
[0].stride
= 1;
257 ret
->dim
[0].lbound
= 0;
258 ret
->dim
[0].ubound
= ncopies
- 1;
262 if (ncopies
- 1 > (ret
->dim
[0].ubound
- ret
->dim
[0].lbound
)
263 / ret
->dim
[0].stride
)
264 runtime_error ("dim too large in spread()");
268 stride
= ret
->dim
[0].stride
;
270 for (n
= 0; n
< ncopies
; n
++)