]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/generated/count_8_l4.c
1 /* Implementation of the COUNT 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 (libgfor).
7 Libgfortran is free software; you can redistribute it and/or
8 modify it under the terms of the GNU Lesser General Public
9 License as published by the Free Software Foundation; either
10 version 2.1 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 Lesser General Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with libgfor; see the file COPYING.LIB. If not,
19 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
25 #include "libgfortran.h"
28 extern void count_8_l4 (gfc_array_i8
*, gfc_array_l4
*, index_type
*);
29 export_proto(count_8_l4
);
32 count_8_l4 (gfc_array_i8
*retarray
, gfc_array_l4
*array
, index_type
*pdim
)
34 index_type count
[GFC_MAX_DIMENSIONS
- 1];
35 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
36 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
37 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
46 /* Make dim zero based to avoid confusion. */
48 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
49 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
50 if (array
->dim
[0].stride
== 0)
51 array
->dim
[0].stride
= 1;
52 if (retarray
->dim
[0].stride
== 0)
53 retarray
->dim
[0].stride
= 1;
55 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
56 delta
= array
->dim
[dim
].stride
;
58 for (n
= 0; n
< dim
; n
++)
60 sstride
[n
] = array
->dim
[n
].stride
;
61 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
63 for (n
= dim
; n
< rank
; n
++)
65 sstride
[n
] = array
->dim
[n
+ 1].stride
;
67 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
70 if (retarray
->data
== NULL
)
72 for (n
= 0; n
< rank
; n
++)
74 retarray
->dim
[n
].lbound
= 0;
75 retarray
->dim
[n
].ubound
= extent
[n
]-1;
77 retarray
->dim
[n
].stride
= 1;
79 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
83 = internal_malloc_size (sizeof (GFC_INTEGER_8
)
84 * retarray
->dim
[rank
-1].stride
89 for (n
= 0; n
< rank
; n
++)
92 dstride
[n
] = retarray
->dim
[n
].stride
;
98 dest
= retarray
->data
;
103 GFC_INTEGER_8 result
;
112 for (n
= 0; n
< len
; n
++, src
+= delta
)
121 /* Advance to the next element. */
126 while (count
[n
] == extent
[n
])
128 /* When we get to the end of a dimension, reset it and increment
129 the next dimension. */
131 /* We could precalculate these products, but this is a less
132 frequently used path so proabably not worth it. */
133 base
-= sstride
[n
] * extent
[n
];
134 dest
-= dstride
[n
] * extent
[n
];
138 /* Break out of the look. */