mirror of
git://sourceware.org/git/glibc.git
synced 2024-11-27 03:41:23 +08:00
5673750800
This patch adds an option to get detailed benchmark output for functions. Invoking the benchmark with 'make DETAILED=1 bench' causes each benchmark program to store a mean execution time for each input it works on. This is useful to give a more comprehensive picture of performance of functions compared to just the single mean figure.
147 lines
3.7 KiB
C
147 lines
3.7 KiB
C
/* Skeleton for benchmark programs.
|
|
Copyright (C) 2013-2014 Free Software Foundation, Inc.
|
|
This file is part of the GNU C Library.
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with the GNU C Library; if not, see
|
|
<http://www.gnu.org/licenses/>. */
|
|
|
|
#include <string.h>
|
|
#include <stdint.h>
|
|
#include <stdbool.h>
|
|
#include <stdio.h>
|
|
#include <time.h>
|
|
#include <inttypes.h>
|
|
#include "bench-timing.h"
|
|
|
|
volatile unsigned int dontoptimize = 0;
|
|
|
|
void
|
|
startup (void)
|
|
{
|
|
/* This loop should cause CPU to switch to maximal freqency.
|
|
This makes subsequent measurement more accurate. We need a side effect
|
|
to prevent the loop being deleted by compiler.
|
|
This should be enough to cause CPU to speed up and it is simpler than
|
|
running loop for constant time. This is used when user does not have root
|
|
access to set a constant freqency. */
|
|
for (int k = 0; k < 10000000; k++)
|
|
dontoptimize += 23 * dontoptimize + 2;
|
|
}
|
|
|
|
#define TIMESPEC_AFTER(a, b) \
|
|
(((a).tv_sec == (b).tv_sec) ? \
|
|
((a).tv_nsec > (b).tv_nsec) : \
|
|
((a).tv_sec > (b).tv_sec))
|
|
int
|
|
main (int argc, char **argv)
|
|
{
|
|
unsigned long i, k;
|
|
struct timespec runtime;
|
|
timing_t start, end;
|
|
bool detailed = false;
|
|
|
|
if (argc == 2 && !strcmp (argv[1], "-d"))
|
|
detailed = true;
|
|
|
|
startup();
|
|
|
|
memset (&runtime, 0, sizeof (runtime));
|
|
|
|
unsigned long iters, res;
|
|
|
|
TIMING_INIT (res);
|
|
|
|
iters = 1000 * res;
|
|
|
|
/* Begin function. */
|
|
printf ("\"%s\": {\n", FUNCNAME);
|
|
|
|
for (int v = 0; v < NUM_VARIANTS; v++)
|
|
{
|
|
if (v)
|
|
putc (',', stdout);
|
|
/* Run for approximately DURATION seconds. */
|
|
clock_gettime (CLOCK_MONOTONIC_RAW, &runtime);
|
|
runtime.tv_sec += DURATION;
|
|
|
|
double d_total_i = 0;
|
|
timing_t total = 0, max = 0, min = 0x7fffffffffffffff;
|
|
int64_t c = 0;
|
|
while (1)
|
|
{
|
|
for (i = 0; i < NUM_SAMPLES (v); i++)
|
|
{
|
|
uint64_t cur;
|
|
TIMING_NOW (start);
|
|
for (k = 0; k < iters; k++)
|
|
BENCH_FUNC (v, i);
|
|
TIMING_NOW (end);
|
|
|
|
TIMING_DIFF (cur, start, end);
|
|
|
|
if (cur > max)
|
|
max = cur;
|
|
|
|
if (cur < min)
|
|
min = cur;
|
|
|
|
TIMING_ACCUM (total, cur);
|
|
/* Accumulate timings for the value. In the end we will divide
|
|
by the total iterations. */
|
|
RESULT_ACCUM (cur, v, i, c * iters, (c + 1) * iters);
|
|
|
|
d_total_i += iters;
|
|
}
|
|
c++;
|
|
struct timespec curtime;
|
|
|
|
memset (&curtime, 0, sizeof (curtime));
|
|
clock_gettime (CLOCK_MONOTONIC_RAW, &curtime);
|
|
if (TIMESPEC_AFTER (curtime, runtime))
|
|
goto done;
|
|
}
|
|
|
|
double d_total_s;
|
|
double d_iters;
|
|
|
|
done:
|
|
d_total_s = total;
|
|
d_iters = iters;
|
|
|
|
printf ("\"%s\": {\n", VARIANT (v));
|
|
printf ("\"duration\": %g, \"iterations\": %g, "
|
|
"\"max\": %g, \"min\": %g, \"mean\": %g\n",
|
|
d_total_s, d_total_i, max / d_iters, min / d_iters,
|
|
d_total_s / d_total_i);
|
|
|
|
if (detailed)
|
|
{
|
|
printf (",\n\"timings\": [");
|
|
for (int i = 0; i < NUM_SAMPLES (v); i++)
|
|
{
|
|
if (i > 0)
|
|
putc (',', stdout);
|
|
printf ("%g", RESULT (v, i));
|
|
}
|
|
puts ("]");
|
|
}
|
|
puts ("}");
|
|
}
|
|
|
|
/* End function. */
|
|
puts ("}");
|
|
|
|
return 0;
|
|
}
|