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 (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. */
36 #include "libgfortran.h"
40 extern void minloc0_4_r4 (gfc_array_i4
* retarray
, gfc_array_r4
*array
);
41 export_proto(minloc0_4_r4
);
44 minloc0_4_r4 (gfc_array_i4
* retarray
, gfc_array_r4
*array
)
46 index_type count
[GFC_MAX_DIMENSIONS
];
47 index_type extent
[GFC_MAX_DIMENSIONS
];
48 index_type sstride
[GFC_MAX_DIMENSIONS
];
55 rank
= GFC_DESCRIPTOR_RANK (array
);
57 runtime_error ("Rank of array needs to be > 0");
59 if (retarray
->data
== NULL
)
61 retarray
->dim
[0].lbound
= 0;
62 retarray
->dim
[0].ubound
= rank
-1;
63 retarray
->dim
[0].stride
= 1;
64 retarray
->dtype
= (retarray
->dtype
& ~GFC_DTYPE_RANK_MASK
) | 1;
66 retarray
->data
= internal_malloc_size (sizeof (GFC_INTEGER_4
) * rank
);
70 if (GFC_DESCRIPTOR_RANK (retarray
) != 1)
71 runtime_error ("rank of return array does not equal 1");
73 if (retarray
->dim
[0].ubound
+ 1 - retarray
->dim
[0].lbound
!= rank
)
74 runtime_error ("dimension of return array incorrect");
76 if (retarray
->dim
[0].stride
== 0)
77 retarray
->dim
[0].stride
= 1;
79 if (array
->dim
[0].stride
== 0)
80 array
->dim
[0].stride
= 1;
82 dstride
= retarray
->dim
[0].stride
;
83 dest
= retarray
->data
;
84 for (n
= 0; n
< rank
; n
++)
86 sstride
[n
] = array
->dim
[n
].stride
;
87 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
91 /* Set the return value. */
92 for (n
= 0; n
< rank
; n
++)
93 dest
[n
* dstride
] = 0;
100 /* Initialize the return value. */
101 for (n
= 0; n
< rank
; n
++)
102 dest
[n
* dstride
] = 1;
107 minval
= GFC_REAL_4_HUGE
;
112 /* Implementation start. */
117 for (n
= 0; n
< rank
; n
++)
118 dest
[n
* dstride
] = count
[n
] + 1;
120 /* Implementation end. */
122 /* Advance to the next element. */
126 while (count
[n
] == extent
[n
])
128 /* When we get to the end of a dimension, reset it and increment
129 the next dimension. */
131 /* We could precalculate these products, but this is a less
132 frequently used path so proabably not worth it. */
133 base
-= sstride
[n
] * extent
[n
];
137 /* Break out of the loop. */
152 extern void mminloc0_4_r4 (gfc_array_i4
*, gfc_array_r4
*, gfc_array_l4
*);
153 export_proto(mminloc0_4_r4
);
156 mminloc0_4_r4 (gfc_array_i4
* retarray
, gfc_array_r4
*array
,
159 index_type count
[GFC_MAX_DIMENSIONS
];
160 index_type extent
[GFC_MAX_DIMENSIONS
];
161 index_type sstride
[GFC_MAX_DIMENSIONS
];
162 index_type mstride
[GFC_MAX_DIMENSIONS
];
166 GFC_LOGICAL_4
*mbase
;
170 rank
= GFC_DESCRIPTOR_RANK (array
);
172 runtime_error ("Rank of array needs to be > 0");
174 if (retarray
->data
== NULL
)
176 retarray
->dim
[0].lbound
= 0;
177 retarray
->dim
[0].ubound
= rank
-1;
178 retarray
->dim
[0].stride
= 1;
179 retarray
->dtype
= (retarray
->dtype
& ~GFC_DTYPE_RANK_MASK
) | 1;
181 retarray
->data
= internal_malloc_size (sizeof (GFC_INTEGER_4
) * rank
);
185 if (GFC_DESCRIPTOR_RANK (retarray
) != 1)
186 runtime_error ("rank of return array does not equal 1");
188 if (retarray
->dim
[0].ubound
+ 1 - retarray
->dim
[0].lbound
!= rank
)
189 runtime_error ("dimension of return array incorrect");
191 if (retarray
->dim
[0].stride
== 0)
192 retarray
->dim
[0].stride
= 1;
195 if (array
->dim
[0].stride
== 0)
196 array
->dim
[0].stride
= 1;
198 dstride
= retarray
->dim
[0].stride
;
199 dest
= retarray
->data
;
200 for (n
= 0; n
< rank
; n
++)
202 sstride
[n
] = array
->dim
[n
].stride
;
203 mstride
[n
] = mask
->dim
[n
].stride
;
204 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
208 /* Set the return value. */
209 for (n
= 0; n
< rank
; n
++)
210 dest
[n
* dstride
] = 0;
218 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
220 /* This allows the same loop to be used for all logical types. */
221 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
222 for (n
= 0; n
< rank
; n
++)
224 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
228 /* Initialize the return value. */
229 for (n
= 0; n
< rank
; n
++)
230 dest
[n
* dstride
] = 1;
235 minval
= GFC_REAL_4_HUGE
;
240 /* Implementation start. */
242 if (*mbase
&& *base
< minval
)
245 for (n
= 0; n
< rank
; n
++)
246 dest
[n
* dstride
] = count
[n
] + 1;
248 /* Implementation end. */
250 /* Advance to the next element. */
255 while (count
[n
] == extent
[n
])
257 /* When we get to the end of a dimension, reset it and increment
258 the next dimension. */
260 /* We could precalculate these products, but this is a less
261 frequently used path so proabably not worth it. */
262 base
-= sstride
[n
] * extent
[n
];
263 mbase
-= mstride
[n
] * extent
[n
];
267 /* Break out of the loop. */