137 lines
		
	
	
		
			3.8 KiB
		
	
	
	
		
			C
		
	
	
	
			
		
		
	
	
			137 lines
		
	
	
		
			3.8 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 GEMM
 | |
| 
 | |
| #ifndef COMPLEX
 | |
| 
 | |
| #ifdef DOUBLE
 | |
| #define GEMM   BLASFUNC(dgemm)
 | |
| #else
 | |
| #define GEMM   BLASFUNC(sgemm)
 | |
| #endif
 | |
| 
 | |
| #else
 | |
| 
 | |
| #ifdef DOUBLE
 | |
| #define GEMM   BLASFUNC(zgemm3m)
 | |
| #else
 | |
| #define GEMM   BLASFUNC(cgemm3m)
 | |
| #endif
 | |
| 
 | |
| #endif
 | |
| 
 | |
| int main(int argc, char *argv[]){
 | |
| 
 | |
|   FLOAT *a, *b, *c;
 | |
|   FLOAT alpha[] = {1.0, 1.0};
 | |
|   FLOAT beta [] = {1.0, 1.0};
 | |
|   char trans='N';
 | |
|   blasint m, i, j;
 | |
|   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++;}
 | |
| 
 | |
|   if ((p = getenv("OPENBLAS_TRANS")))  trans=*p;
 | |
| 
 | |
|   fprintf(stderr, "From : %3d  To : %3d Step=%d : Trans=%c\n", from, to, step, trans);
 | |
| 
 | |
|   if (( a = (FLOAT *)malloc(sizeof(FLOAT) * to * to * COMPSIZE)) == NULL){
 | |
|     fprintf(stderr,"Out of Memory!!\n");exit(1);
 | |
|   }
 | |
| 
 | |
|   if (( b = (FLOAT *)malloc(sizeof(FLOAT) * to * to * COMPSIZE)) == NULL){
 | |
|     fprintf(stderr,"Out of Memory!!\n");exit(1);
 | |
|   }
 | |
| 
 | |
|   if (( c = (FLOAT *)malloc(sizeof(FLOAT) * to * to * COMPSIZE)) == NULL){
 | |
|     fprintf(stderr,"Out of Memory!!\n");exit(1);
 | |
|   }
 | |
| 
 | |
|   p = getenv("OPENBLAS_LOOPS");
 | |
|   if ( p != NULL )
 | |
| 	loops = atoi(p);
 | |
| 
 | |
| 
 | |
| #ifdef __linux
 | |
|   srandom(getpid());
 | |
| #endif
 | |
| 
 | |
|   fprintf(stderr, "   SIZE       Flops\n");
 | |
| 
 | |
|   for(m = from; m <= to; m += step)
 | |
|   {
 | |
| 
 | |
|     timeg=0;
 | |
| 
 | |
|     fprintf(stderr, " %6d : ", (int)m);
 | |
| 
 | |
|     for (l=0; l<loops; l++)
 | |
|     {
 | |
|   
 | |
|     	for(j = 0; j < m; j++){
 | |
|       		for(i = 0; i < m * COMPSIZE; i++){
 | |
| 			a[(long)i + (long)j * (long)m * COMPSIZE] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | |
| 			b[(long)i + (long)j * (long)m * COMPSIZE] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | |
| 			c[(long)i + (long)j * (long)m * COMPSIZE] = ((FLOAT) rand() / (FLOAT) RAND_MAX) - 0.5;
 | |
|       		}
 | |
|     	}
 | |
| 
 | |
|     	begin();
 | |
| 
 | |
|     	GEMM (&trans, &trans, &m, &m, &m, alpha, a, &m, b, &m, beta, c, &m );
 | |
| 
 | |
|     	end();
 | |
| 	    timeg += getsec();
 | |
|     }
 | |
| 
 | |
|     timeg /= loops;
 | |
|     fprintf(stderr,
 | |
| 	    " %10.2f MFlops\n",
 | |
| 	    COMPSIZE * COMPSIZE * 2. * (double)m * (double)m * (double)m / timeg * 1.e-6);
 | |
| 
 | |
|   }
 | |
| 
 | |
|   return 0;
 | |
| }
 | |
| 
 | |
| // void main(int argc, char *argv[]) __attribute__((weak, alias("MAIN__")));
 |