|
| 1 | +/** |
| 2 | + * Copyright (c) 2023 Wasted Audio |
| 3 | + * |
| 4 | + * Permission to use, copy, modify, and/or distribute this software for any |
| 5 | + * purpose with or without fee is hereby granted, provided that the above |
| 6 | + * copyright notice and this permission notice appear in all copies. |
| 7 | + * |
| 8 | + * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH |
| 9 | + * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY |
| 10 | + * AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, |
| 11 | + * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM |
| 12 | + * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR |
| 13 | + * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
| 14 | + * PERFORMANCE OF THIS SOFTWARE. |
| 15 | + */ |
| 16 | + |
| 17 | +#include "HvSignalRFFT.h" |
| 18 | +#include "pffft.h" |
| 19 | + |
| 20 | +hv_size_t sRFFT_init(SignalRFFT *o, struct HvTable *table, const int size) { |
| 21 | + o->table = table; |
| 22 | + o->setup = pffft_new_setup(size, PFFFT_REAL); |
| 23 | + hv_size_t numBytes = hTable_init(&o->inputs, size); |
| 24 | + return numBytes; |
| 25 | +} |
| 26 | + |
| 27 | +void sRFFT_free(SignalRFFT *o) { |
| 28 | + o->table = NULL; |
| 29 | + hTable_free(&o->inputs); |
| 30 | +} |
| 31 | + |
| 32 | +void sRFFT_onMessage(HeavyContextInterface *_c, SignalRFFT *o, int letIndex, |
| 33 | + const HvMessage *m, void *sendMessage) { |
| 34 | + switch (letIndex) { |
| 35 | + case 1: { |
| 36 | + if (msg_isHashLike(m,0)) { |
| 37 | + HvTable *table = hv_table_get(_c, msg_getHash(m,0)); |
| 38 | + if (table != NULL) { |
| 39 | + o->table = table; |
| 40 | + if (hTable_getSize(&o->inputs) != hTable_getSize(table)) { |
| 41 | + hTable_resize(&o->inputs, |
| 42 | + (hv_uint32_t) hv_min_ui(hTable_getSize(&o->inputs), hTable_getSize(table))); |
| 43 | + } |
| 44 | + } |
| 45 | + } |
| 46 | + break; |
| 47 | + } |
| 48 | + case 2: { |
| 49 | + if (msg_isFloat(m,0)) { |
| 50 | + // rfft size should never exceed the coefficient table size |
| 51 | + hTable_resize(&o->inputs, (hv_uint32_t) msg_getFloat(m,0)); |
| 52 | + } |
| 53 | + break; |
| 54 | + } |
| 55 | + default: return; |
| 56 | + } |
| 57 | +} |
| 58 | + |
| 59 | + |
| 60 | +static inline int wrap(const int i, const int n) { |
| 61 | + if (i < 0) return (i+n); |
| 62 | + if (i >= n) return (i-n); |
| 63 | + return i; |
| 64 | +} |
| 65 | + |
| 66 | + |
| 67 | +void __hv_rfft_f(SignalRFFT *o, hv_bInf_t bIn, hv_bOutf_t bOut0, hv_bOutf_t bOut1) { |
| 68 | + hv_assert(o->table != NULL); |
| 69 | + float *const work = hTable_getBuffer(o->table); |
| 70 | + hv_assert(work != NULL); |
| 71 | + const int n = hTable_getSize(o->table); // length fir filter |
| 72 | + hv_assert((n&HV_N_SIMD_MASK) == 0); // n is a multiple of HV_N_SIMD |
| 73 | + |
| 74 | + float *const inputs = hTable_getBuffer(&o->inputs); |
| 75 | + hv_assert(inputs != NULL); |
| 76 | + const int m = hTable_getSize(&o->inputs); // length of input buffer. |
| 77 | + hv_assert(m >= n); |
| 78 | + const int h_orig = hTable_getHead(&o->inputs); |
| 79 | + |
| 80 | + |
| 81 | + pffft_transform_ordered(o->setup, &bIn, &bOut0, work, PFFFT_FORWARD); |
| 82 | + |
| 83 | + __hv_store_f(inputs+h_orig, bIn); // store the new input to the inputs buffer |
| 84 | + hTable_setHead(&o->inputs, wrap(h_orig+HV_N_SIMD, m)); |
| 85 | +} |
| 86 | + |
| 87 | + |
| 88 | +void __hv_rifft_f(SignalRFFT *o, hv_bInf_t bIn0, hv_bInf_t bIn1, hv_bOutf_t bOut) { |
| 89 | + hv_assert(o->table != NULL); |
| 90 | + float *const work = hTable_getBuffer(o->table); |
| 91 | + hv_assert(work != NULL); |
| 92 | + const int n = hTable_getSize(o->table); // length fir filter |
| 93 | + hv_assert((n&HV_N_SIMD_MASK) == 0); // n is a multiple of HV_N_SIMD |
| 94 | + |
| 95 | + float *const inputs = hTable_getBuffer(&o->inputs); |
| 96 | + hv_assert(inputs != NULL); |
| 97 | + const int m = hTable_getSize(&o->inputs); // length of input buffer. |
| 98 | + hv_assert(m >= n); |
| 99 | + const int h_orig = hTable_getHead(&o->inputs); |
| 100 | + |
| 101 | + |
| 102 | + pffft_transform_ordered(o->setup, &bIn0, &bOut, work, PFFFT_BACKWARD); |
| 103 | + |
| 104 | + __hv_store_f(inputs+h_orig, bIn0); // store the new input to the inputs buffer |
| 105 | + hTable_setHead(&o->inputs, wrap(h_orig+HV_N_SIMD, m)); |
| 106 | +} |
0 commit comments