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_INTEGER_16) && defined (HAVE_GFC_INTEGER_16)
40 extern void product_i16 (gfc_array_i16
* const restrict
,
41 gfc_array_i16
* const restrict
, const index_type
* const restrict
);
42 export_proto(product_i16
);
45 product_i16 (gfc_array_i16
* const restrict retarray
,
46 gfc_array_i16
* const restrict array
,
47 const index_type
* const restrict pdim
)
49 index_type count
[GFC_MAX_DIMENSIONS
];
50 index_type extent
[GFC_MAX_DIMENSIONS
];
51 index_type sstride
[GFC_MAX_DIMENSIONS
];
52 index_type dstride
[GFC_MAX_DIMENSIONS
];
53 const GFC_INTEGER_16
* restrict base
;
54 GFC_INTEGER_16
* restrict dest
;
61 /* Make dim zero based to avoid confusion. */
63 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
65 /* TODO: It should be a front end job to correctly set the strides. */
67 if (array
->dim
[0].stride
== 0)
68 array
->dim
[0].stride
= 1;
70 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
71 delta
= array
->dim
[dim
].stride
;
73 for (n
= 0; n
< dim
; n
++)
75 sstride
[n
] = array
->dim
[n
].stride
;
76 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
;
82 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
85 if (retarray
->data
== NULL
)
87 for (n
= 0; n
< rank
; n
++)
89 retarray
->dim
[n
].lbound
= 0;
90 retarray
->dim
[n
].ubound
= extent
[n
]-1;
92 retarray
->dim
[n
].stride
= 1;
94 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
98 = internal_malloc_size (sizeof (GFC_INTEGER_16
)
99 * retarray
->dim
[rank
-1].stride
101 retarray
->offset
= 0;
102 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
106 if (retarray
->dim
[0].stride
== 0)
107 retarray
->dim
[0].stride
= 1;
109 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
110 runtime_error ("rank of return array incorrect");
113 for (n
= 0; n
< rank
; n
++)
116 dstride
[n
] = retarray
->dim
[n
].stride
;
122 dest
= retarray
->data
;
126 const GFC_INTEGER_16
* restrict src
;
127 GFC_INTEGER_16 result
;
136 for (n
= 0; n
< len
; n
++, src
+= delta
)
144 /* Advance to the next element. */
149 while (count
[n
] == extent
[n
])
151 /* When we get to the end of a dimension, reset it and increment
152 the next dimension. */
154 /* We could precalculate these products, but this is a less
155 frequently used path so proabably not worth it. */
156 base
-= sstride
[n
] * extent
[n
];
157 dest
-= dstride
[n
] * extent
[n
];
161 /* Break out of the look. */
176 extern void mproduct_i16 (gfc_array_i16
* const restrict
,
177 gfc_array_i16
* const restrict
, const index_type
* const restrict
,
178 gfc_array_l4
* const restrict
);
179 export_proto(mproduct_i16
);
182 mproduct_i16 (gfc_array_i16
* const restrict retarray
,
183 gfc_array_i16
* const restrict array
,
184 const index_type
* const restrict pdim
,
185 gfc_array_l4
* const restrict mask
)
187 index_type count
[GFC_MAX_DIMENSIONS
];
188 index_type extent
[GFC_MAX_DIMENSIONS
];
189 index_type sstride
[GFC_MAX_DIMENSIONS
];
190 index_type dstride
[GFC_MAX_DIMENSIONS
];
191 index_type mstride
[GFC_MAX_DIMENSIONS
];
192 GFC_INTEGER_16
* restrict dest
;
193 const GFC_INTEGER_16
* restrict base
;
194 const GFC_LOGICAL_4
* restrict mbase
;
203 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
205 /* TODO: It should be a front end job to correctly set the strides. */
207 if (array
->dim
[0].stride
== 0)
208 array
->dim
[0].stride
= 1;
210 if (mask
->dim
[0].stride
== 0)
211 mask
->dim
[0].stride
= 1;
213 len
= array
->dim
[dim
].ubound
+ 1 - array
->dim
[dim
].lbound
;
216 delta
= array
->dim
[dim
].stride
;
217 mdelta
= mask
->dim
[dim
].stride
;
219 for (n
= 0; n
< dim
; n
++)
221 sstride
[n
] = array
->dim
[n
].stride
;
222 mstride
[n
] = mask
->dim
[n
].stride
;
223 extent
[n
] = array
->dim
[n
].ubound
+ 1 - array
->dim
[n
].lbound
;
225 for (n
= dim
; n
< rank
; n
++)
227 sstride
[n
] = array
->dim
[n
+ 1].stride
;
228 mstride
[n
] = mask
->dim
[n
+ 1].stride
;
230 array
->dim
[n
+ 1].ubound
+ 1 - array
->dim
[n
+ 1].lbound
;
233 if (retarray
->data
== NULL
)
235 for (n
= 0; n
< rank
; n
++)
237 retarray
->dim
[n
].lbound
= 0;
238 retarray
->dim
[n
].ubound
= extent
[n
]-1;
240 retarray
->dim
[n
].stride
= 1;
242 retarray
->dim
[n
].stride
= retarray
->dim
[n
-1].stride
* extent
[n
-1];
246 = internal_malloc_size (sizeof (GFC_INTEGER_16
)
247 * retarray
->dim
[rank
-1].stride
249 retarray
->offset
= 0;
250 retarray
->dtype
= (array
->dtype
& ~GFC_DTYPE_RANK_MASK
) | rank
;
254 if (retarray
->dim
[0].stride
== 0)
255 retarray
->dim
[0].stride
= 1;
257 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
258 runtime_error ("rank of return array incorrect");
261 for (n
= 0; n
< rank
; n
++)
264 dstride
[n
] = retarray
->dim
[n
].stride
;
269 dest
= retarray
->data
;
273 if (GFC_DESCRIPTOR_SIZE (mask
) != 4)
275 /* This allows the same loop to be used for all logical types. */
276 assert (GFC_DESCRIPTOR_SIZE (mask
) == 8);
277 for (n
= 0; n
< rank
; n
++)
280 mbase
= (GFOR_POINTER_L8_TO_L4 (mbase
));
285 const GFC_INTEGER_16
* restrict src
;
286 const GFC_LOGICAL_4
* restrict msrc
;
287 GFC_INTEGER_16 result
;
297 for (n
= 0; n
< len
; n
++, src
+= delta
, msrc
+= mdelta
)
306 /* Advance to the next element. */
312 while (count
[n
] == extent
[n
])
314 /* When we get to the end of a dimension, reset it and increment
315 the next dimension. */
317 /* We could precalculate these products, but this is a less
318 frequently used path so proabably not worth it. */
319 base
-= sstride
[n
] * extent
[n
];
320 mbase
-= mstride
[n
] * extent
[n
];
321 dest
-= dstride
[n
] * extent
[n
];
325 /* Break out of the look. */