245 lines
7.2 KiB
Plaintext
245 lines
7.2 KiB
Plaintext
`/* Implementation of the MATMUL intrinsic
|
|
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
|
|
Contributed by Paul Brook <paul@nowt.org>
|
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfortran).
|
|
|
|
Libgfortran is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 3 of the License, or (at your option) any later version.
|
|
|
|
Libgfortran is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
Under Section 7 of GPL version 3, you are granted additional
|
|
permissions described in the GCC Runtime Library Exception, version
|
|
3.1, as published by the Free Software Foundation.
|
|
|
|
You should have received a copy of the GNU General Public License and
|
|
a copy of the GCC Runtime Library Exception along with this program;
|
|
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|
<http://www.gnu.org/licenses/>. */
|
|
|
|
#include "libgfortran.h"
|
|
#include <stdlib.h>
|
|
#include <assert.h>'
|
|
|
|
include(iparm.m4)dnl
|
|
|
|
`#if defined (HAVE_'rtype_name`)
|
|
|
|
/* Dimensions: retarray(x,y) a(x, count) b(count,y).
|
|
Either a or b can be rank 1. In this case x or y is 1. */
|
|
|
|
extern void matmul_'rtype_code` ('rtype` * const restrict,
|
|
gfc_array_l1 * const restrict, gfc_array_l1 * const restrict);
|
|
export_proto(matmul_'rtype_code`);
|
|
|
|
void
|
|
matmul_'rtype_code` ('rtype` * const restrict retarray,
|
|
gfc_array_l1 * const restrict a, gfc_array_l1 * const restrict b)
|
|
{
|
|
const GFC_LOGICAL_1 * restrict abase;
|
|
const GFC_LOGICAL_1 * restrict bbase;
|
|
'rtype_name` * restrict dest;
|
|
index_type rxstride;
|
|
index_type rystride;
|
|
index_type xcount;
|
|
index_type ycount;
|
|
index_type xstride;
|
|
index_type ystride;
|
|
index_type x;
|
|
index_type y;
|
|
int a_kind;
|
|
int b_kind;
|
|
|
|
const GFC_LOGICAL_1 * restrict pa;
|
|
const GFC_LOGICAL_1 * restrict pb;
|
|
index_type astride;
|
|
index_type bstride;
|
|
index_type count;
|
|
index_type n;
|
|
|
|
assert (GFC_DESCRIPTOR_RANK (a) == 2
|
|
|| GFC_DESCRIPTOR_RANK (b) == 2);
|
|
|
|
if (retarray->data == NULL)
|
|
{
|
|
if (GFC_DESCRIPTOR_RANK (a) == 1)
|
|
{
|
|
retarray->dim[0].lbound = 0;
|
|
retarray->dim[0].ubound = b->dim[1].ubound - b->dim[1].lbound;
|
|
retarray->dim[0].stride = 1;
|
|
}
|
|
else if (GFC_DESCRIPTOR_RANK (b) == 1)
|
|
{
|
|
retarray->dim[0].lbound = 0;
|
|
retarray->dim[0].ubound = a->dim[0].ubound - a->dim[0].lbound;
|
|
retarray->dim[0].stride = 1;
|
|
}
|
|
else
|
|
{
|
|
retarray->dim[0].lbound = 0;
|
|
retarray->dim[0].ubound = a->dim[0].ubound - a->dim[0].lbound;
|
|
retarray->dim[0].stride = 1;
|
|
|
|
retarray->dim[1].lbound = 0;
|
|
retarray->dim[1].ubound = b->dim[1].ubound - b->dim[1].lbound;
|
|
retarray->dim[1].stride = retarray->dim[0].ubound+1;
|
|
}
|
|
|
|
retarray->data
|
|
= internal_malloc_size (sizeof ('rtype_name`) * size0 ((array_t *) retarray));
|
|
retarray->offset = 0;
|
|
}
|
|
else if (unlikely (compile_options.bounds_check))
|
|
{
|
|
index_type ret_extent, arg_extent;
|
|
|
|
if (GFC_DESCRIPTOR_RANK (a) == 1)
|
|
{
|
|
arg_extent = b->dim[1].ubound + 1 - b->dim[1].lbound;
|
|
ret_extent = retarray->dim[0].ubound + 1 - retarray->dim[0].lbound;
|
|
if (arg_extent != ret_extent)
|
|
runtime_error ("Incorrect extent in return array in"
|
|
" MATMUL intrinsic: is %ld, should be %ld",
|
|
(long int) ret_extent, (long int) arg_extent);
|
|
}
|
|
else if (GFC_DESCRIPTOR_RANK (b) == 1)
|
|
{
|
|
arg_extent = a->dim[0].ubound + 1 - a->dim[0].lbound;
|
|
ret_extent = retarray->dim[0].ubound + 1 - retarray->dim[0].lbound;
|
|
if (arg_extent != ret_extent)
|
|
runtime_error ("Incorrect extent in return array in"
|
|
" MATMUL intrinsic: is %ld, should be %ld",
|
|
(long int) ret_extent, (long int) arg_extent);
|
|
}
|
|
else
|
|
{
|
|
arg_extent = a->dim[0].ubound + 1 - a->dim[0].lbound;
|
|
ret_extent = retarray->dim[0].ubound + 1 - retarray->dim[0].lbound;
|
|
if (arg_extent != ret_extent)
|
|
runtime_error ("Incorrect extent in return array in"
|
|
" MATMUL intrinsic for dimension 1:"
|
|
" is %ld, should be %ld",
|
|
(long int) ret_extent, (long int) arg_extent);
|
|
|
|
arg_extent = b->dim[1].ubound + 1 - b->dim[1].lbound;
|
|
ret_extent = retarray->dim[1].ubound + 1 - retarray->dim[1].lbound;
|
|
if (arg_extent != ret_extent)
|
|
runtime_error ("Incorrect extent in return array in"
|
|
" MATMUL intrinsic for dimension 2:"
|
|
" is %ld, should be %ld",
|
|
(long int) ret_extent, (long int) arg_extent);
|
|
}
|
|
}
|
|
|
|
abase = a->data;
|
|
a_kind = GFC_DESCRIPTOR_SIZE (a);
|
|
|
|
if (a_kind == 1 || a_kind == 2 || a_kind == 4 || a_kind == 8
|
|
#ifdef HAVE_GFC_LOGICAL_16
|
|
|| a_kind == 16
|
|
#endif
|
|
)
|
|
abase = GFOR_POINTER_TO_L1 (abase, a_kind);
|
|
else
|
|
internal_error (NULL, "Funny sized logical array");
|
|
|
|
bbase = b->data;
|
|
b_kind = GFC_DESCRIPTOR_SIZE (b);
|
|
|
|
if (b_kind == 1 || b_kind == 2 || b_kind == 4 || b_kind == 8
|
|
#ifdef HAVE_GFC_LOGICAL_16
|
|
|| b_kind == 16
|
|
#endif
|
|
)
|
|
bbase = GFOR_POINTER_TO_L1 (bbase, b_kind);
|
|
else
|
|
internal_error (NULL, "Funny sized logical array");
|
|
|
|
dest = retarray->data;
|
|
'
|
|
sinclude(`matmul_asm_'rtype_code`.m4')dnl
|
|
`
|
|
if (GFC_DESCRIPTOR_RANK (retarray) == 1)
|
|
{
|
|
rxstride = retarray->dim[0].stride;
|
|
rystride = rxstride;
|
|
}
|
|
else
|
|
{
|
|
rxstride = retarray->dim[0].stride;
|
|
rystride = retarray->dim[1].stride;
|
|
}
|
|
|
|
/* If we have rank 1 parameters, zero the absent stride, and set the size to
|
|
one. */
|
|
if (GFC_DESCRIPTOR_RANK (a) == 1)
|
|
{
|
|
astride = a->dim[0].stride * a_kind;
|
|
count = a->dim[0].ubound + 1 - a->dim[0].lbound;
|
|
xstride = 0;
|
|
rxstride = 0;
|
|
xcount = 1;
|
|
}
|
|
else
|
|
{
|
|
astride = a->dim[1].stride * a_kind;
|
|
count = a->dim[1].ubound + 1 - a->dim[1].lbound;
|
|
xstride = a->dim[0].stride * a_kind;
|
|
xcount = a->dim[0].ubound + 1 - a->dim[0].lbound;
|
|
}
|
|
if (GFC_DESCRIPTOR_RANK (b) == 1)
|
|
{
|
|
bstride = b->dim[0].stride * b_kind;
|
|
assert(count == b->dim[0].ubound + 1 - b->dim[0].lbound);
|
|
ystride = 0;
|
|
rystride = 0;
|
|
ycount = 1;
|
|
}
|
|
else
|
|
{
|
|
bstride = b->dim[0].stride * b_kind;
|
|
assert(count == b->dim[0].ubound + 1 - b->dim[0].lbound);
|
|
ystride = b->dim[1].stride * b_kind;
|
|
ycount = b->dim[1].ubound + 1 - b->dim[1].lbound;
|
|
}
|
|
|
|
for (y = 0; y < ycount; y++)
|
|
{
|
|
for (x = 0; x < xcount; x++)
|
|
{
|
|
/* Do the summation for this element. For real and integer types
|
|
this is the same as DOT_PRODUCT. For complex types we use do
|
|
a*b, not conjg(a)*b. */
|
|
pa = abase;
|
|
pb = bbase;
|
|
*dest = 0;
|
|
|
|
for (n = 0; n < count; n++)
|
|
{
|
|
if (*pa && *pb)
|
|
{
|
|
*dest = 1;
|
|
break;
|
|
}
|
|
pa += astride;
|
|
pb += bstride;
|
|
}
|
|
|
|
dest += rxstride;
|
|
abase += xstride;
|
|
}
|
|
abase -= xstride * xcount;
|
|
bbase += ystride;
|
|
dest += rystride - (rxstride * xcount);
|
|
}
|
|
}
|
|
|
|
#endif
|
|
'
|