annotate src/fftw-3.3.3/libbench2/report.c @ 169:223a55898ab9 tip default

Add null config files
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 02 Mar 2020 14:03:47 +0000
parents 89f5e221ed7b
children
rev   line source
cannam@95 1 /*
cannam@95 2 * Copyright (c) 2001 Matteo Frigo
cannam@95 3 * Copyright (c) 2001 Massachusetts Institute of Technology
cannam@95 4 *
cannam@95 5 * This program is free software; you can redistribute it and/or modify
cannam@95 6 * it under the terms of the GNU General Public License as published by
cannam@95 7 * the Free Software Foundation; either version 2 of the License, or
cannam@95 8 * (at your option) any later version.
cannam@95 9 *
cannam@95 10 * This program is distributed in the hope that it will be useful,
cannam@95 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@95 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
cannam@95 13 * GNU General Public License for more details.
cannam@95 14 *
cannam@95 15 * You should have received a copy of the GNU General Public License
cannam@95 16 * along with this program; if not, write to the Free Software
cannam@95 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
cannam@95 18 *
cannam@95 19 */
cannam@95 20
cannam@95 21
cannam@95 22 #include "bench.h"
cannam@95 23 #include <stdio.h>
cannam@95 24 #include <stdlib.h>
cannam@95 25 #include <math.h>
cannam@95 26
cannam@95 27 void (*report)(const bench_problem *p, double *t, int st);
cannam@95 28
cannam@95 29 #undef min
cannam@95 30 #undef max /* you never know */
cannam@95 31
cannam@95 32 struct stats {
cannam@95 33 double min;
cannam@95 34 double max;
cannam@95 35 double avg;
cannam@95 36 double median;
cannam@95 37 };
cannam@95 38
cannam@95 39 static void mkstat(double *t, int st, struct stats *a)
cannam@95 40 {
cannam@95 41 int i, j;
cannam@95 42
cannam@95 43 a->min = t[0];
cannam@95 44 a->max = t[0];
cannam@95 45 a->avg = 0.0;
cannam@95 46
cannam@95 47 for (i = 0; i < st; ++i) {
cannam@95 48 if (t[i] < a->min)
cannam@95 49 a->min = t[i];
cannam@95 50 if (t[i] > a->max)
cannam@95 51 a->max = t[i];
cannam@95 52 a->avg += t[i];
cannam@95 53 }
cannam@95 54 a->avg /= (double)st;
cannam@95 55
cannam@95 56 /* compute median --- silly bubblesort algorithm */
cannam@95 57 for (i = st - 1; i > 1; --i) {
cannam@95 58 for (j = 0; j < i - 1; ++j) {
cannam@95 59 double t0, t1;
cannam@95 60 if ((t0 = t[j]) > (t1 = t[j + 1])) {
cannam@95 61 t[j] = t1;
cannam@95 62 t[j + 1] = t0;
cannam@95 63 }
cannam@95 64 }
cannam@95 65 }
cannam@95 66 a->median = t[st / 2];
cannam@95 67 }
cannam@95 68
cannam@95 69 void report_mflops(const bench_problem *p, double *t, int st)
cannam@95 70 {
cannam@95 71 struct stats s;
cannam@95 72 mkstat(t, st, &s);
cannam@95 73 ovtpvt("(%g %g %g %g)\n",
cannam@95 74 mflops(p, s.max), mflops(p, s.avg),
cannam@95 75 mflops(p, s.min), mflops(p, s.median));
cannam@95 76 }
cannam@95 77
cannam@95 78 void report_time(const bench_problem *p, double *t, int st)
cannam@95 79 {
cannam@95 80 struct stats s;
cannam@95 81 UNUSED(p);
cannam@95 82 mkstat(t, st, &s);
cannam@95 83 ovtpvt("(%g %g %g %g)\n", s.min, s.avg, s.max, s.median);
cannam@95 84 }
cannam@95 85
cannam@95 86 void report_benchmark(const bench_problem *p, double *t, int st)
cannam@95 87 {
cannam@95 88 struct stats s;
cannam@95 89 mkstat(t, st, &s);
cannam@95 90 ovtpvt("%.5g %.8g %g\n", mflops(p, s.min), s.min, p->setup_time);
cannam@95 91 }
cannam@95 92
cannam@95 93 static void sprintf_time(double x, char *buf, int buflen)
cannam@95 94 {
cannam@95 95 #ifdef HAVE_SNPRINTF
cannam@95 96 # define MY_SPRINTF(a, b) snprintf(buf, buflen, a, b)
cannam@95 97 #else
cannam@95 98 # define MY_SPRINTF(a, b) sprintf(buf, a, b)
cannam@95 99 #endif
cannam@95 100 if (x < 1.0E-6)
cannam@95 101 MY_SPRINTF("%.2f ns", x * 1.0E9);
cannam@95 102 else if (x < 1.0E-3)
cannam@95 103 MY_SPRINTF("%.2f us", x * 1.0E6);
cannam@95 104 else if (x < 1.0)
cannam@95 105 MY_SPRINTF("%.2f ms", x * 1.0E3);
cannam@95 106 else
cannam@95 107 MY_SPRINTF("%.2f s", x);
cannam@95 108 #undef MY_SPRINTF
cannam@95 109 }
cannam@95 110
cannam@95 111 void report_verbose(const bench_problem *p, double *t, int st)
cannam@95 112 {
cannam@95 113 struct stats s;
cannam@95 114 char bmin[64], bmax[64], bavg[64], bmedian[64], btmin[64];
cannam@95 115 char bsetup[64];
cannam@95 116 int copyp = tensor_sz(p->sz) == 1;
cannam@95 117
cannam@95 118 mkstat(t, st, &s);
cannam@95 119
cannam@95 120 sprintf_time(s.min, bmin, 64);
cannam@95 121 sprintf_time(s.max, bmax, 64);
cannam@95 122 sprintf_time(s.avg, bavg, 64);
cannam@95 123 sprintf_time(s.median, bmedian, 64);
cannam@95 124 sprintf_time(time_min, btmin, 64);
cannam@95 125 sprintf_time(p->setup_time, bsetup, 64);
cannam@95 126
cannam@95 127 ovtpvt("Problem: %s, setup: %s, time: %s, %s: %.5g\n",
cannam@95 128 p->pstring, bsetup, bmin,
cannam@95 129 copyp ? "fp-move/us" : "``mflops''",
cannam@95 130 mflops(p, s.min));
cannam@95 131
cannam@95 132 if (verbose) {
cannam@95 133 ovtpvt("Took %d measurements for at least %s each.\n", st, btmin);
cannam@95 134 ovtpvt("Time: min %s, max %s, avg %s, median %s\n",
cannam@95 135 bmin, bmax, bavg, bmedian);
cannam@95 136 }
cannam@95 137 }