Reformat existing code. There should be no functional effects.

webrtc/common_audio/fft4g.c

 /*
  * http://www.kurims.kyoto-u.ac.jp/~ooura/fft.html
  * Copyright Takuya OOURA, 1996-2001
  *
  * You may use, copy, modify and distribute this code for any purpose (include
  * commercial use) and without fee. Please refer to this package when you modify
  * this code.
  *
  * Changes:
  * Trivial type modifications by the WebRTC authors.
@@ skipping 271 matching lines @@
 
 
 Appendix :
     The cos/sin table is recalculated when the larger table required.
     w[] and ip[] are compatible with all routines.
 */
 
 static void makewt(int nw, int *ip, float *w);
 static void makect(int nc, int *ip, float *c);
 static void bitrv2(int n, int *ip, float *a);
+#if 0  // Not used.
 static void bitrv2conj(int n, int *ip, float *a);
+#endif
 static void cftfsub(int n, float *a, float *w);
 static void cftbsub(int n, float *a, float *w);
 static void cft1st(int n, float *a, float *w);
 static void cftmdl(int n, int l, float *a, float *w);
 static void rftfsub(int n, float *a, int nc, float *c);
 static void rftbsub(int n, float *a, int nc, float *c);
 #if 0  // Not used.
 static void dctsub(int n, float *a, int nc, float *c)
 static void dstsub(int n, float *a, int nc, float *c)
 #endif
 
 
+#if 0  // Not used.
 void WebRtc_cdft(int n, int isgn, float *a, int *ip, float *w)
 {
     if (n > (ip[0] << 2)) {
         makewt(n >> 2, ip, w);
     }
     if (n > 4) {
         if (isgn >= 0) {
             bitrv2(n, ip + 2, a);
             cftfsub(n, a, w);
         } else {
             bitrv2conj(n, ip + 2, a);
             cftbsub(n, a, w);
         }
     } else if (n == 4) {
         cftfsub(n, a, w);
     }
 }
+#endif
 
 
 void WebRtc_rdft(int n, int isgn, float *a, int *ip, float *w)
 {
     int nw, nc;
     float xi;
 
     nw = ip[0];
     if (n > (nw << 2)) {
         nw = n >> 2;
@@ skipping 450 matching lines @@
                 yi = a[k1 + 1];
                 a[j1] = yr;
                 a[j1 + 1] = yi;
                 a[k1] = xr;
                 a[k1 + 1] = xi;
             }
         }
     }
 }
 
-
+#if 0  // Not used.
 static void bitrv2conj(int n, int *ip, float *a)
 {
     int j, j1, k, k1, l, m, m2;
     float xr, xi, yr, yi;
 
     ip[0] = 0;
     l = n;
     m = 1;
     while ((m << 3) < l) {
         l >>= 1;
@@ skipping 87 matching lines @@
                 a[j1 + 1] = yi;
                 a[k1] = xr;
                 a[k1 + 1] = xi;
             }
             k1 = 2 * k + ip[k];
             a[k1 + 1] = -a[k1 + 1];
             a[k1 + m2 + 1] = -a[k1 + m2 + 1];
         }
     }
 }
-
+#endif
 
 static void cftfsub(int n, float *a, float *w)
 {
     int j, j1, j2, j3, l;
     float x0r, x0i, x1r, x1i, x2r, x2i, x3r, x3i;
 
     l = 2;
     if (n > 8) {
         cft1st(n, a, w);
         l = 8;
@@ skipping 406 matching lines @@
         kk += ks;
         wkr = c[kk] - c[nc - kk];
         wki = c[kk] + c[nc - kk];
         xr = wki * a[k] - wkr * a[j];
         a[k] = wkr * a[k] + wki * a[j];
         a[j] = xr;
     }
     a[m] *= c[0];
 }
 #endif  // Not used.