1 /*
2 * Copyright (C) 2004 Michael Niedermayer <michaelni@gmx.at>
3 *
4 * This file is part of FFmpeg.
5 *
6 * FFmpeg is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
30
34
35
40 for(y=0; y<b_h; y++){
41 //FIXME ugly misuse of obmc_stride
42 const uint8_t *obmc1= obmc + y*obmc_stride;
43 const uint8_t *obmc2= obmc1+ (obmc_stride>>1);
44 const uint8_t *obmc3= obmc1+ obmc_stride*(obmc_stride>>1);
47 for(x=0; x<b_w; x++){
48 int v= obmc1[x] * block[3][x + y*src_stride]
49 +obmc2[x] * block[2][x + y*src_stride]
50 +obmc3[x] * block[1][x + y*src_stride]
51 +obmc4[x] * block[0][x + y*src_stride];
52
56 }
57 if(add){
58 v += dst[x + src_x];
60 if(v&(~255)) v= ~(v>>31);
61 dst8[x + y*src_stride] =
v;
62 }else{
64 }
65 }
66 }
67 }
68
70 int plane_index,
level, orientation;
71
72 for(plane_index=0; plane_index<3; plane_index++){
74 for(orientation=level ? 1:0; orientation<4; orientation++){
76 }
77 }
78 }
81 }
82
86
89
94
95 return 0;
96 }
97
99 int i;
101
102 for(i=0; i<
QROOT; i++){
104 v *= pow(2, 1.0 / QROOT);
105 }
106 }
109 8,7,6,5,4,3,2,1,
110 7,7,0,0,0,0,0,1,
111 6,0,6,0,0,0,2,0,
112 5,0,0,5,0,3,0,0,
113 4,0,0,0,4,0,0,0,
114 3,0,0,5,0,3,0,0,
115 2,0,6,0,0,0,2,0,
116 1,7,0,0,0,0,0,1,
117 };
118
119 static const uint8_t brane[256]={
120 0x00,0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x11,0x12,0x12,0x12,0x12,0x12,0x12,0x12,
121 0x04,0x05,0xcc,0xcc,0xcc,0xcc,0xcc,0x41,0x15,0x16,0xcc,0xcc,0xcc,0xcc,0xcc,0x52,
122 0x04,0xcc,0x05,0xcc,0xcc,0xcc,0x41,0xcc,0x15,0xcc,0x16,0xcc,0xcc,0xcc,0x52,0xcc,
123 0x04,0xcc,0xcc,0x05,0xcc,0x41,0xcc,0xcc,0x15,0xcc,0xcc,0x16,0xcc,0x52,0xcc,0xcc,
124 0x04,0xcc,0xcc,0xcc,0x41,0xcc,0xcc,0xcc,0x15,0xcc,0xcc,0xcc,0x16,0xcc,0xcc,0xcc,
125 0x04,0xcc,0xcc,0x41,0xcc,0x05,0xcc,0xcc,0x15,0xcc,0xcc,0x52,0xcc,0x16,0xcc,0xcc,
126 0x04,0xcc,0x41,0xcc,0xcc,0xcc,0x05,0xcc,0x15,0xcc,0x52,0xcc,0xcc,0xcc,0x16,0xcc,
127 0x04,0x41,0xcc,0xcc,0xcc,0xcc,0xcc,0x05,0x15,0x52,0xcc,0xcc,0xcc,0xcc,0xcc,0x16,
128 0x44,0x45,0x45,0x45,0x45,0x45,0x45,0x45,0x55,0x56,0x56,0x56,0x56,0x56,0x56,0x56,
129 0x48,0x49,0xcc,0xcc,0xcc,0xcc,0xcc,0x85,0x59,0x5A,0xcc,0xcc,0xcc,0xcc,0xcc,0x96,
130 0x48,0xcc,0x49,0xcc,0xcc,0xcc,0x85,0xcc,0x59,0xcc,0x5A,0xcc,0xcc,0xcc,0x96,0xcc,
131 0x48,0xcc,0xcc,0x49,0xcc,0x85,0xcc,0xcc,0x59,0xcc,0xcc,0x5A,0xcc,0x96,0xcc,0xcc,
132 0x48,0xcc,0xcc,0xcc,0x49,0xcc,0xcc,0xcc,0x59,0xcc,0xcc,0xcc,0x96,0xcc,0xcc,0xcc,
133 0x48,0xcc,0xcc,0x85,0xcc,0x49,0xcc,0xcc,0x59,0xcc,0xcc,0x96,0xcc,0x5A,0xcc,0xcc,
134 0x48,0xcc,0x85,0xcc,0xcc,0xcc,0x49,0xcc,0x59,0xcc,0x96,0xcc,0xcc,0xcc,0x5A,0xcc,
135 0x48,0x85,0xcc,0xcc,0xcc,0xcc,0xcc,0x49,0x59,0x96,0xcc,0xcc,0xcc,0xcc,0xcc,0x5A,
136 };
137
138 static const uint8_t needs[16]={
139 0,1,0,0,
140 2,4,2,0,
141 0,1,0,0,
142 15
143 };
144
148 int16_t *tmpI= tmpIt;
152 r= brane[dx + 16*dy]&15;
153 l= brane[dx + 16*dy]>>4;
154
155 b= needs[l] | needs[
r];
157 b= 15;
158
159 if(b&5){
161 for(x=0; x < b_w; x++){
162 int a_1=src[x + HTAPS_MAX/2-4];
163 int a0= src[x + HTAPS_MAX/2-3];
164 int a1= src[x + HTAPS_MAX/2-2];
165 int a2= src[x + HTAPS_MAX/2-1];
166 int a3= src[x + HTAPS_MAX/2+0];
167 int a4= src[x + HTAPS_MAX/2+1];
168 int a5= src[x + HTAPS_MAX/2+2];
169 int a6= src[x + HTAPS_MAX/2+3];
170 int am=0;
172 am= 20*(a2+
a3) - 5*(a1+a4) + (a0+
a5);
173 tmpI[x]= am;
174 am= (am+16)>>5;
175 }else{
177 tmpI[x]= am;
178 am= (am+32)>>6;
179 }
180
181 if(am&(~255)) am= ~(am>>31);
182 tmp2[x]= am;
183 }
184 tmpI+= 64;
185 tmp2+= 64;
187 }
189 }
191 tmp2= tmp2t[1];
192
193 if(b&2){
194 for(y=0; y < b_h; y++){
195 for(x=0; x < b_w+1; x++){
204 int am=0;
206 am= (20*(a2+
a3) - 5*(a1+a4) + (a0+
a5) + 16)>>5;
207 else
209
210 if(am&(~255)) am= ~(am>>31);
211 tmp2[x]= am;
212 }
214 tmp2+= 64;
215 }
217 }
219 tmp2= tmp2t[2];
220 tmpI= tmpIt;
221 if(b&4){
222 for(y=0; y < b_h; y++){
223 for(x=0; x < b_w; x++){
232 int am=0;
234 am= (20*(a2+
a3) - 5*(a1+a4) + (a0+
a5) + 512)>>10;
235 else
237 if(am&(~255)) am= ~(am>>31);
238 tmp2[x]= am;
239 }
240 tmpI+= 64;
241 tmp2+= 64;
242 }
243 }
244
247 hpel[ 2]= src + 1;
248
249 hpel[ 4]= tmp2t[1];
250 hpel[ 5]= tmp2t[2];
251 hpel[ 6]= tmp2t[1] + 1;
252
254 hpel[ 9]= hpel[1] + 64;
255 hpel[10]= hpel[8] + 1;
256
257 #define MC_STRIDE(x) (needs[x] ? 64 : stride)
258
259 if(b==15){
260 int dxy = dx / 8 + dy / 8 * 4;
261 const uint8_t *src1 = hpel[dxy ];
262 const uint8_t *src2 = hpel[dxy + 1];
263 const uint8_t *src3 = hpel[dxy + 4];
264 const uint8_t *src4 = hpel[dxy + 5];
269 dx&=7;
270 dy&=7;
271 for(y=0; y < b_h; y++){
272 for(x=0; x < b_w; x++){
273 dst[x]= ((8-dx)*(8-dy)*src1[x] + dx*(8-dy)*src2[x]+
274 (8-dx)* dy *src3[x] + dx* dy *src4[x]+32)>>6;
275 }
276 src1+=stride1;
277 src2+=stride2;
278 src3+=stride3;
279 src4+=stride4;
281 }
282 }else{
287 int a= weight[((dx&7) + (8*(dy&7)))];
289 for(y=0; y < b_h; y++){
290 for(x=0; x < b_w; x++){
291 dst[x]= (a*src1[x] + b*src2[x] + 4)>>3;
292 }
293 src1+=stride1;
294 src2+=stride2;
296 }
297 }
298 }
299
300 void ff_snow_pred_block(
SnowContext *
s,
uint8_t *dst,
uint8_t *tmp, ptrdiff_t
stride,
int sx,
int sy,
int b_w,
int b_h,
BlockNode *
block,
int plane_index,
int w,
int h){
303 const unsigned color = block->
color[plane_index];
304 const unsigned color4 = color*0x01010101;
305 if(b_w==32){
306 for(y=0; y < b_h; y++){
307 *(uint32_t*)&dst[0 + y*stride]= color4;
308 *(uint32_t*)&dst[4 + y*stride]= color4;
309 *(uint32_t*)&dst[8 + y*stride]= color4;
310 *(uint32_t*)&dst[12+ y*stride]= color4;
311 *(uint32_t*)&dst[16+ y*stride]= color4;
312 *(uint32_t*)&dst[20+ y*stride]= color4;
313 *(uint32_t*)&dst[24+ y*stride]= color4;
314 *(uint32_t*)&dst[28+ y*stride]= color4;
315 }
316 }else if(b_w==16){
317 for(y=0; y < b_h; y++){
318 *(uint32_t*)&dst[0 + y*stride]= color4;
319 *(uint32_t*)&dst[4 + y*stride]= color4;
320 *(uint32_t*)&dst[8 + y*stride]= color4;
321 *(uint32_t*)&dst[12+ y*stride]= color4;
322 }
323 }else if(b_w==8){
324 for(y=0; y < b_h; y++){
325 *(uint32_t*)&dst[0 + y*stride]= color4;
326 *(uint32_t*)&dst[4 + y*stride]= color4;
327 }
328 }else if(b_w==4){
329 for(y=0; y < b_h; y++){
330 *(uint32_t*)&dst[0 + y*stride]= color4;
331 }
332 }else{
333 for(y=0; y < b_h; y++){
334 for(x=0; x < b_w; x++){
336 }
337 }
338 }
339 }else{
342 int mx= block->
mx*scale;
343 int my= block->
my*scale;
344 const int dx= mx&15;
345 const int dy= my&15;
346 const int tab_index= 3 - (b_w>>2) + (b_w>>4);
354 sx, sy, w, h);
356 }
357
359
361 av_assert2((tab_index>=0 && tab_index<4) || b_w==32);
362 if((dx&3) || (dy&3) || !(b_w == b_h || 2*b_w == b_h || b_w == 2*b_h) || (b_w&(b_w-1)) || !s->
plane[plane_index].
fast_mc )
363 mc_block(&s->
plane[plane_index], dst, src, stride, b_w, b_h, dx, dy);
364 else if(b_w==32){
366 for(y=0; y<b_h; y+=16){
369 }
370 }else if(b_w==b_h)
372 else if(b_w==2*b_h){
375 }else{
379 }
380 }
381 }
382
383 #define mca(dx,dy,b_w)\
384 static void mc_block_hpel ## dx ## dy ## b_w(uint8_t *dst, const uint8_t *src, ptrdiff_t stride, int h){\
385 av_assert2(h==b_w);\
386 mc_block(NULL, dst, src-(HTAPS_MAX/2-1)-(HTAPS_MAX/2-1)*stride, stride, b_w, b_w, dx, dy);\
387 }
388
397
401 int i, j;
402
404 s->
max_ref_frames=1;
//just make sure it's not an invalid value in case of no initial keyframe
405
411
412 #define mcf(dx,dy)\
413 s->dsp.put_qpel_pixels_tab [0][dy+dx/4]=\
414 s->dsp.put_no_rnd_qpel_pixels_tab[0][dy+dx/4]=\
415 s->h264qpel.put_h264_qpel_pixels_tab[0][dy+dx/4];\
416 s->dsp.put_qpel_pixels_tab [1][dy+dx/4]=\
417 s->dsp.put_no_rnd_qpel_pixels_tab[1][dy+dx/4]=\
418 s->h264qpel.put_h264_qpel_pixels_tab[1][dy+dx/4];
419
436
437 #define mcfh(dx,dy)\
438 s->hdsp.put_pixels_tab [0][dy/4+dx/8]=\
439 s->hdsp.put_no_rnd_pixels_tab[0][dy/4+dx/8]=\
440 mc_block_hpel ## dx ## dy ## 16;\
441 s->hdsp.put_pixels_tab [1][dy/4+dx/8]=\
442 s->hdsp.put_no_rnd_pixels_tab[1][dy/4+dx/8]=\
443 mc_block_hpel ## dx ## dy ## 8;
444
449
451
452 // dec += FFMAX(s->chroma_h_shift, s->chroma_v_shift);
453
456
462
468 goto fail;
469 }
470
474 goto fail;
475
476 return 0;
477 fail:
479 }
480
483 int plane_index,
level, orientation;
484 int ret, emu_buf_size;
485
493 }
494
498 }
499
500 for(plane_index=0; plane_index < s->
nb_planes; plane_index++){
503
504 if(plane_index){
507 }
510
512 for(orientation=level ? 1 : 0; orientation<4; orientation++){
514
518 b->
width = (w + !(orientation&1))>>1;
519 b->
height= (h + !(orientation>1))>>1;
520
524
525 if(orientation&1){
528 }
529 if(orientation>1){
532 }
534
535 if(level)
537 //FIXME avoid this realloc
541 goto fail;
542 }
543 w= (w+1)>>1;
544 h= (h+1)>>1;
545 }
546 }
547
548 return 0;
549 fail:
551 }
552
553 #define USE_HALFPEL_PLANE 0
554
557
559 int is_chroma= !!p;
564
568 if (!halfpel[1][p] || !halfpel[2][p] || !halfpel[3][p])
570
572 for(y=0; y<h; y++){
573 for(x=0; x<w; x++){
574 int i= y*ls + x;
575
576 halfpel[1][p][i]= (20*(src[i] + src[i+1]) - 5*(src[i-1] + src[i+2]) + (src[i-2] + src[i+3]) + 16 )>>5;
577 }
578 }
579 for(y=0; y<h; y++){
580 for(x=0; x<w; x++){
581 int i= y*ls + x;
582
583 halfpel[2][p][i]= (20*(src[i] + src[i+ls]) - 5*(src[i-ls] + src[i+2*ls]) + (src[i-2*ls] + src[i+3*ls]) + 16 )>>5;
584 }
585 }
586 src= halfpel[1][p];
587 for(y=0; y<h; y++){
588 for(x=0; x<w; x++){
589 int i= y*ls + x;
590
591 halfpel[3][p][i]= (20*(src[i] + src[i+ls]) - 5*(src[i-ls] + src[i+2*ls]) + (src[i-2*ls] + src[i+3*ls]) + 16 )>>5;
592 }
593 }
594
595 //FIXME border!
596 }
597 return 0;
598 }
599
601 {
603 int i;
604
607 for(i=0; i<9; i++)
610 }
611 }
612
616 int w= s->
avctx->
width;
//FIXME round up to x16 ?
618
630 }
631 }
632
634
642 }
645
648 }else{
649 int i;
652 break;
656 return -1;
657 }
658 }
659
662
664
665 return 0;
666 }
667
669 {
670 int plane_index,
level, orientation, i;
671
677
683
687
693 }
695 }
696
697 for(plane_index=0; plane_index < s->
nb_planes; plane_index++){
699 for(orientation=level ? 1 : 0; orientation<4; orientation++){
701
703 }
704 }
705 }
708 }