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., 59 Temple Place - Suite 330,
29 Boston, MA 02111-1307, USA. */
35 #include "libgfortran.h"
38 extern void minval_i4 (gfc_array_i4
*, gfc_array_i4
*, index_type
*);
39 export_proto(minval_i4
);
42 minval_i4 (gfc_array_i4
*retarray
, gfc_array_i4
*array
, index_type
*pdim
)
44 index_type count
[GFC_MAX_DIMENSIONS
- 1];
45 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
46 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
47 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
56 /* Make dim zero based to avoid confusion. */
58 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
59 if (array
->dim
[0].stride
== 0)
60 array
->dim
[0].stride
= 1;
62 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
63 delta
= array
->dim
[dim
].stride
;
65 for (n
= 0; n
< dim
; n
++)
67 sstride
[n
] = array
->dim
[n
].stride
;
68 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
70 for (n
= dim
; n
< rank
; n
++)
72 sstride
[n
] = array
->dim
[n
+ 1].stride
;
74 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
77 if (retarray
->data
== NULL
)
79 for (n
= 0; n
< rank
; n
++)
81 retarray
->dim
[n
].lbound
= 0;
82 retarray
->dim
[n
].ubound
= extent
[n
]-1;
84 retarray
->dim
[n
].stride
= 1;
86 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
90 = internal_malloc_size (sizeof (GFC_INTEGER_4
)
91 * retarray
->dim
[rank
-1].stride
94 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
98 if (retarray
->dim
[0].stride
== 0)
99 retarray
->dim
[0].stride
= 1;
101 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
102 runtime_error ("rank of return array incorrect");
105 for (n
= 0; n
< rank
; n
++)
108 dstride
[n
] = retarray
->dim
[n
].stride
;
114 dest
= retarray
->data
;
119 GFC_INTEGER_4 result
;
123 result
= GFC_INTEGER_4_HUGE
;
125 *dest
= GFC_INTEGER_4_HUGE
;
128 for (n
= 0; n
< len
; n
++, src
+= delta
)
137 /* Advance to the next element. */
142 while (count
[n
] == extent
[n
])
144 /* When we get to the end of a dimension, reset it and increment
145 the next dimension. */
147 /* We could precalculate these products, but this is a less
148 frequently used path so proabably not worth it. */
149 base
-= sstride
[n
] * extent
[n
];
150 dest
-= dstride
[n
] * extent
[n
];
154 /* Break out of the look. */
169 extern void mminval_i4 (gfc_array_i4
*, gfc_array_i4
*, index_type
*,
171 export_proto(mminval_i4
);
174 mminval_i4 (gfc_array_i4
* retarray
, gfc_array_i4
* array
,
175 index_type
*pdim
, gfc_array_l4
* mask
)
177 index_type count
[GFC_MAX_DIMENSIONS
- 1];
178 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
179 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
180 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
181 index_type mstride
[GFC_MAX_DIMENSIONS
- 1];
184 GFC_LOGICAL_4
*mbase
;
193 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
194 if (array
->dim
[0].stride
== 0)
195 array
->dim
[0].stride
= 1;
197 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
200 delta
= array
->dim
[dim
].stride
;
201 mdelta
= mask
->dim
[dim
].stride
;
203 for (n
= 0; n
< dim
; n
++)
205 sstride
[n
] = array
->dim
[n
].stride
;
206 mstride
[n
] = mask
->dim
[n
].stride
;
207 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
209 for (n
= dim
; n
< rank
; n
++)
211 sstride
[n
] = array
->dim
[n
+ 1].stride
;
212 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
214 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
217 if (retarray
->data
== NULL
)
219 for (n
= 0; n
< rank
; n
++)
221 retarray
->dim
[n
].lbound
= 0;
222 retarray
->dim
[n
].ubound
= extent
[n
]-1;
224 retarray
->dim
[n
].stride
= 1;
226 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
230 = internal_malloc_size (sizeof (GFC_INTEGER_4
)
231 * retarray
->dim
[rank
-1].stride
234 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
238 if (retarray
->dim
[0].stride
== 0)
239 retarray
->dim
[0].stride
= 1;
241 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
242 runtime_error ("rank of return array incorrect");
245 for (n
= 0; n
< rank
; n
++)
248 dstride
[n
] = retarray
->dim
[n
].stride
;
253 dest
= retarray
->data
;
257 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
259 /* This allows the same loop to be used for all logical types. */
260 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
261 for (n
= 0; n
< rank
; n
++)
264 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
271 GFC_INTEGER_4 result
;
276 result
= GFC_INTEGER_4_HUGE
;
278 *dest
= GFC_INTEGER_4_HUGE
;
281 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
284 if (*msrc
&& *src
< result
)
290 /* Advance to the next element. */
296 while (count
[n
] == extent
[n
])
298 /* When we get to the end of a dimension, reset it and increment
299 the next dimension. */
301 /* We could precalculate these products, but this is a less
302 frequently used path so proabably not worth it. */
303 base
-= sstride
[n
] * extent
[n
];
304 mbase
-= mstride
[n
] * extent
[n
];
305 dest
-= dstride
[n
] * extent
[n
];
309 /* Break out of the look. */