atl_f77wrap_gemm.c

来自「基于Blas CLapck的.用过的人知道是干啥的」· C语言 代码 · 共 144 行

/* ---------------------------------------------------------------------
 *
 * -- Automatically Tuned Linear Algebra Software (ATLAS)
 *    (C) Copyright 2000 All Rights Reserved
 *
 * -- ATLAS routine -- Version 3.2 -- December 25, 2000
 *
 * Author         : Antoine P. Petitet
 * 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_f77wrap.h"
#include "atlas_level3.h"

void Mjoin( PATLF77WRAP, gemm )
(
   F77_INTEGER                * ITRANSA,
   F77_INTEGER                * ITRANSB,
   F77_INTEGER                * M,
   F77_INTEGER                * N,
   F77_INTEGER                * K,
   TYPE                       * ALPHA,
   TYPE                       * A,
   F77_INTEGER                * LDA,
   TYPE                       * B,
   F77_INTEGER                * LDB,
   TYPE                       * BETA,
   TYPE                       * C,
   F77_INTEGER                * LDC
)
{
/*
 * Purpose
 * =======
 *
 * ATL_F77wrap_gemm performs one of the matrix-matrix operations
 *
 *    C := alpha * op( A ) * op( B ) + beta * C,
 *
 * where op( X ) is one of
 *
 *    op( X ) = X   or   op( X ) = X'   or   op( X ) = conjg( X' ).
 *
 * Alpha and beta are scalars, and A, B and C are matrices, with op( A )
 * an m by k matrix,  op( B )  a  k by n matrix and  C an m by n matrix.
 *
 * Notes
 * =====
 *
 * This routine is an internal wrapper function written in  C  called by
 * the corresponding Fortran 77 user callable subroutine.  It calls  the
 * appropriate ATLAS routine performing the actual computation.
 *
 * This wrapper layer resolves the following portability issues:
 *
 *    - the routines' name sheme translation imposed by the  Fortran / C
 *      compilers of your target computer,
 *    - the translation of Fortran characters into the ATLAS  correspon-
 *      ding C enumerated type (in cooperation with the Fortan user cal-
 *      lable subroutine),
 *    - the translation of Fortran integers into the proper C correspon-
 *      ding native type;
 *
 * and the following ease-of-programming issue:
 *
 *    - a pointer to the the first entry of vector operands (when appli-
 *      cable) is passed to the  ATLAS computational routine even if the
 *      corresponding input increment value is negative. This allows for
 *      a more natural expression in  C  of the computation performed by
 *      these ATLAS functions.
 *
 * ---------------------------------------------------------------------
 */
/* ..
 * .. Executable Statements ..
 *
 */
#ifdef TCPLX
   TYPE CONE[2] = {ATL_rone, ATL_rzero}, *beta=BETA;
#endif
/*
 * Call SYRK/HERK when that's what the user is actually asking for; Added by RCW
 * Just handle beta=0, since beta=X requires a copy of C to preserve asymmetry
 */
   if (A == B && *M == *N && *ITRANSA != *ITRANSB && *LDA == *LDB &&
       *BETA == ATL_rzero)
   {
      #ifdef TCPLX
      if (*ITRANSA != AtlasConjTrans && *ITRANSB != AtlasConjTrans &&
          BETA[1] == ATL_rzero)
      {
      #endif
         Mjoin(PATL,syrk)(AtlasUpper, *ITRANSA, *N, *K, SVVAL ALPHA, A, *LDA,
                          SVVAL BETA, C, *LDC);
         Mjoin(PATL,syreflect)(AtlasUpper, *N, C, *LDC);
         return;
      #ifdef TCPLX
      }
      #endif
   }
   Mjoin( PATL, gemm )( *ITRANSA, *ITRANSB, *M, *N, *K, SVVAL ALPHA, A, *LDA,
                        B, *LDB, SVVAL BETA, C, *LDC );
/*
 * End of Mjoin( PATLF77WRAP, gemm )
 */
}