1 /* Implementation of the SUM intrinsic
2 Copyright 2002 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 95 runtime library (libgfortran).
7 Libgfortran is free software; you can redistribute it and/or
8 modify it under the terms of the GNU General Public
9 License as published by the Free Software Foundation; either
10 version 2 of the License, or (at your option) any later version.
12 In addition to the permissions in the GNU General Public License, the
13 Free Software Foundation gives you unlimited permission to link the
14 compiled version of this file into combinations with other programs,
15 and to distribute those combinations without any restriction coming
16 from the use of this file. (The General Public License restrictions
17 do apply in other respects; for example, they cover modification of
18 the file, and distribution when not linked into a combine
21 Libgfortran is distributed in the hope that it will be useful,
22 but WITHOUT ANY WARRANTY; without even the implied warranty of
23 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 GNU General Public License for more details.
26 You should have received a copy of the GNU General Public
27 License along with libgfortran; see the file COPYING. If not,
28 write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
29 Boston, MA 02110-1301, USA. */
34 #include "libgfortran.h"
37 extern void sum_c4 (gfc_array_c4
*, gfc_array_c4
*, index_type
*);
41 sum_c4 (gfc_array_c4
*retarray
, gfc_array_c4
*array
, index_type
*pdim
)
43 index_type count
[GFC_MAX_DIMENSIONS
];
44 index_type extent
[GFC_MAX_DIMENSIONS
];
45 index_type sstride
[GFC_MAX_DIMENSIONS
];
46 index_type dstride
[GFC_MAX_DIMENSIONS
];
55 /* Make dim zero based to avoid confusion. */
57 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
59 /* TODO: It should be a front end job to correctly set the strides. */
61 if (array
->dim
[0].stride
== 0)
62 array
->dim
[0].stride
= 1;
64 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
65 delta
= array
->dim
[dim
].stride
;
67 for (n
= 0; n
< dim
; n
++)
69 sstride
[n
] = array
->dim
[n
].stride
;
70 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
72 for (n
= dim
; n
< rank
; n
++)
74 sstride
[n
] = array
->dim
[n
+ 1].stride
;
76 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
79 if (retarray
->data
== NULL
)
81 for (n
= 0; n
< rank
; n
++)
83 retarray
->dim
[n
].lbound
= 0;
84 retarray
->dim
[n
].ubound
= extent
[n
]-1;
86 retarray
->dim
[n
].stride
= 1;
88 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
92 = internal_malloc_size (sizeof (GFC_COMPLEX_4
)
93 * retarray
->dim
[rank
-1].stride
96 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
100 if (retarray
->dim
[0].stride
== 0)
101 retarray
->dim
[0].stride
= 1;
103 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
104 runtime_error ("rank of return array incorrect");
107 for (n
= 0; n
< rank
; n
++)
110 dstride
[n
] = retarray
->dim
[n
].stride
;
116 dest
= retarray
->data
;
121 GFC_COMPLEX_4 result
;
130 for (n
= 0; n
< len
; n
++, src
+= delta
)
138 /* Advance to the next element. */
143 while (count
[n
] == extent
[n
])
145 /* When we get to the end of a dimension, reset it and increment
146 the next dimension. */
148 /* We could precalculate these products, but this is a less
149 frequently used path so proabably not worth it. */
150 base
-= sstride
[n
] * extent
[n
];
151 dest
-= dstride
[n
] * extent
[n
];
155 /* Break out of the look. */
170 extern void msum_c4 (gfc_array_c4
*, gfc_array_c4
*, index_type
*,
172 export_proto(msum_c4
);
175 msum_c4 (gfc_array_c4
* retarray
, gfc_array_c4
* array
,
176 index_type
*pdim
, gfc_array_l4
* mask
)
178 index_type count
[GFC_MAX_DIMENSIONS
];
179 index_type extent
[GFC_MAX_DIMENSIONS
];
180 index_type sstride
[GFC_MAX_DIMENSIONS
];
181 index_type dstride
[GFC_MAX_DIMENSIONS
];
182 index_type mstride
[GFC_MAX_DIMENSIONS
];
185 GFC_LOGICAL_4
*mbase
;
194 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
196 /* TODO: It should be a front end job to correctly set the strides. */
198 if (array
->dim
[0].stride
== 0)
199 array
->dim
[0].stride
= 1;
201 if (mask
->dim
[0].stride
== 0)
202 mask
->dim
[0].stride
= 1;
204 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
207 delta
= array
->dim
[dim
].stride
;
208 mdelta
= mask
->dim
[dim
].stride
;
210 for (n
= 0; n
< dim
; n
++)
212 sstride
[n
] = array
->dim
[n
].stride
;
213 mstride
[n
] = mask
->dim
[n
].stride
;
214 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
216 for (n
= dim
; n
< rank
; n
++)
218 sstride
[n
] = array
->dim
[n
+ 1].stride
;
219 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
221 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
224 if (retarray
->data
== NULL
)
226 for (n
= 0; n
< rank
; n
++)
228 retarray
->dim
[n
].lbound
= 0;
229 retarray
->dim
[n
].ubound
= extent
[n
]-1;
231 retarray
->dim
[n
].stride
= 1;
233 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
237 = internal_malloc_size (sizeof (GFC_COMPLEX_4
)
238 * retarray
->dim
[rank
-1].stride
240 retarray
->offset
= 0;
241 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
245 if (retarray
->dim
[0].stride
== 0)
246 retarray
->dim
[0].stride
= 1;
248 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
249 runtime_error ("rank of return array incorrect");
252 for (n
= 0; n
< rank
; n
++)
255 dstride
[n
] = retarray
->dim
[n
].stride
;
260 dest
= retarray
->data
;
264 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
266 /* This allows the same loop to be used for all logical types. */
267 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
268 for (n
= 0; n
< rank
; n
++)
271 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
278 GFC_COMPLEX_4 result
;
288 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
297 /* Advance to the next element. */
303 while (count
[n
] == extent
[n
])
305 /* When we get to the end of a dimension, reset it and increment
306 the next dimension. */
308 /* We could precalculate these products, but this is a less
309 frequently used path so proabably not worth it. */
310 base
-= sstride
[n
] * extent
[n
];
311 mbase
-= mstride
[n
] * extent
[n
];
312 dest
-= dstride
[n
] * extent
[n
];
316 /* Break out of the look. */