1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*
* HardInfo - Displays System Information
* Copyright (C) 2003-2007 Leandro A. F. Pereira <leandro@hardinfo.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 2.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "hardinfo.h"
#include "benchmark.h"
#include "fftbench.h"
static gpointer fft_for(unsigned int start, unsigned int end, void *data, gint thread_number)
{
unsigned int i;
FFTBench **benches = (FFTBench **)data;
FFTBench *fftbench = (FFTBench *)(benches[thread_number]);
for (i = start; i <= end; i++) {
fft_bench_run(fftbench);
}
return NULL;
}
#define FFT_MAXT 4
void
benchmark_fft(void)
{
bench_value r = EMPTY_BENCH_VALUE;
int n_cores, i;
gchar *temp;
FFTBench **benches;
shell_view_set_enabled(FALSE);
shell_status_update("Running FFT benchmark...");
/* Pre-allocate all benchmarks */
benches = g_new0(FFTBench *, FFT_MAXT);
for (i = 0; i < FFT_MAXT; i++) {
benches[i] = fft_bench_new();
}
/* Run the benchmark */
r = benchmark_parallel_for(FFT_MAXT, 0, FFT_MAXT, fft_for, benches);
/* Free up the memory */
for (i = 0; i < FFT_MAXT; i++) {
fft_bench_free(benches[i]);
}
g_free(benches);
r.result = r.elapsed_time;
bench_results[BENCHMARK_FFT] = r;
}
|
