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, syr2k )
63
const enum ATLAS_UPLO UPLO,
64
const enum ATLAS_TRANS TRANS,
81
* Mjoin( PATL, syr2k ) performs one of the @(syhe_comm) rank 2k operations
83
* C := alpha * A * B' + alpha * B * A' + beta * C,
87
* C := alpha * A' * B + alpha * B' * A + beta * C,
89
* where alpha and beta are scalars, C is an n by n @(syhe_comm) matrix and
90
* A and B are n by k matrices in the first case and k by n matrices in
93
* This is a recursive version of the algorithm. For a more detailed
94
* description of the arguments of this function, see the reference im-
95
* plementation in the ATLAS/src/blas/reference directory.
97
* ---------------------------------------------------------------------
100
* .. Local Variables ..
103
TYPE alpha0 = (TYPE)(ALPHA), beta0 = (TYPE)(BETA);
105
TYPE * alpha, * beta;
107
TYPE one[2] = { ATL_rone, ATL_rzero };
108
TYPE * alpha, * beta;
110
RC3_FUN_SYR2K_T ATL_rsyr2k;
113
* .. Executable Statements ..
117
( ( SCALAR_IS_ZERO( ALPHA ) || ( K == 0 ) ) && SCALAR_IS_ONE( BETA ) ) )
120
if( ( SCALAR_IS_ZERO( ALPHA ) ) || ( K == 0 ) )
121
{ Mjoin( PATL, trscal )( UPLO, N, N, BETA, C, LDC ); return; }
123
type.size = sizeof( TYPE ); type.one = (void *)(&one);
124
alpha = &alpha0; beta = &beta0;
126
type.size = sizeof( TYPE[2] ); type.one = (void *)one;
127
alpha = (TYPE *)(ALPHA); beta = (TYPE *)(BETA);
130
if( TRANS == AtlasNoTrans )
132
type.Tgemm = Mjoin( PATL, gemmNT_RB );
133
if( UPLO == AtlasUpper )
134
{ type.Tsyr2k = Mjoin( PATL, syr2kUN ); ATL_rsyr2k = ATL_rsyr2kUN; }
136
{ type.Tsyr2k = Mjoin( PATL, syr2kLN ); ATL_rsyr2k = ATL_rsyr2kLN; }
140
type.Tgemm = Mjoin( PATL, gemmTN_RB );
141
if( UPLO == AtlasUpper )
142
{ type.Tsyr2k = Mjoin( PATL, syr2kUT ); ATL_rsyr2k = ATL_rsyr2kUT; }
144
{ type.Tsyr2k = Mjoin( PATL, syr2kLT ); ATL_rsyr2k = ATL_rsyr2kLT; }
147
ATL_rsyr2k( &type, N, K, (void *)(alpha), (void *)(A), LDA, (void *)(B),
148
LDB, (void *)(beta), (void *)(C), LDC, SYR2K_NB );
150
* End of Mjoin( PATL, syr2k )