1 /* Implementation of the COUNT intrinsic
2 Copyright (C) 2002-2023 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"
29 #if defined (HAVE_GFC_INTEGER_4)
32 extern void count_4_l (gfc_array_i4
* const restrict
,
33 gfc_array_l1
* const restrict
, const index_type
* const restrict
);
34 export_proto(count_4_l
);
37 count_4_l (gfc_array_i4
* const restrict retarray
,
38 gfc_array_l1
* const restrict array
,
39 const index_type
* const restrict pdim
)
41 index_type count
[GFC_MAX_DIMENSIONS
];
42 index_type extent
[GFC_MAX_DIMENSIONS
];
43 index_type sstride
[GFC_MAX_DIMENSIONS
];
44 index_type dstride
[GFC_MAX_DIMENSIONS
];
45 const GFC_LOGICAL_1
* restrict base
;
46 GFC_INTEGER_4
* restrict dest
;
55 /* Make dim zero based to avoid confusion. */
57 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
59 src_kind
= GFC_DESCRIPTOR_SIZE (array
);
61 len
= GFC_DESCRIPTOR_EXTENT(array
,dim
);
65 delta
= GFC_DESCRIPTOR_STRIDE_BYTES(array
,dim
);
67 for (n
= 0; n
< dim
; n
++)
69 sstride
[n
] = GFC_DESCRIPTOR_STRIDE_BYTES(array
,n
);
70 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
);
75 for (n
= dim
; n
< rank
; n
++)
77 sstride
[n
] = GFC_DESCRIPTOR_STRIDE_BYTES(array
,n
+ 1);
78 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
+ 1);
84 if (retarray
->base_addr
== NULL
)
86 size_t alloc_size
, str
;
88 for (n
= 0; n
< rank
; n
++)
93 str
= GFC_DESCRIPTOR_STRIDE(retarray
,n
-1) * extent
[n
-1];
95 GFC_DIMENSION_SET(retarray
->dim
[n
], 0, extent
[n
] - 1, str
);
100 retarray
->dtype
.rank
= rank
;
102 alloc_size
= GFC_DESCRIPTOR_STRIDE(retarray
,rank
-1) * extent
[rank
-1];
104 retarray
->base_addr
= xmallocarray (alloc_size
, sizeof (GFC_INTEGER_4
));
110 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
111 runtime_error ("rank of return array incorrect in"
112 " COUNT intrinsic: is %ld, should be %ld",
113 (long int) GFC_DESCRIPTOR_RANK (retarray
),
116 if (unlikely (compile_options
.bounds_check
))
118 for (n
=0; n
< rank
; n
++)
120 index_type ret_extent
;
122 ret_extent
= GFC_DESCRIPTOR_EXTENT(retarray
,n
);
123 if (extent
[n
] != ret_extent
)
124 runtime_error ("Incorrect extent in return value of"
125 " COUNT intrinsic in dimension %d:"
126 " is %ld, should be %ld", (int) n
+ 1,
127 (long int) ret_extent
, (long int) extent
[n
]);
132 for (n
= 0; n
< rank
; n
++)
135 dstride
[n
] = GFC_DESCRIPTOR_STRIDE(retarray
,n
);
140 base
= array
->base_addr
;
142 if (src_kind
== 1 || src_kind
== 2 || src_kind
== 4 || src_kind
== 8
143 #ifdef HAVE_GFC_LOGICAL_16
149 base
= GFOR_POINTER_TO_L1 (base
, src_kind
);
152 internal_error (NULL
, "Funny sized logical array in COUNT intrinsic");
154 dest
= retarray
->base_addr
;
157 while (continue_loop
)
159 const GFC_LOGICAL_1
* restrict src
;
160 GFC_INTEGER_4 result
;
169 for (n
= 0; n
< len
; n
++, src
+= delta
)
178 /* Advance to the next element. */
183 while (count
[n
] == extent
[n
])
185 /* When we get to the end of a dimension, reset it and increment
186 the next dimension. */
188 /* We could precalculate these products, but this is a less
189 frequently used path so probably not worth it. */
190 base
-= sstride
[n
] * extent
[n
];
191 dest
-= dstride
[n
] * extent
[n
];
195 /* Break out of the loop. */