📄 atl_rsyr2kln.c
字号:
/* --------------------------------------------------------------------- * * -- Automatically Tuned Linear Algebra Software (ATLAS) * (C) Copyright 2000 All Rights Reserved * * -- ATLAS routine -- Version 3.2 -- December 25, 2000 * * Author : Antoine P. Petitet * Contributor(s) : R. Clint Whaley * Originally developed at the University of Tennessee, * Innovative Computing Laboratory, Knoxville TN, 37996-1301, USA. * * --------------------------------------------------------------------- * * -- Copyright notice and Licensing terms: * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions, and the following disclaimer in * the documentation and/or other materials provided with the distri- * bution. * 3. The name of the University, the ATLAS group, or the names of its * contributors may not be used to endorse or promote products deri- * ved from this software without specific written permission. * * -- Disclaimer: * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, * OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEO- * RY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (IN- * CLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * --------------------------------------------------------------------- *//* * Include files */#include "atlas_rblas3.h"#include "atlas_kernel3.h"void ATL_rsyr2kLN( RC3_SYR2K_T * RTYP, const int N, const int K, const void * ALPHA, const void * A, const int LDA, const void * B, const int LDB, const void * BETA, void * C, const int LDC, const int RB){/* * Purpose * ======= * * ATL_rsyr2kLN performs the following symmetric rank-2k operation * * C := alpha * A * B' + alpha * B * A' + beta * C, * * where alpha and beta are scalars, C is an n by n (lower) symmetric * matrix and A and B are n by k matrices. * * This is a type-less recursive version of the algorithm. * * --------------------------------------------------------------------- *//* * .. Local Variables .. */ size_t size; int n1, n2;/* .. * .. Executable Statements .. * */#ifndef SYR2K_REC if( !RTYP->Tsyr2k( N, K, ALPHA, A, LDA, B, LDB, BETA, C, LDC ) ) return;#endif if( ( n1 = N - RB ) <= 0 ) { ATL_assert( RTYP->Tsyr2k( N, K, ALPHA, A, LDA, B, LDB, BETA, C, LDC ) == 0 ); return; } n2 = N - ( n1 = RB + ( n1 / ( RB << 1 ) ) * RB ); size = RTYP->size; ATL_rsyr2kLN( RTYP, n1, K, ALPHA, A, LDA, B, LDB, BETA, C, LDC, RB ); RTYP->Tgemm( n2, n1, K, ALPHA, Mrc3( A, n1, 0, LDA, size ), LDA, B, LDB, BETA, Mrc3( C, n1, 0, LDC, size ), LDC ); RTYP->Tgemm( n2, n1, K, ALPHA, Mrc3( B, n1, 0, LDB, size ), LDB, A, LDA, RTYP->one, Mrc3( C, n1, 0, LDC, size ), LDC ); ATL_rsyr2kLN( RTYP, n2, K, ALPHA, Mrc3( A, n1, 0, LDA, size ), LDA, Mrc3( B, n1, 0, LDB, size ), LDB, BETA, Mrc3( C, n1, n1, LDC, size ), LDC, RB );/* * End of ATL_rsyr2kLN */}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -