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.

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