1 /* Implementation of the PARITY intrinsic
2 Copyright (C) 2010-2018 Free Software Foundation, Inc.
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"
27
28
29 #if defined (HAVE_GFC_LOGICAL_16) && defined (HAVE_GFC_LOGICAL_16)
30
31
32 extern void parity_l16 (gfc_array_l16 * const restrict,
33 gfc_array_l16 * const restrict, const index_type * const restrict);
34 export_proto(parity_l16);
35
36 void
parity_l16(gfc_array_l16 * const restrict retarray,gfc_array_l16 * const restrict array,const index_type * const restrict pdim)37 parity_l16 (gfc_array_l16 * const restrict retarray,
38 gfc_array_l16 * 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_16 * restrict base;
46 GFC_LOGICAL_16 * 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 #ifdef HAVE_BACK_ARG
55 assert(back == 0);
56 #endif
57
58 /* Make dim zero based to avoid confusion. */
59 rank = GFC_DESCRIPTOR_RANK (array) - 1;
60 dim = (*pdim) - 1;
61
62 if (unlikely (dim < 0 || dim > rank))
63 {
64 runtime_error ("Dim argument incorrect in PARITY intrinsic: "
65 "is %ld, should be between 1 and %ld",
66 (long int) dim + 1, (long int) rank + 1);
67 }
68
69 len = GFC_DESCRIPTOR_EXTENT(array,dim);
70 if (len < 0)
71 len = 0;
72 delta = GFC_DESCRIPTOR_STRIDE(array,dim);
73
74 for (n = 0; n < dim; n++)
75 {
76 sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
77 extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
78
79 if (extent[n] < 0)
80 extent[n] = 0;
81 }
82 for (n = dim; n < rank; n++)
83 {
84 sstride[n] = GFC_DESCRIPTOR_STRIDE(array, n + 1);
85 extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);
86
87 if (extent[n] < 0)
88 extent[n] = 0;
89 }
90
91 if (retarray->base_addr == NULL)
92 {
93 size_t alloc_size, str;
94
95 for (n = 0; n < rank; n++)
96 {
97 if (n == 0)
98 str = 1;
99 else
100 str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
101
102 GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
103
104 }
105
106 retarray->offset = 0;
107 retarray->dtype.rank = rank;
108
109 alloc_size = GFC_DESCRIPTOR_STRIDE(retarray,rank-1) * extent[rank-1];
110
111 retarray->base_addr = xmallocarray (alloc_size, sizeof (GFC_LOGICAL_16));
112 if (alloc_size == 0)
113 {
114 /* Make sure we have a zero-sized array. */
115 GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
116 return;
117
118 }
119 }
120 else
121 {
122 if (rank != GFC_DESCRIPTOR_RANK (retarray))
123 runtime_error ("rank of return array incorrect in"
124 " PARITY intrinsic: is %ld, should be %ld",
125 (long int) (GFC_DESCRIPTOR_RANK (retarray)),
126 (long int) rank);
127
128 if (unlikely (compile_options.bounds_check))
129 bounds_ifunction_return ((array_t *) retarray, extent,
130 "return value", "PARITY");
131 }
132
133 for (n = 0; n < rank; n++)
134 {
135 count[n] = 0;
136 dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
137 if (extent[n] <= 0)
138 return;
139 }
140
141 base = array->base_addr;
142 dest = retarray->base_addr;
143
144 continue_loop = 1;
145 while (continue_loop)
146 {
147 const GFC_LOGICAL_16 * restrict src;
148 GFC_LOGICAL_16 result;
149 src = base;
150 {
151
152 result = 0;
153 if (len <= 0)
154 *dest = 0;
155 else
156 {
157 for (n = 0; n < len; n++, src += delta)
158 {
159
160 result = result != *src;
161 }
162
163 *dest = result;
164 }
165 }
166 /* Advance to the next element. */
167 count[0]++;
168 base += sstride[0];
169 dest += dstride[0];
170 n = 0;
171 while (count[n] == extent[n])
172 {
173 /* When we get to the end of a dimension, reset it and increment
174 the next dimension. */
175 count[n] = 0;
176 /* We could precalculate these products, but this is a less
177 frequently used path so probably not worth it. */
178 base -= sstride[n] * extent[n];
179 dest -= dstride[n] * extent[n];
180 n++;
181 if (n >= rank)
182 {
183 /* Break out of the loop. */
184 continue_loop = 0;
185 break;
186 }
187 else
188 {
189 count[n]++;
190 base += sstride[n];
191 dest += dstride[n];
192 }
193 }
194 }
195 }
196
197 #endif
198