1 /* Implementation of the MAXLOC 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"
30 __maxloc1_4_r8 (gfc_array_i4
* retarray
, gfc_array_r8
*array
, index_type
*pdim
)
32 index_type count
[GFC_MAX_DIMENSIONS
- 1];
33 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
34 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
35 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
44 /* Make dim zero based to avoid confusion. */
46 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
47 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
48 if (array
->dim
[0].stride
== 0)
49 array
->dim
[0].stride
= 1;
50 if (retarray
->dim
[0].stride
== 0)
51 retarray
->dim
[0].stride
= 1;
53 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
54 delta
= array
->dim
[dim
].stride
;
56 for (n
= 0; n
< dim
; n
++)
58 sstride
[n
] = array
->dim
[n
].stride
;
59 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
61 for (n
= dim
; n
< rank
; n
++)
63 sstride
[n
] = array
->dim
[n
+ 1].stride
;
65 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
68 for (n
= 0; n
< rank
; n
++)
71 dstride
[n
] = retarray
->dim
[n
].stride
;
77 dest
= retarray
->data
;
87 maxval
= -GFC_REAL_8_HUGE
;
93 for (n
= 0; n
< len
; n
++, src
+= delta
)
99 result
= (GFC_INTEGER_4
)n
+ 1;
105 /* Advance to the next element. */
110 while (count
[n
] == extent
[n
])
112 /* When we get to the end of a dimension, reset it and increment
113 the next dimension. */
115 /* We could precalculate these products, but this is a less
116 frequently used path so proabably not worth it. */
117 base
-= sstride
[n
] * extent
[n
];
118 dest
-= dstride
[n
] * extent
[n
];
122 /* Break out of the look. */
137 __mmaxloc1_4_r8 (gfc_array_i4
* retarray
, gfc_array_r8
* array
, index_type
*pdim
, gfc_array_l4
* mask
)
139 index_type count
[GFC_MAX_DIMENSIONS
- 1];
140 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
141 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
142 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
143 index_type mstride
[GFC_MAX_DIMENSIONS
- 1];
146 GFC_LOGICAL_4
*mbase
;
155 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
156 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
157 if (array
->dim
[0].stride
== 0)
158 array
->dim
[0].stride
= 1;
159 if (retarray
->dim
[0].stride
== 0)
160 retarray
->dim
[0].stride
= 1;
162 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
165 delta
= array
->dim
[dim
].stride
;
166 mdelta
= mask
->dim
[dim
].stride
;
168 for (n
= 0; n
< dim
; n
++)
170 sstride
[n
] = array
->dim
[n
].stride
;
171 mstride
[n
] = mask
->dim
[n
].stride
;
172 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
174 for (n
= dim
; n
< rank
; n
++)
176 sstride
[n
] = array
->dim
[n
+ 1].stride
;
177 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
179 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
182 for (n
= 0; n
< rank
; n
++)
185 dstride
[n
] = retarray
->dim
[n
].stride
;
190 dest
= retarray
->data
;
194 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
196 /* This allows the same loop to be used for all logical types. */
197 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
198 for (n
= 0; n
< rank
; n
++)
201 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
208 GFC_INTEGER_4 result
;
214 maxval
= -GFC_REAL_8_HUGE
;
220 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
223 if (*msrc
&& *src
> maxval
)
226 result
= (GFC_INTEGER_4
)n
+ 1;
232 /* Advance to the next element. */
238 while (count
[n
] == extent
[n
])
240 /* When we get to the end of a dimension, reset it and increment
241 the next dimension. */
243 /* We could precalculate these products, but this is a less
244 frequently used path so proabably not worth it. */
245 base
-= sstride
[n
] * extent
[n
];
246 mbase
-= mstride
[n
] * extent
[n
];
247 dest
-= dstride
[n
] * extent
[n
];
251 /* Break out of the look. */