1 /* Implementation of the ALL intrinsic
2 Copyright (C) 2002-2013 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
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"
31 #if defined (HAVE_GFC_LOGICAL_1)
34 extern void all_l1 (gfc_array_l1 * const restrict,
35 gfc_array_l1 * const restrict, const index_type * const restrict);
39 all_l1 (gfc_array_l1 * const restrict retarray,
40 gfc_array_l1 * const restrict array,
41 const index_type * const restrict pdim)
43 index_type count[GFC_MAX_DIMENSIONS];
44 index_type extent[GFC_MAX_DIMENSIONS];
45 index_type sstride[GFC_MAX_DIMENSIONS];
46 index_type dstride[GFC_MAX_DIMENSIONS];
47 const GFC_LOGICAL_1 * restrict base;
48 GFC_LOGICAL_1 * restrict dest;
57 /* Make dim zero based to avoid confusion. */
59 rank = GFC_DESCRIPTOR_RANK (array) - 1;
61 src_kind = GFC_DESCRIPTOR_SIZE (array);
63 len = GFC_DESCRIPTOR_EXTENT(array,dim);
67 delta = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
69 for (n = 0; n < dim; n++)
71 sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n);
72 extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
77 for (n = dim; n < rank; n++)
79 sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n + 1);
80 extent[n] = GFC_DESCRIPTOR_EXTENT(array,n + 1);
86 if (retarray->base_addr == NULL)
88 size_t alloc_size, str;
90 for (n = 0; n < rank; n++)
95 str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
97 GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
101 retarray->offset = 0;
102 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
104 alloc_size = sizeof (GFC_LOGICAL_1) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
109 /* Make sure we have a zero-sized array. */
110 GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
114 retarray->base_addr = xmalloc (alloc_size);
118 if (rank != GFC_DESCRIPTOR_RANK (retarray))
119 runtime_error ("rank of return array incorrect in"
120 " ALL intrinsic: is %ld, should be %ld",
121 (long int) GFC_DESCRIPTOR_RANK (retarray),
124 if (unlikely (compile_options.bounds_check))
126 for (n=0; n < rank; n++)
128 index_type ret_extent;
130 ret_extent = GFC_DESCRIPTOR_EXTENT(retarray,n);
131 if (extent[n] != ret_extent)
132 runtime_error ("Incorrect extent in return value of"
133 " ALL intrinsic in dimension %d:"
134 " is %ld, should be %ld", (int) n + 1,
135 (long int) ret_extent, (long int) extent[n]);
140 for (n = 0; n < rank; n++)
143 dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
148 base = array->base_addr;
150 if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
151 #ifdef HAVE_GFC_LOGICAL_16
157 base = GFOR_POINTER_TO_L1 (base, src_kind);
160 internal_error (NULL, "Funny sized logical array in ALL intrinsic");
162 dest = retarray->base_addr;
165 while (continue_loop)
167 const GFC_LOGICAL_1 * restrict src;
168 GFC_LOGICAL_1 result;
172 /* Return true only if all the elements are set. */
178 for (n = 0; n < len; n++, src += delta)
190 /* Advance to the next element. */
195 while (count[n] == extent[n])
197 /* When we get to the end of a dimension, reset it and increment
198 the next dimension. */
200 /* We could precalculate these products, but this is a less
201 frequently used path so probably not worth it. */
202 base -= sstride[n] * extent[n];
203 dest -= dstride[n] * extent[n];
207 /* Break out of the look. */