vorbis.c 6.64 KB
Newer Older
1
/*
2
 * This file is part of Libav.
3
 *
4
 * Libav is free software; you can redistribute it and/or
5 6
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
7
 * version 2.1 of the License, or (at your option) any later version.
8
 *
9
 * Libav is distributed in the hope that it will be useful,
10 11 12 13 14
 * 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
15
 * License along with Libav; if not, write to the Free Software
16
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
17 18
 */

19 20 21 22 23 24
/**
 * @file
 * Common code for Vorbis I encoder and decoder
 * @author Denes Balatoni  ( dbalatoni programozo hu )
 */

25
#define BITSTREAM_READER_LE
26
#include "avcodec.h"
27
#include "get_bits.h"
28 29

#include "vorbis.h"
Oded Shimon's avatar
Oded Shimon committed
30 31


32 33
/* Helper functions */

34 35 36
// x^(1/n)
unsigned int ff_vorbis_nth_root(unsigned int x, unsigned int n)
{
37
    unsigned int ret = 0, i, j;
38

39 40
    do {
        ++ret;
41 42 43
        for (i = 0, j = ret; i < n - 1; i++)
            j *= ret;
    } while (j <= x);
44

45
    return ret - 1;
46 47
}

48
// Generate vlc codes from vorbis huffman code lengths
49

50 51 52
// 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.
53
int ff_vorbis_len2vlc(uint8_t *bits, uint32_t *codes, unsigned num)
54
{
55
    uint32_t exit_at_level[33] = { 404 };
56

57
    unsigned i, j, p, code;
58

59
#ifdef DEBUG
60
    GetBitContext gb;
61
#endif
62

63
    for (p = 0; (bits[p] == 0) && (p < num); ++p)
64
        ;
65
    if (p == num) {
66 67
//        av_log(vc->avccontext, AV_LOG_INFO, "An empty codebook. Heh?! \n");
        return 0;
68 69
    }

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

76
#ifdef DEBUG
77 78
    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]);
79
    for (i = 0; i < bits[p]; ++i)
80 81 82
        av_log(NULL, AV_LOG_INFO, "%s", get_bits1(&gb) ? "1" : "0");
    av_log(NULL, AV_LOG_INFO, "\n");
#endif
83

84
    ++p;
85

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

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

    }

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

119 120
    return 0;
}
121

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

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

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

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