198 lines
		
	
	
		
			5.4 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			198 lines
		
	
	
		
			5.4 KiB
		
	
	
	
		
			C
		
	
	
	
/***************************************************************************
 | 
						|
Copyright (c) 2014, The OpenBLAS Project
 | 
						|
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.
 | 
						|
3. Neither the name of the OpenBLAS project nor the names of
 | 
						|
its contributors may be used to endorse or promote products
 | 
						|
derived from this software without specific prior 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 OPENBLAS PROJECT 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.
 | 
						|
*****************************************************************************/
 | 
						|
 | 
						|
#include "bench.h"
 | 
						|
 | 
						|
 | 
						|
#undef GEMV
 | 
						|
 | 
						|
#ifndef COMPLEX
 | 
						|
 | 
						|
#ifdef DOUBLE
 | 
						|
#define GEMV   BLASFUNC(dgemv)
 | 
						|
#else
 | 
						|
#define GEMV   BLASFUNC(sgemv)
 | 
						|
#endif
 | 
						|
 | 
						|
#else
 | 
						|
 | 
						|
#ifdef DOUBLE
 | 
						|
#define GEMV   BLASFUNC(zgemv)
 | 
						|
#else
 | 
						|
#define GEMV   BLASFUNC(cgemv)
 | 
						|
#endif
 | 
						|
 | 
						|
#endif
 | 
						|
