1 /* Implementation of the ANY intrinsic
2 Copyright (C) 2002-2021 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 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 3 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 General Public License for more details.
17 Under Section 7 of GPL version 3, you are granted additional
18 permissions described in the GCC Runtime Library Exception, version
19 3.1, as published by the Free Software Foundation.
21 You should have received a copy of the GNU General Public License and
22 a copy of the GCC Runtime Library Exception along with this program;
23 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 <http://www.gnu.org/licenses/>. */
26 #include "libgfortran.h"
29 #if defined (HAVE_GFC_LOGICAL_16)
32 extern void any_l16 (gfc_array_l16
* const restrict
,
33 gfc_array_l1
* const restrict
, const index_type
* const restrict
);
34 export_proto(any_l16
);
37 any_l16 (gfc_array_l16
* const restrict retarray
,
38 gfc_array_l1
* const restrict array
,
39 const index_type
* const restrict pdim
)
41 index_type count
[GFC_MAX_DIMENSIONS
];
42 index_type extent
[GFC_MAX_DIMENSIONS
];
43 index_type sstride
[GFC_MAX_DIMENSIONS
];
44 index_type dstride
[GFC_MAX_DIMENSIONS
];
45 const GFC_LOGICAL_1
* restrict base
;
46 GFC_LOGICAL_16
* restrict dest
;
55 /* Make dim zero based to avoid confusion. */
57 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
59 src_kind
= GFC_DESCRIPTOR_SIZE (array
);
61 len
= GFC_DESCRIPTOR_EXTENT(array
,dim
);
65 delta
= GFC_DESCRIPTOR_STRIDE_BYTES(array
,dim
);
67 for (n
= 0; n
< dim
; n
++)
69 sstride
[n
] = GFC_DESCRIPTOR_STRIDE_BYTES(array
,n
);
70 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
);
75 for (n
= dim
; n
< rank
; n
++)
77 sstride
[n
] = GFC_DESCRIPTOR_STRIDE_BYTES(array
,n
+ 1);
78 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
+ 1);
84 if (retarray
->base_addr
== NULL
)
86 size_t alloc_size
, str
;
88 for (n
= 0; n
< rank
; n
++)
93 str
= GFC_DESCRIPTOR_STRIDE(retarray
,n
-1) * extent
[n
-1];
95 GFC_DIMENSION_SET(retarray
->dim
[n
], 0, extent
[n
] - 1, str
);
100 retarray
->dtype
.rank
= rank
;
102 alloc_size
= GFC_DESCRIPTOR_STRIDE(retarray
,rank
-1) * extent
[rank
-1];
106 /* Make sure we have a zero-sized array. */
107 GFC_DIMENSION_SET(retarray
->dim
[0], 0, -1, 1);
111 retarray
->base_addr
= xmallocarray (alloc_size
, sizeof (GFC_LOGICAL_16
));
115 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
116 runtime_error ("rank of return array incorrect in"
117 " ANY intrinsic: is %ld, should be %ld",
118 (long int) GFC_DESCRIPTOR_RANK (retarray
),
121 if (unlikely (compile_options
.bounds_check
))
123 for (n
=0; n
< rank
; n
++)
125 index_type ret_extent
;
127 ret_extent
= GFC_DESCRIPTOR_EXTENT(retarray
,n
);
128 if (extent
[n
] != ret_extent
)
129 runtime_error ("Incorrect extent in return value of"
130 " ANY intrinsic in dimension %d:"
131 " is %ld, should be %ld", (int) n
+ 1,
132 (long int) ret_extent
, (long int) extent
[n
]);
137 for (n
= 0; n
< rank
; n
++)
140 dstride
[n
] = GFC_DESCRIPTOR_STRIDE(retarray
,n
);
145 base
= array
->base_addr
;
147 if (src_kind
== 1 || src_kind
== 2 || src_kind
== 4 || src_kind
== 8
148 #ifdef HAVE_GFC_LOGICAL_16
154 base
= GFOR_POINTER_TO_L1 (base
, src_kind
);
157 internal_error (NULL
, "Funny sized logical array in ANY intrinsic");
159 dest
= retarray
->base_addr
;
162 while (continue_loop
)
164 const GFC_LOGICAL_1
* restrict src
;
165 GFC_LOGICAL_16 result
;
174 for (n
= 0; n
< len
; n
++, src
+= delta
)
177 /* Return true if any of the elements are set. */
187 /* Advance to the next element. */
192 while (count
[n
] == extent
[n
])
194 /* When we get to the end of a dimension, reset it and increment
195 the next dimension. */
197 /* We could precalculate these products, but this is a less
198 frequently used path so probably not worth it. */
199 base
-= sstride
[n
] * extent
[n
];
200 dest
-= dstride
[n
] * extent
[n
];
204 /* Break out of the loop. */