vorbis.c 6.67 KB
Newer Older
1
/**
2
 * @file
3
 * Common code for Vorbis I encoder and decoder
4
 * @author Denes Balatoni  ( dbalatoni programozo hu )
5
 *
6 7 8
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
9 10
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
11
 * version 2.1 of the License, or (at your option) any later version.
12
 *
13
 * FFmpeg is distributed in the hope that it will be useful,
14 15 16 17 18
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
19
 * License along with FFmpeg; if not, write to the Free Software
20
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 22
 */

23 24 25 26 27 28
/**
 * @file
 * Common code for Vorbis I encoder and decoder
 * @author Denes Balatoni  ( dbalatoni programozo hu )
 */

29
#define BITSTREAM_READER_LE
30
#include "avcodec.h"
31
#include "get_bits.h"
32 33

#include "vorbis.h"
Oded Shimon's avatar
Oded Shimon committed
34 35


36 37
/* Helper functions */

38 39 40
// x^(1/n)
unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n)
{
41
    unsigned int ret = 0, i, j;
42

43 44
    do {
        ++ret;
45 46 47
        for (i = 0, j = ret; i < n - 1; i++)
            j *= ret;
    } while (j <= x);
48

49
    return ret - 1;
50 51
}

52
// Generate vlc codes from vorbis huffman code lengths
53

54 55 56
// the two bits[p] > 32 checks should be redundant, all calling code should
// already ensure that, but since it allows overwriting the stack it seems
// reasonable to check redundantly.
57
int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, unsigned num)
58
{
59
    uint32_t exit_at_level[33] = { 404 };
60

61
    unsigned i, j, p, code;
62

63
#ifdef DEBUG
64
    GetBitContext gb;
65
#endif
66

67
    for (p = 0; (bits[p] == 0) && (p < num); ++p)
68
        ;
69
    if (p == num)
70
        return 0;
71

72
    codes[p] = 0;
73 74
    if (bits[p] > 32)
        return 1;
75 76
    for (i = 0; i < bits[p]; ++i)
        exit_at_level[i+1] = 1 << i;
77

78
#ifdef DEBUG
79 80
    av_log(NULL, AV_LOG_INFO, " %u. of %u code len %d code %d - ", p, num, bits[p], codes[p]);
    init_get_bits(&gb, (uint8_t *)&codes[p], bits[p]);
81
    for (i = 0; i < bits[p]; ++i)
82 83 84
        av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0");
    av_log(NULL, AV_LOG_INFO, "\n");
#endif
85

86
    ++p;
87

88
    for (; p < num; ++p) {
89
        if (bits[p] > 32)
90 91 92
             return 1;
        if (bits[p] == 0)
             continue;
93
        // find corresponding exit(node which the tree can grow further from)
94
        for (i = bits[p]; i > 0; --i)
95 96 97
            if (exit_at_level[i])
                break;
        if (!i) // overspecified tree
98 99 100
             return 1;
        code = exit_at_level[i];
        exit_at_level[i] = 0;
101
        // construct code (append 0s to end) and introduce new exits
102 103 104
        for (j = i + 1 ;j <= bits[p]; ++j)
            exit_at_level[j] = code + (1 << (j - 1));
        codes[p] = code;
105

106
#ifdef DEBUG
107
        av_log(NULL, AV_LOG_INFO, " %d. code len %d code %d - ", p, bits[p], codes[p]);
108
        init_get_bits(&gb, (uint8_t *)&codes[p], bits[p]);
109
        for (i = 0; i < bits[p]; ++i)
110 111
            av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0");
        av_log(NULL, AV_LOG_INFO, "\n");
112 113 114 115
#endif

    }

116
    //no exits should be left (underspecified tree - ie. unused valid vlcs - not allowed by SPEC)
117
    for (p = 1; p < 33; p++)
118 119
        if (exit_at_level[p])
            return 1;
120

121 122
    return 0;
}
123

