1 /* Implementation of the MINVAL 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. */
34 #include "libgfortran.h"
37 #if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_REAL_16)
40 extern void minval_r16 (gfc_array_r16 * const restrict,
41 gfc_array_r16 * const restrict, const index_type * const restrict);
42 export_proto(minval_r16);
45 minval_r16 (gfc_array_r16 * const restrict retarray,
46 gfc_array_r16 * const restrict array,
47 const index_type * const restrict pdim)
49 index_type count[GFC_MAX_DIMENSIONS];
50 index_type extent[GFC_MAX_DIMENSIONS];
51 index_type sstride[GFC_MAX_DIMENSIONS];
52 index_type dstride[GFC_MAX_DIMENSIONS];
53 const GFC_REAL_16 * restrict base;
54 GFC_REAL_16 * restrict dest;
61 /* Make dim zero based to avoid confusion. */
63 rank = GFC_DESCRIPTOR_RANK (array) - 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;
76 for (n = dim; n < rank; n++)
78 sstride[n] = array->dim[n + 1].stride;
80 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
86 if (retarray->data == NULL)
90 for (n = 0; n < rank; n++)
92 retarray->dim[n].lbound = 0;
93 retarray->dim[n].ubound = extent[n]-1;
95 retarray->dim[n].stride = 1;
97 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
100 retarray->offset = 0;
101 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
103 alloc_size = sizeof (GFC_REAL_16) * retarray->dim[rank-1].stride
108 /* Make sure we have a zero-sized array. */
109 retarray->dim[0].lbound = 0;
110 retarray->dim[0].ubound = -1;
114 retarray->data = internal_malloc_size (alloc_size);
118 if (rank != GFC_DESCRIPTOR_RANK (retarray))
119 runtime_error ("rank of return array incorrect");
122 for (n = 0; n < rank; n++)
125 dstride[n] = retarray->dim[n].stride;
131 dest = retarray->data;
135 const GFC_REAL_16 * restrict src;
140 result = GFC_REAL_16_HUGE;
142 *dest = GFC_REAL_16_HUGE;
145 for (n = 0; n < len; n++, src += delta)
154 /* Advance to the next element. */
159 while (count[n] == extent[n])
161 /* When we get to the end of a dimension, reset it and increment
162 the next dimension. */
164 /* We could precalculate these products, but this is a less
165 frequently used path so probably not worth it. */
166 base -= sstride[n] * extent[n];
167 dest -= dstride[n] * extent[n];
171 /* Break out of the look. */
186 extern void mminval_r16 (gfc_array_r16 * const restrict,
187 gfc_array_r16 * const restrict, const index_type * const restrict,
188 gfc_array_l1 * const restrict);
189 export_proto(mminval_r16);
192 mminval_r16 (gfc_array_r16 * const restrict retarray,
193 gfc_array_r16 * const restrict array,
194 const index_type * const restrict pdim,
195 gfc_array_l1 * const restrict mask)
197 index_type count[GFC_MAX_DIMENSIONS];
198 index_type extent[GFC_MAX_DIMENSIONS];
199 index_type sstride[GFC_MAX_DIMENSIONS];
200 index_type dstride[GFC_MAX_DIMENSIONS];
201 index_type mstride[GFC_MAX_DIMENSIONS];
202 GFC_REAL_16 * restrict dest;
203 const GFC_REAL_16 * restrict base;
204 const GFC_LOGICAL_1 * restrict mbase;
214 rank = GFC_DESCRIPTOR_RANK (array) - 1;
216 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
222 mask_kind = GFC_DESCRIPTOR_SIZE (mask);
224 if (mask_kind == 1 || mask_kind == 2 || mask_kind == 4 || mask_kind == 8
225 #ifdef HAVE_GFC_LOGICAL_16
229 mbase = GFOR_POINTER_TO_L1 (mbase, mask_kind);
231 runtime_error ("Funny sized logical array");
233 delta = array->dim[dim].stride;
234 mdelta = mask->dim[dim].stride * mask_kind;
236 for (n = 0; n < dim; n++)
238 sstride[n] = array->dim[n].stride;
239 mstride[n] = mask->dim[n].stride * mask_kind;
240 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
246 for (n = dim; n < rank; n++)
248 sstride[n] = array->dim[n + 1].stride;
249 mstride[n] = mask->dim[n + 1].stride * mask_kind;
251 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
257 if (retarray->data == NULL)
261 for (n = 0; n < rank; n++)
263 retarray->dim[n].lbound = 0;
264 retarray->dim[n].ubound = extent[n]-1;
266 retarray->dim[n].stride = 1;
268 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
271 alloc_size = sizeof (GFC_REAL_16) * retarray->dim[rank-1].stride
274 retarray->offset = 0;
275 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
279 /* Make sure we have a zero-sized array. */
280 retarray->dim[0].lbound = 0;
281 retarray->dim[0].ubound = -1;
285 retarray->data = internal_malloc_size (alloc_size);
290 if (rank != GFC_DESCRIPTOR_RANK (retarray))
291 runtime_error ("rank of return array incorrect");
294 for (n = 0; n < rank; n++)
297 dstride[n] = retarray->dim[n].stride;
302 dest = retarray->data;
307 const GFC_REAL_16 * restrict src;
308 const GFC_LOGICAL_1 * restrict msrc;
314 result = GFC_REAL_16_HUGE;
316 *dest = GFC_REAL_16_HUGE;
319 for (n = 0; n < len; n++, src += delta, msrc += mdelta)
322 if (*msrc && *src < result)
328 /* Advance to the next element. */
334 while (count[n] == extent[n])
336 /* When we get to the end of a dimension, reset it and increment
337 the next dimension. */
339 /* We could precalculate these products, but this is a less
340 frequently used path so probably not worth it. */
341 base -= sstride[n] * extent[n];
342 mbase -= mstride[n] * extent[n];
343 dest -= dstride[n] * extent[n];
347 /* Break out of the look. */
363 extern void sminval_r16 (gfc_array_r16 * const restrict,
364 gfc_array_r16 * const restrict, const index_type * const restrict,
366 export_proto(sminval_r16);
369 sminval_r16 (gfc_array_r16 * const restrict retarray,
370 gfc_array_r16 * const restrict array,
371 const index_type * const restrict pdim,
372 GFC_LOGICAL_4 * mask)
381 minval_r16 (retarray, array, pdim);
384 rank = GFC_DESCRIPTOR_RANK (array);
386 runtime_error ("Rank of array needs to be > 0");
388 if (retarray->data == NULL)
390 retarray->dim[0].lbound = 0;
391 retarray->dim[0].ubound = rank-1;
392 retarray->dim[0].stride = 1;
393 retarray->dtype = (retarray->dtype & ~GFC_DTYPE_RANK_MASK) | 1;
394 retarray->offset = 0;
395 retarray->data = internal_malloc_size (sizeof (GFC_REAL_16) * rank);
399 if (GFC_DESCRIPTOR_RANK (retarray) != 1)
400 runtime_error ("rank of return array does not equal 1");
402 if (retarray->dim[0].ubound + 1 - retarray->dim[0].lbound != rank)
403 runtime_error ("dimension of return array incorrect");
406 dstride = retarray->dim[0].stride;
407 dest = retarray->data;
409 for (n = 0; n < rank; n++)
410 dest[n * dstride] = GFC_REAL_16_HUGE ;