1 /* Implementation of the MINVAL intrinsic
2 Copyright (C) 2002-2022 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 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 3 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 General Public License for more details.
17 Under Section 7 of GPL version 3, you are granted additional
18 permissions described in the GCC Runtime Library Exception, version
19 3.1, as published by the Free Software Foundation.
21 You should have received a copy of the GNU General Public License and
22 a copy of the GCC Runtime Library Exception along with this program;
23 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 <http://www.gnu.org/licenses/>. */
26 #include "libgfortran.h"
29 #if defined (HAVE_GFC_REAL_8) && defined (HAVE_GFC_REAL_8)
32 extern void minval_r8 (gfc_array_r8
* const restrict
,
33 gfc_array_r8
* const restrict
, const index_type
* const restrict
);
34 export_proto(minval_r8
);
37 minval_r8 (gfc_array_r8
* const restrict retarray
,
38 gfc_array_r8
* const restrict array
,
39 const index_type
* const restrict pdim
)
41 index_type count
[GFC_MAX_DIMENSIONS
];
42 index_type extent
[GFC_MAX_DIMENSIONS
];
43 index_type sstride
[GFC_MAX_DIMENSIONS
];
44 index_type dstride
[GFC_MAX_DIMENSIONS
];
45 const GFC_REAL_8
* restrict base
;
46 GFC_REAL_8
* restrict dest
;
54 /* Make dim zero based to avoid confusion. */
55 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
58 if (unlikely (dim
< 0 || dim
> rank
))
60 runtime_error ("Dim argument incorrect in MINVAL intrinsic: "
61 "is %ld, should be between 1 and %ld",
62 (long int) dim
+ 1, (long int) rank
+ 1);
65 len
= GFC_DESCRIPTOR_EXTENT(array
,dim
);
68 delta
= GFC_DESCRIPTOR_STRIDE(array
,dim
);
70 for (n
= 0; n
< dim
; n
++)
72 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
,n
);
73 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
);
78 for (n
= dim
; n
< rank
; n
++)
80 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
, n
+ 1);
81 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
, n
+ 1);
87 if (retarray
->base_addr
== NULL
)
89 size_t alloc_size
, str
;
91 for (n
= 0; n
< rank
; n
++)
96 str
= GFC_DESCRIPTOR_STRIDE(retarray
,n
-1) * extent
[n
-1];
98 GFC_DIMENSION_SET(retarray
->dim
[n
], 0, extent
[n
] - 1, str
);
102 retarray
->offset
= 0;
103 retarray
->dtype
.rank
= rank
;
105 alloc_size
= GFC_DESCRIPTOR_STRIDE(retarray
,rank
-1) * extent
[rank
-1];
107 retarray
->base_addr
= xmallocarray (alloc_size
, sizeof (GFC_REAL_8
));
110 /* Make sure we have a zero-sized array. */
111 GFC_DIMENSION_SET(retarray
->dim
[0], 0, -1, 1);
118 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
119 runtime_error ("rank of return array incorrect in"
120 " MINVAL intrinsic: is %ld, should be %ld",
121 (long int) (GFC_DESCRIPTOR_RANK (retarray
)),
124 if (unlikely (compile_options
.bounds_check
))
125 bounds_ifunction_return ((array_t
*) retarray
, extent
,
126 "return value", "MINVAL");
129 for (n
= 0; n
< rank
; n
++)
132 dstride
[n
] = GFC_DESCRIPTOR_STRIDE(retarray
,n
);
137 base
= array
->base_addr
;
138 dest
= retarray
->base_addr
;
141 while (continue_loop
)
143 const GFC_REAL_8
* restrict src
;
148 #if defined (GFC_REAL_8_INFINITY)
149 result
= GFC_REAL_8_INFINITY
;
151 result
= GFC_REAL_8_HUGE
;
154 *dest
= GFC_REAL_8_HUGE
;
157 #if ! defined HAVE_BACK_ARG
158 for (n
= 0; n
< len
; n
++, src
+= delta
)
162 #if defined (GFC_REAL_8_QUIET_NAN)
166 if (unlikely (n
>= len
))
167 result
= GFC_REAL_8_QUIET_NAN
;
168 else for (; n
< len
; n
++, src
+= delta
)
178 /* Advance to the next element. */
183 while (count
[n
] == extent
[n
])
185 /* When we get to the end of a dimension, reset it and increment
186 the next dimension. */
188 /* We could precalculate these products, but this is a less
189 frequently used path so probably not worth it. */
190 base
-= sstride
[n
] * extent
[n
];
191 dest
-= dstride
[n
] * extent
[n
];
195 /* Break out of the loop. */
210 extern void mminval_r8 (gfc_array_r8
* const restrict
,
211 gfc_array_r8
* const restrict
, const index_type
* const restrict
,
212 gfc_array_l1
* const restrict
);
213 export_proto(mminval_r8
);
216 mminval_r8 (gfc_array_r8
* const restrict retarray
,
217 gfc_array_r8
* const restrict array
,
218 const index_type
* const restrict pdim
,
219 gfc_array_l1
* const restrict mask
)
221 index_type count
[GFC_MAX_DIMENSIONS
];
222 index_type extent
[GFC_MAX_DIMENSIONS
];
223 index_type sstride
[GFC_MAX_DIMENSIONS
];
224 index_type dstride
[GFC_MAX_DIMENSIONS
];
225 index_type mstride
[GFC_MAX_DIMENSIONS
];
226 GFC_REAL_8
* restrict dest
;
227 const GFC_REAL_8
* restrict base
;
228 const GFC_LOGICAL_1
* restrict mbase
;
240 minval_r8 (retarray
, array
, pdim
, back
);
242 minval_r8 (retarray
, array
, pdim
);
248 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
251 if (unlikely (dim
< 0 || dim
> rank
))
253 runtime_error ("Dim argument incorrect in MINVAL intrinsic: "
254 "is %ld, should be between 1 and %ld",
255 (long int) dim
+ 1, (long int) rank
+ 1);
258 len
= GFC_DESCRIPTOR_EXTENT(array
,dim
);
262 mbase
= mask
->base_addr
;
264 mask_kind
= GFC_DESCRIPTOR_SIZE (mask
);
266 if (mask_kind
== 1 || mask_kind
== 2 || mask_kind
== 4 || mask_kind
== 8
267 #ifdef HAVE_GFC_LOGICAL_16
271 mbase
= GFOR_POINTER_TO_L1 (mbase
, mask_kind
);
273 runtime_error ("Funny sized logical array");
275 delta
= GFC_DESCRIPTOR_STRIDE(array
,dim
);
276 mdelta
= GFC_DESCRIPTOR_STRIDE_BYTES(mask
,dim
);
278 for (n
= 0; n
< dim
; n
++)
280 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
,n
);
281 mstride
[n
] = GFC_DESCRIPTOR_STRIDE_BYTES(mask
,n
);
282 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
);
288 for (n
= dim
; n
< rank
; n
++)
290 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
,n
+ 1);
291 mstride
[n
] = GFC_DESCRIPTOR_STRIDE_BYTES(mask
, n
+ 1);
292 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
, n
+ 1);
298 if (retarray
->base_addr
== NULL
)
300 size_t alloc_size
, str
;
302 for (n
= 0; n
< rank
; n
++)
307 str
= GFC_DESCRIPTOR_STRIDE(retarray
,n
-1) * extent
[n
-1];
309 GFC_DIMENSION_SET(retarray
->dim
[n
], 0, extent
[n
] - 1, str
);
313 alloc_size
= GFC_DESCRIPTOR_STRIDE(retarray
,rank
-1) * extent
[rank
-1];
315 retarray
->offset
= 0;
316 retarray
->dtype
.rank
= rank
;
320 /* Make sure we have a zero-sized array. */
321 GFC_DIMENSION_SET(retarray
->dim
[0], 0, -1, 1);
325 retarray
->base_addr
= xmallocarray (alloc_size
, sizeof (GFC_REAL_8
));
330 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
331 runtime_error ("rank of return array incorrect in MINVAL intrinsic");
333 if (unlikely (compile_options
.bounds_check
))
335 bounds_ifunction_return ((array_t
*) retarray
, extent
,
336 "return value", "MINVAL");
337 bounds_equal_extents ((array_t
*) mask
, (array_t
*) array
,
338 "MASK argument", "MINVAL");
342 for (n
= 0; n
< rank
; n
++)
345 dstride
[n
] = GFC_DESCRIPTOR_STRIDE(retarray
,n
);
350 dest
= retarray
->base_addr
;
351 base
= array
->base_addr
;
355 const GFC_REAL_8
* restrict src
;
356 const GFC_LOGICAL_1
* restrict msrc
;
362 #if defined (GFC_REAL_8_INFINITY)
363 result
= GFC_REAL_8_INFINITY
;
365 result
= GFC_REAL_8_HUGE
;
367 #if defined (GFC_REAL_8_QUIET_NAN)
370 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
373 #if defined (GFC_REAL_8_INFINITY) || defined (GFC_REAL_8_QUIET_NAN)
376 #if defined (GFC_REAL_8_QUIET_NAN)
383 if (unlikely (n
>= len
))
385 #if defined (GFC_REAL_8_QUIET_NAN)
386 result
= non_empty_p
? GFC_REAL_8_QUIET_NAN
: GFC_REAL_8_HUGE
;
388 result
= GFC_REAL_8_HUGE
;
391 else for (; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
394 if (*msrc
&& *src
< result
)
399 /* Advance to the next element. */
405 while (count
[n
] == extent
[n
])
407 /* When we get to the end of a dimension, reset it and increment
408 the next dimension. */
410 /* We could precalculate these products, but this is a less
411 frequently used path so probably not worth it. */
412 base
-= sstride
[n
] * extent
[n
];
413 mbase
-= mstride
[n
] * extent
[n
];
414 dest
-= dstride
[n
] * extent
[n
];
418 /* Break out of the loop. */
434 extern void sminval_r8 (gfc_array_r8
* const restrict
,
435 gfc_array_r8
* const restrict
, const index_type
* const restrict
,
437 export_proto(sminval_r8
);
440 sminval_r8 (gfc_array_r8
* const restrict retarray
,
441 gfc_array_r8
* const restrict array
,
442 const index_type
* const restrict pdim
,
443 GFC_LOGICAL_4
* mask
)
445 index_type count
[GFC_MAX_DIMENSIONS
];
446 index_type extent
[GFC_MAX_DIMENSIONS
];
447 index_type dstride
[GFC_MAX_DIMENSIONS
];
448 GFC_REAL_8
* restrict dest
;
454 if (mask
== NULL
|| *mask
)
457 minval_r8 (retarray
, array
, pdim
, back
);
459 minval_r8 (retarray
, array
, pdim
);
463 /* Make dim zero based to avoid confusion. */
465 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
467 if (unlikely (dim
< 0 || dim
> rank
))
469 runtime_error ("Dim argument incorrect in MINVAL intrinsic: "
470 "is %ld, should be between 1 and %ld",
471 (long int) dim
+ 1, (long int) rank
+ 1);
474 for (n
= 0; n
< dim
; n
++)
476 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
);
482 for (n
= dim
; n
< rank
; n
++)
485 GFC_DESCRIPTOR_EXTENT(array
,n
+ 1);
491 if (retarray
->base_addr
== NULL
)
493 size_t alloc_size
, str
;
495 for (n
= 0; n
< rank
; n
++)
500 str
= GFC_DESCRIPTOR_STRIDE(retarray
,n
-1) * extent
[n
-1];
502 GFC_DIMENSION_SET(retarray
->dim
[n
], 0, extent
[n
] - 1, str
);
506 retarray
->offset
= 0;
507 retarray
->dtype
.rank
= rank
;
509 alloc_size
= GFC_DESCRIPTOR_STRIDE(retarray
,rank
-1) * extent
[rank
-1];
513 /* Make sure we have a zero-sized array. */
514 GFC_DIMENSION_SET(retarray
->dim
[0], 0, -1, 1);
518 retarray
->base_addr
= xmallocarray (alloc_size
, sizeof (GFC_REAL_8
));
522 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
523 runtime_error ("rank of return array incorrect in"
524 " MINVAL intrinsic: is %ld, should be %ld",
525 (long int) (GFC_DESCRIPTOR_RANK (retarray
)),
528 if (unlikely (compile_options
.bounds_check
))
530 for (n
=0; n
< rank
; n
++)
532 index_type ret_extent
;
534 ret_extent
= GFC_DESCRIPTOR_EXTENT(retarray
,n
);
535 if (extent
[n
] != ret_extent
)
536 runtime_error ("Incorrect extent in return value of"
537 " MINVAL intrinsic in dimension %ld:"
538 " is %ld, should be %ld", (long int) n
+ 1,
539 (long int) ret_extent
, (long int) extent
[n
]);
544 for (n
= 0; n
< rank
; n
++)
547 dstride
[n
] = GFC_DESCRIPTOR_STRIDE(retarray
,n
);
550 dest
= retarray
->base_addr
;
554 *dest
= GFC_REAL_8_HUGE
;
558 while (count
[n
] == extent
[n
])
560 /* When we get to the end of a dimension, reset it and increment
561 the next dimension. */
563 /* We could precalculate these products, but this is a less
564 frequently used path so probably not worth it. */
565 dest
-= dstride
[n
] * extent
[n
];