]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/generated/product_r8.c
1 /* Implementation of the PRODUCT 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"
29 __product_r8 (gfc_array_r8
* retarray
, gfc_array_r8
*array
, index_type
*pdim
)
31 index_type count
[GFC_MAX_DIMENSIONS
- 1];
32 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
33 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
34 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
43 /* Make dim zero based to avoid confusion. */
45 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
46 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
47 if (array
->dim
[0].stride
== 0)
48 array
->dim
[0].stride
= 1;
49 if (retarray
->dim
[0].stride
== 0)
50 retarray
->dim
[0].stride
= 1;
52 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
53 delta
= array
->dim
[dim
].stride
;
55 for (n
= 0; n
< dim
; n
++)
57 sstride
[n
] = array
->dim
[n
].stride
;
58 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
60 for (n
= dim
; n
< rank
; n
++)
62 sstride
[n
] = array
->dim
[n
+ 1].stride
;
64 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
67 for (n
= 0; n
< rank
; n
++)
70 dstride
[n
] = retarray
->dim
[n
].stride
;
76 dest
= retarray
->data
;
90 for (n
= 0; n
< len
; n
++, src
+= delta
)
98 /* Advance to the next element. */
103 while (count
[n
] == extent
[n
])
105 /* When we get to the end of a dimension, reset it and increment
106 the next dimension. */
108 /* We could precalculate these products, but this is a less
109 frequently used path so proabably not worth it. */
110 base
-= sstride
[n
] * extent
[n
];
111 dest
-= dstride
[n
] * extent
[n
];
115 /* Break out of the look. */
130 __mproduct_r8 (gfc_array_r8
* retarray
, gfc_array_r8
* array
, index_type
*pdim
, gfc_array_l4
* mask
)
132 index_type count
[GFC_MAX_DIMENSIONS
- 1];
133 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
134 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
135 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
136 index_type mstride
[GFC_MAX_DIMENSIONS
- 1];
139 GFC_LOGICAL_4
*mbase
;
148 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
149 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
150 if (array
->dim
[0].stride
== 0)
151 array
->dim
[0].stride
= 1;
152 if (retarray
->dim
[0].stride
== 0)
153 retarray
->dim
[0].stride
= 1;
155 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
158 delta
= array
->dim
[dim
].stride
;
159 mdelta
= mask
->dim
[dim
].stride
;
161 for (n
= 0; n
< dim
; n
++)
163 sstride
[n
] = array
->dim
[n
].stride
;
164 mstride
[n
] = mask
->dim
[n
].stride
;
165 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
167 for (n
= dim
; n
< rank
; n
++)
169 sstride
[n
] = array
->dim
[n
+ 1].stride
;
170 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
172 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
175 for (n
= 0; n
< rank
; n
++)
178 dstride
[n
] = retarray
->dim
[n
].stride
;
183 dest
= retarray
->data
;
187 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
189 /* This allows the same loop to be used for all logical types. */
190 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
191 for (n
= 0; n
< rank
; n
++)
194 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
211 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
220 /* Advance to the next element. */
226 while (count
[n
] == extent
[n
])
228 /* When we get to the end of a dimension, reset it and increment
229 the next dimension. */
231 /* We could precalculate these products, but this is a less
232 frequently used path so proabably not worth it. */
233 base
-= sstride
[n
] * extent
[n
];
234 mbase
-= mstride
[n
] * extent
[n
];
235 dest
-= dstride
[n
] * extent
[n
];
239 /* Break out of the look. */