]>
Commit | Line | Data |
---|---|---|
76b9f891 | 1 | /* Implementation of the ANY intrinsic |
f1717362 | 2 | Copyright (C) 2002-2016 Free Software Foundation, Inc. |
4ee9c684 | 3 | Contributed by Paul Brook <paul@nowt.org> |
4 | ||
b4ba8232 | 5 | This file is part of the GNU Fortran runtime library (libgfortran). |
4ee9c684 | 6 | |
7 | Libgfortran is free software; you can redistribute it and/or | |
b417ea8c | 8 | modify it under the terms of the GNU General Public |
4ee9c684 | 9 | License as published by the Free Software Foundation; either |
6bc9506f | 10 | version 3 of the License, or (at your option) any later version. |
4ee9c684 | 11 | |
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 | |
b417ea8c | 15 | GNU General Public License for more details. |
4ee9c684 | 16 | |
6bc9506f | 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. | |
20 | ||
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/>. */ | |
4ee9c684 | 25 | |
41f2d5e8 | 26 | #include "libgfortran.h" |
4ee9c684 | 27 | #include <stdlib.h> |
28 | #include <assert.h> | |
4ee9c684 | 29 | |
7b6cb5bd | 30 | |
76b9f891 | 31 | #if defined (HAVE_GFC_LOGICAL_2) |
920e54ef | 32 | |
33 | ||
76b9f891 | 34 | extern void any_l2 (gfc_array_l2 * const restrict, |
35 | gfc_array_l1 * const restrict, const index_type * const restrict); | |
36 | export_proto(any_l2); | |
7b6cb5bd | 37 | |
4ee9c684 | 38 | void |
76b9f891 | 39 | any_l2 (gfc_array_l2 * const restrict retarray, |
40 | gfc_array_l1 * const restrict array, | |
b4cafd67 | 41 | const index_type * const restrict pdim) |
4ee9c684 | 42 | { |
9130521e | 43 | index_type count[GFC_MAX_DIMENSIONS]; |
44 | index_type extent[GFC_MAX_DIMENSIONS]; | |
45 | index_type sstride[GFC_MAX_DIMENSIONS]; | |
46 | index_type dstride[GFC_MAX_DIMENSIONS]; | |
76b9f891 | 47 | const GFC_LOGICAL_1 * restrict base; |
48 | GFC_LOGICAL_2 * restrict dest; | |
4ee9c684 | 49 | index_type rank; |
50 | index_type n; | |
51 | index_type len; | |
52 | index_type delta; | |
53 | index_type dim; | |
76b9f891 | 54 | int src_kind; |
393a1b6c | 55 | int continue_loop; |
4ee9c684 | 56 | |
57 | /* Make dim zero based to avoid confusion. */ | |
58 | dim = (*pdim) - 1; | |
59 | rank = GFC_DESCRIPTOR_RANK (array) - 1; | |
b87be38a | 60 | |
76b9f891 | 61 | src_kind = GFC_DESCRIPTOR_SIZE (array); |
62 | ||
827aef63 | 63 | len = GFC_DESCRIPTOR_EXTENT(array,dim); |
393a1b6c | 64 | if (len < 0) |
65 | len = 0; | |
66 | ||
827aef63 | 67 | delta = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim); |
4ee9c684 | 68 | |
69 | for (n = 0; n < dim; n++) | |
70 | { | |
827aef63 | 71 | sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n); |
72 | extent[n] = GFC_DESCRIPTOR_EXTENT(array,n); | |
a14c06e9 | 73 | |
74 | if (extent[n] < 0) | |
75 | extent[n] = 0; | |
4ee9c684 | 76 | } |
77 | for (n = dim; n < rank; n++) | |
78 | { | |
827aef63 | 79 | sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n + 1); |
80 | extent[n] = GFC_DESCRIPTOR_EXTENT(array,n + 1); | |
a14c06e9 | 81 | |
82 | if (extent[n] < 0) | |
83 | extent[n] = 0; | |
4ee9c684 | 84 | } |
85 | ||
553877d9 | 86 | if (retarray->base_addr == NULL) |
5fcc57ce | 87 | { |
827aef63 | 88 | size_t alloc_size, str; |
a14c06e9 | 89 | |
5fcc57ce | 90 | for (n = 0; n < rank; n++) |
91 | { | |
5fcc57ce | 92 | if (n == 0) |
827aef63 | 93 | str = 1; |
5fcc57ce | 94 | else |
827aef63 | 95 | str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1]; |
96 | ||
97 | GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str); | |
98 | ||
5fcc57ce | 99 | } |
100 | ||
93830de1 | 101 | retarray->offset = 0; |
07ea8faa | 102 | retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank; |
a14c06e9 | 103 | |
af1e9051 | 104 | alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1]; |
a14c06e9 | 105 | |
106 | if (alloc_size == 0) | |
107 | { | |
108 | /* Make sure we have a zero-sized array. */ | |
827aef63 | 109 | GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1); |
a14c06e9 | 110 | return; |
111 | } | |
112 | else | |
af1e9051 | 113 | retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_LOGICAL_2)); |
5fcc57ce | 114 | } |
07ea8faa | 115 | else |
116 | { | |
07ea8faa | 117 | if (rank != GFC_DESCRIPTOR_RANK (retarray)) |
8dec97a0 | 118 | runtime_error ("rank of return array incorrect in" |
686509f7 | 119 | " ANY intrinsic: is %ld, should be %ld", |
120 | (long int) GFC_DESCRIPTOR_RANK (retarray), | |
121 | (long int) rank); | |
8dec97a0 | 122 | |
c7fb575f | 123 | if (unlikely (compile_options.bounds_check)) |
8dec97a0 | 124 | { |
125 | for (n=0; n < rank; n++) | |
126 | { | |
127 | index_type ret_extent; | |
128 | ||
827aef63 | 129 | ret_extent = GFC_DESCRIPTOR_EXTENT(retarray,n); |
8dec97a0 | 130 | if (extent[n] != ret_extent) |
131 | runtime_error ("Incorrect extent in return value of" | |
76b9f891 | 132 | " ANY intrinsic in dimension %d:" |
6f3a0779 | 133 | " is %ld, should be %ld", (int) n + 1, |
8dec97a0 | 134 | (long int) ret_extent, (long int) extent[n]); |
135 | } | |
136 | } | |
07ea8faa | 137 | } |
138 | ||
4ee9c684 | 139 | for (n = 0; n < rank; n++) |
140 | { | |
141 | count[n] = 0; | |
827aef63 | 142 | dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n); |
4ee9c684 | 143 | if (extent[n] <= 0) |
7cbf86e5 | 144 | return; |
4ee9c684 | 145 | } |
146 | ||
553877d9 | 147 | base = array->base_addr; |
76b9f891 | 148 | |
149 | if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8 | |
150 | #ifdef HAVE_GFC_LOGICAL_16 | |
151 | || src_kind == 16 | |
152 | #endif | |
153 | ) | |
154 | { | |
155 | if (base) | |
156 | base = GFOR_POINTER_TO_L1 (base, src_kind); | |
157 | } | |
158 | else | |
159 | internal_error (NULL, "Funny sized logical array in ANY intrinsic"); | |
160 | ||
553877d9 | 161 | dest = retarray->base_addr; |
4ee9c684 | 162 | |
393a1b6c | 163 | continue_loop = 1; |
164 | while (continue_loop) | |
4ee9c684 | 165 | { |
76b9f891 | 166 | const GFC_LOGICAL_1 * restrict src; |
167 | GFC_LOGICAL_2 result; | |
4ee9c684 | 168 | src = base; |
169 | { | |
170 | ||
171 | result = 0; | |
172 | if (len <= 0) | |
173 | *dest = 0; | |
174 | else | |
175 | { | |
176 | for (n = 0; n < len; n++, src += delta) | |
177 | { | |
178 | ||
76b9f891 | 179 | /* Return true if any of the elements are set. */ |
4ee9c684 | 180 | if (*src) |
76b9f891 | 181 | { |
182 | result = 1; | |
183 | break; | |
184 | } | |
4ee9c684 | 185 | } |
186 | *dest = result; | |
187 | } | |
188 | } | |
189 | /* Advance to the next element. */ | |
190 | count[0]++; | |
191 | base += sstride[0]; | |
192 | dest += dstride[0]; | |
193 | n = 0; | |
194 | while (count[n] == extent[n]) | |
195 | { | |
196 | /* When we get to the end of a dimension, reset it and increment | |
197 | the next dimension. */ | |
198 | count[n] = 0; | |
199 | /* We could precalculate these products, but this is a less | |
e4f51eaa | 200 | frequently used path so probably not worth it. */ |
4ee9c684 | 201 | base -= sstride[n] * extent[n]; |
202 | dest -= dstride[n] * extent[n]; | |
203 | n++; | |
204 | if (n == rank) | |
205 | { | |
206 | /* Break out of the look. */ | |
393a1b6c | 207 | continue_loop = 0; |
4ee9c684 | 208 | break; |
209 | } | |
210 | else | |
211 | { | |
212 | count[n]++; | |
213 | base += sstride[n]; | |
214 | dest += dstride[n]; | |
215 | } | |
216 | } | |
217 | } | |
218 | } | |
219 | ||
920e54ef | 220 | #endif |