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 (libgfor).
7 Libgfortran is free software; you can redistribute it and/or
8 modify it under the terms of the GNU Lesser General Public
9 License as published by the Free Software Foundation; either
10 version 2.1 of the License, or (at your option) any later version.
12 Libgfortran is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU Lesser General Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with libgfor; see the file COPYING.LIB. If not,
19 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
26 #include "libgfortran.h"
29 extern void __maxval_r8 (gfc_array_r8 *, gfc_array_r8 *, index_type *);
30 export_proto_np(__maxval_r8);
33 __maxval_r8 (gfc_array_r8 *retarray, gfc_array_r8 *array, index_type *pdim)
35 index_type count[GFC_MAX_DIMENSIONS - 1];
36 index_type extent[GFC_MAX_DIMENSIONS - 1];
37 index_type sstride[GFC_MAX_DIMENSIONS - 1];
38 index_type dstride[GFC_MAX_DIMENSIONS - 1];
47 /* Make dim zero based to avoid confusion. */
49 rank = GFC_DESCRIPTOR_RANK (array) - 1;
50 assert (rank == GFC_DESCRIPTOR_RANK (retarray));
51 if (array->dim[0].stride == 0)
52 array->dim[0].stride = 1;
53 if (retarray->dim[0].stride == 0)
54 retarray->dim[0].stride = 1;
56 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
57 delta = array->dim[dim].stride;
59 for (n = 0; n < dim; n++)
61 sstride[n] = array->dim[n].stride;
62 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
64 for (n = dim; n < rank; n++)
66 sstride[n] = array->dim[n + 1].stride;
68 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
71 if (retarray->data == NULL)
73 for (n = 0; n < rank; n++)
75 retarray->dim[n].lbound = 0;
76 retarray->dim[n].ubound = extent[n]-1;
78 retarray->dim[n].stride = 1;
80 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
84 = internal_malloc_size (sizeof (GFC_REAL_8)
85 * retarray->dim[rank-1].stride
90 for (n = 0; n < rank; n++)
93 dstride[n] = retarray->dim[n].stride;
99 dest = retarray->data;
108 result = -GFC_REAL_8_HUGE;
110 *dest = -GFC_REAL_8_HUGE;
113 for (n = 0; n < len; n++, src += delta)
122 /* Advance to the next element. */
127 while (count[n] == extent[n])
129 /* When we get to the end of a dimension, reset it and increment
130 the next dimension. */
132 /* We could precalculate these products, but this is a less
133 frequently used path so proabably not worth it. */
134 base -= sstride[n] * extent[n];
135 dest -= dstride[n] * extent[n];
139 /* Break out of the look. */
154 extern void __mmaxval_r8 (gfc_array_r8 *, gfc_array_r8 *, index_type *,
156 export_proto_np(__mmaxval_r8);
159 __mmaxval_r8 (gfc_array_r8 * retarray, gfc_array_r8 * array, index_type *pdim, gfc_array_l4 * mask)
161 index_type count[GFC_MAX_DIMENSIONS - 1];
162 index_type extent[GFC_MAX_DIMENSIONS - 1];
163 index_type sstride[GFC_MAX_DIMENSIONS - 1];
164 index_type dstride[GFC_MAX_DIMENSIONS - 1];
165 index_type mstride[GFC_MAX_DIMENSIONS - 1];
168 GFC_LOGICAL_4 *mbase;
177 rank = GFC_DESCRIPTOR_RANK (array) - 1;
178 assert (rank == GFC_DESCRIPTOR_RANK (retarray));
179 if (array->dim[0].stride == 0)
180 array->dim[0].stride = 1;
181 if (retarray->dim[0].stride == 0)
182 retarray->dim[0].stride = 1;
184 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
187 delta = array->dim[dim].stride;
188 mdelta = mask->dim[dim].stride;
190 for (n = 0; n < dim; n++)
192 sstride[n] = array->dim[n].stride;
193 mstride[n] = mask->dim[n].stride;
194 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
196 for (n = dim; n < rank; n++)
198 sstride[n] = array->dim[n + 1].stride;
199 mstride[n] = mask->dim[n + 1].stride;
201 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
204 for (n = 0; n < rank; n++)
207 dstride[n] = retarray->dim[n].stride;
212 dest = retarray->data;
216 if (GFC_DESCRIPTOR_SIZE (mask) != 4)
218 /* This allows the same loop to be used for all logical types. */
219 assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
220 for (n = 0; n < rank; n++)
223 mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
235 result = -GFC_REAL_8_HUGE;
237 *dest = -GFC_REAL_8_HUGE;
240 for (n = 0; n < len; n++, src += delta, msrc += mdelta)
243 if (*msrc && *src > result)
249 /* Advance to the next element. */
255 while (count[n] == extent[n])
257 /* When we get to the end of a dimension, reset it and increment
258 the next dimension. */
260 /* We could precalculate these products, but this is a less
261 frequently used path so proabably not worth it. */
262 base -= sstride[n] * extent[n];
263 mbase -= mstride[n] * extent[n];
264 dest -= dstride[n] * extent[n];
268 /* Break out of the look. */