yading@10: /** yading@10: * @file yading@10: * Common code for Vorbis I encoder and decoder yading@10: * @author Denes Balatoni ( dbalatoni programozo hu ) yading@10: * yading@10: * This file is part of FFmpeg. yading@10: * yading@10: * FFmpeg is free software; you can redistribute it and/or yading@10: * modify it under the terms of the GNU Lesser General Public yading@10: * License as published by the Free Software Foundation; either yading@10: * version 2.1 of the License, or (at your option) any later version. yading@10: * yading@10: * FFmpeg is distributed in the hope that it will be useful, yading@10: * but WITHOUT ANY WARRANTY; without even the implied warranty of yading@10: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU yading@10: * Lesser General Public License for more details. yading@10: * yading@10: * You should have received a copy of the GNU Lesser General Public yading@10: * License along with FFmpeg; if not, write to the Free Software yading@10: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA yading@10: */ yading@10: yading@10: /** yading@10: * @file yading@10: * Common code for Vorbis I encoder and decoder yading@10: * @author Denes Balatoni ( dbalatoni programozo hu ) yading@10: */ yading@10: yading@10: #define BITSTREAM_READER_LE yading@10: #include "avcodec.h" yading@10: #include "get_bits.h" yading@10: yading@10: #include "vorbis.h" yading@10: yading@10: yading@10: /* Helper functions */ yading@10: yading@10: // x^(1/n) yading@10: unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n) yading@10: { yading@10: unsigned int ret = 0, i, j; yading@10: yading@10: do { yading@10: ++ret; yading@10: for (i = 0, j = ret; i < n - 1; i++) yading@10: j *= ret; yading@10: } while (j <= x); yading@10: yading@10: return ret - 1; yading@10: } yading@10: yading@10: // Generate vlc codes from vorbis huffman code lengths yading@10: yading@10: // the two bits[p] > 32 checks should be redundant, all calling code should yading@10: // already ensure that, but since it allows overwriting the stack it seems yading@10: // reasonable to check redundantly. yading@10: int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, unsigned num) yading@10: { yading@10: uint32_t exit_at_level[33] = { 404 }; yading@10: yading@10: unsigned i, j, p, code; yading@10: yading@10: #ifdef DEBUG yading@10: GetBitContext gb; yading@10: #endif yading@10: yading@10: for (p = 0; (bits[p] == 0) && (p < num); ++p) yading@10: ; yading@10: if (p == num) yading@10: return 0; yading@10: yading@10: codes[p] = 0; yading@10: if (bits[p] > 32) yading@10: return 1; yading@10: for (i = 0; i < bits[p]; ++i) yading@10: exit_at_level[i+1] = 1 << i; yading@10: yading@10: #ifdef DEBUG yading@10: av_log(NULL, AV_LOG_INFO, " %u. of %u code len %d code %d - ", p, num, bits[p], codes[p]); yading@10: init_get_bits(&gb, (uint8_t *)&codes[p], bits[p]); yading@10: for (i = 0; i < bits[p]; ++i) yading@10: av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); yading@10: av_log(NULL, AV_LOG_INFO, "\n"); yading@10: #endif yading@10: yading@10: ++p; yading@10: yading@10: for (; p < num; ++p) { yading@10: if (bits[p] > 32) yading@10: return 1; yading@10: if (bits[p] == 0) yading@10: continue; yading@10: // find corresponding exit(node which the tree can grow further from) yading@10: for (i = bits[p]; i > 0; --i) yading@10: if (exit_at_level[i]) yading@10: break; yading@10: if (!i) // overspecified tree yading@10: return 1; yading@10: code = exit_at_level[i]; yading@10: exit_at_level[i] = 0; yading@10: // construct code (append 0s to end) and introduce new exits yading@10: for (j = i + 1 ;j <= bits[p]; ++j) yading@10: exit_at_level[j] = code + (1 << (j - 1)); yading@10: codes[p] = code; yading@10: yading@10: #ifdef DEBUG yading@10: av_log(NULL, AV_LOG_INFO, " %d. code len %d code %d - ", p, bits[p], codes[p]); yading@10: init_get_bits(&gb, (uint8_t *)&codes[p], bits[p]); yading@10: for (i = 0; i < bits[p]; ++i) yading@10: av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0"); yading@10: av_log(NULL, AV_LOG_INFO, "\n"); yading@10: #endif yading@10: yading@10: } yading@10: yading@10: //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC) yading@10: for (p = 1; p < 33; p++) yading@10: if (exit_at_level[p]) yading@10: return 1; yading@10: yading@10: return 0; yading@10: } yading@10: yading@10: int ff_vorbis_ready_floor1_list(AVCodecContext *avctx, yading@10: vorbis_floor1_entry *list, int values) yading@10: { yading@10: int i; yading@10: list[0].sort = 0; yading@10: list[1].sort = 1; yading@10: for (i = 2; i < values; i++) { yading@10: int j; yading@10: list[i].low = 0; yading@10: list[i].high = 1; yading@10: list[i].sort = i; yading@10: for (j = 2; j < i; j++) { yading@10: int tmp = list[j].x; yading@10: if (tmp < list[i].x) { yading@10: if (tmp > list[list[i].low].x) yading@10: list[i].low = j; yading@10: } else { yading@10: if (tmp < list[list[i].high].x) yading@10: list[i].high = j; yading@10: } yading@10: } yading@10: } yading@10: for (i = 0; i < values - 1; i++) { yading@10: int j; yading@10: for (j = i + 1; j < values; j++) { yading@10: if (list[i].x == list[j].x) { yading@10: av_log(avctx, AV_LOG_ERROR, yading@10: "Duplicate value found in floor 1 X coordinates\n"); yading@10: return AVERROR_INVALIDDATA; yading@10: } yading@10: if (list[list[i].sort].x > list[list[j].sort].x) { yading@10: int tmp = list[i].sort; yading@10: list[i].sort = list[j].sort; yading@10: list[j].sort = tmp; yading@10: } yading@10: } yading@10: } yading@10: return 0; yading@10: } yading@10: yading@10: static inline void render_line_unrolled(intptr_t x, int y, int x1, yading@10: intptr_t sy, int ady, int adx, yading@10: float *buf) yading@10: { yading@10: int err = -adx; yading@10: x -= x1 - 1; yading@10: buf += x1 - 1; yading@10: while (++x < 0) { yading@10: err += ady; yading@10: if (err >= 0) { yading@10: err += ady - adx; yading@10: y += sy; yading@10: buf[x++] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; yading@10: } yading@10: buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; yading@10: } yading@10: if (x <= 0) { yading@10: if (err + ady >= 0) yading@10: y += sy; yading@10: buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; yading@10: } yading@10: } yading@10: yading@10: static void render_line(int x0, int y0, int x1, int y1, float *buf) yading@10: { yading@10: int dy = y1 - y0; yading@10: int adx = x1 - x0; yading@10: int ady = FFABS(dy); yading@10: int sy = dy < 0 ? -1 : 1; yading@10: buf[x0] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y0)]; yading@10: if (ady*2 <= adx) { // optimized common case yading@10: render_line_unrolled(x0, y0, x1, sy, ady, adx, buf); yading@10: } else { yading@10: int base = dy / adx; yading@10: int x = x0; yading@10: int y = y0; yading@10: int err = -adx; yading@10: ady -= FFABS(base) * adx; yading@10: while (++x < x1) { yading@10: y += base; yading@10: err += ady; yading@10: if (err >= 0) { yading@10: err -= adx; yading@10: y += sy; yading@10: } yading@10: buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)]; yading@10: } yading@10: } yading@10: } yading@10: yading@10: void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values, yading@10: uint16_t *y_list, int *flag, yading@10: int multiplier, float *out, int samples) yading@10: { yading@10: int lx, ly, i; yading@10: lx = 0; yading@10: ly = y_list[0] * multiplier; yading@10: for (i = 1; i < values; i++) { yading@10: int pos = list[i].sort; yading@10: if (flag[pos]) { yading@10: int x1 = list[pos].x; yading@10: int y1 = y_list[pos] * multiplier; yading@10: if (lx < samples) yading@10: render_line(lx, ly, FFMIN(x1,samples), y1, out); yading@10: lx = x1; yading@10: ly = y1; yading@10: } yading@10: if (lx >= samples) yading@10: break; yading@10: } yading@10: if (lx < samples) yading@10: render_line(lx, ly, samples, ly, out); yading@10: }