1 `/* Implementation of the MATMUL 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 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 /* Dimensions: retarray(x,y) a(x, count) b(count,y).
29 Either a or b can be rank 1. In this case x or y is 1. */
31 `__matmul_'rtype_code (rtype * retarray, rtype * a, rtype * b)
53 assert (GFC_DESCRIPTOR_RANK (a) == 2
54 || GFC_DESCRIPTOR_RANK (b) == 2);
56 if (retarray->data == NULL)
58 if (GFC_DESCRIPTOR_RANK (a) == 1)
60 retarray->dim[0].lbound = 0;
61 retarray->dim[0].ubound = b->dim[1].ubound - b->dim[1].lbound;
62 retarray->dim[0].stride = 1;
64 else if (GFC_DESCRIPTOR_RANK (b) == 1)
66 retarray->dim[0].lbound = 0;
67 retarray->dim[0].ubound = a->dim[0].ubound - a->dim[0].lbound;
68 retarray->dim[0].stride = 1;
72 retarray->dim[0].lbound = 0;
73 retarray->dim[0].ubound = a->dim[0].ubound - a->dim[0].lbound;
74 retarray->dim[0].stride = 1;
76 retarray->dim[1].lbound = 0;
77 retarray->dim[1].ubound = b->dim[1].ubound - b->dim[1].lbound;
78 retarray->dim[1].stride = retarray->dim[0].ubound+1;
81 retarray->data = internal_malloc (sizeof (rtype_name) * size0 (retarray));
87 dest = retarray->data;
89 if (retarray->dim[0].stride == 0)
90 retarray->dim[0].stride = 1;
91 if (a->dim[0].stride == 0)
93 if (b->dim[0].stride == 0)
96 sinclude(`matmul_asm_'rtype_code`.m4')dnl
98 if (GFC_DESCRIPTOR_RANK (retarray) == 1)
100 rxstride = retarray->dim[0].stride;
105 rxstride = retarray->dim[0].stride;
106 rystride = retarray->dim[1].stride;
109 /* If we have rank 1 parameters, zero the absent stride, and set the size to
111 if (GFC_DESCRIPTOR_RANK (a) == 1)
113 astride = a->dim[0].stride;
114 count = a->dim[0].ubound + 1 - a->dim[0].lbound;
121 astride = a->dim[1].stride;
122 count = a->dim[1].ubound + 1 - a->dim[1].lbound;
123 xstride = a->dim[0].stride;
124 xcount = a->dim[0].ubound + 1 - a->dim[0].lbound;
126 if (GFC_DESCRIPTOR_RANK (b) == 1)
128 bstride = b->dim[0].stride;
129 assert(count == b->dim[0].ubound + 1 - b->dim[0].lbound);
136 bstride = b->dim[0].stride;
137 assert(count == b->dim[0].ubound + 1 - b->dim[0].lbound);
138 ystride = b->dim[1].stride;
139 ycount = b->dim[1].ubound + 1 - b->dim[1].lbound;
142 for (y = 0; y < ycount; y++)
144 for (x = 0; x < xcount; x++)
146 /* Do the summation for this element. For real and integer types
147 this is the same as DOT_PRODUCT. For complex types we use do
148 a*b, not conjg(a)*b. */
153 for (n = 0; n < count; n++)
165 abase -= xstride * xcount;
167 dest += rystride - (rxstride * xcount);