1cabdff1aSopenharmony_ci/* 2cabdff1aSopenharmony_ci * lzf decompression algorithm 3cabdff1aSopenharmony_ci * Copyright (c) 2015 Luca Barbato 4cabdff1aSopenharmony_ci * 5cabdff1aSopenharmony_ci * This file is part of FFmpeg. 6cabdff1aSopenharmony_ci * 7cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or 8cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public 9cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either 10cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version. 11cabdff1aSopenharmony_ci * 12cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful, 13cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of 14cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 15cabdff1aSopenharmony_ci * Lesser General Public License for more details. 16cabdff1aSopenharmony_ci * 17cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public 18cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software 19cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20cabdff1aSopenharmony_ci */ 21cabdff1aSopenharmony_ci 22cabdff1aSopenharmony_ci/** 23cabdff1aSopenharmony_ci * @file 24cabdff1aSopenharmony_ci * lzf decompression 25cabdff1aSopenharmony_ci * 26cabdff1aSopenharmony_ci * LZF is a fast compression/decompression algorithm that takes very little 27cabdff1aSopenharmony_ci * code space and working memory, ideal for real-time and block compression. 28cabdff1aSopenharmony_ci * 29cabdff1aSopenharmony_ci * https://en.wikibooks.org/wiki/Data_Compression/Dictionary_compression#LZF 30cabdff1aSopenharmony_ci */ 31cabdff1aSopenharmony_ci 32cabdff1aSopenharmony_ci#include "libavutil/mem.h" 33cabdff1aSopenharmony_ci 34cabdff1aSopenharmony_ci#include "bytestream.h" 35cabdff1aSopenharmony_ci#include "lzf.h" 36cabdff1aSopenharmony_ci 37cabdff1aSopenharmony_ci#define LZF_LITERAL_MAX (1 << 5) 38cabdff1aSopenharmony_ci#define LZF_LONG_BACKREF 7 + 2 39cabdff1aSopenharmony_ci 40cabdff1aSopenharmony_ciint ff_lzf_uncompress(GetByteContext *gb, uint8_t **buf, int64_t *size) 41cabdff1aSopenharmony_ci{ 42cabdff1aSopenharmony_ci int ret = 0; 43cabdff1aSopenharmony_ci uint8_t *p = *buf; 44cabdff1aSopenharmony_ci int64_t len = 0; 45cabdff1aSopenharmony_ci 46cabdff1aSopenharmony_ci while (bytestream2_get_bytes_left(gb) > 2) { 47cabdff1aSopenharmony_ci uint8_t s = bytestream2_get_byte(gb); 48cabdff1aSopenharmony_ci 49cabdff1aSopenharmony_ci if (s < LZF_LITERAL_MAX) { 50cabdff1aSopenharmony_ci s++; 51cabdff1aSopenharmony_ci if (s > *size - len) { 52cabdff1aSopenharmony_ci *size += s + *size /2; 53cabdff1aSopenharmony_ci ret = av_reallocp(buf, *size); 54cabdff1aSopenharmony_ci if (ret < 0) 55cabdff1aSopenharmony_ci return ret; 56cabdff1aSopenharmony_ci p = *buf + len; 57cabdff1aSopenharmony_ci } 58cabdff1aSopenharmony_ci 59cabdff1aSopenharmony_ci bytestream2_get_buffer(gb, p, s); 60cabdff1aSopenharmony_ci p += s; 61cabdff1aSopenharmony_ci len += s; 62cabdff1aSopenharmony_ci } else { 63cabdff1aSopenharmony_ci int l = 2 + (s >> 5); 64cabdff1aSopenharmony_ci int off = ((s & 0x1f) << 8) + 1; 65cabdff1aSopenharmony_ci 66cabdff1aSopenharmony_ci if (l == LZF_LONG_BACKREF) 67cabdff1aSopenharmony_ci l += bytestream2_get_byte(gb); 68cabdff1aSopenharmony_ci 69cabdff1aSopenharmony_ci off += bytestream2_get_byte(gb); 70cabdff1aSopenharmony_ci 71cabdff1aSopenharmony_ci if (off > len) 72cabdff1aSopenharmony_ci return AVERROR_INVALIDDATA; 73cabdff1aSopenharmony_ci 74cabdff1aSopenharmony_ci if (l > *size - len) { 75cabdff1aSopenharmony_ci *size += l + *size / 2; 76cabdff1aSopenharmony_ci ret = av_reallocp(buf, *size); 77cabdff1aSopenharmony_ci if (ret < 0) 78cabdff1aSopenharmony_ci return ret; 79cabdff1aSopenharmony_ci p = *buf + len; 80cabdff1aSopenharmony_ci } 81cabdff1aSopenharmony_ci 82cabdff1aSopenharmony_ci av_memcpy_backptr(p, off, l); 83cabdff1aSopenharmony_ci 84cabdff1aSopenharmony_ci p += l; 85cabdff1aSopenharmony_ci len += l; 86cabdff1aSopenharmony_ci } 87cabdff1aSopenharmony_ci } 88cabdff1aSopenharmony_ci 89cabdff1aSopenharmony_ci *size = len; 90cabdff1aSopenharmony_ci 91cabdff1aSopenharmony_ci return 0; 92cabdff1aSopenharmony_ci} 93