FFmpeg
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Modules Pages
ffv1enc_template.c
Go to the documentation of this file.
1 /*
2  * FFV1 encoder template
3  *
4  * Copyright (c) 2003-2016 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 #include "ffv1_template.c"
24 
25 static av_always_inline int
27  void *logctx,
28  int w, TYPE *sample[3], int plane_index, int bits,
29  int ac, int pass1)
30 {
31  PlaneContext *const p = &sc->plane[plane_index];
32  RangeCoder *const c = &sc->c;
33  int x;
34  int run_index = sc->run_index;
35  int run_count = 0;
36  int run_mode = 0;
37 
38  if (bits == 0)
39  return 0;
40 
41  if (ac != AC_GOLOMB_RICE) {
42  if (c->bytestream_end - c->bytestream < w * 35) {
43  av_log(logctx, AV_LOG_ERROR, "encoded Range Coder frame too large\n");
44  return AVERROR_INVALIDDATA;
45  }
46  } else {
47  if (put_bytes_left(&sc->pb, 0) < w * 4) {
48  av_log(logctx, AV_LOG_ERROR, "encoded Golomb Rice frame too large\n");
49  return AVERROR_INVALIDDATA;
50  }
51  }
52 
53  if (sc->slice_coding_mode == 1) {
54  for (x = 0; x < w; x++) {
55  int i;
56  int v = sample[0][x];
57  for (i = bits-1; i>=0; i--) {
58  uint8_t state = 128;
59  put_rac(c, &state, (v>>i) & 1);
60  }
61  }
62  return 0;
63  }
64 
65  for (x = 0; x < w; x++) {
66  int diff, context;
67 
68  context = RENAME(get_context)(f->quant_tables[p->quant_table_index],
69  sample[0] + x, sample[1] + x, sample[2] + x);
70  diff = sample[0][x] - RENAME(predict)(sample[0] + x, sample[1] + x);
71 
72  if (context < 0) {
73  context = -context;
74  diff = -diff;
75  }
76 
77  diff = fold(diff, bits);
78 
79  if (ac != AC_GOLOMB_RICE) {
80  if (pass1) {
81  put_symbol_inline(c, p->state[context], diff, 1, sc->rc_stat,
82  sc->rc_stat2[p->quant_table_index][context]);
83  } else {
85  }
86  } else {
87  if (context == 0)
88  run_mode = 1;
89 
90  if (run_mode) {
91  if (diff) {
92  while (run_count >= 1 << ff_log2_run[run_index]) {
93  run_count -= 1 << ff_log2_run[run_index];
94  run_index++;
95  put_bits(&sc->pb, 1, 1);
96  }
97 
98  put_bits(&sc->pb, 1 + ff_log2_run[run_index], run_count);
99  if (run_index)
100  run_index--;
101  run_count = 0;
102  run_mode = 0;
103  if (diff > 0)
104  diff--;
105  } else {
106  run_count++;
107  }
108  }
109 
110  ff_dlog(logctx, "count:%d index:%d, mode:%d, x:%d pos:%d\n",
111  run_count, run_index, run_mode, x,
112  (int)put_bits_count(&sc->pb));
113 
114  if (run_mode == 0)
115  put_vlc_symbol(&sc->pb, &p->vlc_state[context], diff, bits);
116  }
117  }
118  if (run_mode) {
119  while (run_count >= 1 << ff_log2_run[run_index]) {
120  run_count -= 1 << ff_log2_run[run_index];
121  run_index++;
122  put_bits(&sc->pb, 1, 1);
123  }
124 
125  if (run_count)
126  put_bits(&sc->pb, 1, 1);
127  }
128  sc->run_index = run_index;
129 
130  return 0;
131 }
132 
134  const uint8_t *src[4],
135  int w, int h, const int stride[4])
136 {
137  int x, y;
138  int transparency = f->transparency;
139 
140  for (int p = 0; p<3 + transparency; p++)
141  memset(sc->fltmap[p], 0, 65536 * sizeof(**sc->fltmap));
142 
143  for (y = 0; y < h; y++) {
144  for (x = 0; x < w; x++) {
145  int b, g, r, av_uninit(a);
146 
147  if (sizeof(TYPE) == 4 || transparency) {
148  g = *((const uint16_t *)(src[0] + x*2 + stride[0]*y));
149  b = *((const uint16_t *)(src[1] + x*2 + stride[1]*y));
150  r = *((const uint16_t *)(src[2] + x*2 + stride[2]*y));
151  if (transparency)
152  a = *((const uint16_t *)(src[3] + x*2 + stride[3]*y));
153  } else {
154  b = *((const uint16_t *)(src[0] + x*2 + stride[0]*y));
155  g = *((const uint16_t *)(src[1] + x*2 + stride[1]*y));
156  r = *((const uint16_t *)(src[2] + x*2 + stride[2]*y));
157  }
158 
159  sc->fltmap[0][g] = 1;
160  sc->fltmap[1][b] = 1;
161  sc->fltmap[2][r] = 1;
162  if (transparency)
163  sc->fltmap[3][a] = 1;
164  }
165  }
166 }
167 
169  const uint8_t *src[4],
170  int w, int h, const int stride[4], int ac)
171 {
172  int x, y, p, i;
173  const int ring_size = f->context_model ? 3 : 2;
174  TYPE *sample[4][3];
175  const int pass1 = !!(f->avctx->flags & AV_CODEC_FLAG_PASS1);
176  int lbd = f->bits_per_raw_sample <= 8;
177  int packed = !src[1];
178  int bits[4], offset;
179  int transparency = f->transparency;
180  int packed_size = (3 + transparency)*2;
181 
182  ff_ffv1_compute_bits_per_plane(f, sc, bits, &offset, NULL, f->bits_per_raw_sample);
183 
184  sc->run_index = 0;
185 
186  memset(RENAME(sc->sample_buffer), 0, ring_size * MAX_PLANES *
187  (w + 6) * sizeof(*RENAME(sc->sample_buffer)));
188 
189  for (y = 0; y < h; y++) {
190  for (i = 0; i < ring_size; i++)
191  for (p = 0; p < MAX_PLANES; p++)
192  sample[p][i]= RENAME(sc->sample_buffer) + p*ring_size*(w+6) + ((h+i-y)%ring_size)*(w+6) + 3;
193 
194  for (x = 0; x < w; x++) {
195  int b, g, r, av_uninit(a);
196  if (lbd) {
197  unsigned v = *((const uint32_t*)(src[0] + x*4 + stride[0]*y));
198  b = v & 0xFF;
199  g = (v >> 8) & 0xFF;
200  r = (v >> 16) & 0xFF;
201  a = v >> 24;
202  } else if (packed) {
203  const uint16_t *p = ((const uint16_t*)(src[0] + x*packed_size + stride[0]*y));
204  r = p[0];
205  g = p[1];
206  b = p[2];
207  if (transparency)
208  a = p[3];
209  } else if (sizeof(TYPE) == 4 || transparency) {
210  g = *((const uint16_t *)(src[0] + x*2 + stride[0]*y));
211  b = *((const uint16_t *)(src[1] + x*2 + stride[1]*y));
212  r = *((const uint16_t *)(src[2] + x*2 + stride[2]*y));
213  if (transparency)
214  a = *((const uint16_t *)(src[3] + x*2 + stride[3]*y));
215  } else {
216  b = *((const uint16_t *)(src[0] + x*2 + stride[0]*y));
217  g = *((const uint16_t *)(src[1] + x*2 + stride[1]*y));
218  r = *((const uint16_t *)(src[2] + x*2 + stride[2]*y));
219  }
220 
221  if (sc->remap) {
222  g = sc->fltmap[0][g];
223  b = sc->fltmap[1][b];
224  r = sc->fltmap[2][r];
225  if (transparency)
226  a = sc->fltmap[3][a];
227  }
228 
229  if (sc->slice_coding_mode != 1) {
230  b -= g;
231  r -= g;
232  g += (b * sc->slice_rct_by_coef + r * sc->slice_rct_ry_coef) >> 2;
233  b += offset;
234  r += offset;
235  }
236 
237  sample[0][0][x] = g;
238  sample[1][0][x] = b;
239  sample[2][0][x] = r;
240  sample[3][0][x] = a;
241  }
242  for (p = 0; p < 3 + transparency; p++) {
243  int ret;
244  sample[p][0][-1] = sample[p][1][0 ];
245  sample[p][1][ w] = sample[p][1][w-1];
246  if (bits[p] == 9)
247  ret = RENAME(encode_line)(f, sc, f->avctx, w, sample[p], (p + 1) / 2, 9, ac, pass1);
248  else
249  ret = RENAME(encode_line)(f, sc, f->avctx, w, sample[p], (p + 1) / 2,
250  bits[p], ac, pass1);
251  if (ret < 0)
252  return ret;
253  }
254  }
255  return 0;
256 }
257 
load_rgb_frame
static void RENAME() load_rgb_frame(FFV1Context *f, FFV1SliceContext *sc, const uint8_t *src[4], int w, int h, const int stride[4])
Definition: ffv1enc_template.c:133
encode_line
static av_always_inline int RENAME() encode_line(FFV1Context *f, FFV1SliceContext *sc, void *logctx, int w, TYPE *sample[3], int plane_index, int bits, int ac, int pass1)
Definition: ffv1enc_template.c:26
r
const char * r
Definition: vf_curves.c:127
put_symbol_inline
static av_always_inline av_flatten void put_symbol_inline(RangeCoder *c, uint8_t *state, int v, int is_signed, uint64_t rc_stat[256][2], uint64_t rc_stat2[32][2])
Definition: ffv1enc.c:185
put_bits
static void put_bits(Jpeg2000EncoderContext *s, int val, int n)
put n times val bit
Definition: j2kenc.c:223
w
uint8_t w
Definition: llviddspenc.c:38
b
#define b
Definition: input.c:42
predict
static av_always_inline void predict(PredictorState *ps, int *coef, int output_enable)
Definition: aacdec_fixed_prediction.h:77
PlaneContext::state
uint8_t(* state)[CONTEXT_SIZE]
Definition: ffv1.h:67
ring_size
static int ring_size(RingBuffer *ring)
Definition: async.c:105
put_bytes_left
static int put_bytes_left(const PutBitContext *s, int round_up)
Definition: put_bits.h:135
AV_LOG_ERROR
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
Definition: log.h:209
MAX_PLANES
#define MAX_PLANES
Definition: ffv1.h:44
g
const char * g
Definition: vf_curves.c:128
bits
uint8_t bits
Definition: vp3data.h:128
ffv1_template.c
fold
static av_always_inline int fold(int diff, int bits)
Definition: ffv1.h:211
context
it s the only field you need to keep assuming you have a context There is some magic you don t need to care about around this just let it vf default minimum maximum flags name is the option keep it simple and lowercase description are in without and describe what they for example set the foo of the bar offset is the offset of the field in your context
Definition: writing_filters.txt:91
TYPE
#define TYPE
Definition: ffv1dec.c:91
NULL
#define NULL
Definition: coverity.c:32
PlaneContext::vlc_state
VlcState * vlc_state
Definition: ffv1.h:68
AC_GOLOMB_RICE
#define AC_GOLOMB_RICE
Definition: ffv1.h:52
PlaneContext
Definition: ffv1.h:64
state
static struct @487 state
c
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
Definition: undefined.txt:32
ff_dlog
#define ff_dlog(a,...)
Definition: tableprint_vlc.h:28
f
f
Definition: af_crystalizer.c:122
sample
#define sample
Definition: flacdsp_template.c:44
diff
static av_always_inline int diff(const struct color_info *a, const struct color_info *b, const int trans_thresh)
Definition: vf_paletteuse.c:166
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
offset
it s the only field you need to keep assuming you have a context There is some magic you don t need to care about around this just let it vf offset
Definition: writing_filters.txt:86
PlaneContext::quant_table_index
int quant_table_index
Definition: ffv1.h:65
put_vlc_symbol
static void put_vlc_symbol(PutBitContext *pb, VlcState *const state, int v, int bits)
Definition: ffv1enc.c:240
i
#define i(width, name, range_min, range_max)
Definition: cbs_h2645.c:256
put_bits_count
static int put_bits_count(PutBitContext *s)
Definition: put_bits.h:80
encode_rgb_frame
static int RENAME() encode_rgb_frame(FFV1Context *f, FFV1SliceContext *sc, const uint8_t *src[4], int w, int h, const int stride[4], int ac)
Definition: ffv1enc_template.c:168
av_always_inline
#define av_always_inline
Definition: attributes.h:49
FFV1SliceContext
Definition: ffv1.h:73
stride
#define stride
Definition: h264pred_template.c:536
av_uninit
#define av_uninit(x)
Definition: attributes.h:154
ret
ret
Definition: filter_design.txt:187
put_rac
#define put_rac(C, S, B)
RENAME
#define RENAME(element)
Definition: ac3enc_template.c:44
FFV1Context
Definition: ffv1.h:122
ff_log2_run
const uint8_t ff_log2_run[41]
Definition: mathtables.c:116
av_log
#define av_log(a,...)
Definition: tableprint_vlc.h:27
AVERROR_INVALIDDATA
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
Definition: error.h:61
h
h
Definition: vp9dsp_template.c:2070
RangeCoder
Definition: mss3.c:63
ff_ffv1_compute_bits_per_plane
void ff_ffv1_compute_bits_per_plane(const FFV1Context *f, FFV1SliceContext *sc, int bits[4], int *offset, int mask[4], int bits_per_raw_sample)
Definition: ffv1.c:222
src
#define src
Definition: vp8dsp.c:248
AV_CODEC_FLAG_PASS1
#define AV_CODEC_FLAG_PASS1
Use internal 2pass ratecontrol in first pass mode.
Definition: avcodec.h:290