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 __maxval_i4 (gfc_array_i4 * retarray, gfc_array_i4 *array, index_type *pdim)
31 index_type count[GFC_MAX_DIMENSIONS - 1];
32 index_type extent[GFC_MAX_DIMENSIONS - 1];
33 index_type sstride[GFC_MAX_DIMENSIONS - 1];
34 index_type dstride[GFC_MAX_DIMENSIONS - 1];
43 /* Make dim zero based to avoid confusion. */
45 rank = GFC_DESCRIPTOR_RANK (array) - 1;
46 assert (rank == GFC_DESCRIPTOR_RANK (retarray));
47 if (array->dim[0].stride == 0)
48 array->dim[0].stride = 1;
49 if (retarray->dim[0].stride == 0)
50 retarray->dim[0].stride = 1;
52 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
53 delta = array->dim[dim].stride;
55 for (n = 0; n < dim; n++)
57 sstride[n] = array->dim[n].stride;
58 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
60 for (n = dim; n < rank; n++)
62 sstride[n] = array->dim[n + 1].stride;
64 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
67 if (retarray->data == NULL)
69 for (n = 0; n < rank; n++)
71 retarray->dim[n].lbound = 0;
72 retarray->dim[n].ubound = extent[n]-1;
74 retarray->dim[n].stride = 1;
76 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
80 = internal_malloc_size (sizeof (GFC_INTEGER_4)
81 * retarray->dim[rank-1].stride
86 for (n = 0; n < rank; n++)
89 dstride[n] = retarray->dim[n].stride;
95 dest = retarray->data;
100 GFC_INTEGER_4 result;
104 result = -GFC_INTEGER_4_HUGE;
106 *dest = -GFC_INTEGER_4_HUGE;
109 for (n = 0; n < len; n++, src += delta)
118 /* Advance to the next element. */
123 while (count[n] == extent[n])
125 /* When we get to the end of a dimension, reset it and increment
126 the next dimension. */
128 /* We could precalculate these products, but this is a less
129 frequently used path so proabably not worth it. */
130 base -= sstride[n] * extent[n];
131 dest -= dstride[n] * extent[n];
135 /* Break out of the look. */
150 __mmaxval_i4 (gfc_array_i4 * retarray, gfc_array_i4 * array, index_type *pdim, gfc_array_l4 * mask)
152 index_type count[GFC_MAX_DIMENSIONS - 1];
153 index_type extent[GFC_MAX_DIMENSIONS - 1];
154 index_type sstride[GFC_MAX_DIMENSIONS - 1];
155 index_type dstride[GFC_MAX_DIMENSIONS - 1];
156 index_type mstride[GFC_MAX_DIMENSIONS - 1];
159 GFC_LOGICAL_4 *mbase;
168 rank = GFC_DESCRIPTOR_RANK (array) - 1;
169 assert (rank == GFC_DESCRIPTOR_RANK (retarray));
170 if (array->dim[0].stride == 0)
171 array->dim[0].stride = 1;
172 if (retarray->dim[0].stride == 0)
173 retarray->dim[0].stride = 1;
175 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
178 delta = array->dim[dim].stride;
179 mdelta = mask->dim[dim].stride;
181 for (n = 0; n < dim; n++)
183 sstride[n] = array->dim[n].stride;
184 mstride[n] = mask->dim[n].stride;
185 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
187 for (n = dim; n < rank; n++)
189 sstride[n] = array->dim[n + 1].stride;
190 mstride[n] = mask->dim[n + 1].stride;
192 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
195 for (n = 0; n < rank; n++)
198 dstride[n] = retarray->dim[n].stride;
203 dest = retarray->data;
207 if (GFC_DESCRIPTOR_SIZE (mask) != 4)
209 /* This allows the same loop to be used for all logical types. */
210 assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
211 for (n = 0; n < rank; n++)
214 mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
221 GFC_INTEGER_4 result;
226 result = -GFC_INTEGER_4_HUGE;
228 *dest = -GFC_INTEGER_4_HUGE;
231 for (n = 0; n < len; n++, src += delta, msrc += mdelta)
234 if (*msrc && *src > result)
240 /* Advance to the next element. */
246 while (count[n] == extent[n])
248 /* When we get to the end of a dimension, reset it and increment
249 the next dimension. */
251 /* We could precalculate these products, but this is a less
252 frequently used path so proabably not worth it. */
253 base -= sstride[n] * extent[n];
254 mbase -= mstride[n] * extent[n];
255 dest -= dstride[n] * extent[n];
259 /* Break out of the look. */