fork/rust-sdks

git clone https://git.julia.blue/fork/rust-sdks

Théo Monnomsoxr-sys (#438)2e4d385

main
2.5 KiB110 linesraw
1/* SoX Resampler Library      Copyright (c) 2007-16 robs@users.sourceforge.net
2 * Licence for this file: LGPL v2.1                  See LICENCE for details. */
3
4#if !defined PFFT_MACROS_ONLY
5
6#include "math-wrap.h"
7
8#if PFFFT_DOUBLE
9  #include "util64s.h"
10#else
11  #include "util32s.h"
12  #define sin(x) sinf(x)
13  #define cos(x) cosf(x)
14#endif
15
16#define pffft_aligned_free    SIMD_ALIGNED_FREE
17#define pffft_aligned_malloc  SIMD_ALIGNED_MALLOC
18#define pffft_aligned_calloc  SIMD_ALIGNED_CALLOC
19
20#undef inline
21#define inline __inline
22
23#endif
24
25
26
27#include "pffft.c"
28
29
30
31#if !defined PFFT_MACROS_ONLY
32
33#if !defined PFFFT_SIMD_DISABLE
34
35static void pffft_zconvolve(PFFFT_Setup *s, const float *a, const float *b, float *ab) {
36  int i, Ncvec = s->Ncvec;
37  const v4sf * /*RESTRICT*/ va = (const v4sf*)a;
38  const v4sf * RESTRICT vb = (const v4sf*)b;
39  v4sf * /*RESTRICT*/ vab = (v4sf*)ab;
40
41  float ar, ai, br, bi;
42
43#ifdef __arm__
44  __builtin_prefetch(va);
45  __builtin_prefetch(vb);
46  __builtin_prefetch(va+2);
47  __builtin_prefetch(vb+2);
48  __builtin_prefetch(va+4);
49  __builtin_prefetch(vb+4);
50  __builtin_prefetch(va+6);
51  __builtin_prefetch(vb+6);
52#endif
53
54  assert(VALIGNED(a) && VALIGNED(b) && VALIGNED(ab));
55  ar = ((v4sf_union*)va)[0].f[0];
56  ai = ((v4sf_union*)va)[1].f[0];
57  br = ((v4sf_union*)vb)[0].f[0];
58  bi = ((v4sf_union*)vb)[1].f[0];
59
60  for (i=0; i < Ncvec; i += 2) {
61    v4sf ar, ai, br, bi;
62    ar = va[2*i+0]; ai = va[2*i+1];
63    br = vb[2*i+0]; bi = vb[2*i+1];
64    VCPLXMUL(ar, ai, br, bi);
65    vab[2*i+0] = ar;
66    vab[2*i+1] = ai;
67    ar = va[2*i+2]; ai = va[2*i+3];
68    br = vb[2*i+2]; bi = vb[2*i+3];
69    VCPLXMUL(ar, ai, br, bi);
70    vab[2*i+2] = ar;
71    vab[2*i+3] = ai;
72  }
73  if (s->transform == PFFFT_REAL) {
74    ((v4sf_union*)vab)[0].f[0] = ar*br;
75    ((v4sf_union*)vab)[1].f[0] = ai*bi;
76  }
77}
78
79#else
80
81static void pffft_zconvolve(PFFFT_Setup *s, const float *a, const float *b, float *ab) {
82  int i, Ncvec = s->Ncvec;
83
84  if (s->transform == PFFFT_REAL) {
85    /* take care of the fftpack ordering */
86    ab[0] = a[0]*b[0];
87    ab[2*Ncvec-1] = a[2*Ncvec-1]*b[2*Ncvec-1];
88    ++ab; ++a; ++b; --Ncvec;
89  }
90  for (i=0; i < Ncvec; ++i) {
91    float ar, ai, br, bi;
92    ar = a[2*i+0]; ai = a[2*i+1];
93    br = b[2*i+0]; bi = b[2*i+1];
94    VCPLXMUL(ar, ai, br, bi);
95    ab[2*i+0] = ar;
96    ab[2*i+1] = ai;
97  }
98}
99
100#endif
101
102#include <string.h>
103
104static void pffft_reorder_back(int length, void * setup, float * data, float * work)
105{
106  memcpy(work, data, (unsigned)length * sizeof(*work));
107  pffft_zreorder(setup, work, data, PFFFT_BACKWARD);
108}
109
110#endif