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 (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. */
34 #include "libgfortran.h"
37 #if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_REAL_16)
40 extern void product_r16 (gfc_array_r16
*, gfc_array_r16
*, index_type
*);
41 export_proto(product_r16
);
44 product_r16 (gfc_array_r16
*retarray
, gfc_array_r16
*array
, index_type
*pdim
)
46 index_type count
[GFC_MAX_DIMENSIONS
];
47 index_type extent
[GFC_MAX_DIMENSIONS
];
48 index_type sstride
[GFC_MAX_DIMENSIONS
];
49 index_type dstride
[GFC_MAX_DIMENSIONS
];
58 /* Make dim zero based to avoid confusion. */
60 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
62 /* TODO: It should be a front end job to correctly set the strides. */
64 if (array
->dim
[0].stride
== 0)
65 array
->dim
[0].stride
= 1;
67 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
68 delta
= array
->dim
[dim
].stride
;
70 for (n
= 0; n
< dim
; n
++)
72 sstride
[n
] = array
->dim
[n
].stride
;
73 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
75 for (n
= dim
; n
< rank
; n
++)
77 sstride
[n
] = array
->dim
[n
+ 1].stride
;
79 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
82 if (retarray
->data
== NULL
)
84 for (n
= 0; n
< rank
; n
++)
86 retarray
->dim
[n
].lbound
= 0;
87 retarray
->dim
[n
].ubound
= extent
[n
]-1;
89 retarray
->dim
[n
].stride
= 1;
91 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
95 = internal_malloc_size (sizeof (GFC_REAL_16
)
96 * retarray
->dim
[rank
-1].stride
99 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
103 if (retarray
->dim
[0].stride
== 0)
104 retarray
->dim
[0].stride
= 1;
106 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
107 runtime_error ("rank of return array incorrect");
110 for (n
= 0; n
< rank
; n
++)
113 dstride
[n
] = retarray
->dim
[n
].stride
;
119 dest
= retarray
->data
;
133 for (n
= 0; n
< len
; n
++, src
+= delta
)
141 /* Advance to the next element. */
146 while (count
[n
] == extent
[n
])
148 /* When we get to the end of a dimension, reset it and increment
149 the next dimension. */
151 /* We could precalculate these products, but this is a less
152 frequently used path so proabably not worth it. */
153 base
-= sstride
[n
] * extent
[n
];
154 dest
-= dstride
[n
] * extent
[n
];
158 /* Break out of the look. */
173 extern void mproduct_r16 (gfc_array_r16
*, gfc_array_r16
*, index_type
*,
175 export_proto(mproduct_r16
);
178 mproduct_r16 (gfc_array_r16
* retarray
, gfc_array_r16
* array
,
179 index_type
*pdim
, gfc_array_l4
* mask
)
181 index_type count
[GFC_MAX_DIMENSIONS
];
182 index_type extent
[GFC_MAX_DIMENSIONS
];
183 index_type sstride
[GFC_MAX_DIMENSIONS
];
184 index_type dstride
[GFC_MAX_DIMENSIONS
];
185 index_type mstride
[GFC_MAX_DIMENSIONS
];
188 GFC_LOGICAL_4
*mbase
;
197 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
199 /* TODO: It should be a front end job to correctly set the strides. */
201 if (array
->dim
[0].stride
== 0)
202 array
->dim
[0].stride
= 1;
204 if (mask
->dim
[0].stride
== 0)
205 mask
->dim
[0].stride
= 1;
207 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
210 delta
= array
->dim
[dim
].stride
;
211 mdelta
= mask
->dim
[dim
].stride
;
213 for (n
= 0; n
< dim
; n
++)
215 sstride
[n
] = array
->dim
[n
].stride
;
216 mstride
[n
] = mask
->dim
[n
].stride
;
217 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
219 for (n
= dim
; n
< rank
; n
++)
221 sstride
[n
] = array
->dim
[n
+ 1].stride
;
222 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
224 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
227 if (retarray
->data
== NULL
)
229 for (n
= 0; n
< rank
; n
++)
231 retarray
->dim
[n
].lbound
= 0;
232 retarray
->dim
[n
].ubound
= extent
[n
]-1;
234 retarray
->dim
[n
].stride
= 1;
236 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
240 = internal_malloc_size (sizeof (GFC_REAL_16
)
241 * retarray
->dim
[rank
-1].stride
243 retarray
->offset
= 0;
244 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
248 if (retarray
->dim
[0].stride
== 0)
249 retarray
->dim
[0].stride
= 1;
251 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
252 runtime_error ("rank of return array incorrect");
255 for (n
= 0; n
< rank
; n
++)
258 dstride
[n
] = retarray
->dim
[n
].stride
;
263 dest
= retarray
->data
;
267 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
269 /* This allows the same loop to be used for all logical types. */
270 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
271 for (n
= 0; n
< rank
; n
++)
274 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
291 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
300 /* Advance to the next element. */
306 while (count
[n
] == extent
[n
])
308 /* When we get to the end of a dimension, reset it and increment
309 the next dimension. */
311 /* We could precalculate these products, but this is a less
312 frequently used path so proabably not worth it. */
313 base
-= sstride
[n
] * extent
[n
];
314 mbase
-= mstride
[n
] * extent
[n
];
315 dest
-= dstride
[n
] * extent
[n
];
319 /* Break out of the look. */