|
16 | 16 |
|
17 | 17 | #include "HvSignalRFFT.h" |
18 | 18 |
|
19 | | -hv_size_t sRFFT_init(SignalRFFT *o, struct HvTable *table, const int size) { |
20 | | - o->table = table; |
21 | | - hv_size_t numBytes = hTable_init(&o->inputs, size); |
| 19 | +hv_size_t sRFFT_init(SignalRFFT *o, const int size) { |
| 20 | + hv_size_t numBytes = hTable_init(&o->input, size); |
| 21 | + numBytes += hTable_init(&o->outputReal, size/2+1); |
| 22 | + numBytes += hTable_init(&o->outputImagin, size/2+1); |
22 | 23 | return numBytes; |
23 | 24 | } |
24 | 25 |
|
25 | 26 | void sRFFT_free(SignalRFFT *o) { |
26 | | - o->table = NULL; |
27 | | - hTable_free(&o->inputs); |
| 27 | + hTable_free(&o->input); |
| 28 | + hTable_free(&o->outputReal); |
| 29 | + hTable_free(&o->outputImagin); |
| 30 | +} |
| 31 | + |
| 32 | +void __hv_rfft_f(SignalRFFT *o, hv_bInf_t bIn, hv_bOutf_t bOut0, hv_bOutf_t bOut1) { |
| 33 | + // do fft stuff |
28 | 34 | } |
29 | 35 |
|
30 | 36 | void sRFFT_onMessage(HeavyContextInterface *_c, SignalRFFT *o, int letIndex, |
31 | 37 | const HvMessage *m, void *sendMessage) { |
32 | 38 | switch (letIndex) { |
33 | | - case 1: { |
34 | | - if (msg_isHashLike(m,0)) { |
35 | | - HvTable *table = hv_table_get(_c, msg_getHash(m,0)); |
36 | | - if (table != NULL) { |
37 | | - o->table = table; |
38 | | - if (hTable_getSize(&o->inputs) != hTable_getSize(table)) { |
39 | | - hTable_resize(&o->inputs, |
40 | | - (hv_uint32_t) hv_min_ui(hTable_getSize(&o->inputs), hTable_getSize(table))); |
41 | | - } |
42 | | - } |
43 | | - } |
44 | | - break; |
45 | | - } |
46 | | - case 2: { |
47 | | - if (msg_isFloat(m,0)) { |
48 | | - // rfft size should never exceed the coefficient table size |
49 | | - hTable_resize(&o->inputs, (hv_uint32_t) msg_getFloat(m,0)); |
50 | | - } |
51 | | - break; |
52 | | - } |
53 | 39 | default: return; |
54 | 40 | } |
55 | 41 | } |
56 | 42 |
|
57 | | - |
58 | | -static inline int wrap(const int i, const int n) { |
59 | | - if (i < 0) return (i+n); |
60 | | - if (i >= n) return (i-n); |
61 | | - return i; |
| 43 | +hv_size_t sRIFFT_init(SignalRIFFT *o, const int size) { |
| 44 | + hv_size_t numBytes = hTable_init(&o->inputReal, size/2+1); |
| 45 | + numBytes += hTable_init(&o->inputImagin, size/2+1); |
| 46 | + numBytes += hTable_init(&o->output, size); |
| 47 | + return numBytes; |
62 | 48 | } |
63 | 49 |
|
64 | | - |
65 | | -void __hv_rfft_f(SignalRFFT *o, hv_bInf_t bIn, hv_bOutf_t bOut0, hv_bOutf_t bOut1) { |
66 | | - hv_assert(o->table != NULL); |
67 | | - float *const work = hTable_getBuffer(o->table); |
68 | | - hv_assert(work != NULL); |
69 | | - const int n = hTable_getSize(o->table); // length fir filter |
70 | | - hv_assert((n&HV_N_SIMD_MASK) == 0); // n is a multiple of HV_N_SIMD |
71 | | - |
72 | | - float *const inputs = hTable_getBuffer(&o->inputs); |
73 | | - hv_assert(inputs != NULL); |
74 | | - const int m = hTable_getSize(&o->inputs); // length of input buffer. |
75 | | - hv_assert(m >= n); |
76 | | - const int h_orig = hTable_getHead(&o->inputs); |
77 | | - |
78 | | - // float *const bOut = (float *)(hv_alloca(2*n*sizeof(float))); |
79 | | - float *const bOut = (float *)(hv_alloca(sizeof(bIn))); |
80 | | - |
81 | | - // do fft stuff |
82 | | - |
83 | | - // uninterleave result into the output buffers |
84 | | - for (int j = 0; j < n; ++j) { |
85 | | - bOut0[n+j] = bOut[0+2*j]; |
86 | | - bOut1[n+j] = bOut[1+2*j]; |
87 | | - } |
88 | | - |
89 | | - __hv_store_f(inputs+h_orig, bIn); // store the new input to the inputs buffer |
90 | | - hTable_setHead(&o->inputs, wrap(h_orig+HV_N_SIMD, m)); |
| 50 | +void sRIFFT_free(SignalRIFFT *o) { |
| 51 | + hTable_free(&o->inputReal); |
| 52 | + hTable_free(&o->inputImagin); |
| 53 | + hTable_free(&o->output); |
91 | 54 | } |
92 | 55 |
|
| 56 | +void __hv_rifft_f(SignalRIFFT *o, hv_bInf_t bIn0, hv_bInf_t bIn1, hv_bOutf_t bOut) { |
| 57 | + // do ifft stuff |
| 58 | +} |
93 | 59 |
|
94 | | -void __hv_rifft_f(SignalRFFT *o, hv_bInf_t bIn0, hv_bInf_t bIn1, hv_bOutf_t bOut) { |
95 | | - hv_assert(o->table != NULL); |
96 | | - float *const work = hTable_getBuffer(o->table); |
97 | | - hv_assert(work != NULL); |
98 | | - const int n = hTable_getSize(o->table); // length fir filter |
99 | | - hv_assert((n&HV_N_SIMD_MASK) == 0); // n is a multiple of HV_N_SIMD |
100 | | - |
101 | | - float *const inputs = hTable_getBuffer(&o->inputs); |
102 | | - hv_assert(inputs != NULL); |
103 | | - const int m = hTable_getSize(&o->inputs); // length of input buffer. |
104 | | - hv_assert(m >= n); |
105 | | - const int h_orig = hTable_getHead(&o->inputs); |
106 | | - |
107 | | - float *bIn00 = &bIn0; |
108 | | - float *bIn10 = &bIn1; |
109 | | - // float *const bIn = (float *)(hv_alloca(2*n*sizeof(float))); |
110 | | - float *const bIn = (float *)(hv_alloca(sizeof(bOut))); |
111 | | - |
112 | | - // interleave the input buffers into the transform buffer |
113 | | - for (int i = 0; i < 2; ++i) { |
114 | | - for (int j = 0; j < n; ++j) { |
115 | | - bIn[0+2*j] = bIn00[n+j]; |
116 | | - bIn[1+2*j] = bIn10[n+j]; |
117 | | - } |
| 60 | +void sRIFFT_onMessage(HeavyContextInterface *_c, SignalRIFFT *o, int letIndex, |
| 61 | + const HvMessage *m, void *sendMessage) { |
| 62 | + switch (letIndex) { |
| 63 | + default: return; |
118 | 64 | } |
119 | | - |
120 | | - // do ifft stuff |
121 | | - |
122 | | - // __hv_store_f(inputs+h_orig, bIn); // store the new input to the inputs buffer |
123 | | - hTable_setHead(&o->inputs, wrap(h_orig+HV_N_SIMD, m)); |
124 | 65 | } |
0 commit comments