# HG changeset patch
# User vitor
# Date 1269170918 0
# Node ID e3b680f6c10605182eee9c0f6fd8b350061be4ed
# Parent  628a6ba6a4af267410db56e2ddd1fc77c6bea853
Cosmetics: move ff_dct_init() to the bottom of the file

diff -r 628a6ba6a4af -r e3b680f6c106 dct.c
--- a/dct.c	Sun Mar 21 11:24:01 2010 +0000
+++ b/dct.c	Sun Mar 21 11:28:38 2010 +0000
@@ -31,31 +31,6 @@
 #include "libavutil/mathematics.h"
 #include "fft.h"
 
-av_cold int ff_dct_init(DCTContext *s, int nbits, int inverse)
-{
-    int n = 1 << nbits;
-    int i;
-
-    s->nbits    = nbits;
-    s->inverse  = inverse;
-
-    ff_init_ff_cos_tabs(nbits+2);
-
-    s->costab = ff_cos_tabs[nbits+2];
-
-    s->csc2 = av_malloc(n/2 * sizeof(FFTSample));
-
-    if (ff_rdft_init(&s->rdft, nbits, inverse) < 0) {
-        av_free(s->csc2);
-        return -1;
-    }
-
-    for (i = 0; i < n/2; i++)
-        s->csc2[i] = 0.5 / sin((M_PI / (2*n) * (2*i + 1)));
-
-    return 0;
-}
-
 /* sin((M_PI * x / (2*n)) */
 #define SIN(s,n,x) (s->costab[(n) - (x)])
 
@@ -133,6 +108,31 @@
     ff_dct_calc_c(s, data);
 }
 
+av_cold int ff_dct_init(DCTContext *s, int nbits, int inverse)
+{
+    int n = 1 << nbits;
+    int i;
+
+    s->nbits    = nbits;
+    s->inverse  = inverse;
+
+    ff_init_ff_cos_tabs(nbits+2);
+
+    s->costab = ff_cos_tabs[nbits+2];
+
+    s->csc2 = av_malloc(n/2 * sizeof(FFTSample));
+
+    if (ff_rdft_init(&s->rdft, nbits, inverse) < 0) {
+        av_free(s->csc2);
+        return -1;
+    }
+
+    for (i = 0; i < n/2; i++)
+        s->csc2[i] = 0.5 / sin((M_PI / (2*n) * (2*i + 1)));
+
+    return 0;
+}
+
 av_cold void ff_dct_end(DCTContext *s)
 {
     ff_rdft_end(&s->rdft);