1 /* Implementation of the MAXVAL 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. */
35 #include "libgfortran.h"
38 #if defined (HAVE_GFC_REAL_8) && defined (HAVE_GFC_REAL_8)
41 extern void maxval_r8 (gfc_array_r8
* const restrict
,
42 gfc_array_r8
* const restrict
, const index_type
* const restrict
);
43 export_proto(maxval_r8
);
46 maxval_r8 (gfc_array_r8
* const restrict retarray
,
47 gfc_array_r8
* const restrict array
,
48 const index_type
* const restrict pdim
)
50 index_type count
[GFC_MAX_DIMENSIONS
];
51 index_type extent
[GFC_MAX_DIMENSIONS
];
52 index_type sstride
[GFC_MAX_DIMENSIONS
];
53 index_type dstride
[GFC_MAX_DIMENSIONS
];
54 const GFC_REAL_8
* restrict base
;
55 GFC_REAL_8
* restrict dest
;
62 /* Make dim zero based to avoid confusion. */
64 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
66 /* TODO: It should be a front end job to correctly set the strides. */
68 if (array
->dim
[0].stride
== 0)
69 array
->dim
[0].stride
= 1;
71 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
72 delta
= array
->dim
[dim
].stride
;
74 for (n
= 0; n
< dim
; n
++)
76 sstride
[n
] = array
->dim
[n
].stride
;
77 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
79 for (n
= dim
; n
< rank
; n
++)
81 sstride
[n
] = array
->dim
[n
+ 1].stride
;
83 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
86 if (retarray
->data
== NULL
)
88 for (n
= 0; n
< rank
; n
++)
90 retarray
->dim
[n
].lbound
= 0;
91 retarray
->dim
[n
].ubound
= extent
[n
]-1;
93 retarray
->dim
[n
].stride
= 1;
95 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
99 = internal_malloc_size (sizeof (GFC_REAL_8
)
100 * retarray
->dim
[rank
-1].stride
102 retarray
->offset
= 0;
103 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
107 if (retarray
->dim
[0].stride
== 0)
108 retarray
->dim
[0].stride
= 1;
110 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
111 runtime_error ("rank of return array incorrect");
114 for (n
= 0; n
< rank
; n
++)
117 dstride
[n
] = retarray
->dim
[n
].stride
;
123 dest
= retarray
->data
;
127 const GFC_REAL_8
* restrict src
;
132 result
= -GFC_REAL_8_HUGE
;
134 *dest
= -GFC_REAL_8_HUGE
;
137 for (n
= 0; n
< len
; n
++, src
+= delta
)
146 /* Advance to the next element. */
151 while (count
[n
] == extent
[n
])
153 /* When we get to the end of a dimension, reset it and increment
154 the next dimension. */
156 /* We could precalculate these products, but this is a less
157 frequently used path so proabably not worth it. */
158 base
-= sstride
[n
] * extent
[n
];
159 dest
-= dstride
[n
] * extent
[n
];
163 /* Break out of the look. */
178 extern void mmaxval_r8 (gfc_array_r8
* const restrict
,
179 gfc_array_r8
* const restrict
, const index_type
* const restrict
,
180 gfc_array_l4
* const restrict
);
181 export_proto(mmaxval_r8
);
184 mmaxval_r8 (gfc_array_r8
* const restrict retarray
,
185 gfc_array_r8
* const restrict array
,
186 const index_type
* const restrict pdim
,
187 gfc_array_l4
* const restrict mask
)
189 index_type count
[GFC_MAX_DIMENSIONS
];
190 index_type extent
[GFC_MAX_DIMENSIONS
];
191 index_type sstride
[GFC_MAX_DIMENSIONS
];
192 index_type dstride
[GFC_MAX_DIMENSIONS
];
193 index_type mstride
[GFC_MAX_DIMENSIONS
];
194 GFC_REAL_8
* restrict dest
;
195 const GFC_REAL_8
* restrict base
;
196 const GFC_LOGICAL_4
* restrict mbase
;
205 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
207 /* TODO: It should be a front end job to correctly set the strides. */
209 if (array
->dim
[0].stride
== 0)
210 array
->dim
[0].stride
= 1;
212 if (mask
->dim
[0].stride
== 0)
213 mask
->dim
[0].stride
= 1;
215 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
218 delta
= array
->dim
[dim
].stride
;
219 mdelta
= mask
->dim
[dim
].stride
;
221 for (n
= 0; n
< dim
; n
++)
223 sstride
[n
] = array
->dim
[n
].stride
;
224 mstride
[n
] = mask
->dim
[n
].stride
;
225 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
227 for (n
= dim
; n
< rank
; n
++)
229 sstride
[n
] = array
->dim
[n
+ 1].stride
;
230 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
232 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
235 if (retarray
->data
== NULL
)
237 for (n
= 0; n
< rank
; n
++)
239 retarray
->dim
[n
].lbound
= 0;
240 retarray
->dim
[n
].ubound
= extent
[n
]-1;
242 retarray
->dim
[n
].stride
= 1;
244 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
248 = internal_malloc_size (sizeof (GFC_REAL_8
)
249 * retarray
->dim
[rank
-1].stride
251 retarray
->offset
= 0;
252 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
256 if (retarray
->dim
[0].stride
== 0)
257 retarray
->dim
[0].stride
= 1;
259 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
260 runtime_error ("rank of return array incorrect");
263 for (n
= 0; n
< rank
; n
++)
266 dstride
[n
] = retarray
->dim
[n
].stride
;
271 dest
= retarray
->data
;
275 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
277 /* This allows the same loop to be used for all logical types. */
278 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
279 for (n
= 0; n
< rank
; n
++)
282 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
287 const GFC_REAL_8
* restrict src
;
288 const GFC_LOGICAL_4
* restrict msrc
;
294 result
= -GFC_REAL_8_HUGE
;
296 *dest
= -GFC_REAL_8_HUGE
;
299 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
302 if (*msrc
&& *src
> result
)
308 /* Advance to the next element. */
314 while (count
[n
] == extent
[n
])
316 /* When we get to the end of a dimension, reset it and increment
317 the next dimension. */
319 /* We could precalculate these products, but this is a less
320 frequently used path so proabably not worth it. */
321 base
-= sstride
[n
] * extent
[n
];
322 mbase
-= mstride
[n
] * extent
[n
];
323 dest
-= dstride
[n
] * extent
[n
];
327 /* Break out of the look. */