1 /* Implementation of the MAXLOC 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. */
27 #include "libgfortran.h"
30 __maxloc1_4_r8 (gfc_array_i4 * retarray, gfc_array_r8 *array, index_type *pdim)
32 index_type count[GFC_MAX_DIMENSIONS - 1];
33 index_type extent[GFC_MAX_DIMENSIONS - 1];
34 index_type sstride[GFC_MAX_DIMENSIONS - 1];
35 index_type dstride[GFC_MAX_DIMENSIONS - 1];
44 /* Make dim zero based to avoid confusion. */
46 rank = GFC_DESCRIPTOR_RANK (array) - 1;
47 assert (rank == GFC_DESCRIPTOR_RANK (retarray));
48 if (array->dim[0].stride == 0)
49 array->dim[0].stride = 1;
50 if (retarray->dim[0].stride == 0)
51 retarray->dim[0].stride = 1;
53 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
54 delta = array->dim[dim].stride;
56 for (n = 0; n < dim; n++)
58 sstride[n] = array->dim[n].stride;
59 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
61 for (n = dim; n < rank; n++)
63 sstride[n] = array->dim[n + 1].stride;
65 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
68 if (retarray->data == NULL)
70 for (n = 0; n < rank; n++)
72 retarray->dim[n].lbound = 0;
73 retarray->dim[n].ubound = extent[n]-1;
75 retarray->dim[n].stride = 1;
77 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
81 = internal_malloc_size (sizeof (GFC_INTEGER_4)
82 * retarray->dim[rank-1].stride
87 for (n = 0; n < rank; n++)
90 dstride[n] = retarray->dim[n].stride;
96 dest = retarray->data;
101 GFC_INTEGER_4 result;
106 maxval = -GFC_REAL_8_HUGE;
112 for (n = 0; n < len; n++, src += delta)
118 result = (GFC_INTEGER_4)n + 1;
124 /* Advance to the next element. */
129 while (count[n] == extent[n])
131 /* When we get to the end of a dimension, reset it and increment
132 the next dimension. */
134 /* We could precalculate these products, but this is a less
135 frequently used path so proabably not worth it. */
136 base -= sstride[n] * extent[n];
137 dest -= dstride[n] * extent[n];
141 /* Break out of the look. */
156 __mmaxloc1_4_r8 (gfc_array_i4 * retarray, gfc_array_r8 * array, index_type *pdim, gfc_array_l4 * mask)
158 index_type count[GFC_MAX_DIMENSIONS - 1];
159 index_type extent[GFC_MAX_DIMENSIONS - 1];
160 index_type sstride[GFC_MAX_DIMENSIONS - 1];
161 index_type dstride[GFC_MAX_DIMENSIONS - 1];
162 index_type mstride[GFC_MAX_DIMENSIONS - 1];
165 GFC_LOGICAL_4 *mbase;
174 rank = GFC_DESCRIPTOR_RANK (array) - 1;
175 assert (rank == GFC_DESCRIPTOR_RANK (retarray));
176 if (array->dim[0].stride == 0)
177 array->dim[0].stride = 1;
178 if (retarray->dim[0].stride == 0)
179 retarray->dim[0].stride = 1;
181 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
184 delta = array->dim[dim].stride;
185 mdelta = mask->dim[dim].stride;
187 for (n = 0; n < dim; n++)
189 sstride[n] = array->dim[n].stride;
190 mstride[n] = mask->dim[n].stride;
191 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
193 for (n = dim; n < rank; n++)
195 sstride[n] = array->dim[n + 1].stride;
196 mstride[n] = mask->dim[n + 1].stride;
198 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
201 for (n = 0; n < rank; n++)
204 dstride[n] = retarray->dim[n].stride;
209 dest = retarray->data;
213 if (GFC_DESCRIPTOR_SIZE (mask) != 4)
215 /* This allows the same loop to be used for all logical types. */
216 assert (GFC_DESCRIPTOR_SIZE (mask) == 8);
217 for (n = 0; n < rank; n++)
220 mbase = (GFOR_POINTER_L8_TO_L4 (mbase));
227 GFC_INTEGER_4 result;
233 maxval = -GFC_REAL_8_HUGE;
239 for (n = 0; n < len; n++, src += delta, msrc += mdelta)
242 if (*msrc && *src > maxval)
245 result = (GFC_INTEGER_4)n + 1;
251 /* Advance to the next element. */
257 while (count[n] == extent[n])
259 /* When we get to the end of a dimension, reset it and increment
260 the next dimension. */
262 /* We could precalculate these products, but this is a less
263 frequently used path so proabably not worth it. */
264 base -= sstride[n] * extent[n];
265 mbase -= mstride[n] * extent[n];
266 dest -= dstride[n] * extent[n];
270 /* Break out of the look. */