1 /* Implementation of the ALL intrinsic
2 Copyright 2002 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
5 This file is part of the GNU Fortran 95 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 2 of the License, or (at your option) any later version.
12 In addition to the permissions in the GNU General Public License, the
13 Free Software Foundation gives you unlimited permission to link the
14 compiled version of this file into combinations with other programs,
15 and to distribute those combinations without any restriction coming
16 from the use of this file. (The General Public License restrictions
17 do apply in other respects; for example, they cover modification of
18 the file, and distribution when not linked into a combine
21 Libgfortran is distributed in the hope that it will be useful,
22 but WITHOUT ANY WARRANTY; without even the implied warranty of
23 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
24 GNU General Public License for more details.
26 You should have received a copy of the GNU General Public
27 License along with libgfortran; see the file COPYING. If not,
28 write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
29 Boston, MA 02110-1301, USA. */
34 #include "libgfortran.h"
37 #if defined (HAVE_GFC_LOGICAL_8) && defined (HAVE_GFC_LOGICAL_8)
40 extern void all_l8 (gfc_array_l8
*, gfc_array_l8
*, index_type
*);
44 all_l8 (gfc_array_l8
*retarray
, gfc_array_l8
*array
, index_type
*pdim
)
46 index_type count
[GFC_MAX_DIMENSIONS
];
47 index_type extent
[GFC_MAX_DIMENSIONS
];
48 index_type sstride
[GFC_MAX_DIMENSIONS
];
49 index_type dstride
[GFC_MAX_DIMENSIONS
];
58 /* Make dim zero based to avoid confusion. */
60 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
62 /* TODO: It should be a front end job to correctly set the strides. */
64 if (array
->dim
[0].stride
== 0)
65 array
->dim
[0].stride
= 1;
67 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
68 delta
= array
->dim
[dim
].stride
;
70 for (n
= 0; n
< dim
; n
++)
72 sstride
[n
] = array
->dim
[n
].stride
;
73 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
75 for (n
= dim
; n
< rank
; n
++)
77 sstride
[n
] = array
->dim
[n
+ 1].stride
;
79 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
82 if (retarray
->data
== NULL
)
84 for (n
= 0; n
< rank
; n
++)
86 retarray
->dim
[n
].lbound
= 0;
87 retarray
->dim
[n
].ubound
= extent
[n
]-1;
89 retarray
->dim
[n
].stride
= 1;
91 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
95 = internal_malloc_size (sizeof (GFC_LOGICAL_8
)
96 * retarray
->dim
[rank
-1].stride
99 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
103 if (retarray
->dim
[0].stride
== 0)
104 retarray
->dim
[0].stride
= 1;
106 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
107 runtime_error ("rank of return array incorrect");
110 for (n
= 0; n
< rank
; n
++)
113 dstride
[n
] = retarray
->dim
[n
].stride
;
119 dest
= retarray
->data
;
124 GFC_LOGICAL_8 result
;
128 /* Return true only if all the elements are set. */
134 for (n
= 0; n
< len
; n
++, src
+= delta
)
146 /* Advance to the next element. */
151 while (count
[n
] == extent
[n
])
153 /* When we get to the end of a dimension, reset it and increment
154 the next dimension. */
156 /* We could precalculate these products, but this is a less
157 frequently used path so proabably not worth it. */
158 base
-= sstride
[n
] * extent
[n
];
159 dest
-= dstride
[n
] * extent
[n
];
163 /* Break out of the look. */