]>
gcc.gnu.org Git - gcc.git/blob - libgfortran/generated/count_1_l.c
1 /* Implementation of the COUNT intrinsic
2 Copyright 2002, 2007 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. */
31 #include "libgfortran.h"
36 #if defined (HAVE_GFC_INTEGER_1)
39 extern void count_1_l (gfc_array_i1
* const restrict
,
40 gfc_array_l1
* const restrict
, const index_type
* const restrict
);
41 export_proto(count_1_l
);
44 count_1_l (gfc_array_i1
* const restrict retarray
,
45 gfc_array_l1
* const restrict array
,
46 const index_type
* const restrict pdim
)
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
];
52 const GFC_LOGICAL_1
* restrict base
;
53 GFC_INTEGER_1
* restrict dest
;
61 /* Make dim zero based to avoid confusion. */
63 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
65 src_kind
= GFC_DESCRIPTOR_SIZE (array
);
67 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
68 delta
= array
->dim
[dim
].stride
* src_kind
;
70 for (n
= 0; n
< dim
; n
++)
72 sstride
[n
] = array
->dim
[n
].stride
* src_kind
;
73 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
78 for (n
= dim
; n
< rank
; n
++)
80 sstride
[n
] = array
->dim
[n
+ 1].stride
* src_kind
;
82 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
88 if (retarray
->data
== NULL
)
92 for (n
= 0; n
< rank
; n
++)
94 retarray
->dim
[n
].lbound
= 0;
95 retarray
->dim
[n
].ubound
= extent
[n
]-1;
97 retarray
->dim
[n
].stride
= 1;
99 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
102 retarray
->offset
= 0;
103 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
105 alloc_size
= sizeof (GFC_INTEGER_1
) * retarray
->dim
[rank
-1].stride
110 /* Make sure we have a zero-sized array. */
111 retarray
->dim
[0].lbound
= 0;
112 retarray
->dim
[0].ubound
= -1;
116 retarray
->data
= internal_malloc_size (alloc_size
);
120 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
121 runtime_error ("rank of return array incorrect in"
122 " COUNT intrinsic: is %ld, should be %ld",
123 (long int) GFC_DESCRIPTOR_RANK (retarray
),
126 if (compile_options
.bounds_check
)
128 for (n
=0; n
< rank
; n
++)
130 index_type ret_extent
;
132 ret_extent
= retarray
->dim
[n
].ubound
+ 1
133 - retarray
->dim
[n
].lbound
;
134 if (extent
[n
] != ret_extent
)
135 runtime_error ("Incorrect extent in return value of"
136 " COUNT intrinsic in dimension %d:"
137 " is %ld, should be %ld", n
+ 1,
138 (long int) ret_extent
, (long int) extent
[n
]);
143 for (n
= 0; n
< rank
; n
++)
146 dstride
[n
] = retarray
->dim
[n
].stride
;
153 if (src_kind
== 1 || src_kind
== 2 || src_kind
== 4 || src_kind
== 8
154 #ifdef HAVE_GFC_LOGICAL_16
160 base
= GFOR_POINTER_TO_L1 (base
, src_kind
);
163 internal_error (NULL
, "Funny sized logical array in COUNT intrinsic");
165 dest
= retarray
->data
;
169 const GFC_LOGICAL_1
* restrict src
;
170 GFC_INTEGER_1 result
;
179 for (n
= 0; n
< len
; n
++, src
+= delta
)
188 /* Advance to the next element. */
193 while (count
[n
] == extent
[n
])
195 /* When we get to the end of a dimension, reset it and increment
196 the next dimension. */
198 /* We could precalculate these products, but this is a less
199 frequently used path so probably not worth it. */
200 base
-= sstride
[n
] * extent
[n
];
201 dest
-= dstride
[n
] * extent
[n
];
205 /* Break out of the look. */
This page took 0.044129 seconds and 5 git commands to generate.