FFmpeg
magicyuvenc.c
Go to the documentation of this file.
1 /*
2  * MagicYUV encoder
3  * Copyright (c) 2017 Paul B Mahol
4  *
5  * This file is part of FFmpeg.
6  *
7  * FFmpeg is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU Lesser General Public
9  * License as published by the Free Software Foundation; either
10  * version 2.1 of the License, or (at your option) any later version.
11  *
12  * FFmpeg is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15  * Lesser General Public License for more details.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with FFmpeg; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 #include <stdlib.h>
23 #include <string.h>
24 
25 #include "libavutil/opt.h"
26 #include "libavutil/pixdesc.h"
27 #include "libavutil/qsort.h"
28 
29 #include "avcodec.h"
30 #include "bytestream.h"
31 #include "encode.h"
32 #include "put_bits.h"
33 #include "internal.h"
34 #include "thread.h"
35 #include "lossless_videoencdsp.h"
36 
37 #define MAGICYUV_EXTRADATA_SIZE 32
38 
39 typedef enum Prediction {
40  LEFT = 1,
43 } Prediction;
44 
45 typedef struct HuffEntry {
46  uint8_t len;
47  uint32_t code;
48 } HuffEntry;
49 
50 typedef struct PTable {
51  int value; ///< input value
52  int64_t prob; ///< number of occurences of this value in input
53 } PTable;
54 
55 typedef struct MagicYUVContext {
56  const AVClass *class;
59  int planes;
60  uint8_t format;
61  AVFrame *p;
62  int slice_height;
63  int nb_slices;
64  int correlate;
65  int hshift[4];
66  int vshift[4];
67  uint8_t *slices[4];
68  unsigned slice_pos[4];
69  unsigned tables_size;
70  HuffEntry he[4][256];
72  void (*predict)(struct MagicYUVContext *s, uint8_t *src, uint8_t *dst,
73  ptrdiff_t stride, int width, int height);
75 
77  uint8_t *src, uint8_t *dst, ptrdiff_t stride,
78  int width, int height)
79 {
80  uint8_t prev = 0;
81  int i, j;
82 
83  for (i = 0; i < width; i++) {
84  dst[i] = src[i] - prev;
85  prev = src[i];
86  }
87  dst += width;
88  src += stride;
89  for (j = 1; j < height; j++) {
90  prev = src[-stride];
91  for (i = 0; i < width; i++) {
92  dst[i] = src[i] - prev;
93  prev = src[i];
94  }
95  dst += width;
96  src += stride;
97  }
98 }
99 
101  uint8_t *src, uint8_t *dst, ptrdiff_t stride,
102  int width, int height)
103 {
104  int left = 0, top, lefttop;
105  int i, j;
106 
107  for (i = 0; i < width; i++) {
108  dst[i] = src[i] - left;
109  left = src[i];
110  }
111  dst += width;
112  src += stride;
113  for (j = 1; j < height; j++) {
114  top = src[-stride];
115  left = src[0] - top;
116  dst[0] = left;
117  for (i = 1; i < width; i++) {
118  top = src[i - stride];
119  lefttop = src[i - (stride + 1)];
120  left = src[i-1];
121  dst[i] = (src[i] - top) - left + lefttop;
122  }
123  dst += width;
124  src += stride;
125  }
126 }
127 
129  uint8_t *src, uint8_t *dst, ptrdiff_t stride,
130  int width, int height)
131 {
132  int left = 0, lefttop;
133  int i, j;
134 
135  for (i = 0; i < width; i++) {
136  dst[i] = src[i] - left;
137  left = src[i];
138  }
139  dst += width;
140  src += stride;
141  for (j = 1; j < height; j++) {
142  left = lefttop = src[-stride];
143  s->llvidencdsp.sub_median_pred(dst, src - stride, src, width, &left, &lefttop);
144  dst += width;
145  src += stride;
146  }
147 }
148 
150 {
151  MagicYUVContext *s = avctx->priv_data;
153  int i;
154 
155  switch (avctx->pix_fmt) {
156  case AV_PIX_FMT_GBRP:
157  avctx->codec_tag = MKTAG('M', '8', 'R', 'G');
158  s->correlate = 1;
159  s->format = 0x65;
160  break;
161  case AV_PIX_FMT_GBRAP:
162  avctx->codec_tag = MKTAG('M', '8', 'R', 'A');
163  s->correlate = 1;
164  s->format = 0x66;
165  break;
166  case AV_PIX_FMT_YUV420P:
167  avctx->codec_tag = MKTAG('M', '8', 'Y', '0');
168  s->hshift[1] =
169  s->vshift[1] =
170  s->hshift[2] =
171  s->vshift[2] = 1;
172  s->format = 0x69;
173  break;
174  case AV_PIX_FMT_YUV422P:
175  avctx->codec_tag = MKTAG('M', '8', 'Y', '2');
176  s->hshift[1] =
177  s->hshift[2] = 1;
178  s->format = 0x68;
179  break;
180  case AV_PIX_FMT_YUV444P:
181  avctx->codec_tag = MKTAG('M', '8', 'Y', '4');
182  s->format = 0x67;
183  break;
184  case AV_PIX_FMT_YUVA444P:
185  avctx->codec_tag = MKTAG('M', '8', 'Y', 'A');
186  s->format = 0x6a;
187  break;
188  case AV_PIX_FMT_GRAY8:
189  avctx->codec_tag = MKTAG('M', '8', 'G', '0');
190  s->format = 0x6b;
191  break;
192  }
193 
194  ff_llvidencdsp_init(&s->llvidencdsp);
195 
196  s->planes = av_pix_fmt_count_planes(avctx->pix_fmt);
197 
198  s->nb_slices = 1;
199 
200  for (i = 0; i < s->planes; i++) {
201  s->slices[i] = av_malloc(avctx->width * (avctx->height + 2) +
203  if (!s->slices[i]) {
204  av_log(avctx, AV_LOG_ERROR, "Cannot allocate temporary buffer.\n");
205  return AVERROR(ENOMEM);
206  }
207  }
208 
209  switch (s->frame_pred) {
210  case LEFT: s->predict = left_predict; break;
211  case GRADIENT: s->predict = gradient_predict; break;
212  case MEDIAN: s->predict = median_predict; break;
213  }
214 
216 
217  avctx->extradata = av_mallocz(avctx->extradata_size +
219 
220  if (!avctx->extradata) {
221  av_log(avctx, AV_LOG_ERROR, "Could not allocate extradata.\n");
222  return AVERROR(ENOMEM);
223  }
224 
226  bytestream2_put_le32(&pb, MKTAG('M', 'A', 'G', 'Y'));
227  bytestream2_put_le32(&pb, 32);
228  bytestream2_put_byte(&pb, 7);
229  bytestream2_put_byte(&pb, s->format);
230  bytestream2_put_byte(&pb, 12);
231  bytestream2_put_byte(&pb, 0);
232 
233  bytestream2_put_byte(&pb, 0);
234  bytestream2_put_byte(&pb, 0);
235  bytestream2_put_byte(&pb, 32);
236  bytestream2_put_byte(&pb, 0);
237 
238  bytestream2_put_le32(&pb, avctx->width);
239  bytestream2_put_le32(&pb, avctx->height);
240  bytestream2_put_le32(&pb, avctx->width);
241  bytestream2_put_le32(&pb, avctx->height);
242 
243  return 0;
244 }
245 
246 static void calculate_codes(HuffEntry *he, uint16_t codes_count[33])
247 {
248  for (unsigned i = 32, nb_codes = 0; i > 0; i--) {
249  uint16_t curr = codes_count[i]; // # of leafs of length i
250  codes_count[i] = nb_codes / 2; // # of non-leaf nodes on level i
251  nb_codes = codes_count[i] + curr; // # of nodes on level i
252  }
253 
254  for (unsigned i = 0; i < 256; i++) {
255  he[i].code = codes_count[he[i].len];
256  codes_count[he[i].len]++;
257  }
258 }
259 
260 static void count_usage(uint8_t *src, int width,
261  int height, PTable *counts)
262 {
263  int i, j;
264 
265  for (j = 0; j < height; j++) {
266  for (i = 0; i < width; i++) {
267  counts[src[i]].prob++;
268  }
269  src += width;
270  }
271 }
272 
273 typedef struct PackageMergerList {
274  int nitems; ///< number of items in the list and probability ex. 4
275  int item_idx[515]; ///< index range for each item in items 0, 2, 5, 9, 13
276  int probability[514]; ///< probability of each item 3, 8, 18, 46
277  int items[257 * 16]; ///< chain of all individual values that make up items A, B, A, B, C, A, B, C, D, C, D, D, E
279 
280 static int compare_by_prob(const void *a, const void *b)
281 {
282  const PTable *a2 = a;
283  const PTable *b2 = b;
284  return a2->prob - b2->prob;
285 }
286 
287 static void magy_huffman_compute_bits(PTable *prob_table, HuffEntry *distincts,
288  uint16_t codes_counts[33],
289  int size, int max_length)
290 {
291  PackageMergerList list_a, list_b, *to = &list_a, *from = &list_b, *temp;
292  int times, i, j, k;
293  int nbits[257] = {0};
294  int min;
295 
296  av_assert0(max_length > 0);
297 
298  to->nitems = 0;
299  from->nitems = 0;
300  to->item_idx[0] = 0;
301  from->item_idx[0] = 0;
302  AV_QSORT(prob_table, size, PTable, compare_by_prob);
303 
304  for (times = 0; times <= max_length; times++) {
305  to->nitems = 0;
306  to->item_idx[0] = 0;
307 
308  j = 0;
309  k = 0;
310 
311  if (times < max_length) {
312  i = 0;
313  }
314  while (i < size || j + 1 < from->nitems) {
315  to->nitems++;
316  to->item_idx[to->nitems] = to->item_idx[to->nitems - 1];
317  if (i < size &&
318  (j + 1 >= from->nitems ||
319  prob_table[i].prob <
320  from->probability[j] + from->probability[j + 1])) {
321  to->items[to->item_idx[to->nitems]++] = prob_table[i].value;
322  to->probability[to->nitems - 1] = prob_table[i].prob;
323  i++;
324  } else {
325  for (k = from->item_idx[j]; k < from->item_idx[j + 2]; k++) {
326  to->items[to->item_idx[to->nitems]++] = from->items[k];
327  }
328  to->probability[to->nitems - 1] =
329  from->probability[j] + from->probability[j + 1];
330  j += 2;
331  }
332  }
333  temp = to;
334  to = from;
335  from = temp;
336  }
337 
338  min = (size - 1 < from->nitems) ? size - 1 : from->nitems;
339  for (i = 0; i < from->item_idx[min]; i++) {
340  nbits[from->items[i]]++;
341  }
342 
343  for (i = 0; i < size; i++) {
344  distincts[i].len = nbits[i];
345  codes_counts[nbits[i]]++;
346  }
347 }
348 
349 static int encode_table(AVCodecContext *avctx, uint8_t *dst,
350  int width, int height,
351  PutBitContext *pb, HuffEntry *he)
352 {
353  PTable counts[256] = { {0} };
354  uint16_t codes_counts[33] = { 0 };
355  int i;
356 
357  count_usage(dst, width, height, counts);
358 
359  for (i = 0; i < 256; i++) {
360  counts[i].prob++;
361  counts[i].value = i;
362  }
363 
364  magy_huffman_compute_bits(counts, he, codes_counts, 256, 12);
365 
366  calculate_codes(he, codes_counts);
367 
368  for (i = 0; i < 256; i++) {
369  put_bits(pb, 1, 0);
370  put_bits(pb, 7, he[i].len);
371  }
372 
373  return 0;
374 }
375 
376 static int encode_slice(uint8_t *src, uint8_t *dst, int dst_size,
377  int width, int height, HuffEntry *he, int prediction)
378 {
379  PutBitContext pb;
380  int i, j;
381  int count;
382 
383  init_put_bits(&pb, dst, dst_size);
384 
385  put_bits(&pb, 8, 0);
386  put_bits(&pb, 8, prediction);
387 
388  for (j = 0; j < height; j++) {
389  for (i = 0; i < width; i++) {
390  const int idx = src[i];
391  put_bits(&pb, he[idx].len, he[idx].code);
392  }
393 
394  src += width;
395  }
396 
397  count = put_bits_count(&pb) & 0x1F;
398 
399  if (count)
400  put_bits(&pb, 32 - count, 0);
401 
402  flush_put_bits(&pb);
403 
404  return put_bytes_output(&pb);
405 }
406 
408  const AVFrame *frame, int *got_packet)
409 {
410  MagicYUVContext *s = avctx->priv_data;
411  PutByteContext pb;
412  const int width = avctx->width, height = avctx->height;
413  int pos, slice, i, j, ret = 0;
414 
415  ret = ff_alloc_packet(avctx, pkt, (256 + 4 * s->nb_slices + width * height) *
416  s->planes + 256);
417  if (ret < 0)
418  return ret;
419 
421  bytestream2_put_le32(&pb, MKTAG('M', 'A', 'G', 'Y'));
422  bytestream2_put_le32(&pb, 32); // header size
423  bytestream2_put_byte(&pb, 7); // version
424  bytestream2_put_byte(&pb, s->format);
425  bytestream2_put_byte(&pb, 12); // max huffman length
426  bytestream2_put_byte(&pb, 0);
427 
428  bytestream2_put_byte(&pb, 0);
429  bytestream2_put_byte(&pb, 0);
430  bytestream2_put_byte(&pb, 32); // coder type
431  bytestream2_put_byte(&pb, 0);
432 
433  bytestream2_put_le32(&pb, avctx->width);
434  bytestream2_put_le32(&pb, avctx->height);
435  bytestream2_put_le32(&pb, avctx->width);
436  bytestream2_put_le32(&pb, avctx->height);
437  bytestream2_put_le32(&pb, 0);
438 
439  for (i = 0; i < s->planes; i++) {
440  bytestream2_put_le32(&pb, 0);
441  for (j = 1; j < s->nb_slices; j++) {
442  bytestream2_put_le32(&pb, 0);
443  }
444  }
445 
446  bytestream2_put_byte(&pb, s->planes);
447 
448  for (i = 0; i < s->planes; i++) {
449  for (slice = 0; slice < s->nb_slices; slice++) {
450  bytestream2_put_byte(&pb, i);
451  }
452  }
453 
454  if (s->correlate) {
455  uint8_t *r, *g, *b;
457 
458  g = p->data[0];
459  b = p->data[1];
460  r = p->data[2];
461 
462  for (i = 0; i < height; i++) {
463  s->llvidencdsp.diff_bytes(b, b, g, width);
464  s->llvidencdsp.diff_bytes(r, r, g, width);
465  g += p->linesize[0];
466  b += p->linesize[1];
467  r += p->linesize[2];
468  }
469 
470  FFSWAP(uint8_t*, p->data[0], p->data[1]);
471  FFSWAP(int, p->linesize[0], p->linesize[1]);
472 
473  for (i = 0; i < s->planes; i++) {
474  for (slice = 0; slice < s->nb_slices; slice++) {
475  s->predict(s, p->data[i], s->slices[i], p->linesize[i],
476  p->width, p->height);
477  }
478  }
479 
480  av_frame_free(&p);
481  } else {
482  for (i = 0; i < s->planes; i++) {
483  for (slice = 0; slice < s->nb_slices; slice++) {
484  s->predict(s, frame->data[i], s->slices[i], frame->linesize[i],
485  AV_CEIL_RSHIFT(frame->width, s->hshift[i]),
486  AV_CEIL_RSHIFT(frame->height, s->vshift[i]));
487  }
488  }
489  }
490 
492 
493  for (i = 0; i < s->planes; i++) {
494  encode_table(avctx, s->slices[i],
495  AV_CEIL_RSHIFT(frame->width, s->hshift[i]),
496  AV_CEIL_RSHIFT(frame->height, s->vshift[i]),
497  &s->pb, s->he[i]);
498  }
499  s->tables_size = put_bytes_count(&s->pb, 1);
500  bytestream2_skip_p(&pb, s->tables_size);
501 
502  for (i = 0; i < s->planes; i++) {
503  unsigned slice_size;
504 
505  s->slice_pos[i] = bytestream2_tell_p(&pb);
506  slice_size = encode_slice(s->slices[i], pkt->data + bytestream2_tell_p(&pb),
508  AV_CEIL_RSHIFT(frame->width, s->hshift[i]),
509  AV_CEIL_RSHIFT(frame->height, s->vshift[i]),
510  s->he[i], s->frame_pred);
511  bytestream2_skip_p(&pb, slice_size);
512  }
513 
514  pos = bytestream2_tell_p(&pb);
515  bytestream2_seek_p(&pb, 32, SEEK_SET);
516  bytestream2_put_le32(&pb, s->slice_pos[0] - 32);
517  for (i = 0; i < s->planes; i++) {
518  bytestream2_put_le32(&pb, s->slice_pos[i] - 32);
519  }
520  bytestream2_seek_p(&pb, pos, SEEK_SET);
521 
522  pkt->size = bytestream2_tell_p(&pb);
523 
524  *got_packet = 1;
525 
526  return 0;
527 }
528 
530 {
531  MagicYUVContext *s = avctx->priv_data;
532  int i;
533 
534  for (i = 0; i < s->planes; i++)
535  av_freep(&s->slices[i]);
536 
537  return 0;
538 }
539 
540 #define OFFSET(x) offsetof(MagicYUVContext, x)
541 #define VE AV_OPT_FLAG_VIDEO_PARAM | AV_OPT_FLAG_ENCODING_PARAM
542 static const AVOption options[] = {
543  { "pred", "Prediction method", OFFSET(frame_pred), AV_OPT_TYPE_INT, {.i64=LEFT}, LEFT, MEDIAN, VE, "pred" },
544  { "left", NULL, 0, AV_OPT_TYPE_CONST, { .i64 = LEFT }, 0, 0, VE, "pred" },
545  { "gradient", NULL, 0, AV_OPT_TYPE_CONST, { .i64 = GRADIENT }, 0, 0, VE, "pred" },
546  { "median", NULL, 0, AV_OPT_TYPE_CONST, { .i64 = MEDIAN }, 0, 0, VE, "pred" },
547  { NULL},
548 };
549 
550 static const AVClass magicyuv_class = {
551  .class_name = "magicyuv",
552  .item_name = av_default_item_name,
553  .option = options,
554  .version = LIBAVUTIL_VERSION_INT,
555 };
556 
558  .name = "magicyuv",
559  .long_name = NULL_IF_CONFIG_SMALL("MagicYUV video"),
560  .type = AVMEDIA_TYPE_VIDEO,
561  .id = AV_CODEC_ID_MAGICYUV,
562  .priv_data_size = sizeof(MagicYUVContext),
563  .priv_class = &magicyuv_class,
565  .close = magy_encode_close,
566  .encode2 = magy_encode_frame,
567  .capabilities = AV_CODEC_CAP_FRAME_THREADS,
568  .pix_fmts = (const enum AVPixelFormat[]) {
572  },
574 };
AVCodec
AVCodec.
Definition: codec.h:202
GRADIENT
@ GRADIENT
Definition: magicyuvenc.c:41
stride
int stride
Definition: mace.c:144
MagicYUVContext::slices
Slice * slices[4]
Definition: magicyuv.c:67
FF_CODEC_CAP_INIT_THREADSAFE
#define FF_CODEC_CAP_INIT_THREADSAFE
The codec does not modify any global variables in the init function, allowing to call the init functi...
Definition: internal.h:42
VE
#define VE
Definition: magicyuvenc.c:541
gradient_predict
static void gradient_predict(MagicYUVContext *s, uint8_t *src, uint8_t *dst, ptrdiff_t stride, int width, int height)
Definition: magicyuvenc.c:100
AVPixelFormat
AVPixelFormat
Pixel format.
Definition: pixfmt.h:64
init
static av_cold int init(AVCodecContext *avctx)
Definition: avrndec.c:31
r
const char * r
Definition: vf_curves.c:116
AVERROR
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining all references to the list are updated That means that if a filter requires that its input and output have the same format amongst a supported all it has to do is use a reference to the same list of formats query_formats can leave some formats unset and return AVERROR(EAGAIN) to cause the negotiation mechanism toagain later. That can be used by filters with complex requirements to use the format negotiated on one link to set the formats supported on another. Frame references ownership and permissions
opt.h
left_predict
static void left_predict(MagicYUVContext *s, uint8_t *src, uint8_t *dst, ptrdiff_t stride, int width, int height)
Definition: magicyuvenc.c:76
Prediction
Definition: aptx.h:72
put_bytes_output
static int put_bytes_output(const PutBitContext *s)
Definition: put_bits.h:88
ff_magicyuv_encoder
const AVCodec ff_magicyuv_encoder
Definition: magicyuvenc.c:557
HuffEntry::len
uint8_t len
Definition: exr.c:94
MagicYUVContext::nb_slices
int nb_slices
Definition: magicyuv.c:58
compare_by_prob
static int compare_by_prob(const void *a, const void *b)
Definition: magicyuvenc.c:280
MagicYUVContext::hshift
int hshift[4]
Definition: magicyuv.c:65
init_put_bits
static void init_put_bits(PutBitContext *s, uint8_t *buffer, int buffer_size)
Initialize the PutBitContext s.
Definition: put_bits.h:61
av_frame_free
void av_frame_free(AVFrame **frame)
Free the frame and any dynamically allocated objects in it, e.g.
Definition: frame.c:112
MagicYUVContext::predict
void(* predict)(struct MagicYUVContext *s, uint8_t *src, uint8_t *dst, ptrdiff_t stride, int width, int height)
Definition: magicyuvenc.c:72
MagicYUVContext::he
HuffEntry he[4][256]
Definition: magicyuvenc.c:70
AVFrame
This structure describes decoded (raw) audio or video data.
Definition: frame.h:303
put_bits
static void put_bits(Jpeg2000EncoderContext *s, int val, int n)
put n times val bit
Definition: j2kenc.c:220
pixdesc.h
AVFrame::width
int width
Definition: frame.h:361
internal.h
AVPacket::data
uint8_t * data
Definition: packet.h:373
AVOption
AVOption.
Definition: opt.h:247
encode.h
b
#define b
Definition: input.c:40
put_bytes_count
static int put_bytes_count(const PutBitContext *s, int round_up)
Definition: put_bits.h:99
PackageMergerList::item_idx
int item_idx[515]
index range for each item in items 0, 2, 5, 9, 13
Definition: magicyuvenc.c:275
bytestream2_tell_p
static av_always_inline int bytestream2_tell_p(PutByteContext *p)
Definition: bytestream.h:197
count_usage
static void count_usage(uint8_t *src, int width, int height, PTable *counts)
Definition: magicyuvenc.c:260
MagicYUVContext::slice_pos
unsigned slice_pos[4]
Definition: magicyuvenc.c:68
thread.h
MagicYUVContext::pb
PutBitContext pb
Definition: magicyuvenc.c:58
AVFrame::data
uint8_t * data[AV_NUM_DATA_POINTERS]
pointer to the picture/channel planes.
Definition: frame.h:317
av_malloc
#define av_malloc(s)
Definition: tableprint_vlc.h:31
MagicYUVContext
Definition: magicyuv.c:53
encode_table
static int encode_table(AVCodecContext *avctx, uint8_t *dst, int width, int height, PutBitContext *pb, HuffEntry *he)
Definition: magicyuvenc.c:349
av_pix_fmt_count_planes
int av_pix_fmt_count_planes(enum AVPixelFormat pix_fmt)
Definition: pixdesc.c:2604
MagicYUVContext::llvidencdsp
LLVidEncDSPContext llvidencdsp
Definition: magicyuvenc.c:71
AV_PIX_FMT_GBRAP
@ AV_PIX_FMT_GBRAP
planar GBRA 4:4:4:4 32bpp
Definition: pixfmt.h:205
magy_encode_frame
static int magy_encode_frame(AVCodecContext *avctx, AVPacket *pkt, const AVFrame *frame, int *got_packet)
Definition: magicyuvenc.c:407
calculate_codes
static void calculate_codes(HuffEntry *he, uint16_t codes_count[33])
Definition: magicyuvenc.c:246
magicyuv_class
static const AVClass magicyuv_class
Definition: magicyuvenc.c:550
OFFSET
#define OFFSET(x)
Definition: magicyuvenc.c:540
pkt
AVPacket * pkt
Definition: movenc.c:59
AV_LOG_ERROR
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
Definition: log.h:180
bytestream2_get_bytes_left_p
static av_always_inline int bytestream2_get_bytes_left_p(PutByteContext *p)
Definition: bytestream.h:163
av_cold
#define av_cold
Definition: attributes.h:90
bytestream2_init_writer
static av_always_inline void bytestream2_init_writer(PutByteContext *p, uint8_t *buf, int buf_size)
Definition: bytestream.h:147
AVCodecContext::extradata_size
int extradata_size
Definition: avcodec.h:485
MEDIAN
@ MEDIAN
Definition: magicyuvenc.c:42
Prediction
Prediction
Definition: magicyuvenc.c:39
width
#define width
s
#define s(width, name)
Definition: cbs_vp9.c:257
AV_CEIL_RSHIFT
#define AV_CEIL_RSHIFT(a, b)
Definition: common.h:51
g
const char * g
Definition: vf_curves.c:117
MagicYUVContext::tables_size
unsigned tables_size
Definition: magicyuvenc.c:69
PackageMergerList::nitems
int nitems
number of items in the list and probability ex. 4
Definition: magicyuvenc.c:274
from
const char * from
Definition: jacosubdec.c:66
to
const char * to
Definition: webvttdec.c:35
av_assert0
#define av_assert0(cond)
assert() equivalent, that is always enabled.
Definition: avassert.h:37
pix_fmts
static enum AVPixelFormat pix_fmts[]
Definition: libkvazaar.c:290
av_frame_clone
AVFrame * av_frame_clone(const AVFrame *src)
Create a new frame that references the same data as src.
Definition: frame.c:424
AV_PIX_FMT_YUV420P
@ AV_PIX_FMT_YUV420P
planar YUV 4:2:0, 12bpp, (1 Cr & Cb sample per 2x2 Y samples)
Definition: pixfmt.h:66
PTable::prob
int64_t prob
number of occurences of this value in input
Definition: magicyuvenc.c:52
PutBitContext
Definition: put_bits.h:49
AV_CODEC_CAP_FRAME_THREADS
#define AV_CODEC_CAP_FRAME_THREADS
Codec supports frame-level multithreading.
Definition: codec.h:113
LIBAVUTIL_VERSION_INT
#define LIBAVUTIL_VERSION_INT
Definition: version.h:85
MagicYUVContext::vshift
int vshift[4]
Definition: magicyuv.c:66
AVClass
Describe the class of an AVClass context structure.
Definition: log.h:66
PTable
Used to assign a occurrence count or "probability" to an input value.
Definition: magicyuvenc.c:50
NULL
#define NULL
Definition: coverity.c:32
median_predict
static void median_predict(MagicYUVContext *s, uint8_t *src, uint8_t *dst, ptrdiff_t stride, int width, int height)
Definition: magicyuvenc.c:128
av_default_item_name
const char * av_default_item_name(void *ptr)
Return the context name.
Definition: log.c:235
src
#define src
Definition: vp8dsp.c:255
AV_PIX_FMT_GRAY8
@ AV_PIX_FMT_GRAY8
Y , 8bpp.
Definition: pixfmt.h:74
MagicYUVContext::correlate
int correlate
Definition: magicyuvenc.c:64
AV_CODEC_ID_MAGICYUV
@ AV_CODEC_ID_MAGICYUV
Definition: codec_id.h:269
ff_llvidencdsp_init
av_cold void ff_llvidencdsp_init(LLVidEncDSPContext *c)
Definition: lossless_videoencdsp.c:91
for
for(j=16;j >0;--j)
Definition: h264pred_template.c:469
PutByteContext
Definition: bytestream.h:37
qsort.h
PackageMergerList
Used to store intermediate lists in the package merge algorithm.
Definition: magicyuvenc.c:273
AVPacket::size
int size
Definition: packet.h:374
NULL_IF_CONFIG_SMALL
#define NULL_IF_CONFIG_SMALL(x)
Return NULL if CONFIG_SMALL is true, otherwise the argument without modification.
Definition: internal.h:117
options
static const AVOption options[]
Definition: magicyuvenc.c:542
size
int size
Definition: twinvq_data.h:10344
height
#define height
b2
static double b2(void *priv, double x, double y)
Definition: vf_xfade.c:1704
a
The reader does not expect b to be semantically here and if the code is changed by maybe adding a a division or other the signedness will almost certainly be mistaken To avoid this confusion a new type was SUINT is the C unsigned type but it holds a signed int to use the same example SUINT a
Definition: undefined.txt:41
AV_PIX_FMT_YUVA444P
@ AV_PIX_FMT_YUVA444P
planar YUV 4:4:4 32bpp, (1 Cr & Cb sample per 1x1 Y & A samples)
Definition: pixfmt.h:167
MagicYUVContext::slice_height
int slice_height
Definition: magicyuv.c:57
PTable::value
int value
input value
Definition: magicyuvenc.c:51
magy_encode_close
static av_cold int magy_encode_close(AVCodecContext *avctx)
Definition: magicyuvenc.c:529
lossless_videoencdsp.h
MagicYUVContext::frame_pred
int frame_pred
Definition: magicyuvenc.c:57
i
#define i(width, name, range_min, range_max)
Definition: cbs_h2645.c:271
code
and forward the test the status of outputs and forward it to the corresponding return FFERROR_NOT_READY If the filters stores internally one or a few frame for some it can consider them to be part of the FIFO and delay acknowledging a status change accordingly Example code
Definition: filter_design.txt:178
put_bits_count
static int put_bits_count(PutBitContext *s)
Definition: put_bits.h:79
AV_QSORT
#define AV_QSORT(p, num, type, cmp)
Quicksort This sort is fast, and fully inplace but not stable and it is possible to construct input t...
Definition: qsort.h:33
AVCodecContext::extradata
uint8_t * extradata
some codecs need / can use extradata like Huffman tables.
Definition: avcodec.h:484
FF_CODEC_CAP_INIT_CLEANUP
#define FF_CODEC_CAP_INIT_CLEANUP
The codec allows calling the close function for deallocation even if the init function returned a fai...
Definition: internal.h:50
bytestream2_skip_p
static av_always_inline void bytestream2_skip_p(PutByteContext *p, unsigned int size)
Definition: bytestream.h:180
a2
#define a2
Definition: regdef.h:48
av_mallocz
void * av_mallocz(size_t size)
Allocate a memory block with alignment suitable for all memory accesses (including vectors if availab...
Definition: mem.c:263
AVCodec::name
const char * name
Name of the codec implementation.
Definition: codec.h:209
PackageMergerList::items
int items[257 *16]
chain of all individual values that make up items A, B, A, B, C, A, B, C, D, C, D,...
Definition: magicyuvenc.c:277
len
int len
Definition: vorbis_enc_data.h:426
AVCodecContext::height
int height
Definition: avcodec.h:556
AVCodecContext::pix_fmt
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
Definition: avcodec.h:593
LLVidEncDSPContext
Definition: lossless_videoencdsp.h:25
LEFT
@ LEFT
Definition: magicyuvenc.c:40
avcodec.h
MAGICYUV_EXTRADATA_SIZE
#define MAGICYUV_EXTRADATA_SIZE
Definition: magicyuvenc.c:37
ret
ret
Definition: filter_design.txt:187
FFSWAP
#define FFSWAP(type, a, b)
Definition: macros.h:52
AVClass::class_name
const char * class_name
The name of the class; usually it is the same name as the context structure type to which the AVClass...
Definition: log.h:71
frame
these buffered frames must be flushed immediately if a new input produces new the filter must not call request_frame to get more It must just process the frame or queue it The task of requesting more frames is left to the filter s request_frame method or the application If a filter has several the filter must be ready for frames arriving randomly on any input any filter with several inputs will most likely require some kind of queuing mechanism It is perfectly acceptable to have a limited queue and to drop frames when the inputs are too unbalanced request_frame For filters that do not use the this method is called when a frame is wanted on an output For a it should directly call filter_frame on the corresponding output For a if there are queued frames already one of these frames should be pushed If the filter should request a frame on one of its repeatedly until at least one frame has been pushed Return or at least make progress towards producing a frame
Definition: filter_design.txt:264
pos
unsigned int pos
Definition: spdifenc.c:412
HuffEntry::code
uint32_t code
Definition: exr.c:96
AV_INPUT_BUFFER_PADDING_SIZE
#define AV_INPUT_BUFFER_PADDING_SIZE
Definition: defs.h:40
left
Tag MUST be and< 10hcoeff half pel interpolation filter coefficients, hcoeff[0] are the 2 middle coefficients[1] are the next outer ones and so on, resulting in a filter like:...eff[2], hcoeff[1], hcoeff[0], hcoeff[0], hcoeff[1], hcoeff[2] ... the sign of the coefficients is not explicitly stored but alternates after each coeff and coeff[0] is positive, so ...,+,-,+,-,+,+,-,+,-,+,... hcoeff[0] is not explicitly stored but found by subtracting the sum of all stored coefficients with signs from 32 hcoeff[0]=32 - hcoeff[1] - hcoeff[2] - ... a good choice for hcoeff and htaps is htaps=6 hcoeff={40,-10, 2} an alternative which requires more computations at both encoder and decoder side and may or may not be better is htaps=8 hcoeff={42,-14, 6,-2}ref_frames minimum of the number of available reference frames and max_ref_frames for example the first frame after a key frame always has ref_frames=1spatial_decomposition_type wavelet type 0 is a 9/7 symmetric compact integer wavelet 1 is a 5/3 symmetric compact integer wavelet others are reserved stored as delta from last, last is reset to 0 if always_reset||keyframeqlog quality(logarithmic quantizer scale) stored as delta from last, last is reset to 0 if always_reset||keyframemv_scale stored as delta from last, last is reset to 0 if always_reset||keyframe FIXME check that everything works fine if this changes between framesqbias dequantization bias stored as delta from last, last is reset to 0 if always_reset||keyframeblock_max_depth maximum depth of the block tree stored as delta from last, last is reset to 0 if always_reset||keyframequant_table quantization tableHighlevel bitstream structure:==============================--------------------------------------------|Header|--------------------------------------------|------------------------------------|||Block0||||split?||||yes no||||......... intra?||||:Block01 :yes no||||:Block02 :....... ..........||||:Block03 ::y DC ::ref index:||||:Block04 ::cb DC ::motion x :||||......... :cr DC ::motion y :||||....... ..........|||------------------------------------||------------------------------------|||Block1|||...|--------------------------------------------|------------ ------------ ------------|||Y subbands||Cb subbands||Cr subbands||||--- ---||--- ---||--- ---|||||LL0||HL0||||LL0||HL0||||LL0||HL0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||LH0||HH0||||LH0||HH0||||LH0||HH0|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HL1||LH1||||HL1||LH1||||HL1||LH1|||||--- ---||--- ---||--- ---||||--- ---||--- ---||--- ---|||||HH1||HL2||||HH1||HL2||||HH1||HL2|||||...||...||...|||------------ ------------ ------------|--------------------------------------------Decoding process:=================------------|||Subbands|------------||||------------|Intra DC||||LL0 subband prediction ------------|\ Dequantization ------------------- \||Reference frames|\ IDWT|------- -------|Motion \|||Frame 0||Frame 1||Compensation . OBMC v -------|------- -------|--------------. \------> Frame n output Frame Frame<----------------------------------/|...|------------------- Range Coder:============Binary Range Coder:------------------- The implemented range coder is an adapted version based upon "Range encoding: an algorithm for removing redundancy from a digitised message." by G. N. N. Martin. The symbols encoded by the Snow range coder are bits(0|1). The associated probabilities are not fix but change depending on the symbol mix seen so far. bit seen|new state ---------+----------------------------------------------- 0|256 - state_transition_table[256 - old_state];1|state_transition_table[old_state];state_transition_table={ 0, 0, 0, 0, 0, 0, 0, 0, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 190, 191, 192, 194, 194, 195, 196, 197, 198, 199, 200, 201, 202, 202, 204, 205, 206, 207, 208, 209, 209, 210, 211, 212, 213, 215, 215, 216, 217, 218, 219, 220, 220, 222, 223, 224, 225, 226, 227, 227, 229, 229, 230, 231, 232, 234, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 248, 0, 0, 0, 0, 0, 0, 0};FIXME Range Coding of integers:------------------------- FIXME Neighboring Blocks:===================left and top are set to the respective blocks unless they are outside of the image in which case they are set to the Null block top-left is set to the top left block unless it is outside of the image in which case it is set to the left block if this block has no larger parent block or it is at the left side of its parent block and the top right block is not outside of the image then the top right block is used for top-right else the top-left block is used Null block y, cb, cr are 128 level, ref, mx and my are 0 Motion Vector Prediction:=========================1. the motion vectors of all the neighboring blocks are scaled to compensate for the difference of reference frames scaled_mv=(mv *(256 *(current_reference+1)/(mv.reference+1))+128)> the median of the scaled left
Definition: snow.txt:386
AVCodecContext
main external API structure.
Definition: avcodec.h:383
AVFrame::height
int height
Definition: frame.h:361
magy_encode_init
static av_cold int magy_encode_init(AVCodecContext *avctx)
Definition: magicyuvenc.c:149
PackageMergerList::probability
int probability[514]
probability of each item 3, 8, 18, 46
Definition: magicyuvenc.c:276
AV_PIX_FMT_NONE
@ AV_PIX_FMT_NONE
Definition: pixfmt.h:65
bytestream2_seek_p
static av_always_inline int bytestream2_seek_p(PutByteContext *p, int offset, int whence)
Definition: bytestream.h:236
AV_OPT_TYPE_INT
@ AV_OPT_TYPE_INT
Definition: opt.h:224
HuffEntry
Definition: exr.c:93
temp
else temp
Definition: vf_mcdeint.c:248
AV_PIX_FMT_YUV444P
@ AV_PIX_FMT_YUV444P
planar YUV 4:4:4, 24bpp, (1 Cr & Cb sample per 1x1 Y samples)
Definition: pixfmt.h:71
AV_PIX_FMT_GBRP
@ AV_PIX_FMT_GBRP
planar GBR 4:4:4 24bpp
Definition: pixfmt.h:158
AVMEDIA_TYPE_VIDEO
@ AVMEDIA_TYPE_VIDEO
Definition: avutil.h:201
AV_PIX_FMT_YUV422P
@ AV_PIX_FMT_YUV422P
planar YUV 4:2:2, 16bpp, (1 Cr & Cb sample per 2x1 Y samples)
Definition: pixfmt.h:70
flush_put_bits
static void flush_put_bits(PutBitContext *s)
Pad the end of the output stream with zeros.
Definition: put_bits.h:142
AVCodecContext::codec_tag
unsigned int codec_tag
fourcc (LSB first, so "ABCD" -> ('D'<<24) + ('C'<<16) + ('B'<<8) + 'A').
Definition: avcodec.h:408
AVPacket
This structure stores compressed data.
Definition: packet.h:350
AVCodecContext::priv_data
void * priv_data
Definition: avcodec.h:410
MagicYUVContext::planes
int planes
Definition: magicyuv.c:59
av_freep
#define av_freep(p)
Definition: tableprint_vlc.h:35
MagicYUVContext::p
AVFrame * p
Definition: magicyuv.c:54
AVCodecContext::width
int width
picture width / height.
Definition: avcodec.h:556
bytestream.h
AVFrame::linesize
int linesize[AV_NUM_DATA_POINTERS]
For video, size in bytes of each picture line.
Definition: frame.h:334
av_log
#define av_log(a,...)
Definition: tableprint_vlc.h:28
MKTAG
#define MKTAG(a, b, c, d)
Definition: macros.h:55
put_bits.h
AV_OPT_TYPE_CONST
@ AV_OPT_TYPE_CONST
Definition: opt.h:233
ff_alloc_packet
int ff_alloc_packet(AVCodecContext *avctx, AVPacket *avpkt, int64_t size)
Check AVPacket size and allocate data.
Definition: encode.c:34
magy_huffman_compute_bits
static void magy_huffman_compute_bits(PTable *prob_table, HuffEntry *distincts, uint16_t codes_counts[33], int size, int max_length)
Definition: magicyuvenc.c:287
encode_slice
static int encode_slice(uint8_t *src, uint8_t *dst, int dst_size, int width, int height, HuffEntry *he, int prediction)
Definition: magicyuvenc.c:376
MagicYUVContext::format
uint8_t format
Definition: magicyuvenc.c:60
min
float min
Definition: vorbis_enc_data.h:429