int main(int argc, char *argv[]){
 | 
						|
 | 
						|
  FLOAT *a, *x, *y;
 | 
						|
  FLOAT alpha[] = {1.0, 1.0};
 | 
						|
  FLOAT beta [] = {1.0, 0.0};
 | 
						|
  char trans='N';
 | 
						|
  blasint m, i, j;
 | 
						|
  blasint inc_x=1,inc_y=1;
 | 
						|
  blasint n=0;
 | 
						|
  int has_param_n = 0;
 | 
						|
  int has_param_m = 0;
 | 
						|
  int loops = 1;
 | 
						|
  int l;
 | 
						|
  char *p;
 | 
						|
 | 
						|
  int from =   1;
 | 
						|
  int to   = 200;
 | 
						|
  int step =   1;
 | 
						|
 | 
						|
  double time1,timeg;
 | 
						|
 | 
						|
  argc--;argv++;
 | 
						|
 | 
						|
  if (argc > 0) { from     = atol(*argv);		argc--; argv++;}
 | 
						|
  if (argc > 0) { to       = MAX(atol(*argv), from);	argc--; argv++;}
 | 
						|
  if (argc > 0) { step     = atol(*argv);		argc--; argv++;}
 | 
						|
 | 
						|
 | 
						|
  int tomax = to;
 | 
						|
 | 
						|
  if ((p = getenv("OPENBLAS_LOOPS")))  loops = atoi(p);
 | 
						|
  if ((p = getenv("OPENBLAS_INCX")))   inc_x = atoi(p);
 | 
						|
  if ((p = getenv("OPENBLAS_INCY")))   inc_y = atoi(p);
 | 
						|
  if ((p = getenv("OPENBLAS_TRANS")))  trans=*p;
 | 
						|
  if ((p = getenv("OPENBLAS_PARAM_N"))) {
 | 
						|
	  n = atoi(p);
 | 
						|
	  if ((n>0)) has_param_n = 1;
 | 
						|
  	  if ( n > tomax ) tomax = n;
 | 
						|
  }
 | 
						|
  if ( has_param_n == 0 )
 | 
						|
  	if ((p = getenv("OPENBLAS_PARAM_M"))) {
 | 
						|
		  m = atoi(p);
 | 
						|
		  if ((m>0)) has_param_m = 1;
 | 
						|
  	  	  if ( m > tomax ) tomax = m;
 | 
						|
  	}
 | 
						|
 | 
						|
 | 
						|
 | 
						|
  fprintf(stderr, "From : %3d  To : %3d Step = %3d Trans = '%c' Inc_x = %d Inc_y = %d Loops = %d\n", from, to, step,trans,inc_x,inc_y,loops);
 | 
						|
 | 
						|
  if (( a = (FLOAT *)malloc(sizeof(FLOAT) * tomax * tomax * COMPSIZE)) == NULL){
 | 
						|
    fprintf(stderr,"Out of Memory!!\n");exit(1);
 | 
						|
  }
 | 
						|
 | 
						|
  if (( x = (FLOAT *)malloc(sizeof(FLOAT) * tomax * abs(inc_x) * COMPSIZE)) == NULL){
 | 
						|
    fprintf(stderr,"Out of Memory!!\n");exit(1);
 | 
						|
  }
 | 
						|
 | 
						|
  if (( y = (FLOAT *)malloc(sizeof(FLOAT) * tomax * abs(inc_y) * COMPSIZE)) == NULL){
 | 
						|
    fprintf(stderr,"Out of Memory!!\n");exit(1);
 | 
						|
  }
 | 
						|
 | 
						|
#ifdef __linux
 | 
						|
  srandom(getpid());
 | 
						|
#endif
 | 
						|
 | 
						|
  fprintf(stderr, "   SIZE       Flops\n");
 | 
						|
 | 
						|
  if (has_param_m == 0)
 | 
						|
  {
 | 
						|
 | 
						|
  	for(m = from; m <= to; m += step)
 | 
						|
  	{
 | 
						|
   		timeg=0;
 | 
						|
   		if ( has_param_n == 0 ) n = m;
 | 
						|
   		fprintf(stderr, " %6dx%d : ", (int)m,(int)n);
 | 
						|
   		for(j = 0; j < m; j++){
 | 
						|
      			for(i = 0; i < n * COMPSIZE; i++){
 | 
						|
				a[(long)i + (long)j * (long)m * COMPSIZE] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | 
						|
      			}
 | 
						|
   		}
 | 
						|
 | 
						|
    		for (l=0; l<loops; l++)
 | 
						|
    		{
 | 
						|
 | 
						|
   			for(i = 0; i < n * COMPSIZE * abs(inc_x); i++){
 | 
						|
				x[i] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | 
						|
   			}
 | 
						|
 | 
						|
   			for(i = 0; i < m * COMPSIZE * abs(inc_y); i++){
 | 
						|
				y[i] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | 
						|
   			}
 | 
						|
    			begin();
 | 
						|
    			GEMV (&trans, &m, &n, alpha, a, &m, x, &inc_x, beta, y, &inc_y );
 | 
						|
    			end();
 | 
						|
    			time1 = getsec();
 | 
						|
			timeg += time1;
 | 
						|
 | 
						|
    		}
 | 
						|
 | 
						|
    		timeg /= loops;
 | 
						|
 | 
						|
    		fprintf(stderr, " %10.2f MFlops %10.6f sec\n", COMPSIZE * COMPSIZE * 2. * (double)m * (double)n / timeg * 1.e-6, timeg);
 | 
						|
 | 
						|
  	}
 | 
						|
  }
 | 
						|
  else
 | 
						|
  {
 | 
						|
 | 
						|
  	for(n = from; n <= to; n += step)
 | 
						|
  	{
 | 
						|
   		timeg=0;
 | 
						|
   		fprintf(stderr, " %6dx%d : ", (int)m,(int)n);
 | 
						|
   		for(j = 0; j < m; j++){
 | 
						|
      			for(i = 0; i < n * COMPSIZE; i++){
 | 
						|
				a[(long)i + (long)j * (long)m * COMPSIZE] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | 
						|
      			}
 | 
						|
   		}
 | 
						|
 | 
						|
    		for (l=0; l<loops; l++)
 | 
						|
    		{
 | 
						|
 | 
						|
   			for(i = 0; i < n * COMPSIZE * abs(inc_x); i++){
 | 
						|
				x[i] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | 
						|
   			}
 | 
						|
 | 
						|
   			for(i = 0; i < m * COMPSIZE * abs(inc_y); i++){
 | 
						|
				y[i] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | 
						|
   			}
 | 
						|
    			begin();
 | 
						|
    			GEMV (&trans, &m, &n, alpha, a, &m, x, &inc_x, beta, y, &inc_y );
 | 
						|
    			end();
 | 
						|
    			time1 = getsec();
 | 
						|
			timeg += time1;
 | 
						|
 | 
						|
    		}
 | 
						|
 | 
						|
    		timeg /= loops;
 | 
						|
 | 
						|
    		fprintf(stderr, " %10.2f MFlops %10.6f sec\n", COMPSIZE * COMPSIZE * 2. * (double)m * (double)n / timeg * 1.e-6, timeg);
 | 
						|
 | 
						|
  	}
 | 
						|
  }
 | 
						|
 | 
						|
  return 0;
 | 
						|
}
 | 
						|
 | 
						|
// void main(int argc, char *argv[]) __attribute__((weak, alias("MAIN__")));
 |