dgefmm.c

来自「C++编写的高性能矩阵乘法的Stranssen算法」· C语言 代码 · 共 32 行

/*============================================================================
Fast matrix multiply with no extra memory.  This routine is a DGEMM look-alike.
It merely sets a NULL pointer and calls fmm, which will allocate memory.
It has a Fortran style interface.  All arrays are column oriented storage 
(Fortran style).

Inputs 
  c_transa,c_transb : characters specifying form of A or B (transpose or not)
  p_m,p_n,p_k       : matrix dimensions
  p_alpha,p_beta    : scalars
  A                 : m x k matrix
  B                 : k x n matrix
  p_ldb,p_lda,p_ldc : matrix leading dimensions
Outputs
  C                 : m x n matrix, C = alpha*A*B+beta*C
  ============================================================================*/
  #include "matrix.h"

void DGEFMM(char *c_transa, char *c_transb, int *p_m, int *p_n, int *p_k, double 
	    *p_alpha, double *a, int *p_lda, double *b, int *p_ldb,
	    double *p_beta, double *c, int *p_ldc)
{

  int i_naux;           /* Size of work space */

  /* Call fmm with a NULL pointer of length 0 for temporary storage */
  i_naux = 0;
  fmm(*c_transa, *c_transb, *p_m, *p_n, *p_k, *p_alpha, a, *p_lda,
      b, *p_ldb, *p_beta, c, *p_ldc, NULL, i_naux);  

}