mirror/kissfft
1
0
Fork 0
mirror of https://github.com/mborgerding/kissfft.git synced 2025-06-03 17:18:11 -04:00
Code Issues Packages Projects Releases Wiki Activity

benchmark utilities

Browse Source
This commit is contained in:
Mark Borgerding 2003-11-04 02:11:00 +00:00
parent 4ebf0b5aca
commit ee3094a0e4
2 changed files with 136 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

70
test/benchfftw.c Normal file
View File

@ -0,0 +1,70 @@
#include <stdio.h>
#include <stdlib.h>
#include <fftw3.h>
#include <getopt.h>
#include <sys/times.h>
#include <unistd.h>
int main(int argc,char ** argv)
{
int nfft=1024;
int isinverse=0;
int numffts=1000,i;
fftw_complex * in=NULL;
fftw_complex * out=NULL;
fftw_plan p;
struct tms t0,t1;
float cputime;
while (1) {
int c = getopt (argc, argv, "n:ix:");
if (c == -1)
break;
switch (c) {
case 'n':
nfft = atoi (optarg);
break;
case 'x':
numffts = atoi (optarg);
break;
case 'i':
isinverse = 1;
break;
}
}
in=fftw_malloc(sizeof(fftw_complex) * nfft);
out=fftw_malloc(sizeof(fftw_complex) * nfft);
for (i=0;i<nfft;++i ) {
in[i][0] = rand() - RAND_MAX/2;
in[i][1] = rand() - RAND_MAX/2;
}
times(&t0);
if ( isinverse )
p = fftw_plan_dft_1d(nfft, in, out, FFTW_BACKWARD, FFTW_ESTIMATE);
else
p = fftw_plan_dft_1d(nfft, in, out, FFTW_FORWARD, FFTW_ESTIMATE);
for (i=0;i<numffts;++i)
fftw_execute(p);
fftw_destroy_plan(p);
times(&t1);
fftw_free(in); fftw_free(out);
cputime = ( ((float)t1.tms_utime + t1.tms_stime + t1.tms_cutime + t1.tms_cstime ) -
((float)t0.tms_utime + t0.tms_stime + t0.tms_cutime + t0.tms_cstime ) )
/ sysconf(_SC_CLK_TCK);
fprintf(stderr,"fftw\t"
"nfft=%d\t"
"numffts=%d\t"
"cputime=%.3f\n" ,
nfft,numffts,cputime
);
return 0;
}

66
test/benchkiss.c Normal file
View File

@ -0,0 +1,66 @@
#include <stdio.h>
#include <stdlib.h>
#include <getopt.h>
#include <sys/times.h>
#include <unistd.h>
#include "kiss_fft.h"
int main(int argc,char ** argv)
{
int nfft=1024;
int isinverse=0;
int numffts=1000,i;
struct tms t0,t1;
float cputime;
kiss_fft_cpx * buf;
kiss_fft_cpx * bufout;
void *st;
while (1) {
int c = getopt (argc, argv, "n:ix:");
if (c == -1)
break;
switch (c) {
case 'n':
nfft = atoi (optarg);
break;
case 'x':
numffts = atoi (optarg);
break;
case 'i':
isinverse = 1;
break;
}
}
buf=(kiss_fft_cpx*)malloc(sizeof(kiss_fft_cpx) * nfft);
bufout=(kiss_fft_cpx*)malloc(sizeof(kiss_fft_cpx) * nfft);
for (i=0;i<nfft;++i ) {
buf[i].r = rand() - RAND_MAX/2;
buf[i].i = rand() - RAND_MAX/2;
}
times(&t0);
st = kiss_fft_alloc( nfft ,isinverse );
for (i=0;i<numffts;++i)
kiss_fft_io( st ,buf,bufout );
free(st);
times(&t1);
free(buf); free(bufout);
cputime = ( ((float)t1.tms_utime + t1.tms_stime + t1.tms_cutime + t1.tms_cstime ) -
((float)t0.tms_utime + t0.tms_stime + t0.tms_cutime + t0.tms_cstime ) )
/ sysconf(_SC_CLK_TCK);
fprintf(stderr,"KISS\t"
"nfft=%d\t"
"numffts=%d\t"
"cputime=%.3f\n" ,
nfft,numffts,cputime
);
return 0;
}