mirror/kissfft
1
0
Fork 0
mirror of https://github.com/mborgerding/kissfft.git synced 2025-07-18 21:14:24 -04:00
Code Issues Packages Projects Releases Wiki Activity

modified time benchmark to repeat same buffer over and over to avoid IO bottlenecks and get more consistent numbers.

Browse Source
This commit is contained in:
Mark Borgerding
2003-11-01 04:44:50 +00:00
parent 471803ca08
commit 8ac63adc77
5 changed files with 118 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
test/Makefile
View File

@ -28,25 +28,26 @@ endif
$(UTIL): $(UTILSRC)
gcc -o $@ $(CFLAGS) $(TYPEFLAGS) $(UTILSRC)
RANDDAT=rand_$(DATATYPE)_$(NUMFFTS)_$(NFFT).dat
RANDDAT=rand_$(DATATYPE)_$(NFFT).dat
$(RANDDAT):
./rand_fft_data.py -n $(NUMFFTS) -N $(NFFT) -t $(DATATYPE) > $(RANDDAT)
./rand_fft_data.py -n 1 -N $(NFFT) -t $(DATATYPE) > $(RANDDAT)
time: all $(RANDDAT)
@echo
@echo -n "#### timing $(NUMFFTS) x $(NFFT) point FFTs. "; factor $(NFFT)
@if [ -x ~/fftw/st ] && [ $(DATATYPE) == "double" ]; then \
echo "#### FFTW FFT $(DATATYPE)"; \
time ~/fftw/st -n $(NFFT) < $(RANDDAT) > /dev/null;\
time ~/fftw/st -x $(NUMFFTS) -n $(NFFT) < $(RANDDAT) > /dev/null;\
fi
@echo "#### KISS FFT $(DATATYPE)"
@time ./$(UTIL) -n $(NFFT) < $(RANDDAT) > /dev/null
@time ./$(UTIL) -x $(NUMFFTS) -n $(NFFT) < $(RANDDAT) > /dev/null
@rm $(RANDDAT)
POW2=256 512 1024 2048
POW3=243 729 2187
POW5=25 125 625
mtime: all
@for n in $(POW2) ;do \
@for n in $(POW5) ;do \
export NFFT=$$n;make time; \
done

56
test/speedtest.c Executable file
View File

@ -0,0 +1,56 @@
#include <stdio.h>
#include <stdlib.h>
#include <fftw3.h>
#include <getopt.h>
int main(int argc,char ** argv)
{
int nfft=1024;
int isinverse=0;
FILE *fin=stdin;
FILE *fout=stdout;
int times=1,i;
fftw_complex * in=NULL;
fftw_complex * out=NULL;
fftw_plan p;
while (1) {
int c = getopt (argc, argv, "n:ix:");
if (c == -1)
break;
switch (c) {
case 'n':
nfft = atoi (optarg);
break;
case 'x':
times = atoi (optarg);
break;
case 'i':
isinverse = 1;
break;
}
}
//fprintf(stderr,"sizeof(fftw_complex) = %d \n" , sizeof(fftw_complex) );
fprintf(stderr,"sizeof(fftw_complex[0]) = %d \n" , sizeof((*in)[0]) );
in=fftw_malloc(sizeof(fftw_complex) * nfft);
out=fftw_malloc(sizeof(fftw_complex) * nfft);
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);
while ( fread( in , sizeof(fftw_complex) , nfft , fin ) > 0 ) {
for (i=0;i<times;++i)
fftw_execute(p);
fwrite( out , sizeof(fftw_complex) , nfft , fout );
}
fftw_destroy_plan(p);
fftw_free(in); fftw_free(out);
return 0;
}