]>
git.ipfire.org Git - thirdparty/gcc.git/blob - libgfortran/generated/product_c8.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"
28 extern void product_c8 (gfc_array_c8
*, gfc_array_c8
*, index_type
*);
29 export_proto(product_c8
);
32 product_c8 (gfc_array_c8
*retarray
, gfc_array_c8
*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_COMPLEX_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_COMPLEX_8 result
;
112 for (n
= 0; n
< len
; n
++, src
+= delta
)
120 /* Advance to the next element. */
125 while (count
[n
] == extent
[n
])
127 /* When we get to the end of a dimension, reset it and increment
128 the next dimension. */
130 /* We could precalculate these products, but this is a less
131 frequently used path so proabably not worth it. */
132 base
-= sstride
[n
] * extent
[n
];
133 dest
-= dstride
[n
] * extent
[n
];
137 /* Break out of the look. */
152 extern void mproduct_c8 (gfc_array_c8
*, gfc_array_c8
*, index_type
*,
154 export_proto(mproduct_c8
);
157 mproduct_c8 (gfc_array_c8
* retarray
, gfc_array_c8
* array
,
158 index_type
*pdim
, gfc_array_l4
* mask
)
160 index_type count
[GFC_MAX_DIMENSIONS
- 1];
161 index_type extent
[GFC_MAX_DIMENSIONS
- 1];
162 index_type sstride
[GFC_MAX_DIMENSIONS
- 1];
163 index_type dstride
[GFC_MAX_DIMENSIONS
- 1];
164 index_type mstride
[GFC_MAX_DIMENSIONS
- 1];
167 GFC_LOGICAL_4
*mbase
;
176 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
177 assert (rank
== GFC_DESCRIPTOR_RANK (retarray
));
178 if (array
->dim
[0].stride
== 0)
179 array
->dim
[0].stride
= 1;
180 if (retarray
->dim
[0].stride
== 0)
181 retarray
->dim
[0].stride
= 1;
183 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
186 delta
= array
->dim
[dim
].stride
;
187 mdelta
= mask
->dim
[dim
].stride
;
189 for (n
= 0; n
< dim
; n
++)
191 sstride
[n
] = array
->dim
[n
].stride
;
192 mstride
[n
] = mask
->dim
[n
].stride
;
193 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
195 for (n
= dim
; n
< rank
; n
++)
197 sstride
[n
] = array
->dim
[n
+ 1].stride
;
198 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
200 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
203 for (n
= 0; n
< rank
; n
++)
206 dstride
[n
] = retarray
->dim
[n
].stride
;
211 dest
= retarray
->data
;
215 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
217 /* This allows the same loop to be used for all logical types. */
218 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
219 for (n
= 0; n
< rank
; n
++)
222 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
229 GFC_COMPLEX_8 result
;
239 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
248 /* Advance to the next element. */
254 while (count
[n
] == extent
[n
])
256 /* When we get to the end of a dimension, reset it and increment
257 the next dimension. */
259 /* We could precalculate these products, but this is a less
260 frequently used path so proabably not worth it. */
261 base
-= sstride
[n
] * extent
[n
];
262 mbase
-= mstride
[n
] * extent
[n
];
263 dest
-= dstride
[n
] * extent
[n
];
267 /* Break out of the look. */