1 /*
2 * lossless JPEG encoder
3 * Copyright (c) 2000, 2001 Fabrice Bellard
4 * Copyright (c) 2003 Alex Beregszaszi
5 * Copyright (c) 2003-2004 Michael Niedermayer
6 *
7 * Support for external huffman table, various fixes (AVID workaround),
8 * aspecting, new decode_frame mechanism and apple mjpeg-b support
9 * by Alex Beregszaszi
10 *
11 * This file is part of FFmpeg.
12 *
13 * FFmpeg is free software; you can redistribute it and/or
14 * modify it under the terms of the GNU Lesser General Public
15 * License as published by the Free Software Foundation; either
16 * version 2.1 of the License, or (at your option) any later version.
17 *
18 * FFmpeg is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 * Lesser General Public License for more details.
22 *
23 * You should have received a copy of the GNU Lesser General Public
24 * License along with FFmpeg; if not, write to the Free Software
25 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
26 */
27
28 /**
29 * @file
30 * lossless JPEG encoder.
31 */
32
36
44
49
52
57
60
63 {
67 const int linesize = frame->
linesize[0];
70 int left[3], top[3], topleft[3];
72
73 for (i = 0; i < 3; i++)
74 buffer[0][i] = 1 << (9 - 1);
75
76 for (y = 0; y <
height; y++) {
77 const int modified_predictor = y ? predictor : 1;
79
82 return -1;
83 }
84
85 for (i = 0; i < 3; i++)
86 top[i]= left[i]= topleft[i]=
buffer[0][i];
87
88 for (x = 0; x <
width; x++) {
90 buffer[x][1] = ptr[3 * x + 0] - ptr[3 * x + 1] + 0x100;
91 buffer[x][2] = ptr[3 * x + 2] - ptr[3 * x + 1] + 0x100;
92 buffer[x][0] = (ptr[3 * x + 0] + 2 * ptr[3 * x + 1] + ptr[3 * x + 2]) >> 2;
93 }else{
94 buffer[x][1] = ptr[4 * x + 0] - ptr[4 * x + 1] + 0x100;
95 buffer[x][2] = ptr[4 * x + 2] - ptr[4 * x + 1] + 0x100;
96 buffer[x][0] = (ptr[4 * x + 0] + 2 * ptr[4 * x + 1] + ptr[4 * x + 2]) >> 2;
97 }
98
99 for (i = 0; i < 3; i++) {
101
102 PREDICT(pred, topleft[i], top[i], left[i], modified_predictor);
103
104 topleft[i] = top[i];
106
108
109 diff = ((left[i] - pred + 0x100) & 0x1FF) - 0x100;
110
111 if (i == 0)
113 else
115 }
116 }
117 }
118
119 return 0;
120 }
121
124 int mb_x, int mb_y)
125 {
126 int i;
127
128 if (mb_x == 0 || mb_y == 0) {
129 for (i = 0; i < 3; i++) {
131 int x,
y, h,
v, linesize;
135
136 for (y = 0; y <
v; y++) {
137 for (x = 0; x < h; x++) {
139
140 ptr = frame->
data[i] + (linesize * (v * mb_y +
y)) + (h * mb_x + x);
//FIXME optimize this crap
141 if (y == 0 && mb_y == 0) {
142 if (x == 0 && mb_x == 0)
143 pred = 128;
144 else
145 pred = ptr[-1];
146 } else {
147 if (x == 0 && mb_x == 0) {
148 pred = ptr[-linesize];
149 } else {
150 PREDICT(pred, ptr[-linesize - 1], ptr[-linesize],
151 ptr[-1], predictor);
152 }
153 }
154
155 if (i == 0)
157 else
159 }
160 }
161 }
162 } else {
163 for (i = 0; i < 3; i++) {
165 int x,
y, h,
v, linesize;
169
170 for (y = 0; y <
v; y++) {
171 for (x = 0; x < h; x++) {
173
174 ptr = frame->
data[i] + (linesize * (v * mb_y +
y)) + (h * mb_x + x);
//FIXME optimize this crap
175 PREDICT(pred, ptr[-linesize - 1], ptr[-linesize], ptr[-1], predictor);
176
177 if (i == 0)
179 else
181 }
182 }
183 }
184 }
185 }
186
189 {
194 int mb_x, mb_y;
195
196 for (mb_y = 0; mb_y < mb_height; mb_y++) {
200 return -1;
201 }
202
203 for (mb_x = 0; mb_x < mb_width; mb_x++)
205 }
206
207 return 0;
208 }
209
211 const AVFrame *pict,
int *got_packet)
212 {
218 const int mb_height = (height + s->
vsample[0] - 1) / s->
vsample[0];
220 int ret, header_bits;
221
225 max_pkt_size += width * height * 3 * 4;
226 else {
227 max_pkt_size += mb_width * mb_height * 3 * 4
229 }
230
232 return ret;
233
235
238
240
245 else
247 if (ret < 0)
249
250 emms_c();
251
254
258 *got_packet = 1;
259
260 return 0;
261 }
262
264 {
266
269
270 return 0;
271 }
272
274 {
276
283 "Limited range YUV is non-standard, set strict_std_compliance to "
284 "at least unofficial to use it.\n");
286 }
287
291
294
297 goto fail;
298
302
304
313
314 return 0;
315 fail:
318 }
319
335 };