cannam@95: /*
cannam@95:  * Copyright (c) 2001 Matteo Frigo
cannam@95:  * Copyright (c) 2001 Massachusetts Institute of Technology
cannam@95:  *
cannam@95:  * This program is free software; you can redistribute it and/or modify
cannam@95:  * it under the terms of the GNU General Public License as published by
cannam@95:  * the Free Software Foundation; either version 2 of the License, or
cannam@95:  * (at your option) any later version.
cannam@95:  *
cannam@95:  * This program is distributed in the hope that it will be useful,
cannam@95:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@95:  * GNU General Public License for more details.
cannam@95:  *
cannam@95:  * You should have received a copy of the GNU General Public License
cannam@95:  * along with this program; if not, write to the Free Software
cannam@95:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@95:  *
cannam@95:  */
cannam@95: 
cannam@95: 
cannam@95: #include "bench.h"
cannam@95: #include <stdio.h>
cannam@95: #include <stdlib.h>
cannam@95: #include <math.h>
cannam@95: 
cannam@95: void (*report)(const bench_problem *p, double *t, int st);
cannam@95: 
cannam@95: #undef min
cannam@95: #undef max /* you never know */
cannam@95: 
cannam@95: struct stats {
cannam@95:      double min;
cannam@95:      double max;
cannam@95:      double avg;
cannam@95:      double median;
cannam@95: };
cannam@95: 
cannam@95: static void mkstat(double *t, int st, struct stats *a)
cannam@95: {
cannam@95:      int i, j;
cannam@95:      
cannam@95:      a->min = t[0];
cannam@95:      a->max = t[0];
cannam@95:      a->avg = 0.0;
cannam@95: 
cannam@95:      for (i = 0; i < st; ++i) {
cannam@95: 	  if (t[i] < a->min)
cannam@95: 	       a->min = t[i];
cannam@95: 	  if (t[i] > a->max)
cannam@95: 	       a->max = t[i];
cannam@95: 	  a->avg += t[i];
cannam@95:      }
cannam@95:      a->avg /= (double)st;
cannam@95: 
cannam@95:      /* compute median --- silly bubblesort algorithm */
cannam@95:      for (i = st - 1; i > 1; --i) {
cannam@95: 	  for (j = 0; j < i - 1; ++j) {
cannam@95: 	       double t0, t1;
cannam@95: 	       if ((t0 = t[j]) > (t1 = t[j + 1])) {
cannam@95: 		    t[j] = t1;
cannam@95: 		    t[j + 1] = t0;
cannam@95: 	       }
cannam@95: 	  } 
cannam@95:      }
cannam@95:      a->median = t[st / 2];
cannam@95: }
cannam@95: 
cannam@95: void report_mflops(const bench_problem *p, double *t, int st)
cannam@95: {
cannam@95:      struct stats s;
cannam@95:      mkstat(t, st, &s);
cannam@95:      ovtpvt("(%g %g %g %g)\n", 
cannam@95: 	    mflops(p, s.max), mflops(p, s.avg), 
cannam@95: 	    mflops(p, s.min), mflops(p, s.median));
cannam@95: }
cannam@95: 
cannam@95: void report_time(const bench_problem *p, double *t, int st)
cannam@95: {
cannam@95:      struct stats s;
cannam@95:      UNUSED(p);
cannam@95:      mkstat(t, st, &s);
cannam@95:      ovtpvt("(%g %g %g %g)\n", s.min, s.avg, s.max, s.median);
cannam@95: }
cannam@95: 
cannam@95: void report_benchmark(const bench_problem *p, double *t, int st)
cannam@95: {
cannam@95:      struct stats s;
cannam@95:      mkstat(t, st, &s);
cannam@95:      ovtpvt("%.5g %.8g %g\n", mflops(p, s.min), s.min, p->setup_time);
cannam@95: }
cannam@95: 
cannam@95: static void sprintf_time(double x, char *buf, int buflen)
cannam@95: {
cannam@95: #ifdef HAVE_SNPRINTF
cannam@95: #  define MY_SPRINTF(a, b) snprintf(buf, buflen, a, b)
cannam@95: #else
cannam@95: #  define MY_SPRINTF(a, b) sprintf(buf, a, b)
cannam@95: #endif
cannam@95:      if (x < 1.0E-6)
cannam@95: 	  MY_SPRINTF("%.2f ns", x * 1.0E9);
cannam@95:      else if (x < 1.0E-3)
cannam@95: 	  MY_SPRINTF("%.2f us", x * 1.0E6);
cannam@95:      else if (x < 1.0)
cannam@95: 	  MY_SPRINTF("%.2f ms", x * 1.0E3);
cannam@95:      else
cannam@95: 	  MY_SPRINTF("%.2f s", x);
cannam@95: #undef MY_SPRINTF
cannam@95: }
cannam@95: 
cannam@95: void report_verbose(const bench_problem *p, double *t, int st)
cannam@95: {
cannam@95:      struct stats s;
cannam@95:      char bmin[64], bmax[64], bavg[64], bmedian[64], btmin[64];
cannam@95:      char bsetup[64];
cannam@95:      int copyp = tensor_sz(p->sz) == 1;
cannam@95: 
cannam@95:      mkstat(t, st, &s);
cannam@95: 
cannam@95:      sprintf_time(s.min, bmin, 64);
cannam@95:      sprintf_time(s.max, bmax, 64);
cannam@95:      sprintf_time(s.avg, bavg, 64);
cannam@95:      sprintf_time(s.median, bmedian, 64);
cannam@95:      sprintf_time(time_min, btmin, 64);
cannam@95:      sprintf_time(p->setup_time, bsetup, 64);
cannam@95: 
cannam@95:      ovtpvt("Problem: %s, setup: %s, time: %s, %s: %.5g\n",
cannam@95: 	    p->pstring, bsetup, bmin, 
cannam@95: 	    copyp ? "fp-move/us" : "``mflops''",
cannam@95: 	    mflops(p, s.min));
cannam@95: 
cannam@95:      if (verbose) {
cannam@95: 	  ovtpvt("Took %d measurements for at least %s each.\n", st, btmin);
cannam@95: 	  ovtpvt("Time: min %s, max %s, avg %s, median %s\n",
cannam@95: 		 bmin, bmax, bavg, bmedian);
cannam@95:      }
cannam@95: }