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

22 23
#include <string.h>

24
#include "avutil.h"
25
#include "common.h"
26
#include "intreadwrite.h"
27 28
#include "lzo.h"

29
/// Define if we may write up to 12 bytes beyond the output buffer.
30
#define OUTBUF_PADDED 1
31
/// Define if we may read up to 8 bytes beyond the input buffer.
32
#define INBUF_PADDED 1
33

34
typedef struct LZOContext {
35
    const uint8_t *in, *in_end;
36
    uint8_t *out_start, *out, *out_end;
37 38 39 40
    int error;
} LZOContext;

/**
41 42
 * @brief Reads one byte from the input buffer, avoiding an overrun.
 * @return byte read
43
 */
44 45
static inline int get_byte(LZOContext *c)
{
46 47
    if (c->in < c->in_end)
        return *c->in++;
48
    c->error |= AV_LZO_INPUT_DEPLETED;
49
    return 1;
50 51
}

52 53 54 55 56 57
#ifdef INBUF_PADDED
#define GETB(c) (*(c).in++)
#else
#define GETB(c) get_byte(&(c))
#endif

58
/**
59 60 61 62
 * @brief Decodes a length value in the coding used by lzo.
 * @param x previous byte value
 * @param mask bits used from x
 * @return decoded length value
63
 */
64 65
static inline int get_len(LZOContext *c, int x, int mask)
{
66 67
    int cnt = x & mask;
    if (!cnt) {
68 69
        while (!(x = get_byte(c)))
            cnt += 255;
70 71 72 73 74 75
        cnt += mask + x;
    }
    return cnt;
}

/**
76 77
 * @brief Copies bytes from input to output buffer with checking.
 * @param cnt number of bytes to copy, must be >= 0
78
 */
79 80
static inline void copy(LZOContext *c, int cnt)
{
81
    register const uint8_t *src = c->in;
82
    register uint8_t *dst       = c->out;
83 84 85 86
    if (cnt < 0) {
        c->error |= AV_LZO_ERROR;
        return;
    }
87
    if (cnt > c->in_end - src) {
88
        cnt       = FFMAX(c->in_end - src, 0);
89
        c->error |= AV_LZO_INPUT_DEPLETED;
90
    }
91
    if (cnt > c->out_end - dst) {
92
        cnt       = FFMAX(c->out_end - dst, 0);
93
        c->error |= AV_LZO_OUTPUT_FULL;
94
    }
95
#if defined(INBUF_PADDED) && defined(OUTBUF_PADDED)
96
    AV_COPY32U(dst, src);
97 98 99 100 101
    src += 4;
    dst += 4;
    cnt -= 4;
    if (cnt > 0)
#endif
102 103
    memcpy(dst, src, cnt);
    c->in  = src + cnt;
104
    c->out = dst + cnt;
105 106 107
}

/**
108 109
 * @brief Copies previously decoded bytes to current position.
 * @param back how many bytes back we start
110
 * @param cnt number of bytes to copy, must be > 0
111
 *
112 113
 * cnt > back is valid, this will copy the bytes we just copied,
 * thus creating a repeating pattern with a period length of back.
114
 */
115 116 117
static inline void copy_backptr(LZOContext *c, int back, int cnt)
{
    register uint8_t *dst       = c->out;
118 119 120 121
    if (cnt <= 0) {
        c->error |= AV_LZO_ERROR;
        return;
    }
122
    if (dst - c->out_start < back) {
123
        c->error |= AV_LZO_INVALID_BACKPTR;
124 125
        return;
    }
126
    if (cnt > c->out_end - dst) {
127
        cnt       = FFMAX(c->out_end - dst, 0);
128
        c->error |= AV_LZO_OUTPUT_FULL;
129
    }
130
    av_memcpy_backptr(dst, back, cnt);
131 132 133
    c->out = dst + cnt;
}

134 135 136
int av_lzo1x_decode(void *out, int *outlen, const void *in, int *inlen)
{
    int state = 0;
137 138
    int x;
    LZOContext c;
139 140 141 142 143 144 145 146
    if (!*outlen || !*inlen) {
        int res = 0;
        if (!*outlen)
            res |= AV_LZO_OUTPUT_FULL;
        if (!*inlen)
            res |= AV_LZO_INPUT_DEPLETED;
        return res;
    }
147 148 149 150 151 152
    c.in      = in;
    c.in_end  = (const uint8_t *)in + *inlen;
    c.out     = c.out_start = out;
    c.out_end = (uint8_t *)out + *outlen;
    c.error   = 0;
    x         = GETB(c);
153 154
    if (x > 17) {
        copy(&c, x - 17);
155
        x = GETB(c);
156 157
        if (x < 16)
            c.error |= AV_LZO_ERROR;
158
    }
159
    if (c.in > c.in_end)
160
        c.error |= AV_LZO_INPUT_DEPLETED;
161 162
    while (!c.error) {
        int cnt, back;
163 164
        if (x > 15) {
            if (x > 63) {
165
                cnt  = (x >> 5) - 1;
166
                back = (GETB(c) << 3) + ((x >> 2) & 7) + 1;
167
            } else if (x > 31) {
168 169
                cnt  = get_len(&c, x, 31);
                x    = GETB(c);
170
                back = (GETB(c) << 6) + (x >> 2) + 1;
171
            } else {
172 173 174
                cnt   = get_len(&c, x, 7);
                back  = (1 << 14) + ((x & 8) << 11);
                x     = GETB(c);
175
                back += (GETB(c) << 6) + (x >> 2);
176 177
                if (back == (1 << 14)) {
                    if (cnt != 1)
178
                        c.error |= AV_LZO_ERROR;
179 180 181
                    break;
                }
            }
182 183 184 185 186 187 188 189
        } else if (!state) {
            cnt = get_len(&c, x, 15);
            copy(&c, cnt + 3);
            x = GETB(c);
            if (x > 15)
                continue;
            cnt  = 1;
            back = (1 << 11) + (GETB(c) << 2) + (x >> 2) + 1;
190
        } else {
191 192
            cnt  = 0;
            back = (GETB(c) << 2) + (x >> 2) + 1;
193 194
        }
        copy_backptr(&c, back, cnt + 2);
195 196
        state =
        cnt   = x & 3;
197
        copy(&c, cnt);
198
        x = GETB(c);
199 200
    }
    *inlen = c.in_end - c.in;
201 202
    if (c.in > c.in_end)
        *inlen = 0;
203 204 205
    *outlen = c.out_end - c.out;
    return c.error;
}