]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/generated/minloc1_4_r4.c
1 /* Implementation of the MINLOC 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"
31 __minloc1_4_r4 (gfc_array_i4
* retarray
, gfc_array_r4
*array
, index_type
*pdim
)
33 index_type count
[GFC_MAX_DIMENSIONS
- 1];
34 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
35 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
36 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
45 /* Make dim zero based to avoid confusion. */
47 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
48 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
49 if (array
->dim
[0].stride
== 0)
50 array
->dim
[0].stride
= 1;
51 if (retarray
->dim
[0].stride
== 0)
52 retarray
->dim
[0].stride
= 1;
54 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
55 delta
= array
->dim
[dim
].stride
;
57 for (n
= 0; n
< dim
; n
++)
59 sstride
[n
] = array
->dim
[n
].stride
;
60 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
62 for (n
= dim
; n
< rank
; n
++)
64 sstride
[n
] = array
->dim
[n
+ 1].stride
;
66 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
69 for (n
= 0; n
< rank
; n
++)
72 dstride
[n
] = retarray
->dim
[n
].stride
;
78 dest
= retarray
->data
;
88 minval
= GFC_REAL_4_HUGE
;
94 for (n
= 0; n
< len
; n
++, src
+= delta
)
100 result
= (GFC_INTEGER_4
)n
+ 1;
106 /* Advance to the next element. */
111 while (count
[n
] == extent
[n
])
113 /* When we get to the end of a dimension, reset it and increment
114 the next dimension. */
116 /* We could precalculate these products, but this is a less
117 frequently used path so proabably not worth it. */
118 base
-= sstride
[n
] * extent
[n
];
119 dest
-= dstride
[n
] * extent
[n
];
123 /* Break out of the look. */
138 __mminloc1_4_r4 (gfc_array_i4
* retarray
, gfc_array_r4
* array
, index_type
*pdim
, gfc_array_l4
* mask
)
140 index_type count
[GFC_MAX_DIMENSIONS
- 1];
141 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
142 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
143 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
144 index_type mstride
[GFC_MAX_DIMENSIONS
- 1];
147 GFC_LOGICAL_4
*mbase
;
156 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
157 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
158 if (array
->dim
[0].stride
== 0)
159 array
->dim
[0].stride
= 1;
160 if (retarray
->dim
[0].stride
== 0)
161 retarray
->dim
[0].stride
= 1;
163 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
166 delta
= array
->dim
[dim
].stride
;
167 mdelta
= mask
->dim
[dim
].stride
;
169 for (n
= 0; n
< dim
; n
++)
171 sstride
[n
] = array
->dim
[n
].stride
;
172 mstride
[n
] = mask
->dim
[n
].stride
;
173 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
175 for (n
= dim
; n
< rank
; n
++)
177 sstride
[n
] = array
->dim
[n
+ 1].stride
;
178 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
180 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
183 for (n
= 0; n
< rank
; n
++)
186 dstride
[n
] = retarray
->dim
[n
].stride
;
191 dest
= retarray
->data
;
195 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
197 /* This allows the same loop to be used for all logical types. */
198 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
199 for (n
= 0; n
< rank
; n
++)
202 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
209 GFC_INTEGER_4 result
;
215 minval
= GFC_REAL_4_HUGE
;
221 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
224 if (*msrc
&& *src
< minval
)
227 result
= (GFC_INTEGER_4
)n
+ 1;
233 /* Advance to the next element. */
239 while (count
[n
] == extent
[n
])
241 /* When we get to the end of a dimension, reset it and increment
242 the next dimension. */
244 /* We could precalculate these products, but this is a less
245 frequently used path so proabably not worth it. */
246 base
-= sstride
[n
] * extent
[n
];
247 mbase
-= mstride
[n
] * extent
[n
];
248 dest
-= dstride
[n
] * extent
[n
];
252 /* Break out of the look. */