raspi/userland
1
0
Fork 0
mirror of https://github.com/raspberrypi/userland.git synced 2025-12-06 04:49:12 +00:00
Code Issues Projects Releases Wiki Activity

Fixed hello_fft test cases with larger batch size (#581)

Browse Source 
For batch size >= N/2 the test patterns were wrong and created out of
bound memory access.
This commit is contained in:
maazl
2019-10-04 17:48:30 +02:00
committed by Phil Elwell
parent 72bc33a6d8
commit 8062d68f49
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
host_applications/linux/apps/hello_pi/hello_fft/hello_fft.c
View File

@@ -80,8 +80,8 @@ int main(int argc, char *argv[]) {
for (j=0; j<jobs; j++) { for (j=0; j<jobs; j++) {
base = fft->in + j*fft->step; // input buffer base = fft->in + j*fft->step; // input buffer
for (i=0; i<N; i++) base[i].re = base[i].im = 0; for (i=0; i<N; i++) base[i].re = base[i].im = 0;
freq = j+1; freq = (j+1) & (N/2-1);
base[freq].re = base[N-freq].re = 0.5; base[freq].re += base[(N-freq) & (N-1)].re = 0.5;
} }
usleep(1); // Yield to OS usleep(1); // Yield to OS
@@ -92,7 +92,7 @@ int main(int argc, char *argv[]) {
tsq[0]=tsq[1]=0; tsq[0]=tsq[1]=0;
for (j=0; j<jobs; j++) { for (j=0; j<jobs; j++) {
base = fft->out + j*fft->step; // output buffer base = fft->out + j*fft->step; // output buffer
freq = j+1; freq = (j+1) & (N/2-1);
for (i=0; i<N; i++) { for (i=0; i<N; i++) {
double re = cos(2*GPU_FFT_PI*freq*i/N); double re = cos(2*GPU_FFT_PI*freq*i/N);
tsq[0] += pow(re, 2); tsq[0] += pow(re, 2);