📄 atl_cprk_kmm.c
字号:
/* * Automatically Tuned Linear Algebra Software v3.8.0 * (C) Copyright 2003 R. Clint Whaley * * 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 distribution. * 3. The name of the ATLAS group or the names of its contributers may * not be used to endorse or promote products derived from this * software without specific written permission. * * 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 ATLAS GROUP OR ITS CONTRIBUTORS * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 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 THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. * */#define ATL_NOL3#include "atlas_pkblas.h"/* * Get NB defined to call the real matmul */#ifdef SCPLX #undef SCPLX #define SREAL #include "atlas_lvl3.h" #undef SREAL #define SCPLX#elif defined DCPLX #undef DCPLX #define DREAL #include "atlas_lvl3.h" #undef DREAL #define DCPLX#endif/* * Can't use standard include file, since we are doing inter-type calls, * so dump explicit headers here */void NBmm_b0(const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pNBmm_b0) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pMBmm_b0) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pKBmm_b0) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void NBmm_b1(const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pNBmm_b1) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pMBmm_b1) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pKBmm_b1) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void NBmm_bX(const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pNBmm_bX) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pMBmm_bX) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pKBmm_bX) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);void Mjoin(PATLU,pKBmm) (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc);static void ATL_gNBmm_b0 (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc)/* * ALPHA is known to be 1 (handled by copy) * BETA is known to be 0; we handle actual BETA in putblk phase */{ if (M == MB && N == NB && K == KB) { NBmm_b0(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rzero, C+NBNB, ldc); NBmm_b0(M, N, K, ATL_rone, A, lda, B+NBNB, ldb, ATL_rzero, C, ldc); NBmm_bX(M, N, K, ATL_rone, A+NBNB, lda, B+NBNB, ldb, ATL_rnone, C+NBNB, ldc); NBmm_b1(M, N, K, ATL_rone, A+NBNB, lda, B, ldb, ATL_rone, C, ldc); } else if (M != MB) { if (N == NB && K == KB) { Mjoin(PATLU,pMBmm_b0)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rzero, C+M*N, ldc); Mjoin(PATLU,pMBmm_b0)(M, N, K, ATL_rone, A, lda, B+NBNB, ldb, ATL_rzero, C, ldc); Mjoin(PATLU,pMBmm_bX)(M, N, K, ATL_rone, A+M*K, lda, B+NBNB, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pMBmm_b1)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } else { Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rzero, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rzero, C, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } } else if (N != NB) /* ib is full */ { if (K == KB) { Mjoin(PATLU,pNBmm_b0)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rzero, C+M*N, ldc); Mjoin(PATLU,pNBmm_b0)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rzero, C, ldc); Mjoin(PATLU,pNBmm_bX)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pNBmm_b1)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } else { Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rzero, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rzero, C, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } } else /* ib and jb are full */ { Mjoin(PATLU,pKBmm_b0)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rzero, C+M*N, ldc); Mjoin(PATLU,pKBmm_b0)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rzero, C, ldc); Mjoin(PATLU,pKBmm_bX)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm_b1)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); }}static void ATL_gNBmm_b1 (const int M, const int N, const int K, const TYPE alpha, const TYPE *A, const int lda, const TYPE *B, const int ldb, const TYPE beta, TYPE *C, const int ldc)/* * ALPHA is known to be 1 (handled by copy) * BETA is known to be 1; we handle actual BETA in putblk phase */{ if (M == MB && N == NB && K == KB) { NBmm_bX(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rnone, C+NBNB, ldc); NBmm_b1(M, N, K, ATL_rone, A, lda, B+NBNB, ldb, ATL_rone, C, ldc); NBmm_bX(M, N, K, ATL_rone, A+NBNB, lda, B+NBNB, ldb, ATL_rnone, C+NBNB, ldc); NBmm_b1(M, N, K, ATL_rone, A+NBNB, lda, B, ldb, ATL_rone, C, ldc); } else if (M != MB) { if (N == NB && K == KB) { Mjoin(PATLU,pMBmm_bX)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pMBmm_b1)(M, N, K, ATL_rone, A, lda, B+NBNB, ldb, ATL_rone, C, ldc); Mjoin(PATLU,pMBmm_bX)(M, N, K, ATL_rone, A+M*K, lda, B+NBNB, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pMBmm_b1)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } else { Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rone, C, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } } else if (N != NB) /* ib is full */ { if (K == KB) { Mjoin(PATLU,pNBmm_bX)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pNBmm_b1)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rone, C, ldc); Mjoin(PATLU,pNBmm_bX)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pNBmm_b1)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } else { Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rone, C, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); } } else /* ib and jb are full */ { Mjoin(PATLU,pKBmm_bX)(M, N, K, ATL_rone, A, lda, B, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm_b1)(M, N, K, ATL_rone, A, lda, B+N*K, ldb, ATL_rone, C, ldc); Mjoin(PATLU,pKBmm_bX)(M, N, K, ATL_rone, A+M*K, lda, B+N*K, ldb, ATL_rnone, C+M*N, ldc); Mjoin(PATLU,pKBmm_b1)(M, N, K, ATL_rone, A+M*K, lda, B, ldb, ATL_rone, C, ldc); }}#define ATL_pmmJIKF Mjoin(PATL,pmmJIKF)#define ATL_pmmJIK Mjoin(PATL,pmmJIK)#define ATL_prow2blkTF Mjoin(PATL,prow2blkTF)#define ATL_pcol2blkF Mjoin(PATL,pcol2blkF)#define ATL_pcol2blk Mjoin(PATL,pcol2blk_a1)#define ATL_pcol2blk_aX Mjoin(PATL,pcol2blk_aX)#define ATL_prow2blkT Mjoin(PATL,prow2blkT_a1)#define ATL_prow2blkT_aX Mjoin(PATL,prow2blkT_aX)#define ATL_pputblk Mjoin(PATL,pputblk)#define KBmm Mjoin(PATL,pKBmm)#define pNBmm ATL_gNBmm_b1#define pNBmm0 ATL_gNBmm_b0#define ATL_gNBmm ATL_gNBmm_b1int Mjoin(PATL,prk_kmm)(const enum ATLAS_UPLO UC, const enum PACK_UPLO UA, const enum ATLAS_TRANS TA, const int N, const int K, const SCALAR alpha, const TYPE *A, const int lda, const SCALAR beta, const int CP, TYPE *C, const int ldc)/* * If CP == 0, then C is a general rectangular matrix. * If CP != 0, then C is packed matrix. * In both cases, UC tells what portion of the matrix to update. * Performs a syrk/sprk by calling the gemm kernel directly */{ const enum PACK_UPLO UC2 = ((CP) ? UC : PackGen); const int nKb = ATL_DivByNB(K), kb = K - ATL_MulByNB(nKb); const int KK = K - kb; const int incK = ATL_MulByNB(K)SHIFT; const int ldainc = (UA == AtlasUpper) ? 1 : ((UA == AtlasLower) ? -1 : 0); const int ldcinc = (UC2 == AtlasUpper) ? 1 : ((UC2 == AtlasLower) ? -1 : 0); int i, j, k, ib, jb, iend; void *vC=NULL; TYPE *pC, *pA, *pB, *c; const int K2 = K + K; const TYPE one[2] = {ATL_rone, ATL_rzero};/* * Grab enough space for NBxNB C workspace and all of A, and copy all of A. * If this is too much, we will reduce K in outer routine until malloc succeeds */ i = ATL_Cachelen + ATL_MulBySize(NBNB+N*K); if (i <= ATL_pkMaxMalloc || K <= NB) vC = malloc(i); if (!vC) return(-1); pC = ATL_AlignPtr(vC); pB = pC + NBNB2; if (TA == AtlasNoTrans) Mjoin(ATL_prow2blkTF,_blk)(NB, N, K, one, A, lda, ldainc, pB); else Mjoin(ATL_pcol2blkF,_blk)(NB, K, N, one, A, lda, ldainc, pB);/* * Loop over column panels of $C$ */ for (j=0; j < N; j += NB) { jb = N-j; jb = Mmin(jb, NB);/* * Loop over row panels of $C$ */ iend = (UC == AtlasUpper) ? j+1 : N; for (i=((UC == AtlasUpper) ? 0 : j); i < iend; i += NB) { pA = pC + NBNB2 + i*(K SHIFT); ib = N-i; ib = Mmin(ib, NB); if (ib != NB || jb != NB) Mjoin(PATL,gezero)(ib, jb, pC, ib); if (nKb) { pNBmm0(ib, jb, NB, ATL_rone, pA, NB, pB, NB, ATL_rzero, pC, ib); for (k=NB; k != KK; k += NB) pNBmm(ib, jb, NB, ATL_rone, pA+ib*(k SHIFT), NB, pB+jb*(k SHIFT), NB, ATL_rone, pC, ib); if (kb) ATL_gNBmm(ib, jb, kb, ATL_rone, pA+ib*(KK SHIFT), kb, pB+jb*(KK SHIFT), kb, ATL_rone, pC, ib); } else if (kb) { if (ib == NB && jb == NB) Mjoin(PATL,gezero)(ib, jb, pC, ib); ATL_gNBmm(ib,jb,kb, ATL_rone, pA, kb, pB, kb, ATL_rzero, pC, ib); } if (i != j) Mjoin(PATL,pputblk_aX)(ib, jb, pC, C+MindexP(UC2,i,j,ldc), Mpld(UC2,j,ldc), ldcinc, alpha, beta); else Mjoin(PATL,pputblk_diag)(ib, jb, pC, UC, C+MindexP(UC2,i,j,ldc), Mpld(UC2,j,ldc), ldcinc, alpha, beta); } pB += incK; } free(vC); return(0);}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -