/* * Copyright (C) 2026 Linux Studio Plugins Project * (C) 2026 Vladimir Sadovnikov * * This file is part of lsp-dsp-lib * Created on: 23 фев. 2025 г. * * lsp-dsp-lib 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 3 of the License, or * any later version. * * lsp-dsp-lib 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 lsp-dsp-lib. If not, see . */ #include #include #include #include #include #define MIN_RANK 8 #define MAX_RANK 16 namespace lsp { namespace generic { void packed_direct_fft(float *dst, const float *src, size_t rank); } IF_ARCH_X86( namespace sse { void packed_direct_fft(float *dst, const float *src, size_t rank); } namespace avx { void packed_direct_fft(float *dst, const float *src, size_t rank); void packed_direct_fft_fma3(float *dst, const float *src, size_t rank); } namespace avx512 { void packed_direct_fft(float *dst, const float *src, size_t rank); } ) IF_ARCH_ARM( namespace neon_d32 { void packed_direct_fft(float *dst, const float *src, size_t rank); } ) IF_ARCH_AARCH64( namespace asimd { void packed_direct_fft(float *dst, const float *src, size_t rank); } ) typedef void (* packed_direct_fft_t) (float *dst, const float *src, size_t rank); } //----------------------------------------------------------------------------- // Performance test for complex multiplication PTEST_BEGIN("dsp.fft", pfft, 10, 1000) void call(const char *label, float *dst, const float *src, size_t rank, packed_direct_fft_t fft) { if (!PTEST_SUPPORTED(fft)) return; char buf[80]; snprintf(buf, sizeof(buf), "%s x %d", label, int(1 << rank)); printf("Testing %s samples (rank = %d) ...\n", buf, int(rank)); PTEST_LOOP(buf, fft(dst, src, rank); ) } PTEST_MAIN { size_t fft_size = 1 << MAX_RANK; uint8_t *data = NULL; float *sig_re = alloc_aligned(data, fft_size * 4, 64); float *sig_im = &sig_re[fft_size]; float *fft_re = &sig_im[fft_size]; for (size_t i=0; i < (1 << MAX_RANK); ++i) { sig_re[i] = randf(0.0f, 1.0f); sig_im[i] = 0.0f; } #define CALL(func) \ call(#func, fft_re, sig_re, i, func) for (size_t i=MIN_RANK; i <= MAX_RANK; ++i) { CALL(generic::packed_direct_fft); IF_ARCH_X86(CALL(sse::packed_direct_fft)); IF_ARCH_X86(CALL(avx::packed_direct_fft)); IF_ARCH_X86(CALL(avx::packed_direct_fft_fma3)); IF_ARCH_X86(CALL(avx512::packed_direct_fft)); IF_ARCH_ARM(CALL(neon_d32::packed_direct_fft)); IF_ARCH_AARCH64(CALL(asimd::packed_direct_fft)); PTEST_SEPARATOR; } free_aligned(data); } PTEST_END