You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

206 lines
5.5KB

  1. /*
  2. * LZO 1x decompression
  3. * Copyright (c) 2006 Reimar Doeffinger
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * 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. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * 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. #include <string.h>
  22. #include "avutil.h"
  23. #include "common.h"
  24. #include "intreadwrite.h"
  25. #include "lzo.h"
  26. /// Define if we may write up to 12 bytes beyond the output buffer.
  27. #define OUTBUF_PADDED 1
  28. /// Define if we may read up to 8 bytes beyond the input buffer.
  29. #define INBUF_PADDED 1
  30. typedef struct LZOContext {
  31. const uint8_t *in, *in_end;
  32. uint8_t *out_start, *out, *out_end;
  33. int error;
  34. } LZOContext;
  35. /**
  36. * @brief Reads one byte from the input buffer, avoiding an overrun.
  37. * @return byte read
  38. */
  39. static inline int get_byte(LZOContext *c)
  40. {
  41. if (c->in < c->in_end)
  42. return *c->in++;
  43. c->error |= AV_LZO_INPUT_DEPLETED;
  44. return 1;
  45. }
  46. #ifdef INBUF_PADDED
  47. #define GETB(c) (*(c).in++)
  48. #else
  49. #define GETB(c) get_byte(&(c))
  50. #endif
  51. /**
  52. * @brief Decodes a length value in the coding used by lzo.
  53. * @param x previous byte value
  54. * @param mask bits used from x
  55. * @return decoded length value
  56. */
  57. static inline int get_len(LZOContext *c, int x, int mask)
  58. {
  59. int cnt = x & mask;
  60. if (!cnt) {
  61. while (!(x = get_byte(c)))
  62. cnt += 255;
  63. cnt += mask + x;
  64. }
  65. return cnt;
  66. }
  67. /**
  68. * @brief Copies bytes from input to output buffer with checking.
  69. * @param cnt number of bytes to copy, must be >= 0
  70. */
  71. static inline void copy(LZOContext *c, int cnt)
  72. {
  73. register const uint8_t *src = c->in;
  74. register uint8_t *dst = c->out;
  75. if (cnt < 0) {
  76. c->error |= AV_LZO_ERROR;
  77. return;
  78. }
  79. if (cnt > c->in_end - src) {
  80. cnt = FFMAX(c->in_end - src, 0);
  81. c->error |= AV_LZO_INPUT_DEPLETED;
  82. }
  83. if (cnt > c->out_end - dst) {
  84. cnt = FFMAX(c->out_end - dst, 0);
  85. c->error |= AV_LZO_OUTPUT_FULL;
  86. }
  87. #if defined(INBUF_PADDED) && defined(OUTBUF_PADDED)
  88. AV_COPY32U(dst, src);
  89. src += 4;
  90. dst += 4;
  91. cnt -= 4;
  92. if (cnt > 0)
  93. #endif
  94. memcpy(dst, src, cnt);
  95. c->in = src + cnt;
  96. c->out = dst + cnt;
  97. }
  98. /**
  99. * @brief Copies previously decoded bytes to current position.
  100. * @param back how many bytes back we start
  101. * @param cnt number of bytes to copy, must be > 0
  102. *
  103. * cnt > back is valid, this will copy the bytes we just copied,
  104. * thus creating a repeating pattern with a period length of back.
  105. */
  106. static inline void copy_backptr(LZOContext *c, int back, int cnt)
  107. {
  108. register uint8_t *dst = c->out;
  109. if (cnt <= 0) {
  110. c->error |= AV_LZO_ERROR;
  111. return;
  112. }
  113. if (dst - c->out_start < back) {
  114. c->error |= AV_LZO_INVALID_BACKPTR;
  115. return;
  116. }
  117. if (cnt > c->out_end - dst) {
  118. cnt = FFMAX(c->out_end - dst, 0);
  119. c->error |= AV_LZO_OUTPUT_FULL;
  120. }
  121. av_memcpy_backptr(dst, back, cnt);
  122. c->out = dst + cnt;
  123. }
  124. int av_lzo1x_decode(void *out, int *outlen, const void *in, int *inlen)
  125. {
  126. int state = 0;
  127. int x;
  128. LZOContext c;
  129. if (!*outlen || !*inlen) {
  130. int res = 0;
  131. if (!*outlen)
  132. res |= AV_LZO_OUTPUT_FULL;
  133. if (!*inlen)
  134. res |= AV_LZO_INPUT_DEPLETED;
  135. return res;
  136. }
  137. c.in = in;
  138. c.in_end = (const uint8_t *)in + *inlen;
  139. c.out = c.out_start = out;
  140. c.out_end = (uint8_t *)out + *outlen;
  141. c.error = 0;
  142. x = GETB(c);
  143. if (x > 17) {
  144. copy(&c, x - 17);
  145. x = GETB(c);
  146. if (x < 16)
  147. c.error |= AV_LZO_ERROR;
  148. }
  149. if (c.in > c.in_end)
  150. c.error |= AV_LZO_INPUT_DEPLETED;
  151. while (!c.error) {
  152. int cnt, back;
  153. if (x > 15) {
  154. if (x > 63) {
  155. cnt = (x >> 5) - 1;
  156. back = (GETB(c) << 3) + ((x >> 2) & 7) + 1;
  157. } else if (x > 31) {
  158. cnt = get_len(&c, x, 31);
  159. x = GETB(c);
  160. back = (GETB(c) << 6) + (x >> 2) + 1;
  161. } else {
  162. cnt = get_len(&c, x, 7);
  163. back = (1 << 14) + ((x & 8) << 11);
  164. x = GETB(c);
  165. back += (GETB(c) << 6) + (x >> 2);
  166. if (back == (1 << 14)) {
  167. if (cnt != 1)
  168. c.error |= AV_LZO_ERROR;
  169. break;
  170. }
  171. }
  172. } else if (!state) {
  173. cnt = get_len(&c, x, 15);
  174. copy(&c, cnt + 3);
  175. x = GETB(c);
  176. if (x > 15)
  177. continue;
  178. cnt = 1;
  179. back = (1 << 11) + (GETB(c) << 2) + (x >> 2) + 1;
  180. } else {
  181. cnt = 0;
  182. back = (GETB(c) << 2) + (x >> 2) + 1;
  183. }
  184. copy_backptr(&c, back, cnt + 2);
  185. state =
  186. cnt = x & 3;
  187. copy(&c, cnt);
  188. x = GETB(c);
  189. }
  190. *inlen = c.in_end - c.in;
  191. if (c.in > c.in_end)
  192. *inlen = 0;
  193. *outlen = c.out_end - c.out;
  194. return c.error;
  195. }