1
/* ---------------------------------------------------------------------
3
* -- Automatically Tuned Linear Algebra Software (ATLAS)
4
* (C) Copyright 2000 All Rights Reserved
6
* -- ATLAS routine -- Version 3.2 -- December 25, 2000
8
* -- Suggestions, comments, bugs reports should be sent to the follo-
9
* wing e-mail address: atlas@cs.utk.edu
11
* Author : Antoine P. Petitet
12
* Contributor(s) : R. Clint Whaley
13
* University of Tennessee - Innovative Computing Laboratory
14
* Knoxville TN, 37996-1301, USA.
16
* ---------------------------------------------------------------------
18
* -- Copyright notice and Licensing terms:
20
* Redistribution and use in source and binary forms, with or without
21
* modification, are permitted provided that the following conditions
24
* 1. Redistributions of source code must retain the above copyright
25
* notice, this list of conditions and the following disclaimer.
26
* 2. Redistributions in binary form must reproduce the above copyright
27
* notice, this list of conditions, and the following disclaimer in
28
* the documentation and/or other materials provided with the distri-
30
* 3. The name of the University, the ATLAS group, or the names of its
31
* contributors may not be used to endorse or promote products deri-
32
* ved from this software without specific written permission.
36
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
37
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
38
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
39
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
40
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
41
* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
42
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
43
* OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEO-
44
* RY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (IN-
45
* CLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
46
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
48
* ---------------------------------------------------------------------
53
#include "atlas_rblas3.h"
54
#include "atlas_kernel3.h"
55
#include "atlas_lvl3.h"
61
void Mjoin( PATL, symm )
63
const enum ATLAS_SIDE SIDE,
64
const enum ATLAS_UPLO UPLO,
81
* Mjoin( PATL, symm ) performs one of the matrix-matrix operations
83
* C := alpha * A * B + beta * C,
87
* C := alpha * B * A + beta * C,
89
* where alpha and beta are scalars, A is a symmetric matrix and B and
90
* C are m by n matrices.
92
* This is a recursive version of the algorithm. For a more detailed
93
* description of the arguments of this function, see the reference im-
94
* plementation in the ATLAS/src/blas/reference directory.
96
* ---------------------------------------------------------------------
99
* .. Local Variables ..
102
TYPE alpha0 = (TYPE)(ALPHA), beta0 = (TYPE)(BETA);
103
const TYPE one = ATL_rone;
105
TYPE one[2] = { ATL_rone, ATL_rzero };
107
TYPE * alpha, * beta;
108
RC3_FUN_SYMM_T ATL_rsymm;
111
* .. Executable Statements ..
114
if( ( M == 0 ) || ( N == 0 ) ||
115
( ( SCALAR_IS_ZERO( ALPHA ) ) && ( SCALAR_IS_ONE( BETA ) ) ) ) return;
117
if( SCALAR_IS_ZERO( ALPHA ) )
118
{ Mjoin( PATL, gescal )( M, N, BETA, C, LDC ); return; }
120
type.size = sizeof( TYPE ); type.one = (void *)(&one);
121
type.TgemmNN = Mjoin( PATL, gemmNN_RB );
122
alpha = &alpha0; beta = &beta0;
124
type.size = sizeof( TYPE[2] ); type.one = (void *)(one);
125
type.TgemmNN = Mjoin( PATL, gemmNN_RB );
126
alpha = (TYPE *)(ALPHA); beta = (TYPE *)(BETA);
129
if( SIDE == AtlasLeft )
131
type.Tgemm = Mjoin( PATL, gemmTN_RB );
132
if( UPLO == AtlasUpper )
133
{ type.Tsymm = Mjoin( PATL, symmLU ); ATL_rsymm = ATL_rsymmLU; }
135
{ type.Tsymm = Mjoin( PATL, symmLL ); ATL_rsymm = ATL_rsymmLL; }
139
type.Tgemm = Mjoin( PATL, gemmNT_RB );
140
if( UPLO == AtlasUpper )
141
{ type.Tsymm = Mjoin( PATL, symmRU ); ATL_rsymm = ATL_rsymmRU; }
143
{ type.Tsymm = Mjoin( PATL, symmRL ); ATL_rsymm = ATL_rsymmRL; }
146
ATL_rsymm( &type, M, N, ((void *)alpha), ((void *)A), LDA, ((void *)B),
147
LDB, ((void *)beta), ((void *)C), LDC, SYMM_NB );
149
* End of Mjoin( PATL, symm )