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., 59 Temple Place - Suite 330,
29 Boston, MA 02111-1307, USA. */
35 #include "libgfortran.h"
38 extern void maxval_r4 (gfc_array_r4 *, gfc_array_r4 *, index_type *);
39 export_proto(maxval_r4);
42 maxval_r4 (gfc_array_r4 *retarray, gfc_array_r4 *array, index_type *pdim)
44 index_type count[GFC_MAX_DIMENSIONS];
45 index_type extent[GFC_MAX_DIMENSIONS];
46 index_type sstride[GFC_MAX_DIMENSIONS];
47 index_type dstride[GFC_MAX_DIMENSIONS];
56 /* Make dim zero based to avoid confusion. */
58 rank = GFC_DESCRIPTOR_RANK (array) - 1;
60 /* TODO: It should be a front end job to correctly set the strides. */
62 if (array->dim[0].stride == 0)
63 array->dim[0].stride = 1;
65 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
66 delta = array->dim[dim].stride;
68 for (n = 0; n < dim; n++)
70 sstride[n] = array->dim[n].stride;
71 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
73 for (n = dim; n < rank; n++)
75 sstride[n] = array->dim[n + 1].stride;
77 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
80 if (retarray->data == NULL)
82 for (n = 0; n < rank; n++)
84 retarray->dim[n].lbound = 0;
85 retarray->dim[n].ubound = extent[n]-1;
87 retarray->dim[n].stride = 1;
89 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
93 = internal_malloc_size (sizeof (GFC_REAL_4)
94 * retarray->dim[rank-1].stride
97 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
101 if (retarray->dim[0].stride == 0)
102 retarray->dim[0].stride = 1;
104 if (rank != GFC_DESCRIPTOR_RANK (retarray))
105 runtime_error ("rank of return array incorrect");
108 for (n = 0; n < rank; n++)
111 dstride[n] = retarray->dim[n].stride;
117 dest = retarray->data;
126 result = -GFC_REAL_4_HUGE;
128 *dest = -GFC_REAL_4_HUGE;
131 for (n = 0; n < len; n++, src += delta)
140 /* Advance to the next element. */
145 while (count[n] == extent[n])
147 /* When we get to the end of a dimension, reset it and increment
148 the next dimension. */
150 /* We could precalculate these products, but this is a less
151 frequently used path so proabably not worth it. */
152 base -= sstride[n] * extent[n];
153 dest -= dstride[n] * extent[n];
157 /* Break out of the look. */
172 extern void mmaxval_r4 (gfc_array_r4 *, gfc_array_r4 *, index_type *,
174 export_proto(mmaxval_r4);
177 mmaxval_r4 (gfc_array_r4 * retarray, gfc_array_r4 * array,
178 index_type *pdim, gfc_array_l4 * mask)
180 index_type count[GFC_MAX_DIMENSIONS];
181 index_type extent[GFC_MAX_DIMENSIONS];
182 index_type sstride[GFC_MAX_DIMENSIONS];
183 index_type dstride[GFC_MAX_DIMENSIONS];
184 index_type mstride[GFC_MAX_DIMENSIONS];
187 GFC_LOGICAL_4 *mbase;
196 rank = GFC_DESCRIPTOR_RANK (array) - 1;
198 /* TODO: It should be a front end job to correctly set the strides. */
200 if (array->dim[0].stride == 0)
201 array->dim[0].stride = 1;
203 if (mask->dim[0].stride == 0)
204 mask->dim[0].stride = 1;
206 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
209 delta = array->dim[dim].stride;
210 mdelta = mask->dim[dim].stride;
212 for (n = 0; n < dim; n++)
214 sstride[n] = array->dim[n].stride;
215 mstride[n] = mask->dim[n].stride;
216 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
218 for (n = dim; n < rank; n++)
220 sstride[n] = array->dim[n + 1].stride;
221 mstride[n] = mask->dim[n + 1].stride;
223 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
226 if (retarray->data == NULL)
228 for (n = 0; n < rank; n++)
230 retarray->dim[n].lbound = 0;
231 retarray->dim[n].ubound = extent[n]-1;
233 retarray->dim[n].stride = 1;
235 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
239 = internal_malloc_size (sizeof (GFC_REAL_4)
240 * retarray->dim[rank-1].stride
242 retarray->offset = 0;
243 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
247 if (retarray->dim[0].stride == 0)
248 retarray->dim[0].stride = 1;
250 if (rank != GFC_DESCRIPTOR_RANK (retarray))
251 runtime_error ("rank of return array incorrect");
254 for (n = 0; n < rank; n++)
257 dstride[n] = retarray->dim[n].stride;
262 dest = retarray->data;
266 if (GFC_DESCRIPTOR_SIZE (mask) != 4)
268 /* This allows the same loop to be used for all logical types. */
269 assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
270 for (n = 0; n < rank; n++)
273 mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
285 result = -GFC_REAL_4_HUGE;
287 *dest = -GFC_REAL_4_HUGE;
290 for (n = 0; n < len; n++, src += delta, msrc += mdelta)
293 if (*msrc && *src > result)
299 /* Advance to the next element. */
305 while (count[n] == extent[n])
307 /* When we get to the end of a dimension, reset it and increment
308 the next dimension. */
310 /* We could precalculate these products, but this is a less
311 frequently used path so proabably not worth it. */
312 base -= sstride[n] * extent[n];
313 mbase -= mstride[n] * extent[n];
314 dest -= dstride[n] * extent[n];
318 /* Break out of the look. */