147 lines
		
	
	
		
			4.3 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			147 lines
		
	
	
		
			4.3 KiB
		
	
	
	
		
			C
		
	
	
	
/*********************************************************************/
 | 
						|
/* Copyright 2009, 2010 The University of Texas at Austin.           */
 | 
						|
/* All rights reserved.                                              */
 | 
						|
/*                                                                   */
 | 
						|
/* 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.                              */
 | 
						|
/*                                                                   */
 | 
						|
/*    THIS  SOFTWARE IS PROVIDED  BY THE  UNIVERSITY OF  TEXAS AT    */
 | 
						|
/*    AUSTIN  ``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  OF TEXAS AT    */
 | 
						|
/*    AUSTIN OR 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.                                    */
 | 
						|
/*                                                                   */
 | 
						|
/* The views and conclusions contained in the software and           */
 | 
						|
/* documentation are those of the authors and should not be          */
 | 
						|
/* interpreted as representing official policies, either expressed   */
 | 
						|
/* or implied, of The University of Texas at Austin.                 */
 | 
						|
/*********************************************************************/
 | 
						|
 | 
						|
#include <stdio.h>
 | 
						|
#include "common.h"
 | 
						|
#ifdef FUNCTION_PROFILE
 | 
						|
#include "functable.h"
 | 
						|
#endif
 | 
						|
 | 
						|
#if defined(DOUBLE)
 | 
						|
#define ERROR_NAME "ZGEADD "
 | 
						|
#else
 | 
						|
#define ERROR_NAME "CGEADD "
 | 
						|
#endif
 | 
						|
 | 
						|
#ifndef CBLAS
 | 
						|
 | 
						|
void NAME(blasint *M, blasint *N, FLOAT *ALPHA, FLOAT *a, blasint *LDA,
 | 
						|
		                  FLOAT *BETA,  FLOAT *c, blasint *LDC)
 | 
						|
{
 | 
						|
 | 
						|
  blasint m = *M;
 | 
						|
  blasint n = *N;
 | 
						|
  blasint lda = *LDA;
 | 
						|
  blasint ldc = *LDC; 
 | 
						|
 | 
						|
  blasint info;
 | 
						|
 | 
						|
  PRINT_DEBUG_NAME;
 | 
						|
 | 
						|
  info = 0;
 | 
						|
 | 
						|
 | 
						|
  if (lda < MAX(1, m))	info = 6;
 | 
						|
  if (ldc < MAX(1, m))	info = 8;
 | 
						|
 | 
						|
  if (n < 0)		info = 2;
 | 
						|
  if (m < 0)		info = 1;
 | 
						|
 | 
						|
  if (info != 0){
 | 
						|
    BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
 | 
						|
    return;
 | 
						|
  }
 | 
						|
 | 
						|
#else
 | 
						|
void CNAME( enum CBLAS_ORDER order, blasint m,  blasint n,  FLOAT *ALPHA, FLOAT *a,  blasint lda, FLOAT *BETA, 
 | 
						|
		  FLOAT *c,  blasint ldc)
 | 
						|
{
 | 
						|
/* 
 | 
						|
void CNAME(enum CBLAS_ORDER order,
 | 
						|
	   blasint m, blasint n,
 | 
						|
	   FLOAT alpha,
 | 
						|
	   FLOAT  *a, blasint lda,
 | 
						|
	   FLOAT beta,
 | 
						|
	   FLOAT  *c, blasint ldc){ */
 | 
						|
 | 
						|
  blasint info, t;
 | 
						|
 | 
						|
  PRINT_DEBUG_CNAME;
 | 
						|
 | 
						|
  info  =  0;
 | 
						|
 | 
						|
  if (order == CblasColMajor) {
 | 
						|
 | 
						|
    info = -1;
 | 
						|
 | 
						|
    if (ldc < MAX(1, m))  info = 8;
 | 
						|
    if (lda < MAX(1, m))  info = 5;
 | 
						|
    if (n < 0)		  info = 2;
 | 
						|
    if (m < 0)		  info = 1;
 | 
						|
 | 
						|
  }
 | 
						|
 | 
						|
  if (order == CblasRowMajor) {
 | 
						|
    info = -1;
 | 
						|
 | 
						|
    t = n;
 | 
						|
    n = m;
 | 
						|
    m = t;
 | 
						|
 | 
						|
    if (ldc < MAX(1, m))  info = 8;
 | 
						|
    if (lda < MAX(1, m))  info = 5;
 | 
						|
    if (n < 0)		  info = 2;
 | 
						|
    if (m < 0)		  info = 1;
 | 
						|
  }
 | 
						|
 | 
						|
  if (info >= 0) {
 | 
						|
    BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
 | 
						|
    return;
 | 
						|
  }
 | 
						|
 | 
						|
#endif
 | 
						|
 | 
						|
  if ((m==0) || (n==0)) return;
 | 
						|
 | 
						|
 | 
						|
  IDEBUG_START;
 | 
						|
 | 
						|
  FUNCTION_PROFILE_START();
 | 
						|
 | 
						|
 | 
						|
  GEADD_K(m,n,ALPHA[0],ALPHA[1], a, lda, BETA[0], BETA[1], c, ldc); 
 | 
						|
 | 
						|
 | 
						|
  FUNCTION_PROFILE_END(1, 2* m * n ,  2 * m * n);
 | 
						|
 | 
						|
  IDEBUG_END;
 | 
						|
 | 
						|
  return;
 | 
						|
 | 
						|
}
 |