]>
Commit | Line | Data |
---|---|---|
1a0fd3d3 | 1 | /* Implementation of the PARITY intrinsic |
818ab71a | 2 | Copyright (C) 2010-2016 Free Software Foundation, Inc. |
0cd0559e TB |
3 | Contributed by Tobias Burnus <burnus@net-b.de> |
4 | ||
5 | This file is part of the GNU Fortran runtime library (libgfortran). | |
6 | ||
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. | |
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 | |
15 | GNU General Public License for more details. | |
16 | ||
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/>. */ | |
25 | ||
26 | #include "libgfortran.h" | |
0cd0559e TB |
27 | |
28 | ||
29 | #if defined (HAVE_GFC_LOGICAL_1) && defined (HAVE_GFC_LOGICAL_1) | |
30 | ||
31 | ||
32 | extern void parity_l1 (gfc_array_l1 * const restrict, | |
33 | gfc_array_l1 * const restrict, const index_type * const restrict); | |
34 | export_proto(parity_l1); | |
35 | ||
36 | void | |
37 | parity_l1 (gfc_array_l1 * const restrict retarray, | |
38 | gfc_array_l1 * const restrict array, | |
39 | const index_type * const restrict pdim) | |
40 | { | |
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_1 * restrict dest; | |
47 | index_type rank; | |
48 | index_type n; | |
49 | index_type len; | |
50 | index_type delta; | |
51 | index_type dim; | |
52 | int continue_loop; | |
53 | ||
54 | /* Make dim zero based to avoid confusion. */ | |
55 | dim = (*pdim) - 1; | |
56 | rank = GFC_DESCRIPTOR_RANK (array) - 1; | |
57 | ||
58 | len = GFC_DESCRIPTOR_EXTENT(array,dim); | |
59 | if (len < 0) | |
60 | len = 0; | |
61 | delta = GFC_DESCRIPTOR_STRIDE(array,dim); | |
62 | ||
63 | for (n = 0; n < dim; n++) | |
64 | { | |
65 | sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n); | |
66 | extent[n] = GFC_DESCRIPTOR_EXTENT(array,n); | |
67 | ||
68 | if (extent[n] < 0) | |
69 | extent[n] = 0; | |
70 | } | |
71 | for (n = dim; n < rank; n++) | |
72 | { | |
73 | sstride[n] = GFC_DESCRIPTOR_STRIDE(array, n + 1); | |
74 | extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1); | |
75 | ||
76 | if (extent[n] < 0) | |
77 | extent[n] = 0; | |
78 | } | |
79 | ||
21d1335b | 80 | if (retarray->base_addr == NULL) |
0cd0559e TB |
81 | { |
82 | size_t alloc_size, str; | |
83 | ||
84 | for (n = 0; n < rank; n++) | |
85 | { | |
86 | if (n == 0) | |
87 | str = 1; | |
88 | else | |
89 | str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1]; | |
90 | ||
91 | GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str); | |
92 | ||
93 | } | |
94 | ||
95 | retarray->offset = 0; | |
96 | retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank; | |
97 | ||
92e6f3a4 | 98 | alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1]; |
0cd0559e | 99 | |
92e6f3a4 | 100 | retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_LOGICAL_1)); |
0cd0559e TB |
101 | if (alloc_size == 0) |
102 | { | |
103 | /* Make sure we have a zero-sized array. */ | |
104 | GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1); | |
105 | return; | |
106 | ||
107 | } | |
0cd0559e TB |
108 | } |
109 | else | |
110 | { | |
111 | if (rank != GFC_DESCRIPTOR_RANK (retarray)) | |
112 | runtime_error ("rank of return array incorrect in" | |
113 | " PARITY intrinsic: is %ld, should be %ld", | |
114 | (long int) (GFC_DESCRIPTOR_RANK (retarray)), | |
115 | (long int) rank); | |
116 | ||
117 | if (unlikely (compile_options.bounds_check)) | |
118 | bounds_ifunction_return ((array_t *) retarray, extent, | |
119 | "return value", "PARITY"); | |
120 | } | |
121 | ||
122 | for (n = 0; n < rank; n++) | |
123 | { | |
124 | count[n] = 0; | |
125 | dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n); | |
126 | if (extent[n] <= 0) | |
3d2244b9 | 127 | return; |
0cd0559e TB |
128 | } |
129 | ||
21d1335b TB |
130 | base = array->base_addr; |
131 | dest = retarray->base_addr; | |
0cd0559e TB |
132 | |
133 | continue_loop = 1; | |
134 | while (continue_loop) | |
135 | { | |
136 | const GFC_LOGICAL_1 * restrict src; | |
137 | GFC_LOGICAL_1 result; | |
138 | src = base; | |
139 | { | |
140 | ||
141 | result = 0; | |
142 | if (len <= 0) | |
143 | *dest = 0; | |
144 | else | |
145 | { | |
146 | for (n = 0; n < len; n++, src += delta) | |
147 | { | |
148 | ||
149 | result = result != *src; | |
150 | } | |
151 | ||
152 | *dest = result; | |
153 | } | |
154 | } | |
155 | /* Advance to the next element. */ | |
156 | count[0]++; | |
157 | base += sstride[0]; | |
158 | dest += dstride[0]; | |
159 | n = 0; | |
160 | while (count[n] == extent[n]) | |
161 | { | |
162 | /* When we get to the end of a dimension, reset it and increment | |
163 | the next dimension. */ | |
164 | count[n] = 0; | |
165 | /* We could precalculate these products, but this is a less | |
166 | frequently used path so probably not worth it. */ | |
167 | base -= sstride[n] * extent[n]; | |
168 | dest -= dstride[n] * extent[n]; | |
169 | n++; | |
170 | if (n == rank) | |
171 | { | |
172 | /* Break out of the look. */ | |
173 | continue_loop = 0; | |
174 | break; | |
175 | } | |
176 | else | |
177 | { | |
178 | count[n]++; | |
179 | base += sstride[n]; | |
180 | dest += dstride[n]; | |
181 | } | |
182 | } | |
183 | } | |
184 | } | |
185 | ||
186 | #endif |