]> git.ipfire.org Git - thirdparty/gcc.git/blame - libgfortran/generated/all_l4.c
re PR libfortran/34670 (bounds checking for array intrinsics)
[thirdparty/gcc.git] / libgfortran / generated / all_l4.c
CommitLineData
6de9cd9a 1/* Implementation of the ALL intrinsic
36ae8a61 2 Copyright 2002, 2007 Free Software Foundation, Inc.
6de9cd9a
DN
3 Contributed by Paul Brook <paul@nowt.org>
4
57dea9f6 5This file is part of the GNU Fortran 95 runtime library (libgfortran).
6de9cd9a
DN
6
7Libgfortran is free software; you can redistribute it and/or
57dea9f6 8modify it under the terms of the GNU General Public
6de9cd9a 9License as published by the Free Software Foundation; either
57dea9f6
TM
10version 2 of the License, or (at your option) any later version.
11
12In addition to the permissions in the GNU General Public License, the
13Free Software Foundation gives you unlimited permission to link the
14compiled version of this file into combinations with other programs,
15and to distribute those combinations without any restriction coming
16from the use of this file. (The General Public License restrictions
17do apply in other respects; for example, they cover modification of
18the file, and distribution when not linked into a combine
19executable.)
6de9cd9a
DN
20
21Libgfortran is distributed in the hope that it will be useful,
22but WITHOUT ANY WARRANTY; without even the implied warranty of
23MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
57dea9f6 24GNU General Public License for more details.
6de9cd9a 25
57dea9f6
TM
26You should have received a copy of the GNU General Public
27License along with libgfortran; see the file COPYING. If not,
fe2ae685
KC
28write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
29Boston, MA 02110-1301, USA. */
6de9cd9a 30
36ae8a61 31#include "libgfortran.h"
6de9cd9a
DN
32#include <stdlib.h>
33#include <assert.h>
6de9cd9a 34
7d7b8bfe 35
644cb69f
FXC
36#if defined (HAVE_GFC_LOGICAL_4) && defined (HAVE_GFC_LOGICAL_4)
37
38
64acfd99
JB
39extern void all_l4 (gfc_array_l4 * const restrict,
40 gfc_array_l4 * const restrict, const index_type * const restrict);
7f68c75f 41export_proto(all_l4);
7d7b8bfe 42
6de9cd9a 43void
64acfd99
JB
44all_l4 (gfc_array_l4 * const restrict retarray,
45 gfc_array_l4 * const restrict array,
46 const index_type * const restrict pdim)
6de9cd9a 47{
e33e218b
TK
48 index_type count[GFC_MAX_DIMENSIONS];
49 index_type extent[GFC_MAX_DIMENSIONS];
50 index_type sstride[GFC_MAX_DIMENSIONS];
51 index_type dstride[GFC_MAX_DIMENSIONS];
64acfd99
JB
52 const GFC_LOGICAL_4 * restrict base;
53 GFC_LOGICAL_4 * restrict dest;
6de9cd9a
DN
54 index_type rank;
55 index_type n;
56 index_type len;
57 index_type delta;
58 index_type dim;
59
60 /* Make dim zero based to avoid confusion. */
61 dim = (*pdim) - 1;
62 rank = GFC_DESCRIPTOR_RANK (array) - 1;
f6c7d65b 63
6de9cd9a
DN
64 len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
65 delta = array->dim[dim].stride;
66
67 for (n = 0; n < dim; n++)
68 {
69 sstride[n] = array->dim[n].stride;
70 extent[n] = array->dim[n].ubound + 1 - array->dim[n].lbound;
80ee04b9
TK
71
72 if (extent[n] < 0)
73 extent[n] = 0;
6de9cd9a
DN
74 }
75 for (n = dim; n < rank; n++)
76 {
77 sstride[n] = array->dim[n + 1].stride;
78 extent[n] =
79 array->dim[n + 1].ubound + 1 - array->dim[n + 1].lbound;
80ee04b9
TK
80
81 if (extent[n] < 0)
82 extent[n] = 0;
6de9cd9a
DN
83 }
84
6c167c45
VL
85 if (retarray->data == NULL)
86 {
80ee04b9
TK
87 size_t alloc_size;
88
6c167c45
VL
89 for (n = 0; n < rank; n++)
90 {
91 retarray->dim[n].lbound = 0;
92 retarray->dim[n].ubound = extent[n]-1;
93 if (n == 0)
94 retarray->dim[n].stride = 1;
95 else
96 retarray->dim[n].stride = retarray->dim[n-1].stride * extent[n-1];
97 }
98
efd4dc1a 99 retarray->offset = 0;
50dd63a9 100 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
80ee04b9
TK
101
102 alloc_size = sizeof (GFC_LOGICAL_4) * retarray->dim[rank-1].stride
103 * extent[rank-1];
104
105 if (alloc_size == 0)
106 {
107 /* Make sure we have a zero-sized array. */
108 retarray->dim[0].lbound = 0;
109 retarray->dim[0].ubound = -1;
110 return;
111 }
112 else
113 retarray->data = internal_malloc_size (alloc_size);
6c167c45 114 }
50dd63a9
TK
115 else
116 {
50dd63a9 117 if (rank != GFC_DESCRIPTOR_RANK (retarray))
fd6590f8
TK
118 runtime_error ("rank of return array incorrect in"
119 " ALL intrinsic: is %d, should be %d",
120 GFC_DESCRIPTOR_RANK (retarray), rank);
121
122 if (compile_options.bounds_check)
123 {
124 for (n=0; n < rank; n++)
125 {
126 index_type ret_extent;
127
128 ret_extent = retarray->dim[n].ubound + 1
129 - retarray->dim[n].lbound;
130 if (extent[n] != ret_extent)
131 runtime_error ("Incorrect extent in return value of"
132 " ALL intrinsic in dimension %d:"
133 " is %ld, should be %ld", n + 1,
134 (long int) ret_extent, (long int) extent[n]);
135 }
136 }
50dd63a9
TK
137 }
138
6de9cd9a
DN
139 for (n = 0; n < rank; n++)
140 {
141 count[n] = 0;
142 dstride[n] = retarray->dim[n].stride;
143 if (extent[n] <= 0)
144 len = 0;
145 }
146
147 base = array->data;
148 dest = retarray->data;
149
150 while (base)
151 {
64acfd99 152 const GFC_LOGICAL_4 * restrict src;
6de9cd9a
DN
153 GFC_LOGICAL_4 result;
154 src = base;
155 {
156
157 /* Return true only if all the elements are set. */
158 result = 1;
159 if (len <= 0)
160 *dest = 1;
161 else
162 {
163 for (n = 0; n < len; n++, src += delta)
164 {
165
166 if (! *src)
167 {
168 result = 0;
169 break;
170 }
171 }
172 *dest = result;
173 }
174 }
175 /* Advance to the next element. */
176 count[0]++;
177 base += sstride[0];
178 dest += dstride[0];
179 n = 0;
180 while (count[n] == extent[n])
181 {
182 /* When we get to the end of a dimension, reset it and increment
183 the next dimension. */
184 count[n] = 0;
185 /* We could precalculate these products, but this is a less
5d7adf7a 186 frequently used path so probably not worth it. */
6de9cd9a
DN
187 base -= sstride[n] * extent[n];
188 dest -= dstride[n] * extent[n];
189 n++;
190 if (n == rank)
191 {
192 /* Break out of the look. */
193 base = NULL;
194 break;
195 }
196 else
197 {
198 count[n]++;
199 base += sstride[n];
200 dest += dstride[n];
201 }
202 }
203 }
204}
205
644cb69f 206#endif