missing Changelog
[official-gcc.git] / libgfortran / generated / parity_l8.c
blob950910122542ac39719e35b8c68d572d5d8b5b68
1 /* Implementation of the PARITY intrinsic
2 Copyright 2010, 2012 Free Software Foundation, Inc.
3 Contributed by Tobias Burnus <burnus@net-b.de>
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"
27 #include <stdlib.h>
28 #include <math.h>
29 #include <assert.h>
32 #if defined (HAVE_GFC_LOGICAL_8) && defined (HAVE_GFC_LOGICAL_8)
35 extern void parity_l8 (gfc_array_l8 * const restrict,
36 gfc_array_l8 * const restrict, const index_type * const restrict);
37 export_proto(parity_l8);
39 void
40 parity_l8 (gfc_array_l8 * const restrict retarray,
41 gfc_array_l8 * const restrict array,
42 const index_type * const restrict pdim)
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_8 * restrict base;
49 GFC_LOGICAL_8 * 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;
57 /* Make dim zero based to avoid confusion. */
58 dim = (*pdim) - 1;
59 rank = GFC_DESCRIPTOR_RANK (array) - 1;
61 len = GFC_DESCRIPTOR_EXTENT(array,dim);
62 if (len < 0)
63 len = 0;
64 delta = GFC_DESCRIPTOR_STRIDE(array,dim);
66 for (n = 0; n < dim; n++)
68 sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
69 extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
71 if (extent[n] < 0)
72 extent[n] = 0;
74 for (n = dim; n < rank; n++)
76 sstride[n] = GFC_DESCRIPTOR_STRIDE(array, n + 1);
77 extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);
79 if (extent[n] < 0)
80 extent[n] = 0;
83 if (retarray->base_addr == NULL)
85 size_t alloc_size, str;
87 for (n = 0; n < rank; n++)
89 if (n == 0)
90 str = 1;
91 else
92 str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
94 GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
98 retarray->offset = 0;
99 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
101 alloc_size = sizeof (GFC_LOGICAL_8) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
102 * extent[rank-1];
104 retarray->base_addr = xmalloc (alloc_size);
105 if (alloc_size == 0)
107 /* Make sure we have a zero-sized array. */
108 GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
109 return;
113 else
115 if (rank != GFC_DESCRIPTOR_RANK (retarray))
116 runtime_error ("rank of return array incorrect in"
117 " PARITY intrinsic: is %ld, should be %ld",
118 (long int) (GFC_DESCRIPTOR_RANK (retarray)),
119 (long int) rank);
121 if (unlikely (compile_options.bounds_check))
122 bounds_ifunction_return ((array_t *) retarray, extent,
123 "return value", "PARITY");
126 for (n = 0; n < rank; n++)
128 count[n] = 0;
129 dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
130 if (extent[n] <= 0)
131 return;
134 base = array->base_addr;
135 dest = retarray->base_addr;
137 continue_loop = 1;
138 while (continue_loop)
140 const GFC_LOGICAL_8 * restrict src;
141 GFC_LOGICAL_8 result;
142 src = base;
145 result = 0;
146 if (len <= 0)
147 *dest = 0;
148 else
150 for (n = 0; n < len; n++, src += delta)
153 result = result != *src;
156 *dest = result;
159 /* Advance to the next element. */
160 count[0]++;
161 base += sstride[0];
162 dest += dstride[0];
163 n = 0;
164 while (count[n] == extent[n])
166 /* When we get to the end of a dimension, reset it and increment
167 the next dimension. */
168 count[n] = 0;
169 /* We could precalculate these products, but this is a less
170 frequently used path so probably not worth it. */
171 base -= sstride[n] * extent[n];
172 dest -= dstride[n] * extent[n];
173 n++;
174 if (n == rank)
176 /* Break out of the look. */
177 continue_loop = 0;
178 break;
180 else
182 count[n]++;
183 base += sstride[n];
184 dest += dstride[n];
190 #endif