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