]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/generated/maxloc1_4_i8.c
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 extern void maxloc1_4_i8 (gfc_array_i4
*, gfc_array_i8
*, index_type
*);
31 export_proto(maxloc1_4_i8
);
34 maxloc1_4_i8 (gfc_array_i4
*retarray
, gfc_array_i8
*array
, index_type
*pdim
)
36 index_type count
[GFC_MAX_DIMENSIONS
- 1];
37 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
38 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
39 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
48 /* Make dim zero based to avoid confusion. */
50 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
51 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
52 if (array
->dim
[0].stride
== 0)
53 array
->dim
[0].stride
= 1;
54 if (retarray
->dim
[0].stride
== 0)
55 retarray
->dim
[0].stride
= 1;
57 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
58 delta
= array
->dim
[dim
].stride
;
60 for (n
= 0; n
< dim
; n
++)
62 sstride
[n
] = array
->dim
[n
].stride
;
63 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
65 for (n
= dim
; n
< rank
; n
++)
67 sstride
[n
] = array
->dim
[n
+ 1].stride
;
69 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
72 if (retarray
->data
== NULL
)
74 for (n
= 0; n
< rank
; n
++)
76 retarray
->dim
[n
].lbound
= 0;
77 retarray
->dim
[n
].ubound
= extent
[n
]-1;
79 retarray
->dim
[n
].stride
= 1;
81 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
85 = internal_malloc_size (sizeof (GFC_INTEGER_4
)
86 * retarray
->dim
[rank
-1].stride
91 for (n
= 0; n
< rank
; n
++)
94 dstride
[n
] = retarray
->dim
[n
].stride
;
100 dest
= retarray
->data
;
105 GFC_INTEGER_4 result
;
109 GFC_INTEGER_8 maxval
;
110 maxval
= -GFC_INTEGER_8_HUGE
;
116 for (n
= 0; n
< len
; n
++, src
+= delta
)
122 result
= (GFC_INTEGER_4
)n
+ 1;
128 /* Advance to the next element. */
133 while (count
[n
] == extent
[n
])
135 /* When we get to the end of a dimension, reset it and increment
136 the next dimension. */
138 /* We could precalculate these products, but this is a less
139 frequently used path so proabably not worth it. */
140 base
-= sstride
[n
] * extent
[n
];
141 dest
-= dstride
[n
] * extent
[n
];
145 /* Break out of the look. */
160 extern void mmaxloc1_4_i8 (gfc_array_i4
*, gfc_array_i8
*, index_type
*,
162 export_proto(mmaxloc1_4_i8
);
165 mmaxloc1_4_i8 (gfc_array_i4
* retarray
, gfc_array_i8
* array
,
166 index_type
*pdim
, gfc_array_l4
* mask
)
168 index_type count
[GFC_MAX_DIMENSIONS
- 1];
169 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
170 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
171 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
172 index_type mstride
[GFC_MAX_DIMENSIONS
- 1];
175 GFC_LOGICAL_4
*mbase
;
184 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
185 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
186 if (array
->dim
[0].stride
== 0)
187 array
->dim
[0].stride
= 1;
188 if (retarray
->dim
[0].stride
== 0)
189 retarray
->dim
[0].stride
= 1;
191 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
194 delta
= array
->dim
[dim
].stride
;
195 mdelta
= mask
->dim
[dim
].stride
;
197 for (n
= 0; n
< dim
; n
++)
199 sstride
[n
] = array
->dim
[n
].stride
;
200 mstride
[n
] = mask
->dim
[n
].stride
;
201 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
203 for (n
= dim
; n
< rank
; n
++)
205 sstride
[n
] = array
->dim
[n
+ 1].stride
;
206 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
208 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
211 for (n
= 0; n
< rank
; n
++)
214 dstride
[n
] = retarray
->dim
[n
].stride
;
219 dest
= retarray
->data
;
223 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
225 /* This allows the same loop to be used for all logical types. */
226 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
227 for (n
= 0; n
< rank
; n
++)
230 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
237 GFC_INTEGER_4 result
;
242 GFC_INTEGER_8 maxval
;
243 maxval
= -GFC_INTEGER_8_HUGE
;
249 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
252 if (*msrc
&& *src
> maxval
)
255 result
= (GFC_INTEGER_4
)n
+ 1;
261 /* Advance to the next element. */
267 while (count
[n
] == extent
[n
])
269 /* When we get to the end of a dimension, reset it and increment
270 the next dimension. */
272 /* We could precalculate these products, but this is a less
273 frequently used path so proabably not worth it. */
274 base
-= sstride
[n
] * extent
[n
];
275 mbase
-= mstride
[n
] * extent
[n
];
276 dest
-= dstride
[n
] * extent
[n
];
280 /* Break out of the look. */