124
int ff_vorbis_ready_floor1_list(AVCodecContext *avctx,
125
                                vorbis_floor1_entry *list, int values)
126
{
127
    int i;
128 129 130 131
    list[0].sort = 0;
    list[1].sort = 1;
    for (i = 2; i < values; i++) {
        int j;
132
        list[i].low  = 0;
133 134 135 136 137
        list[i].high = 1;
        list[i].sort = i;
        for (j = 2; j < i; j++) {
            int tmp = list[j].x;
            if (tmp < list[i].x) {
138
                if (tmp > list[list[i].low].x)
139
                    list[i].low  =  j;
140
            } else {
141 142
                if (tmp < list[list[i].high].x)
                    list[i].high = j;
143 144 145 146 147 148
            }
        }
    }
    for (i = 0; i < values - 1; i++) {
        int j;
        for (j = i + 1; j < values; j++) {
149
            if (list[i].x == list[j].x) {
150
                av_log(avctx, AV_LOG_ERROR,
151 152 153
                       "Duplicate value found in floor 1 X coordinates\n");
                return AVERROR_INVALIDDATA;
            }
154 155 156 157 158 159 160
            if (list[list[i].sort].x > list[list[j].sort].x) {
                int tmp = list[i].sort;
                list[i].sort = list[j].sort;
                list[j].sort = tmp;
            }
        }
    }
161
    return 0;
162 163
}

164
static inline void render_line_unrolled(intptr_t x, int y, int x1,
165
                                        intptr_t sy, int ady, int adx,
166
                                        float *buf)
167
{
168
    int err = -adx;
169 170
    x -= x1 - 1;
    buf += x1 - 1;
171 172 173 174
    while (++x < 0) {
        err += ady;
        if (err >= 0) {
            err += ady - adx;
175
            y   += sy;
176
            buf[x++] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
177
        }
178
        buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
179 180 181 182
    }
    if (x <= 0) {
        if (err + ady >= 0)
            y += sy;
183
        buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
184 185 186
    }
}

187
static void render_line(int x0, int y0, int x1, int y1, float *buf)
188
{
189
    int dy  = y1 - y0;
190
    int adx = x1 - x0;
191
    int ady = FFABS(dy);
192
    int sy  = dy < 0 ? -1 : 1;
193
    buf[x0] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y0)];
194
    if (ady*2 <= adx) { // optimized common case
195 196
        render_line_unrolled(x0, y0, x1, sy, ady, adx, buf);
    } else {
197 198
        int base  = dy / adx;
        int x     = x0;
199
        int y     = y0;
200
        int err   = -adx;
Loren Merritt's avatar
Loren Merritt committed
201 202 203 204 205 206
        ady -= FFABS(base) * adx;
        while (++x < x1) {
            y += base;
            err += ady;
            if (err >= 0) {
                err -= adx;
207
                y   += sy;
Loren Merritt's avatar
Loren Merritt committed
208
            }
209
            buf[x] = ff_vorbis_floor1_inverse_db_table[av_clip_uint8(y)];
210
        }
211
    }
212 213
}

214
void ff_vorbis_floor1_render_list(vorbis_floor1_entry * list, int values,
215
                                  uint16_t *y_list, int *flag,
216
                                  int multiplier, float *out, int samples)
217
{
218
    int lx, ly, i;
219 220 221 222 223
    lx = 0;
    ly = y_list[0] * multiplier;
    for (i = 1; i < values; i++) {
        int pos = list[i].sort;
        if (flag[pos]) {
224 225 226 227 228 229
            int x1 = list[pos].x;
            int y1 = y_list[pos] * multiplier;
            if (lx < samples)
                render_line(lx, ly, FFMIN(x1,samples), y1, out);
            lx = x1;
            ly = y1;
230
        }
231 232
        if (lx >= samples)
            break;
233
    }
234 235
    if (lx < samples)
        render_line(lx, ly, samples, ly, out);
236
}