10l: fix ff_fft_init_arm() prototype

[ffmpeg] / libavcodec / celp_filters.c

diff --git a/libavcodec/celp_filters.c b/libavcodec/celp_filters.c
index ef1a578f44272579da9c094dcc692ba9f5b4f97d..d54e2fa7099aef50dd167078b701d8e9fffeeb99 100644 (file)
--- a/libavcodec/celp_filters.c
+++ b/libavcodec/celp_filters.c
@@ -25,11 +25,10 @@
 #include "avcodec.h"
 #include "celp_filters.h"
 
-void ff_celp_convolve_circ(
-        int16_t* fc_out,
-        const int16_t* fc_in,
-        const int16_t* filter,
-        int len)
+void ff_celp_convolve_circ(int16_t* fc_out,
+                           const int16_t* fc_in,
+                           const int16_t* filter,
+                           int len)
 {
     int i, k;
 
@@ -37,44 +36,49 @@ void ff_celp_convolve_circ(
 
     /* Since there are few pulses over an entire subframe (i.e. almost
        all fc_in[i] are zero) it is faster to loop over fc_in first. */
-    for(i=0; i<len; i++)
-    {
-        if(fc_in[i])
-        {
-            for(k=0; k<i; k++)
+    for (i = 0; i < len; i++) {
+        if (fc_in[i]) {
+            for (k = 0; k < i; k++)
                 fc_out[k] += (fc_in[i] * filter[len + k - i]) >> 15;
 
-            for(k=i; k<len; k++)
+            for (k = i; k < len; k++)
                 fc_out[k] += (fc_in[i] * filter[      k - i]) >> 15;
         }
     }
 }
 
-int ff_celp_lp_synthesis_filter(
-        int16_t *out,
-        const int16_t* filter_coeffs,
-        const int16_t* in,
-        int buffer_length,
-        int filter_length,
-        int stop_on_overflow,
-        int rounder)
+void ff_celp_circ_addf(float *out, const float *in,
+                       const float *lagged, int lag, float fac, int n)
+{
+    int k;
+    for (k = 0; k < lag; k++)
+        out[k] = in[k] + fac * lagged[n + k - lag];
+    for (; k < n; k++)
+        out[k] = in[k] + fac * lagged[    k - lag];
+}
+
+int ff_celp_lp_synthesis_filter(int16_t *out,
+                                const int16_t* filter_coeffs,
+                                const int16_t* in,
+                                int buffer_length,
+                                int filter_length,
+                                int stop_on_overflow,
+                                int rounder)
 {
     int i,n;
 
-    // This line is to avoid a +1 subtraction in the main loop.
+    // Avoids a +1 in the inner loop.
     filter_length++;
 
-    for(n=0; n<buffer_length; n++)
-    {
+    for (n = 0; n < buffer_length; n++) {
         int sum = rounder;
-        for(i=1; i<filter_length; i++)
+        for (i = 1; i < filter_length; i++)
             sum -= filter_coeffs[i-1] * out[n-i];
 
         sum = (sum >> 12) + in[n];
 
-        if(sum + 0x8000 > 0xFFFFU)
-        {
-            if(stop_on_overflow)
+        if (sum + 0x8000 > 0xFFFFU) {
+            if (stop_on_overflow)
                 return 1;
             sum = (sum >> 31) ^ 32767;
         }
@@ -84,22 +88,38 @@ int ff_celp_lp_synthesis_filter(
     return 0;
 }
 
-void ff_celp_lp_synthesis_filterf(
-        float *out,
-        const float* filter_coeffs,
-        const float* in,
-        int buffer_length,
-        int filter_length)
+void ff_celp_lp_synthesis_filterf(float *out,
+                                  const float* filter_coeffs,
+                                  const float* in,
+                                  int buffer_length,
+                                  int filter_length)
 {
     int i,n;
 
-    // This line is to avoid a +1 subtraction in the main loop
+    // Avoids a +1 in the inner loop.
     filter_length++;
 
-    for(n=0; n<buffer_length; n++)
-    {
+    for (n = 0; n < buffer_length; n++) {
         out[n] = in[n];
-        for(i=1; i<filter_length; i++)
+        for (i = 1; i < filter_length; i++)
             out[n] -= filter_coeffs[i-1] * out[n-i];
     }
 }
+
+void ff_celp_lp_zero_synthesis_filterf(float *out,
+                                       const float* filter_coeffs,
+                                       const float* in,
+                                       int buffer_length,
+                                       int filter_length)
+{
+    int i,n;
+
+    // Avoids a +1 in the inner loop.
+    filter_length++;
+
+    for (n = 0; n < buffer_length; n++) {
+        out[n] = in[n];
+        for (i = 1; i < filter_length; i++)
+            out[n] += filter_coeffs[i-1] * in[n-i];
+    }
+}