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.

1171 lines
43KB

  1. /*
  2. * FFV1 encoder
  3. *
  4. * Copyright (c) 2003-2012 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * This file is part of FFmpeg.
  7. *
  8. * FFmpeg 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. * FFmpeg 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 FFmpeg; 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) encoder
  25. */
  26. #include "libavutil/avassert.h"
  27. #include "libavutil/crc.h"
  28. #include "libavutil/opt.h"
  29. #include "libavutil/imgutils.h"
  30. #include "libavutil/pixdesc.h"
  31. #include "libavutil/timer.h"
  32. #include "avcodec.h"
  33. #include "internal.h"
  34. #include "put_bits.h"
  35. #include "rangecoder.h"
  36. #include "golomb.h"
  37. #include "mathops.h"
  38. #include "ffv1.h"
  39. static const int8_t quant5_10bit[256] = {
  40. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1,
  41. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  42. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  43. 1, 1, 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, 2,
  48. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  49. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  50. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  51. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  52. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -1,
  53. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  54. -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
  55. -1, -1, -1, -1, -1, -1, -0, -0, -0, -0, -0, -0, -0, -0, -0, -0,
  56. };
  57. static const int8_t quant5[256] = {
  58. 0, 1, 1, 1, 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, -2, -2, -2,
  69. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  70. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  71. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  72. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  73. -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2, -1, -1, -1,
  74. };
  75. static const int8_t quant9_10bit[256] = {
  76. 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2,
  77. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3,
  78. 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
  79. 3, 3, 3, 3, 3, 3, 3, 3, 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, 4, 4, 4, 4, 4, 4, 4,
  84. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  85. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  86. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  87. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  88. -4, -4, -4, -4, -4, -4, -4, -4, -4, -3, -3, -3, -3, -3, -3, -3,
  89. -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3, -3,
  90. -3, -3, -3, -3, -3, -3, -2, -2, -2, -2, -2, -2, -2, -2, -2, -2,
  91. -2, -2, -2, -2, -1, -1, -1, -1, -1, -1, -1, -1, -0, -0, -0, -0,
  92. };
  93. static const int8_t quant11[256] = {
  94. 0, 1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4,
  95. 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
  96. 4, 4, 4, 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, -5, -5,
  103. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  104. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  105. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  106. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5,
  107. -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -5, -4, -4,
  108. -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4, -4,
  109. -4, -4, -4, -4, -4, -3, -3, -3, -3, -3, -3, -3, -2, -2, -2, -1,
  110. };
  111. static const uint8_t ver2_state[256] = {
  112. 0, 10, 10, 10, 10, 16, 16, 16, 28, 16, 16, 29, 42, 49, 20, 49,
  113. 59, 25, 26, 26, 27, 31, 33, 33, 33, 34, 34, 37, 67, 38, 39, 39,
  114. 40, 40, 41, 79, 43, 44, 45, 45, 48, 48, 64, 50, 51, 52, 88, 52,
  115. 53, 74, 55, 57, 58, 58, 74, 60, 101, 61, 62, 84, 66, 66, 68, 69,
  116. 87, 82, 71, 97, 73, 73, 82, 75, 111, 77, 94, 78, 87, 81, 83, 97,
  117. 85, 83, 94, 86, 99, 89, 90, 99, 111, 92, 93, 134, 95, 98, 105, 98,
  118. 105, 110, 102, 108, 102, 118, 103, 106, 106, 113, 109, 112, 114, 112, 116, 125,
  119. 115, 116, 117, 117, 126, 119, 125, 121, 121, 123, 145, 124, 126, 131, 127, 129,
  120. 165, 130, 132, 138, 133, 135, 145, 136, 137, 139, 146, 141, 143, 142, 144, 148,
  121. 147, 155, 151, 149, 151, 150, 152, 157, 153, 154, 156, 168, 158, 162, 161, 160,
  122. 172, 163, 169, 164, 166, 184, 167, 170, 177, 174, 171, 173, 182, 176, 180, 178,
  123. 175, 189, 179, 181, 186, 183, 192, 185, 200, 187, 191, 188, 190, 197, 193, 196,
  124. 197, 194, 195, 196, 198, 202, 199, 201, 210, 203, 207, 204, 205, 206, 208, 214,
  125. 209, 211, 221, 212, 213, 215, 224, 216, 217, 218, 219, 220, 222, 228, 223, 225,
  126. 226, 224, 227, 229, 240, 230, 231, 232, 233, 234, 235, 236, 238, 239, 237, 242,
  127. 241, 243, 242, 244, 245, 246, 247, 248, 249, 250, 251, 252, 252, 253, 254, 255,
  128. };
  129. static void find_best_state(uint8_t best_state[256][256],
  130. const uint8_t one_state[256])
  131. {
  132. int i, j, k, m;
  133. double l2tab[256];
  134. for (i = 1; i < 256; i++)
  135. l2tab[i] = log2(i / 256.0);
  136. for (i = 0; i < 256; i++) {
  137. double best_len[256];
  138. double p = i / 256.0;
  139. for (j = 0; j < 256; j++)
  140. best_len[j] = 1 << 30;
  141. for (j = FFMAX(i - 10, 1); j < FFMIN(i + 11, 256); j++) {
  142. double occ[256] = { 0 };
  143. double len = 0;
  144. occ[j] = 1.0;
  145. for (k = 0; k < 256; k++) {
  146. double newocc[256] = { 0 };
  147. for (m = 1; m < 256; m++)
  148. if (occ[m]) {
  149. len -=occ[m]*( p *l2tab[ m]
  150. + (1-p)*l2tab[256-m]);
  151. }
  152. if (len < best_len[k]) {
  153. best_len[k] = len;
  154. best_state[i][k] = j;
  155. }
  156. for (m = 0; m < 256; m++)
  157. if (occ[m]) {
  158. newocc[ one_state[ m]] += occ[m] * p;
  159. newocc[256 - one_state[256 - m]] += occ[m] * (1 - p);
  160. }
  161. memcpy(occ, newocc, sizeof(occ));
  162. }
  163. }
  164. }
  165. }
  166. static av_always_inline av_flatten void put_symbol_inline(RangeCoder *c,
  167. uint8_t *state, int v,
  168. int is_signed,
  169. uint64_t rc_stat[256][2],
  170. uint64_t rc_stat2[32][2])
  171. {
  172. int i;
  173. #define put_rac(C, S, B) \
  174. do { \
  175. if (rc_stat) { \
  176. rc_stat[*(S)][B]++; \
  177. rc_stat2[(S) - state][B]++; \
  178. } \
  179. put_rac(C, S, B); \
  180. } while (0)
  181. if (v) {
  182. const int a = FFABS(v);
  183. const int e = av_log2(a);
  184. put_rac(c, state + 0, 0);
  185. if (e <= 9) {
  186. for (i = 0; i < e; i++)
  187. put_rac(c, state + 1 + i, 1); // 1..10
  188. put_rac(c, state + 1 + i, 0);
  189. for (i = e - 1; i >= 0; i--)
  190. put_rac(c, state + 22 + i, (a >> i) & 1); // 22..31
  191. if (is_signed)
  192. put_rac(c, state + 11 + e, v < 0); // 11..21
  193. } else {
  194. for (i = 0; i < e; i++)
  195. put_rac(c, state + 1 + FFMIN(i, 9), 1); // 1..10
  196. put_rac(c, state + 1 + 9, 0);
  197. for (i = e - 1; i >= 0; i--)
  198. put_rac(c, state + 22 + FFMIN(i, 9), (a >> i) & 1); // 22..31
  199. if (is_signed)
  200. put_rac(c, state + 11 + 10, v < 0); // 11..21
  201. }
  202. } else {
  203. put_rac(c, state + 0, 1);
  204. }
  205. #undef put_rac
  206. }
  207. static av_noinline void put_symbol(RangeCoder *c, uint8_t *state,
  208. int v, int is_signed)
  209. {
  210. put_symbol_inline(c, state, v, is_signed, NULL, NULL);
  211. }
  212. static inline void put_vlc_symbol(PutBitContext *pb, VlcState *const state,
  213. int v, int bits)
  214. {
  215. int i, k, code;
  216. v = fold(v - state->bias, bits);
  217. i = state->count;
  218. k = 0;
  219. while (i < state->error_sum) { // FIXME: optimize
  220. k++;
  221. i += i;
  222. }
  223. av_assert2(k <= 13);
  224. #if 0 // JPEG LS
  225. if (k == 0 && 2 * state->drift <= -state->count)
  226. code = v ^ (-1);
  227. else
  228. code = v;
  229. #else
  230. code = v ^ ((2 * state->drift + state->count) >> 31);
  231. #endif
  232. av_dlog(NULL, "v:%d/%d bias:%d error:%d drift:%d count:%d k:%d\n", v, code,
  233. state->bias, state->error_sum, state->drift, state->count, k);
  234. set_sr_golomb(pb, code, k, 12, bits);
  235. update_vlc_state(state, v);
  236. }
  237. static av_always_inline int encode_line(FFV1Context *s, int w,
  238. int16_t *sample[3],
  239. int plane_index, int bits)
  240. {
  241. PlaneContext *const p = &s->plane[plane_index];
  242. RangeCoder *const c = &s->c;
  243. int x;
  244. int run_index = s->run_index;
  245. int run_count = 0;
  246. int run_mode = 0;
  247. if (s->ac) {
  248. if (c->bytestream_end - c->bytestream < w * 20) {
  249. av_log(s->avctx, AV_LOG_ERROR, "encoded frame too large\n");
  250. return AVERROR_INVALIDDATA;
  251. }
  252. } else {
  253. if (s->pb.buf_end - s->pb.buf - (put_bits_count(&s->pb) >> 3) < w * 4) {
  254. av_log(s->avctx, AV_LOG_ERROR, "encoded frame too large\n");
  255. return AVERROR_INVALIDDATA;
  256. }
  257. }
  258. for (x = 0; x < w; x++) {
  259. int diff, context;
  260. context = get_context(p, sample[0] + x, sample[1] + x, sample[2] + x);
  261. diff = sample[0][x] - predict(sample[0] + x, sample[1] + x);
  262. if (context < 0) {
  263. context = -context;
  264. diff = -diff;
  265. }
  266. diff = fold(diff, bits);
  267. if (s->ac) {
  268. if (s->flags & CODEC_FLAG_PASS1) {
  269. put_symbol_inline(c, p->state[context], diff, 1, s->rc_stat,
  270. s->rc_stat2[p->quant_table_index][context]);
  271. } else {
  272. put_symbol_inline(c, p->state[context], diff, 1, NULL, NULL);
  273. }
  274. } else {
  275. if (context == 0)
  276. run_mode = 1;
  277. if (run_mode) {
  278. if (diff) {
  279. while (run_count >= 1 << ff_log2_run[run_index]) {
  280. run_count -= 1 << ff_log2_run[run_index];
  281. run_index++;
  282. put_bits(&s->pb, 1, 1);
  283. }
  284. put_bits(&s->pb, 1 + ff_log2_run[run_index], run_count);
  285. if (run_index)
  286. run_index--;
  287. run_count = 0;
  288. run_mode = 0;
  289. if (diff > 0)
  290. diff--;
  291. } else {
  292. run_count++;
  293. }
  294. }
  295. av_dlog(s->avctx, "count:%d index:%d, mode:%d, x:%d pos:%d\n",
  296. run_count, run_index, run_mode, x,
  297. (int)put_bits_count(&s->pb));
  298. if (run_mode == 0)
  299. put_vlc_symbol(&s->pb, &p->vlc_state[context], diff, bits);
  300. }
  301. }
  302. if (run_mode) {
  303. while (run_count >= 1 << ff_log2_run[run_index]) {
  304. run_count -= 1 << ff_log2_run[run_index];
  305. run_index++;
  306. put_bits(&s->pb, 1, 1);
  307. }
  308. if (run_count)
  309. put_bits(&s->pb, 1, 1);
  310. }
  311. s->run_index = run_index;
  312. return 0;
  313. }
  314. static void encode_plane(FFV1Context *s, uint8_t *src, int w, int h,
  315. int stride, int plane_index)
  316. {
  317. int x, y, i;
  318. const int ring_size = s->avctx->context_model ? 3 : 2;
  319. int16_t *sample[3];
  320. s->run_index = 0;
  321. memset(s->sample_buffer, 0, ring_size * (w + 6) * sizeof(*s->sample_buffer));
  322. for (y = 0; y < h; y++) {
  323. for (i = 0; i < ring_size; i++)
  324. sample[i] = s->sample_buffer + (w + 6) * ((h + i - y) % ring_size) + 3;
  325. sample[0][-1]= sample[1][0 ];
  326. sample[1][ w]= sample[1][w-1];
  327. // { START_TIMER
  328. if (s->bits_per_raw_sample <= 8) {
  329. for (x = 0; x < w; x++)
  330. sample[0][x] = src[x + stride * y];
  331. encode_line(s, w, sample, plane_index, 8);
  332. } else {
  333. if (s->packed_at_lsb) {
  334. for (x = 0; x < w; x++) {
  335. sample[0][x] = ((uint16_t*)(src + stride*y))[x];
  336. }
  337. } else {
  338. for (x = 0; x < w; x++) {
  339. sample[0][x] = ((uint16_t*)(src + stride*y))[x] >> (16 - s->bits_per_raw_sample);
  340. }
  341. }
  342. encode_line(s, w, sample, plane_index, s->bits_per_raw_sample);
  343. }
  344. // STOP_TIMER("encode line") }
  345. }
  346. }
  347. static void encode_rgb_frame(FFV1Context *s, uint8_t *src[3], int w, int h, int stride[3])
  348. {
  349. int x, y, p, i;
  350. const int ring_size = s->avctx->context_model ? 3 : 2;
  351. int16_t *sample[4][3];
  352. int lbd = s->bits_per_raw_sample <= 8;
  353. int bits = s->bits_per_raw_sample > 0 ? s->bits_per_raw_sample : 8;
  354. int offset = 1 << bits;
  355. s->run_index = 0;
  356. memset(s->sample_buffer, 0, ring_size * MAX_PLANES *
  357. (w + 6) * sizeof(*s->sample_buffer));
  358. for (y = 0; y < h; y++) {
  359. for (i = 0; i < ring_size; i++)
  360. for (p = 0; p < MAX_PLANES; p++)
  361. sample[p][i]= s->sample_buffer + p*ring_size*(w+6) + ((h+i-y)%ring_size)*(w+6) + 3;
  362. for (x = 0; x < w; x++) {
  363. int b, g, r, av_uninit(a);
  364. if (lbd) {
  365. unsigned v = *((uint32_t*)(src[0] + x*4 + stride[0]*y));
  366. b = v & 0xFF;
  367. g = (v >> 8) & 0xFF;
  368. r = (v >> 16) & 0xFF;
  369. a = v >> 24;
  370. } else {
  371. b = *((uint16_t*)(src[0] + x*2 + stride[0]*y));
  372. g = *((uint16_t*)(src[1] + x*2 + stride[1]*y));
  373. r = *((uint16_t*)(src[2] + x*2 + stride[2]*y));
  374. }
  375. b -= g;
  376. r -= g;
  377. g += (b + r) >> 2;
  378. b += offset;
  379. r += offset;
  380. sample[0][0][x] = g;
  381. sample[1][0][x] = b;
  382. sample[2][0][x] = r;
  383. sample[3][0][x] = a;
  384. }
  385. for (p = 0; p < 3 + s->transparency; p++) {
  386. sample[p][0][-1] = sample[p][1][0 ];
  387. sample[p][1][ w] = sample[p][1][w-1];
  388. if (lbd)
  389. encode_line(s, w, sample[p], (p + 1) / 2, 9);
  390. else
  391. encode_line(s, w, sample[p], (p + 1) / 2, bits + 1);
  392. }
  393. }
  394. }
  395. static void write_quant_table(RangeCoder *c, int16_t *quant_table)
  396. {
  397. int last = 0;
  398. int i;
  399. uint8_t state[CONTEXT_SIZE];
  400. memset(state, 128, sizeof(state));
  401. for (i = 1; i < 128; i++)
  402. if (quant_table[i] != quant_table[i - 1]) {
  403. put_symbol(c, state, i - last - 1, 0);
  404. last = i;
  405. }
  406. put_symbol(c, state, i - last - 1, 0);
  407. }
  408. static void write_quant_tables(RangeCoder *c,
  409. int16_t quant_table[MAX_CONTEXT_INPUTS][256])
  410. {
  411. int i;
  412. for (i = 0; i < 5; i++)
  413. write_quant_table(c, quant_table[i]);
  414. }
  415. static void write_header(FFV1Context *f)
  416. {
  417. uint8_t state[CONTEXT_SIZE];
  418. int i, j;
  419. RangeCoder *const c = &f->slice_context[0]->c;
  420. memset(state, 128, sizeof(state));
  421. if (f->version < 2) {
  422. put_symbol(c, state, f->version, 0);
  423. put_symbol(c, state, f->ac, 0);
  424. if (f->ac > 1) {
  425. for (i = 1; i < 256; i++)
  426. put_symbol(c, state,
  427. f->state_transition[i] - c->one_state[i], 1);
  428. }
  429. put_symbol(c, state, f->colorspace, 0); //YUV cs type
  430. if (f->version > 0)
  431. put_symbol(c, state, f->bits_per_raw_sample, 0);
  432. put_rac(c, state, f->chroma_planes);
  433. put_symbol(c, state, f->chroma_h_shift, 0);
  434. put_symbol(c, state, f->chroma_v_shift, 0);
  435. put_rac(c, state, f->transparency);
  436. write_quant_tables(c, f->quant_table);
  437. } else if (f->version < 3) {
  438. put_symbol(c, state, f->slice_count, 0);
  439. for (i = 0; i < f->slice_count; i++) {
  440. FFV1Context *fs = f->slice_context[i];
  441. put_symbol(c, state,
  442. (fs->slice_x + 1) * f->num_h_slices / f->width, 0);
  443. put_symbol(c, state,
  444. (fs->slice_y + 1) * f->num_v_slices / f->height, 0);
  445. put_symbol(c, state,
  446. (fs->slice_width + 1) * f->num_h_slices / f->width - 1,
  447. 0);
  448. put_symbol(c, state,
  449. (fs->slice_height + 1) * f->num_v_slices / f->height - 1,
  450. 0);
  451. for (j = 0; j < f->plane_count; j++) {
  452. put_symbol(c, state, f->plane[j].quant_table_index, 0);
  453. av_assert0(f->plane[j].quant_table_index == f->avctx->context_model);
  454. }
  455. }
  456. }
  457. }
  458. static int write_extradata(FFV1Context *f)
  459. {
  460. RangeCoder *const c = &f->c;
  461. uint8_t state[CONTEXT_SIZE];
  462. int i, j, k;
  463. uint8_t state2[32][CONTEXT_SIZE];
  464. unsigned v;
  465. memset(state2, 128, sizeof(state2));
  466. memset(state, 128, sizeof(state));
  467. f->avctx->extradata_size = 10000 + 4 +
  468. (11 * 11 * 5 * 5 * 5 + 11 * 11 * 11) * 32;
  469. f->avctx->extradata = av_malloc(f->avctx->extradata_size);
  470. ff_init_range_encoder(c, f->avctx->extradata, f->avctx->extradata_size);
  471. ff_build_rac_states(c, 0.05 * (1LL << 32), 256 - 8);
  472. put_symbol(c, state, f->version, 0);
  473. if (f->version > 2) {
  474. if (f->version == 3)
  475. f->minor_version = 3;
  476. put_symbol(c, state, f->minor_version, 0);
  477. }
  478. put_symbol(c, state, f->ac, 0);
  479. if (f->ac > 1)
  480. for (i = 1; i < 256; i++)
  481. put_symbol(c, state, f->state_transition[i] - c->one_state[i], 1);
  482. put_symbol(c, state, f->colorspace, 0); // YUV cs type
  483. put_symbol(c, state, f->bits_per_raw_sample, 0);
  484. put_rac(c, state, f->chroma_planes);
  485. put_symbol(c, state, f->chroma_h_shift, 0);
  486. put_symbol(c, state, f->chroma_v_shift, 0);
  487. put_rac(c, state, f->transparency);
  488. put_symbol(c, state, f->num_h_slices - 1, 0);
  489. put_symbol(c, state, f->num_v_slices - 1, 0);
  490. put_symbol(c, state, f->quant_table_count, 0);
  491. for (i = 0; i < f->quant_table_count; i++)
  492. write_quant_tables(c, f->quant_tables[i]);
  493. for (i = 0; i < f->quant_table_count; i++) {
  494. for (j = 0; j < f->context_count[i] * CONTEXT_SIZE; j++)
  495. if (f->initial_states[i] && f->initial_states[i][0][j] != 128)
  496. break;
  497. if (j < f->context_count[i] * CONTEXT_SIZE) {
  498. put_rac(c, state, 1);
  499. for (j = 0; j < f->context_count[i]; j++)
  500. for (k = 0; k < CONTEXT_SIZE; k++) {
  501. int pred = j ? f->initial_states[i][j - 1][k] : 128;
  502. put_symbol(c, state2[k],
  503. (int8_t)(f->initial_states[i][j][k] - pred), 1);
  504. }
  505. } else {
  506. put_rac(c, state, 0);
  507. }
  508. }
  509. if (f->version > 2) {
  510. put_symbol(c, state, f->ec, 0);
  511. put_symbol(c, state, f->intra = (f->avctx->gop_size < 2), 0);
  512. }
  513. f->avctx->extradata_size = ff_rac_terminate(c);
  514. v = av_crc(av_crc_get_table(AV_CRC_32_IEEE), 0, f->avctx->extradata, f->avctx->extradata_size);
  515. AV_WL32(f->avctx->extradata + f->avctx->extradata_size, v);
  516. f->avctx->extradata_size += 4;
  517. return 0;
  518. }
  519. static int sort_stt(FFV1Context *s, uint8_t stt[256])
  520. {
  521. int i, i2, changed, print = 0;
  522. do {
  523. changed = 0;
  524. for (i = 12; i < 244; i++) {
  525. for (i2 = i + 1; i2 < 245 && i2 < i + 4; i2++) {
  526. #define COST(old, new) \
  527. s->rc_stat[old][0] * -log2((256 - (new)) / 256.0) + \
  528. s->rc_stat[old][1] * -log2((new) / 256.0)
  529. #define COST2(old, new) \
  530. COST(old, new) + COST(256 - (old), 256 - (new))
  531. double size0 = COST2(i, i) + COST2(i2, i2);
  532. double sizeX = COST2(i, i2) + COST2(i2, i);
  533. if (size0 - sizeX > size0*(1e-14) && i != 128 && i2 != 128) {
  534. int j;
  535. FFSWAP(int, stt[i], stt[i2]);
  536. FFSWAP(int, s->rc_stat[i][0], s->rc_stat[i2][0]);
  537. FFSWAP(int, s->rc_stat[i][1], s->rc_stat[i2][1]);
  538. if (i != 256 - i2) {
  539. FFSWAP(int, stt[256 - i], stt[256 - i2]);
  540. FFSWAP(int, s->rc_stat[256 - i][0], s->rc_stat[256 - i2][0]);
  541. FFSWAP(int, s->rc_stat[256 - i][1], s->rc_stat[256 - i2][1]);
  542. }
  543. for (j = 1; j < 256; j++) {
  544. if (stt[j] == i)
  545. stt[j] = i2;
  546. else if (stt[j] == i2)
  547. stt[j] = i;
  548. if (i != 256 - i2) {
  549. if (stt[256 - j] == 256 - i)
  550. stt[256 - j] = 256 - i2;
  551. else if (stt[256 - j] == 256 - i2)
  552. stt[256 - j] = 256 - i;
  553. }
  554. }
  555. print = changed = 1;
  556. }
  557. }
  558. }
  559. } while (changed);
  560. return print;
  561. }
  562. static av_cold int encode_init(AVCodecContext *avctx)
  563. {
  564. FFV1Context *s = avctx->priv_data;
  565. const AVPixFmtDescriptor *desc = av_pix_fmt_desc_get(avctx->pix_fmt);
  566. int i, j, k, m, ret;
  567. ffv1_common_init(avctx);
  568. s->version = 0;
  569. if ((avctx->flags & (CODEC_FLAG_PASS1|CODEC_FLAG_PASS2)) || avctx->slices>1)
  570. s->version = FFMAX(s->version, 2);
  571. if (avctx->level == 3 || (s->version==2 && avctx->strict_std_compliance > FF_COMPLIANCE_EXPERIMENTAL)) {
  572. s->version = 3;
  573. }
  574. if (s->ec < 0) {
  575. s->ec = (s->version >= 3);
  576. }
  577. if (s->version >= 2 && avctx->strict_std_compliance > FF_COMPLIANCE_EXPERIMENTAL) {
  578. av_log(avctx, AV_LOG_ERROR, "Version 2 needed for requested features but version 2 is experimental and not enabled\n");
  579. return AVERROR_INVALIDDATA;
  580. }
  581. s->ac = avctx->coder_type > 0 ? 2 : 0;
  582. s->plane_count = 3;
  583. switch(avctx->pix_fmt) {
  584. case AV_PIX_FMT_YUV444P9:
  585. case AV_PIX_FMT_YUV422P9:
  586. case AV_PIX_FMT_YUV420P9:
  587. if (!avctx->bits_per_raw_sample)
  588. s->bits_per_raw_sample = 9;
  589. case AV_PIX_FMT_YUV444P10:
  590. case AV_PIX_FMT_YUV420P10:
  591. case AV_PIX_FMT_YUV422P10:
  592. s->packed_at_lsb = 1;
  593. if (!avctx->bits_per_raw_sample && !s->bits_per_raw_sample)
  594. s->bits_per_raw_sample = 10;
  595. case AV_PIX_FMT_GRAY16:
  596. case AV_PIX_FMT_YUV444P16:
  597. case AV_PIX_FMT_YUV422P16:
  598. case AV_PIX_FMT_YUV420P16:
  599. if (!avctx->bits_per_raw_sample && !s->bits_per_raw_sample) {
  600. s->bits_per_raw_sample = 16;
  601. } else if (!s->bits_per_raw_sample) {
  602. s->bits_per_raw_sample = avctx->bits_per_raw_sample;
  603. }
  604. if (s->bits_per_raw_sample <= 8) {
  605. av_log(avctx, AV_LOG_ERROR, "bits_per_raw_sample invalid\n");
  606. return AVERROR_INVALIDDATA;
  607. }
  608. if (!s->ac && avctx->coder_type == -1) {
  609. av_log(avctx, AV_LOG_INFO, "bits_per_raw_sample > 8, forcing coder 1\n");
  610. s->ac = 2;
  611. }
  612. if (!s->ac) {
  613. av_log(avctx, AV_LOG_ERROR, "bits_per_raw_sample of more than 8 needs -coder 1 currently\n");
  614. return AVERROR(ENOSYS);
  615. }
  616. s->version = FFMAX(s->version, 1);
  617. case AV_PIX_FMT_GRAY8:
  618. case AV_PIX_FMT_YUV444P:
  619. case AV_PIX_FMT_YUV440P:
  620. case AV_PIX_FMT_YUV422P:
  621. case AV_PIX_FMT_YUV420P:
  622. case AV_PIX_FMT_YUV411P:
  623. case AV_PIX_FMT_YUV410P:
  624. s->chroma_planes = desc->nb_components < 3 ? 0 : 1;
  625. s->colorspace = 0;
  626. break;
  627. case AV_PIX_FMT_YUVA444P:
  628. case AV_PIX_FMT_YUVA422P:
  629. case AV_PIX_FMT_YUVA420P:
  630. s->chroma_planes = 1;
  631. s->colorspace = 0;
  632. s->transparency = 1;
  633. break;
  634. case AV_PIX_FMT_RGB32:
  635. s->colorspace = 1;
  636. s->transparency = 1;
  637. break;
  638. case AV_PIX_FMT_0RGB32:
  639. s->colorspace = 1;
  640. break;
  641. case AV_PIX_FMT_GBRP9:
  642. if (!avctx->bits_per_raw_sample)
  643. s->bits_per_raw_sample = 9;
  644. case AV_PIX_FMT_GBRP10:
  645. if (!avctx->bits_per_raw_sample && !s->bits_per_raw_sample)
  646. s->bits_per_raw_sample = 10;
  647. case AV_PIX_FMT_GBRP12:
  648. if (!avctx->bits_per_raw_sample && !s->bits_per_raw_sample)
  649. s->bits_per_raw_sample = 12;
  650. case AV_PIX_FMT_GBRP14:
  651. if (!avctx->bits_per_raw_sample && !s->bits_per_raw_sample)
  652. s->bits_per_raw_sample = 14;
  653. else if (!s->bits_per_raw_sample)
  654. s->bits_per_raw_sample = avctx->bits_per_raw_sample;
  655. s->colorspace = 1;
  656. s->chroma_planes = 1;
  657. s->version = FFMAX(s->version, 1);
  658. break;
  659. default:
  660. av_log(avctx, AV_LOG_ERROR, "format not supported\n");
  661. return AVERROR(ENOSYS);
  662. }
  663. if (s->transparency) {
  664. av_log(avctx, AV_LOG_WARNING, "Storing alpha plane, this will require a recent FFV1 decoder to playback!\n");
  665. }
  666. if (avctx->context_model > 1U) {
  667. av_log(avctx, AV_LOG_ERROR, "Invalid context model %d, valid values are 0 and 1\n", avctx->context_model);
  668. return AVERROR(EINVAL);
  669. }
  670. if (s->ac > 1)
  671. for (i = 1; i < 256; i++)
  672. s->state_transition[i] = ver2_state[i];
  673. for (i = 0; i < 256; i++) {
  674. s->quant_table_count = 2;
  675. if (s->bits_per_raw_sample <= 8) {
  676. s->quant_tables[0][0][i]= quant11[i];
  677. s->quant_tables[0][1][i]= 11*quant11[i];
  678. s->quant_tables[0][2][i]= 11*11*quant11[i];
  679. s->quant_tables[1][0][i]= quant11[i];
  680. s->quant_tables[1][1][i]= 11*quant11[i];
  681. s->quant_tables[1][2][i]= 11*11*quant5 [i];
  682. s->quant_tables[1][3][i]= 5*11*11*quant5 [i];
  683. s->quant_tables[1][4][i]= 5*5*11*11*quant5 [i];
  684. } else {
  685. s->quant_tables[0][0][i]= quant9_10bit[i];
  686. s->quant_tables[0][1][i]= 11*quant9_10bit[i];
  687. s->quant_tables[0][2][i]= 11*11*quant9_10bit[i];
  688. s->quant_tables[1][0][i]= quant9_10bit[i];
  689. s->quant_tables[1][1][i]= 11*quant9_10bit[i];
  690. s->quant_tables[1][2][i]= 11*11*quant5_10bit[i];
  691. s->quant_tables[1][3][i]= 5*11*11*quant5_10bit[i];
  692. s->quant_tables[1][4][i]= 5*5*11*11*quant5_10bit[i];
  693. }
  694. }
  695. s->context_count[0] = (11 * 11 * 11 + 1) / 2;
  696. s->context_count[1] = (11 * 11 * 5 * 5 * 5 + 1) / 2;
  697. memcpy(s->quant_table, s->quant_tables[avctx->context_model],
  698. sizeof(s->quant_table));
  699. for (i = 0; i < s->plane_count; i++) {
  700. PlaneContext *const p = &s->plane[i];
  701. memcpy(p->quant_table, s->quant_table, sizeof(p->quant_table));
  702. p->quant_table_index = avctx->context_model;
  703. p->context_count = s->context_count[p->quant_table_index];
  704. }
  705. if ((ret = ffv1_allocate_initial_states(s)) < 0)
  706. return ret;
  707. avctx->coded_frame = &s->picture;
  708. if (!s->transparency)
  709. s->plane_count = 2;
  710. avcodec_get_chroma_sub_sample(avctx->pix_fmt, &s->chroma_h_shift, &s->chroma_v_shift);
  711. s->picture_number = 0;
  712. if (avctx->flags & (CODEC_FLAG_PASS1 | CODEC_FLAG_PASS2)) {
  713. for (i = 0; i < s->quant_table_count; i++) {
  714. s->rc_stat2[i] = av_mallocz(s->context_count[i] *
  715. sizeof(*s->rc_stat2[i]));
  716. if (!s->rc_stat2[i])
  717. return AVERROR(ENOMEM);
  718. }
  719. }
  720. if (avctx->stats_in) {
  721. char *p = avctx->stats_in;
  722. uint8_t best_state[256][256];
  723. int gob_count = 0;
  724. char *next;
  725. av_assert0(s->version >= 2);
  726. for (;;) {
  727. for (j = 0; j < 256; j++)
  728. for (i = 0; i < 2; i++) {
  729. s->rc_stat[j][i] = strtol(p, &next, 0);
  730. if (next == p) {
  731. av_log(avctx, AV_LOG_ERROR,
  732. "2Pass file invalid at %d %d [%s]\n", j, i, p);
  733. return AVERROR_INVALIDDATA;
  734. }
  735. p = next;
  736. }
  737. for (i = 0; i < s->quant_table_count; i++)
  738. for (j = 0; j < s->context_count[i]; j++) {
  739. for (k = 0; k < 32; k++)
  740. for (m = 0; m < 2; m++) {
  741. s->rc_stat2[i][j][k][m] = strtol(p, &next, 0);
  742. if (next == p) {
  743. av_log(avctx, AV_LOG_ERROR,
  744. "2Pass file invalid at %d %d %d %d [%s]\n",
  745. i, j, k, m, p);
  746. return AVERROR_INVALIDDATA;
  747. }
  748. p = next;
  749. }
  750. }
  751. gob_count = strtol(p, &next, 0);
  752. if (next == p || gob_count <= 0) {
  753. av_log(avctx, AV_LOG_ERROR, "2Pass file invalid\n");
  754. return AVERROR_INVALIDDATA;
  755. }
  756. p = next;
  757. while (*p == '\n' || *p == ' ')
  758. p++;
  759. if (p[0] == 0)
  760. break;
  761. }
  762. sort_stt(s, s->state_transition);
  763. find_best_state(best_state, s->state_transition);
  764. for (i = 0; i < s->quant_table_count; i++) {
  765. for (k = 0; k < 32; k++) {
  766. double a=0, b=0;
  767. int jp = 0;
  768. for (j = 0; j < s->context_count[i]; j++) {
  769. double p = 128;
  770. if (s->rc_stat2[i][j][k][0] + s->rc_stat2[i][j][k][1] > 200 && j || a+b > 200) {
  771. if (a+b)
  772. p = 256.0 * b / (a + b);
  773. s->initial_states[i][jp][k] =
  774. best_state[av_clip(round(p), 1, 255)][av_clip((a + b) / gob_count, 0, 255)];
  775. for(jp++; jp<j; jp++)
  776. s->initial_states[i][jp][k] = s->initial_states[i][jp-1][k];
  777. a=b=0;
  778. }
  779. a += s->rc_stat2[i][j][k][0];
  780. b += s->rc_stat2[i][j][k][1];
  781. if (a+b) {
  782. p = 256.0 * b / (a + b);
  783. }
  784. s->initial_states[i][j][k] =
  785. best_state[av_clip(round(p), 1, 255)][av_clip((a + b) / gob_count, 0, 255)];
  786. }
  787. }
  788. }
  789. }
  790. if (s->version > 1) {
  791. s->num_v_slices = (avctx->width > 352 || avctx->height > 288 || !avctx->slices) ? 2 : 1;
  792. for (; s->num_v_slices < 9; s->num_v_slices++) {
  793. for (s->num_h_slices = s->num_v_slices; s->num_h_slices < 2*s->num_v_slices; s->num_h_slices++) {
  794. if (avctx->slices == s->num_h_slices * s->num_v_slices && avctx->slices <= 64 || !avctx->slices)
  795. goto slices_ok;
  796. }
  797. }
  798. av_log(avctx, AV_LOG_ERROR,
  799. "Unsupported number %d of slices requested, please specify a "
  800. "supported number with -slices (ex:4,6,9,12,16, ...)\n",
  801. avctx->slices);
  802. return AVERROR(ENOSYS);
  803. slices_ok:
  804. write_extradata(s);
  805. }
  806. if ((ret = ffv1_init_slice_contexts(s)) < 0)
  807. return ret;
  808. if ((ret = ffv1_init_slices_state(s)) < 0)
  809. return ret;
  810. #define STATS_OUT_SIZE 1024 * 1024 * 6
  811. if (avctx->flags & CODEC_FLAG_PASS1) {
  812. avctx->stats_out = av_mallocz(STATS_OUT_SIZE);
  813. if (!avctx->stats_out)
  814. return AVERROR(ENOMEM);
  815. for (i = 0; i < s->quant_table_count; i++)
  816. for (j = 0; j < s->slice_count; j++) {
  817. FFV1Context *sf = s->slice_context[j];
  818. av_assert0(!sf->rc_stat2[i]);
  819. sf->rc_stat2[i] = av_mallocz(s->context_count[i] *
  820. sizeof(*sf->rc_stat2[i]));
  821. if (!sf->rc_stat2[i])
  822. return AVERROR(ENOMEM);
  823. }
  824. }
  825. return 0;
  826. }
  827. static void encode_slice_header(FFV1Context *f, FFV1Context *fs)
  828. {
  829. RangeCoder *c = &fs->c;
  830. uint8_t state[CONTEXT_SIZE];
  831. int j;
  832. memset(state, 128, sizeof(state));
  833. put_symbol(c, state, (fs->slice_x +1)*f->num_h_slices / f->width , 0);
  834. put_symbol(c, state, (fs->slice_y +1)*f->num_v_slices / f->height , 0);
  835. put_symbol(c, state, (fs->slice_width +1)*f->num_h_slices / f->width -1, 0);
  836. put_symbol(c, state, (fs->slice_height+1)*f->num_v_slices / f->height-1, 0);
  837. for (j=0; j<f->plane_count; j++) {
  838. put_symbol(c, state, f->plane[j].quant_table_index, 0);
  839. av_assert0(f->plane[j].quant_table_index == f->avctx->context_model);
  840. }
  841. if (!f->picture.interlaced_frame)
  842. put_symbol(c, state, 3, 0);
  843. else
  844. put_symbol(c, state, 1 + !f->picture.top_field_first, 0);
  845. put_symbol(c, state, f->picture.sample_aspect_ratio.num, 0);
  846. put_symbol(c, state, f->picture.sample_aspect_ratio.den, 0);
  847. }
  848. static int encode_slice(AVCodecContext *c, void *arg)
  849. {
  850. FFV1Context *fs = *(void **)arg;
  851. FFV1Context *f = fs->avctx->priv_data;
  852. int width = fs->slice_width;
  853. int height = fs->slice_height;
  854. int x = fs->slice_x;
  855. int y = fs->slice_y;
  856. AVFrame *const p = &f->picture;
  857. const int ps = av_pix_fmt_desc_get(c->pix_fmt)->comp[0].step_minus1 + 1;
  858. if (p->key_frame)
  859. ffv1_clear_slice_state(f, fs);
  860. if (f->version > 2) {
  861. encode_slice_header(f, fs);
  862. }
  863. if (!fs->ac) {
  864. if (f->version > 2)
  865. put_rac(&fs->c, (uint8_t[]) { 129 }, 0);
  866. fs->ac_byte_count = f->version > 2 || (!x && !y) ? ff_rac_terminate(&fs->c) : 0;
  867. init_put_bits(&fs->pb,
  868. fs->c.bytestream_start + fs->ac_byte_count,
  869. fs->c.bytestream_end - fs->c.bytestream_start - fs->ac_byte_count);
  870. }
  871. if (f->colorspace == 0) {
  872. const int chroma_width = -((-width) >> f->chroma_h_shift);
  873. const int chroma_height = -((-height) >> f->chroma_v_shift);
  874. const int cx = x >> f->chroma_h_shift;
  875. const int cy = y >> f->chroma_v_shift;
  876. encode_plane(fs, p->data[0] + ps*x + y*p->linesize[0], width, height, p->linesize[0], 0);
  877. if (f->chroma_planes) {
  878. encode_plane(fs, p->data[1] + ps*cx+cy*p->linesize[1], chroma_width, chroma_height, p->linesize[1], 1);
  879. encode_plane(fs, p->data[2] + ps*cx+cy*p->linesize[2], chroma_width, chroma_height, p->linesize[2], 1);
  880. }
  881. if (fs->transparency)
  882. encode_plane(fs, p->data[3] + ps*x + y*p->linesize[3], width, height, p->linesize[3], 2);
  883. } else {
  884. uint8_t *planes[3] = {p->data[0] + ps*x + y*p->linesize[0],
  885. p->data[1] + ps*x + y*p->linesize[1],
  886. p->data[2] + ps*x + y*p->linesize[2]};
  887. encode_rgb_frame(fs, planes, width, height, p->linesize);
  888. }
  889. emms_c();
  890. return 0;
  891. }
  892. static int encode_frame(AVCodecContext *avctx, AVPacket *pkt,
  893. const AVFrame *pict, int *got_packet)
  894. {
  895. FFV1Context *f = avctx->priv_data;
  896. RangeCoder *const c = &f->slice_context[0]->c;
  897. AVFrame *const p = &f->picture;
  898. int used_count = 0;
  899. uint8_t keystate = 128;
  900. uint8_t *buf_p;
  901. int i, ret;
  902. if ((ret = ff_alloc_packet2(avctx, pkt, avctx->width*avctx->height*((8*2+1+1)*4)/8
  903. + FF_MIN_BUFFER_SIZE)) < 0)
  904. return ret;
  905. ff_init_range_encoder(c, pkt->data, pkt->size);
  906. ff_build_rac_states(c, 0.05 * (1LL << 32), 256 - 8);
  907. *p = *pict;
  908. p->pict_type = AV_PICTURE_TYPE_I;
  909. if (avctx->gop_size == 0 || f->picture_number % avctx->gop_size == 0) {
  910. put_rac(c, &keystate, 1);
  911. p->key_frame = 1;
  912. f->gob_count++;
  913. write_header(f);
  914. } else {
  915. put_rac(c, &keystate, 0);
  916. p->key_frame = 0;
  917. }
  918. if (f->ac > 1) {
  919. int i;
  920. for (i = 1; i < 256; i++) {
  921. c->one_state[i] = f->state_transition[i];
  922. c->zero_state[256 - i] = 256 - c->one_state[i];
  923. }
  924. }
  925. for (i = 1; i < f->slice_count; i++) {
  926. FFV1Context *fs = f->slice_context[i];
  927. uint8_t *start = pkt->data + (pkt->size - used_count) * (int64_t)i / f->slice_count;
  928. int len = pkt->size / f->slice_count;
  929. ff_init_range_encoder(&fs->c, start, len);
  930. }
  931. avctx->execute(avctx, encode_slice, &f->slice_context[0], NULL,
  932. f->slice_count, sizeof(void *));
  933. buf_p = pkt->data;
  934. for (i = 0; i < f->slice_count; i++) {
  935. FFV1Context *fs = f->slice_context[i];
  936. int bytes;
  937. if (fs->ac) {
  938. uint8_t state = 129;
  939. put_rac(&fs->c, &state, 0);
  940. bytes = ff_rac_terminate(&fs->c);
  941. } else {
  942. flush_put_bits(&fs->pb); // FIXME: nicer padding
  943. bytes = fs->ac_byte_count + (put_bits_count(&fs->pb) + 7) / 8;
  944. }
  945. if (i > 0 || f->version > 2) {
  946. av_assert0(bytes < pkt->size / f->slice_count);
  947. memmove(buf_p, fs->c.bytestream_start, bytes);
  948. av_assert0(bytes < (1 << 24));
  949. AV_WB24(buf_p + bytes, bytes);
  950. bytes += 3;
  951. }
  952. if (f->ec) {
  953. unsigned v;
  954. buf_p[bytes++] = 0;
  955. v = av_crc(av_crc_get_table(AV_CRC_32_IEEE), 0, buf_p, bytes);
  956. AV_WL32(buf_p + bytes, v);
  957. bytes += 4;
  958. }
  959. buf_p += bytes;
  960. }
  961. if ((avctx->flags & CODEC_FLAG_PASS1) && (f->picture_number & 31) == 0) {
  962. int j, k, m;
  963. char *p = avctx->stats_out;
  964. char *end = p + STATS_OUT_SIZE;
  965. memset(f->rc_stat, 0, sizeof(f->rc_stat));
  966. for (i = 0; i < f->quant_table_count; i++)
  967. memset(f->rc_stat2[i], 0, f->context_count[i] * sizeof(*f->rc_stat2[i]));
  968. for (j = 0; j < f->slice_count; j++) {
  969. FFV1Context *fs = f->slice_context[j];
  970. for (i = 0; i < 256; i++) {
  971. f->rc_stat[i][0] += fs->rc_stat[i][0];
  972. f->rc_stat[i][1] += fs->rc_stat[i][1];
  973. }
  974. for (i = 0; i < f->quant_table_count; i++) {
  975. for (k = 0; k < f->context_count[i]; k++)
  976. for (m = 0; m < 32; m++) {
  977. f->rc_stat2[i][k][m][0] += fs->rc_stat2[i][k][m][0];
  978. f->rc_stat2[i][k][m][1] += fs->rc_stat2[i][k][m][1];
  979. }
  980. }
  981. }
  982. for (j = 0; j < 256; j++) {
  983. snprintf(p, end - p, "%" PRIu64 " %" PRIu64 " ",
  984. f->rc_stat[j][0], f->rc_stat[j][1]);
  985. p += strlen(p);
  986. }
  987. snprintf(p, end - p, "\n");
  988. for (i = 0; i < f->quant_table_count; i++) {
  989. for (j = 0; j < f->context_count[i]; j++)
  990. for (m = 0; m < 32; m++) {
  991. snprintf(p, end - p, "%" PRIu64 " %" PRIu64 " ",
  992. f->rc_stat2[i][j][m][0], f->rc_stat2[i][j][m][1]);
  993. p += strlen(p);
  994. }
  995. }
  996. snprintf(p, end - p, "%d\n", f->gob_count);
  997. } else if (avctx->flags & CODEC_FLAG_PASS1)
  998. avctx->stats_out[0] = '\0';
  999. f->picture_number++;
  1000. pkt->size = buf_p - pkt->data;
  1001. pkt->flags |= AV_PKT_FLAG_KEY * p->key_frame;
  1002. *got_packet = 1;
  1003. return 0;
  1004. }
  1005. #define OFFSET(x) offsetof(FFV1Context, x)
  1006. #define VE AV_OPT_FLAG_VIDEO_PARAM | AV_OPT_FLAG_ENCODING_PARAM
  1007. static const AVOption options[] = {
  1008. { "slicecrc", "Protect slices with CRCs", OFFSET(ec), AV_OPT_TYPE_INT, { .i64 = -1 }, -1, 1, VE },
  1009. { NULL }
  1010. };
  1011. static const AVClass class = {
  1012. .class_name = "ffv1 encoder",
  1013. .item_name = av_default_item_name,
  1014. .option = options,
  1015. .version = LIBAVUTIL_VERSION_INT,
  1016. };
  1017. static const AVCodecDefault ffv1_defaults[] = {
  1018. { "coder", "-1" },
  1019. { NULL },
  1020. };
  1021. AVCodec ff_ffv1_encoder = {
  1022. .name = "ffv1",
  1023. .type = AVMEDIA_TYPE_VIDEO,
  1024. .id = AV_CODEC_ID_FFV1,
  1025. .priv_data_size = sizeof(FFV1Context),
  1026. .init = encode_init,
  1027. .encode2 = encode_frame,
  1028. .close = ffv1_close,
  1029. .capabilities = CODEC_CAP_SLICE_THREADS,
  1030. .pix_fmts = (const enum AVPixelFormat[]) {
  1031. AV_PIX_FMT_YUV420P, AV_PIX_FMT_YUVA420P, AV_PIX_FMT_YUVA422P, AV_PIX_FMT_YUV444P,
  1032. AV_PIX_FMT_YUVA444P, AV_PIX_FMT_YUV440P, AV_PIX_FMT_YUV422P, AV_PIX_FMT_YUV411P,
  1033. AV_PIX_FMT_YUV410P, AV_PIX_FMT_0RGB32, AV_PIX_FMT_RGB32, AV_PIX_FMT_YUV420P16,
  1034. AV_PIX_FMT_YUV422P16, AV_PIX_FMT_YUV444P16, AV_PIX_FMT_YUV444P9, AV_PIX_FMT_YUV422P9,
  1035. AV_PIX_FMT_YUV420P9, AV_PIX_FMT_YUV420P10, AV_PIX_FMT_YUV422P10, AV_PIX_FMT_YUV444P10,
  1036. AV_PIX_FMT_GRAY16, AV_PIX_FMT_GRAY8, AV_PIX_FMT_GBRP9, AV_PIX_FMT_GBRP10,
  1037. AV_PIX_FMT_GBRP12, AV_PIX_FMT_GBRP14,
  1038. AV_PIX_FMT_NONE
  1039. },
  1040. .long_name = NULL_IF_CONFIG_SMALL("FFmpeg video codec #1"),
  1041. .defaults = ffv1_defaults,
  1042. .priv_class = &class,
  1043. };