]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | `/* Implementation of the MINVAL intrinsic |
e3c063ce | 2 | Copyright (C) 2002-2013 Free Software Foundation, Inc. |
6de9cd9a DN |
3 | Contributed by Paul Brook <paul@nowt.org> |
4 | ||
0cd0559e | 5 | This file is part of the GNU Fortran runtime library (libgfortran). |
6de9cd9a DN |
6 | |
7 | Libgfortran is free software; you can redistribute it and/or | |
57dea9f6 | 8 | modify it under the terms of the GNU General Public |
6de9cd9a | 9 | License as published by the Free Software Foundation; either |
748086b7 | 10 | version 3 of the License, or (at your option) any later version. |
6de9cd9a DN |
11 | |
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 | |
57dea9f6 | 15 | GNU General Public License for more details. |
6de9cd9a | 16 | |
748086b7 JJ |
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. | |
20 | ||
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/>. */ | |
6de9cd9a | 25 | |
36ae8a61 | 26 | #include "libgfortran.h" |
6de9cd9a | 27 | #include <stdlib.h> |
36ae8a61 | 28 | #include <assert.h>' |
6de9cd9a DN |
29 | |
30 | include(iparm.m4)dnl | |
31 | include(ifunction.m4)dnl | |
644cb69f FXC |
32 | |
33 | `#if defined (HAVE_'atype_name`) && defined (HAVE_'rtype_name`)' | |
34 | ||
c9e66eda | 35 | ARRAY_FUNCTION(atype_max, |
80927a56 JJ |
36 | `#if defined ('atype_inf`) |
37 | result = atype_inf; | |
38 | #else | |
39 | result = atype_max; | |
40 | #endif', | |
41 | `#if defined ('atype_nan`) | |
42 | if (*src <= result) | |
43 | break; | |
44 | } | |
45 | if (unlikely (n >= len)) | |
46 | result = atype_nan; | |
47 | else for (; n < len; n++, src += delta) | |
48 | { | |
49 | #endif | |
50 | if (*src < result) | |
51 | result = *src;') | |
6de9cd9a | 52 | |
c9e66eda | 53 | MASKED_ARRAY_FUNCTION(atype_max, |
80927a56 JJ |
54 | `#if defined ('atype_inf`) |
55 | result = atype_inf; | |
56 | #else | |
57 | result = atype_max; | |
58 | #endif | |
59 | #if defined ('atype_nan`) | |
60 | int non_empty_p = 0; | |
61 | #endif', | |
62 | `#if defined ('atype_inf`) || defined ('atype_nan`) | |
63 | if (*msrc) | |
64 | { | |
65 | #if defined ('atype_nan`) | |
66 | non_empty_p = 1; | |
67 | if (*src <= result) | |
68 | #endif | |
69 | break; | |
70 | } | |
71 | } | |
72 | if (unlikely (n >= len)) | |
73 | { | |
74 | #if defined ('atype_nan`) | |
75 | result = non_empty_p ? atype_nan : atype_max; | |
76 | #else | |
77 | result = atype_max; | |
78 | #endif | |
79 | } | |
80 | else for (; n < len; n++, src += delta, msrc += mdelta) | |
81 | { | |
82 | #endif | |
83 | if (*msrc && *src < result) | |
0cd0559e | 84 | result = *src;', `') |
6de9cd9a | 85 | |
97a62038 TK |
86 | SCALAR_ARRAY_FUNCTION(atype_max) |
87 | ||
644cb69f | 88 | #endif |