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.

308 lines
12KB

  1. /*
  2. * FFV1 codec for libavcodec
  3. *
  4. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * This file is part of Libav.
  7. *
  8. * Libav is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * 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. * Libav is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with Libav; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. /**
  23. * @file
  24. * FF Video Codec 1 (a lossless codec)
  25. */
  26. #include "libavutil/attributes.h"
  27. #include "avcodec.h"
  28. #include "get_bits.h"
  29. #include "put_bits.h"
  30. #include "rangecoder.h"
  31. #include "golomb.h"
  32. #include "mathops.h"
  33. #include "ffv1.h"
  34. const int8_t ffv1_quant5_10bit[256] = {
  35. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1,
  36. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  37. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  38. 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  39. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  40. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  41. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  42. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  43. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  44. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  45. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  46. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  47. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -1,
  48. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  49. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  50. -1, -1, -1, -1, -1, -1, -0, -0, -0, -0, -0, -0, -0, -0, -0, -0,
  51. };
  52. const int8_t ffv1_quant5[256] = {
  53. 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  54. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  55. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  56. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  57. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  58. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  59. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  60. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  61. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  62. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  63. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  64. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  65. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  66. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  67. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  68. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -1, -1, -1,
  69. };
  70. const int8_t ffv1_quant9_10bit[256] = {
  71. 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2,
  72. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3,
  73. 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
  74. 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
  75. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
  76. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
  77. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
  78. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
  79. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  80. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  81. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  82. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  83. -4, -4, -4, -4, -4, -4, -4, -4, -4, -3, -3, -3, -3, -3, -3, -3,
  84. -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3,
  85. -3, -3, -3, -3, -3, -3, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  86. -2, -2, -2, -2, -1, -1, -1, -1, -1, -1, -1, -1, -0, -0, -0, -0,
  87. };
  88. const int8_t ffv1_quant11[256] = {
  89. 0, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4,
  90. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
  91. 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
  92. 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
  93. 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
  94. 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
  95. 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
  96. 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
  97. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  98. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  99. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  100. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  101. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  102. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -4, -4,
  103. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  104. -4, -4, -4, -4, -4, -3, -3, -3, -3, -3, -3, -3, -2, -2, -2, -1,
  105. };
  106. const uint8_t ffv1_ver2_state[256] = {
  107. 0, 10, 10, 10, 10, 16, 16, 16, 28, 16, 16, 29, 42, 49, 20, 49,
  108. 59, 25, 26, 26, 27, 31, 33, 33, 33, 34, 34, 37, 67, 38, 39, 39,
  109. 40, 40, 41, 79, 43, 44, 45, 45, 48, 48, 64, 50, 51, 52, 88, 52,
  110. 53, 74, 55, 57, 58, 58, 74, 60, 101, 61, 62, 84, 66, 66, 68, 69,
  111. 87, 82, 71, 97, 73, 73, 82, 75, 111, 77, 94, 78, 87, 81, 83, 97,
  112. 85, 83, 94, 86, 99, 89, 90, 99, 111, 92, 93, 134, 95, 98, 105, 98,
  113. 105, 110, 102, 108, 102, 118, 103, 106, 106, 113, 109, 112, 114, 112, 116, 125,
  114. 115, 116, 117, 117, 126, 119, 125, 121, 121, 123, 145, 124, 126, 131, 127, 129,
  115. 165, 130, 132, 138, 133, 135, 145, 136, 137, 139, 146, 141, 143, 142, 144, 148,
  116. 147, 155, 151, 149, 151, 150, 152, 157, 153, 154, 156, 168, 158, 162, 161, 160,
  117. 172, 163, 169, 164, 166, 184, 167, 170, 177, 174, 171, 173, 182, 176, 180, 178,
  118. 175, 189, 179, 181, 186, 183, 192, 185, 200, 187, 191, 188, 190, 197, 193, 196,
  119. 197, 194, 195, 196, 198, 202, 199, 201, 210, 203, 207, 204, 205, 206, 208, 214,
  120. 209, 211, 221, 212, 213, 215, 224, 216, 217, 218, 219, 220, 222, 228, 223, 225,
  121. 226, 224, 227, 229, 240, 230, 231, 232, 233, 234, 235, 236, 238, 239, 237, 242,
  122. 241, 243, 242, 244, 245, 246, 247, 248, 249, 250, 251, 252, 252, 253, 254, 255,
  123. };
  124. av_cold int ffv1_common_init(AVCodecContext *avctx)
  125. {
  126. FFV1Context *s = avctx->priv_data;
  127. s->avctx = avctx;
  128. s->flags = avctx->flags;
  129. if (!avctx->width || !avctx->height)
  130. return AVERROR_INVALIDDATA;
  131. s->width = avctx->width;
  132. s->height = avctx->height;
  133. // defaults
  134. s->num_h_slices = 1;
  135. s->num_v_slices = 1;
  136. return 0;
  137. }
  138. int ffv1_init_slice_state(FFV1Context *f, FFV1Context *fs)
  139. {
  140. int j;
  141. fs->plane_count = f->plane_count;
  142. fs->transparency = f->transparency;
  143. for (j = 0; j < f->plane_count; j++) {
  144. PlaneContext *const p = &fs->plane[j];
  145. if (fs->ac != AC_GOLOMB_RICE) {
  146. if (!p->state)
  147. p->state = av_malloc(CONTEXT_SIZE * p->context_count *
  148. sizeof(uint8_t));
  149. if (!p->state)
  150. return AVERROR(ENOMEM);
  151. } else {
  152. if (!p->vlc_state)
  153. p->vlc_state = av_malloc(p->context_count * sizeof(VlcState));
  154. if (!p->vlc_state)
  155. return AVERROR(ENOMEM);
  156. }
  157. }
  158. if (fs->ac == AC_RANGE_CUSTOM_TAB) {
  159. //FIXME only redo if state_transition changed
  160. for (j = 1; j < 256; j++) {
  161. fs->c.one_state[j] = f->state_transition[j];
  162. fs->c.zero_state[256 - j] = 256 - fs->c.one_state[j];
  163. }
  164. }
  165. return 0;
  166. }
  167. av_cold int ffv1_init_slice_contexts(FFV1Context *f)
  168. {
  169. int i, j;
  170. f->slice_count = f->num_h_slices * f->num_v_slices;
  171. if (f->slice_count <= 0) {
  172. av_log(f->avctx, AV_LOG_ERROR, "Invalid number of slices\n");
  173. return AVERROR(EINVAL);
  174. }
  175. for (i = 0; i < f->slice_count; i++) {
  176. int sx = i % f->num_h_slices;
  177. int sy = i / f->num_h_slices;
  178. int sxs = f->avctx->width * sx / f->num_h_slices;
  179. int sxe = f->avctx->width * (sx + 1) / f->num_h_slices;
  180. int sys = f->avctx->height * sy / f->num_v_slices;
  181. int sye = f->avctx->height * (sy + 1) / f->num_v_slices;
  182. FFV1Context *fs = av_mallocz(sizeof(*fs));
  183. if (!fs)
  184. goto memfail;
  185. f->slice_context[i] = fs;
  186. memcpy(fs, f, sizeof(*fs));
  187. memset(fs->rc_stat2, 0, sizeof(fs->rc_stat2));
  188. fs->slice_width = sxe - sxs;
  189. fs->slice_height = sye - sys;
  190. fs->slice_x = sxs;
  191. fs->slice_y = sys;
  192. fs->sample_buffer = av_malloc(3 * MAX_PLANES * (fs->width + 6) *
  193. sizeof(*fs->sample_buffer));
  194. if (!fs->sample_buffer) {
  195. av_free(fs);
  196. goto memfail;
  197. }
  198. }
  199. return 0;
  200. memfail:
  201. for (j = 0; j < i; j++) {
  202. av_free(f->slice_context[j]->sample_buffer);
  203. av_free(f->slice_context[j]);
  204. }
  205. return AVERROR(ENOMEM);
  206. }
  207. int ffv1_allocate_initial_states(FFV1Context *f)
  208. {
  209. int i;
  210. for (i = 0; i < f->quant_table_count; i++) {
  211. f->initial_states[i] = av_malloc(f->context_count[i] *
  212. sizeof(*f->initial_states[i]));
  213. if (!f->initial_states[i])
  214. return AVERROR(ENOMEM);
  215. memset(f->initial_states[i], 128,
  216. f->context_count[i] * sizeof(*f->initial_states[i]));
  217. }
  218. return 0;
  219. }
  220. void ffv1_clear_slice_state(FFV1Context *f, FFV1Context *fs)
  221. {
  222. int i, j;
  223. for (i = 0; i < f->plane_count; i++) {
  224. PlaneContext *p = &fs->plane[i];
  225. p->interlace_bit_state[0] = 128;
  226. p->interlace_bit_state[1] = 128;
  227. if (fs->ac != AC_GOLOMB_RICE) {
  228. if (f->initial_states[p->quant_table_index]) {
  229. memcpy(p->state, f->initial_states[p->quant_table_index],
  230. CONTEXT_SIZE * p->context_count);
  231. } else
  232. memset(p->state, 128, CONTEXT_SIZE * p->context_count);
  233. } else {
  234. for (j = 0; j < p->context_count; j++) {
  235. p->vlc_state[j].drift = 0;
  236. p->vlc_state[j].error_sum = 4; //FFMAX((RANGE + 32)/64, 2);
  237. p->vlc_state[j].bias = 0;
  238. p->vlc_state[j].count = 1;
  239. }
  240. }
  241. }
  242. }
  243. av_cold int ffv1_close(AVCodecContext *avctx)
  244. {
  245. FFV1Context *s = avctx->priv_data;
  246. int i, j;
  247. for (j = 0; j < s->slice_count; j++) {
  248. FFV1Context *fs = s->slice_context[j];
  249. for (i = 0; i < s->plane_count; i++) {
  250. PlaneContext *p = &fs->plane[i];
  251. av_freep(&p->state);
  252. av_freep(&p->vlc_state);
  253. }
  254. av_freep(&fs->sample_buffer);
  255. }
  256. av_freep(&avctx->stats_out);
  257. for (j = 0; j < s->quant_table_count; j++) {
  258. av_freep(&s->initial_states[j]);
  259. for (i = 0; i < s->slice_count; i++) {
  260. FFV1Context *sf = s->slice_context[i];
  261. av_freep(&sf->rc_stat2[j]);
  262. }
  263. av_freep(&s->rc_stat2[j]);
  264. }
  265. for (i = 0; i < s->slice_count; i++)
  266. av_freep(&s->slice_context[i]);
  267. return 0;
  268. }