Commit a7adcf29 authored by Diego Biurrun's avatar Diego Biurrun

whitespace cosmetics, prettyprinting, K&R coding style

Originally committed as revision 20080 to svn://svn.ffmpeg.org/ffmpeg/trunk
parent badce93d
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
* @file libavcodec/vorbis.c * @file libavcodec/vorbis.c
* Common code for Vorbis I encoder and decoder * Common code for Vorbis I encoder and decoder
* @author Denes Balatoni ( dbalatoni programozo hu ) * @author Denes Balatoni ( dbalatoni programozo hu )
*
* This file is part of FFmpeg. * This file is part of FFmpeg.
* *
* FFmpeg is free software; you can redistribute it and/or * FFmpeg is free software; you can redistribute it and/or
...@@ -35,13 +35,13 @@ ...@@ -35,13 +35,13 @@
// x^(1/n) // x^(1/n)
unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n) unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n)
{ {
unsigned int ret=0, i, j; unsigned int ret = 0, i, j;
do { do {
++ret; ++ret;
for(i=0,j=ret;i<n-1;i++) for (i = 0, j = ret; i < n - 1; i++)
j*=ret; j *= ret;
} while (j<=x); } while (j <= x);
return ret - 1; return ret - 1;
} }
...@@ -53,61 +53,62 @@ unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n) ...@@ -53,61 +53,62 @@ unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n)
// reasonable to check redundantly. // reasonable to check redundantly.
int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, uint_fast32_t num) int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, uint_fast32_t num)
{ {
uint_fast32_t exit_at_level[33]={404,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, uint_fast32_t exit_at_level[33] = {
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; 404, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
uint_fast8_t i,j; uint_fast8_t i, j;
uint_fast32_t code,p; uint_fast32_t code, p;
#ifdef V_DEBUG #ifdef V_DEBUG
GetBitContext gb; GetBitContext gb;
#endif #endif
for(p=0;(bits[p]==0) && (p<num);++p) for (p = 0; (bits[p] == 0) && (p < num); ++p)
; ;
if (p==num) { if (p == num) {
// av_log(vc->avccontext, AV_LOG_INFO, "An empty codebook. Heh?! \n"); // av_log(vc->avccontext, AV_LOG_INFO, "An empty codebook. Heh?! \n");
return 0; return 0;
} }
codes[p]=0; codes[p] = 0;
if (bits[p] > 32) if (bits[p] > 32)
return 1; return 1;
for(i=0;i<bits[p];++i) for (i = 0; i < bits[p]; ++i)
exit_at_level[i+1]=1<<i; exit_at_level[i+1] = 1 << i;
#ifdef V_DEBUG #ifdef V_DEBUG
av_log(NULL, AV_LOG_INFO, " %d. of %d code len %d code %d - ", p, num, bits[p], codes[p]); av_log(NULL, AV_LOG_INFO, " %d. of %d code len %d code %d - ", p, num, bits[p], codes[p]);
init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]); init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]);
for(i=0;i<bits[p];++i) for (i = 0; i < bits[p]; ++i)
av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0");
av_log(NULL, AV_LOG_INFO, "\n"); av_log(NULL, AV_LOG_INFO, "\n");
#endif #endif
++p; ++p;
for(;p<num;++p) { for (; p < num; ++p) {
if (bits[p] > 32) if (bits[p] > 32)
return 1; return 1;
if (bits[p]==0) if (bits[p] == 0)
continue; continue;
// find corresponding exit(node which the tree can grow further from) // find corresponding exit(node which the tree can grow further from)
for(i=bits[p];i>0;--i) for (i = bits[p]; i > 0; --i)
if (exit_at_level[i]) if (exit_at_level[i])
break; break;
if (!i) // overspecified tree if (!i) // overspecified tree
return 1; return 1;
code=exit_at_level[i]; code = exit_at_level[i];
exit_at_level[i]=0; exit_at_level[i] = 0;
// construct code (append 0s to end) and introduce new exits // construct code (append 0s to end) and introduce new exits
for(j=i+1;j<=bits[p];++j) for (j = i + 1 ;j <= bits[p]; ++j)
exit_at_level[j]=code+(1<<(j-1)); exit_at_level[j] = code + (1 << (j - 1));
codes[p]=code; codes[p] = code;
#ifdef V_DEBUG #ifdef V_DEBUG
av_log(NULL, AV_LOG_INFO, " %d. code len %d code %d - ", p, bits[p], codes[p]); av_log(NULL, AV_LOG_INFO, " %d. code len %d code %d - ", p, bits[p], codes[p]);
init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]); init_get_bits(&gb, (uint_fast8_t *)&codes[p], bits[p]);
for(i=0;i<bits[p];++i) for (i = 0; i < bits[p]; ++i)
av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0");
av_log(NULL, AV_LOG_INFO, "\n"); av_log(NULL, AV_LOG_INFO, "\n");
#endif #endif
...@@ -115,7 +116,7 @@ int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, uint_fast32_t num) ...@@ -115,7 +116,7 @@ int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, uint_fast32_t num)
} }
//no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC) //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC)
for (p=1; p<33; p++) for (p = 1; p < 33; p++)
if (exit_at_level[p]) if (exit_at_level[p])
return 1; return 1;
...@@ -157,11 +158,11 @@ void ff_vorbis_ready_floor1_list(vorbis_floor1_entry * list, int values) ...@@ -157,11 +158,11 @@ void ff_vorbis_ready_floor1_list(vorbis_floor1_entry * list, int values)
static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1, static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1,
intptr_t sy, int ady, int adx, intptr_t sy, int ady, int adx,
float * buf) float *buf)
{ {
int err = -adx; int err = -adx;
x -= x1-1; x -= x1 - 1;
buf += x1-1; buf += x1 - 1;
while (++x < 0) { while (++x < 0) {
err += ady; err += ady;
if (err >= 0) { if (err >= 0) {
...@@ -178,14 +179,14 @@ static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1, ...@@ -178,14 +179,14 @@ static inline void render_line_unrolled(intptr_t x, intptr_t y, int x1,
} }
} }
static void render_line(int x0, int y0, int x1, int y1, float * buf) static void render_line(int x0, int y0, int x1, int y1, float *buf)
{ {
int dy = y1 - y0; int dy = y1 - y0;
int adx = x1 - x0; int adx = x1 - x0;
int ady = FFABS(dy); int ady = FFABS(dy);
int sy = dy<0 ? -1 : 1; int sy = dy < 0 ? -1 : 1;
buf[x0] = ff_vorbis_floor1_inverse_db_table[y0]; buf[x0] = ff_vorbis_floor1_inverse_db_table[y0];
if(ady*2<=adx) { // optimized common case if (ady*2 <= adx) { // optimized common case
render_line_unrolled(x0, y0, x1, sy, ady, adx, buf); render_line_unrolled(x0, y0, x1, sy, ady, adx, buf);
} else { } else {
int base = dy / adx; int base = dy / adx;
...@@ -206,8 +207,8 @@ static void render_line(int x0, int y0, int x1, int y1, float * buf) ...@@ -206,8 +207,8 @@ static void render_line(int x0, int y0, int x1, int y1, float * buf)
} }
void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values, void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values,
uint_fast16_t * y_list, int * flag, uint_fast16_t *y_list, int *flag,
int multiplier, float * out, int samples) int multiplier, float *out, int samples)
{ {
int lx, ly, i; int lx, ly, i;
lx = 0; lx = 0;
......
...@@ -2156,4 +2156,3 @@ const float * const ff_vorbis_vwin[8] = { ...@@ -2156,4 +2156,3 @@ const float * const ff_vorbis_vwin[8] = {
vwin64, vwin128, vwin256, vwin512, vwin64, vwin128, vwin256, vwin512,
vwin1024, vwin2048, vwin4096, vwin8192 vwin1024, vwin2048, vwin4096, vwin8192
}; };
This diff is collapsed.
This diff is collapsed.
...@@ -24,8 +24,7 @@ ...@@ -24,8 +24,7 @@
#include <stdint.h> #include <stdint.h>
static const uint8_t codebook0[] = { static const uint8_t codebook0[] = {
2, 10, 8, 14, 7, 12, 11, 14, 1, 5, 3, 7, 4, 9, 7, 2, 10, 8, 14, 7, 12, 11, 14, 1, 5, 3, 7, 4, 9, 7, 13,
13,
}; };
static const uint8_t codebook1[] = { static const uint8_t codebook1[] = {
...@@ -452,11 +451,11 @@ static const struct { ...@@ -452,11 +451,11 @@ static const struct {
int dim; int dim;
int len; int len;
int real_len; int real_len;
const uint8_t * clens; const uint8_t *clens;
int lookup; int lookup;
float min; float min;
float delta; float delta;
const uint8_t * quant; const uint8_t *quant;
} cvectors[] = { } cvectors[] = {
{ 2, 16, 16, codebook0, 0 }, { 2, 16, 16, codebook0, 0 },
{ 2, 8, 8, codebook1, 0 }, { 2, 8, 8, codebook1, 0 },
...@@ -493,7 +492,7 @@ static const struct { ...@@ -493,7 +492,7 @@ static const struct {
int dim; int dim;
int subclass; int subclass;
int masterbook; int masterbook;
const int * nbooks; const int *nbooks;
} floor_classes[] = { } floor_classes[] = {
{ 3, 0, 0, (const int[]){ 4 } }, { 3, 0, 0, (const int[]){ 4 } },
{ 4, 1, 0, (const int[]){ 5, 6 } }, { 4, 1, 0, (const int[]){ 5, 6 } },
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment