falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
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.
22217 Commits
32 Branches
743MB
Tree: 5cc5d9bf29
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '5cc5d9bf29'
${ noResults }
FFmpeg/libavcodec/h264_loopfilter.c

724 lines
33KB
Raw Blame History 

  1. /*

  2.  * H.26L/H.264/AVC/JVT/14496-10/... loop filter

  3.  * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>

  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. /**

  23.  * @file libavcodec/h264_loopfilter.c

  24.  * H.264 / AVC / MPEG4 part10 loop filter.

  25.  * @author Michael Niedermayer <michaelni@gmx.at>

  26.  */

  27. 

  28. #include "internal.h"

  29. #include "dsputil.h"

  30. #include "avcodec.h"

  31. #include "mpegvideo.h"

  32. #include "h264.h"

  33. #include "mathops.h"

  34. #include "rectangle.h"

  35. 

  36. #if ARCH_X86

  37. #include "x86/h264_i386.h"

  38. #endif

  39. 

  40. //#undef NDEBUG

  41. #include <assert.h>

  42. 

  43. /* Deblocking filter (p153) */

  44. static const uint8_t alpha_table[52*3] = {

  45.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  46.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  47.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  48.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  49.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  50.      0,  0,  0,  0,  0,  0,  4,  4,  5,  6,

  51.      7,  8,  9, 10, 12, 13, 15, 17, 20, 22,

  52.     25, 28, 32, 36, 40, 45, 50, 56, 63, 71,

  53.     80, 90,101,113,127,144,162,182,203,226,

  54.    255,255,

  55.    255,255,255,255,255,255,255,255,255,255,255,255,255,

  56.    255,255,255,255,255,255,255,255,255,255,255,255,255,

  57.    255,255,255,255,255,255,255,255,255,255,255,255,255,

  58.    255,255,255,255,255,255,255,255,255,255,255,255,255,

  59. };

  60. static const uint8_t beta_table[52*3] = {

  61.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  62.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  63.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  64.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  65.      0,  0,  0,  0,  0,  0,  0,  0,  0,  0,

  66.      0,  0,  0,  0,  0,  0,  2,  2,  2,  3,

  67.      3,  3,  3,  4,  4,  4,  6,  6,  7,  7,

  68.      8,  8,  9,  9, 10, 10, 11, 11, 12, 12,

  69.     13, 13, 14, 14, 15, 15, 16, 16, 17, 17,

  70.     18, 18,

  71.     18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,

  72.     18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,

  73.     18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,

  74.     18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,

  75. };

  76. static const uint8_t tc0_table[52*3][4] = {

  77.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  78.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  79.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  80.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  81.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  82.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  83.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  84.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  85.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  86.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  87.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 },

  88.     {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 0 }, {-1, 0, 0, 1 },

  89.     {-1, 0, 0, 1 }, {-1, 0, 0, 1 }, {-1, 0, 0, 1 }, {-1, 0, 1, 1 }, {-1, 0, 1, 1 }, {-1, 1, 1, 1 },

  90.     {-1, 1, 1, 1 }, {-1, 1, 1, 1 }, {-1, 1, 1, 1 }, {-1, 1, 1, 2 }, {-1, 1, 1, 2 }, {-1, 1, 1, 2 },

  91.     {-1, 1, 1, 2 }, {-1, 1, 2, 3 }, {-1, 1, 2, 3 }, {-1, 2, 2, 3 }, {-1, 2, 2, 4 }, {-1, 2, 3, 4 },

  92.     {-1, 2, 3, 4 }, {-1, 3, 3, 5 }, {-1, 3, 4, 6 }, {-1, 3, 4, 6 }, {-1, 4, 5, 7 }, {-1, 4, 5, 8 },

  93.     {-1, 4, 6, 9 }, {-1, 5, 7,10 }, {-1, 6, 8,11 }, {-1, 6, 8,13 }, {-1, 7,10,14 }, {-1, 8,11,16 },

  94.     {-1, 9,12,18 }, {-1,10,13,20 }, {-1,11,15,23 }, {-1,13,17,25 },

  95.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  96.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  97.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  98.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  99.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  100.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  101.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  102.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  103.     {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 }, {-1,13,17,25 },

  104. };

  105. 

  106. static void av_noinline filter_mb_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  107.     const int index_a = qp + h->slice_alpha_c0_offset;

  108.     const int alpha = (alpha_table+52)[index_a];

  109.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  110.     if (alpha ==0 || beta == 0) return;

  111. 

  112.     if( bS[0] < 4 ) {

  113.         int8_t tc[4];

  114.         tc[0] = (tc0_table+52)[index_a][bS[0]];

  115.         tc[1] = (tc0_table+52)[index_a][bS[1]];

  116.         tc[2] = (tc0_table+52)[index_a][bS[2]];

  117.         tc[3] = (tc0_table+52)[index_a][bS[3]];

  118.         h->s.dsp.h264_h_loop_filter_luma(pix, stride, alpha, beta, tc);

  119.     } else {

  120.         h->s.dsp.h264_h_loop_filter_luma_intra(pix, stride, alpha, beta);

  121.     }

  122. }

  123. static void av_noinline filter_mb_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  124.     const int index_a = qp + h->slice_alpha_c0_offset;

  125.     const int alpha = (alpha_table+52)[index_a];

  126.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  127.     if (alpha ==0 || beta == 0) return;

  128. 

  129.     if( bS[0] < 4 ) {

  130.         int8_t tc[4];

  131.         tc[0] = (tc0_table+52)[index_a][bS[0]]+1;

  132.         tc[1] = (tc0_table+52)[index_a][bS[1]]+1;

  133.         tc[2] = (tc0_table+52)[index_a][bS[2]]+1;

  134.         tc[3] = (tc0_table+52)[index_a][bS[3]]+1;

  135.         h->s.dsp.h264_h_loop_filter_chroma(pix, stride, alpha, beta, tc);

  136.     } else {

  137.         h->s.dsp.h264_h_loop_filter_chroma_intra(pix, stride, alpha, beta);

  138.     }

  139. }

  140. 

  141. static void filter_mb_mbaff_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int bsi, int qp ) {

  142.     int i;

  143.     for( i = 0; i < 8; i++, pix += stride) {

  144.         int index_a;

  145.         int alpha;

  146.         int beta;

  147.         const int bS_index = (i >> 1) * bsi;

  148. 

  149.         if( bS[bS_index] == 0 ) {

  150.             continue;

  151.         }

  152. 

  153.         index_a = qp + h->slice_alpha_c0_offset;

  154.         alpha = (alpha_table+52)[index_a];

  155.         beta  = (beta_table+52)[qp + h->slice_beta_offset];

  156. 

  157.         if( bS[bS_index] < 4 ) {

  158.             const int tc0 = (tc0_table+52)[index_a][bS[bS_index]];

  159.             const int p0 = pix[-1];

  160.             const int p1 = pix[-2];

  161.             const int p2 = pix[-3];

  162.             const int q0 = pix[0];

  163.             const int q1 = pix[1];

  164.             const int q2 = pix[2];

  165. 

  166.             if( FFABS( p0 - q0 ) < alpha &&

  167.                 FFABS( p1 - p0 ) < beta &&

  168.                 FFABS( q1 - q0 ) < beta ) {

  169.                 int tc = tc0;

  170.                 int i_delta;

  171. 

  172.                 if( FFABS( p2 - p0 ) < beta ) {

  173.                     pix[-2] = p1 + av_clip( ( p2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( p1 << 1 ) ) >> 1, -tc0, tc0 );

  174.                     tc++;

  175.                 }

  176.                 if( FFABS( q2 - q0 ) < beta ) {

  177.                     pix[1] = q1 + av_clip( ( q2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( q1 << 1 ) ) >> 1, -tc0, tc0 );

  178.                     tc++;

  179.                 }

  180. 

  181.                 i_delta = av_clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );

  182.                 pix[-1] = av_clip_uint8( p0 + i_delta );    /* p0' */

  183.                 pix[0]  = av_clip_uint8( q0 - i_delta );    /* q0' */

  184.                 tprintf(h->s.avctx, "filter_mb_mbaff_edgev i:%d, qp:%d, indexA:%d, alpha:%d, beta:%d, tc:%d\n# bS:%d -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, qp[qp_index], index_a, alpha, beta, tc, bS[bS_index], pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);

  185.             }

  186.         }else{

  187.             const int p0 = pix[-1];

  188.             const int p1 = pix[-2];

  189.             const int p2 = pix[-3];

  190. 

  191.             const int q0 = pix[0];

  192.             const int q1 = pix[1];

  193.             const int q2 = pix[2];

  194. 

  195.             if( FFABS( p0 - q0 ) < alpha &&

  196.                 FFABS( p1 - p0 ) < beta &&

  197.                 FFABS( q1 - q0 ) < beta ) {

  198. 

  199.                 if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){

  200.                     if( FFABS( p2 - p0 ) < beta)

  201.                     {

  202.                         const int p3 = pix[-4];

  203.                         /* p0', p1', p2' */

  204.                         pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;

  205.                         pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;

  206.                         pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;

  207.                     } else {

  208.                         /* p0' */

  209.                         pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  210.                     }

  211.                     if( FFABS( q2 - q0 ) < beta)

  212.                     {

  213.                         const int q3 = pix[3];

  214.                         /* q0', q1', q2' */

  215.                         pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;

  216.                         pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;

  217.                         pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;

  218.                     } else {

  219.                         /* q0' */

  220.                         pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  221.                     }

  222.                 }else{

  223.                     /* p0', q0' */

  224.                     pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  225.                     pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  226.                 }

  227.                 tprintf(h->s.avctx, "filter_mb_mbaff_edgev i:%d, qp:%d, indexA:%d, alpha:%d, beta:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x, %02x, %02x]\n", i, qp[qp_index], index_a, alpha, beta, p2, p1, p0, q0, q1, q2, pix[-3], pix[-2], pix[-1], pix[0], pix[1], pix[2]);

  228.             }

  229.         }

  230.     }

  231. }

  232. static void filter_mb_mbaff_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int bsi, int qp ) {

  233.     int i;

  234.     for( i = 0; i < 4; i++, pix += stride) {

  235.         int index_a;

  236.         int alpha;

  237.         int beta;

  238.         const int bS_index = i*bsi;

  239. 

  240.         if( bS[bS_index] == 0 ) {

  241.             continue;

  242.         }

  243. 

  244.         index_a = qp + h->slice_alpha_c0_offset;

  245.         alpha = (alpha_table+52)[index_a];

  246.         beta  = (beta_table+52)[qp + h->slice_beta_offset];

  247. 

  248.         if( bS[bS_index] < 4 ) {

  249.             const int tc = (tc0_table+52)[index_a][bS[bS_index]] + 1;

  250.             const int p0 = pix[-1];

  251.             const int p1 = pix[-2];

  252.             const int q0 = pix[0];

  253.             const int q1 = pix[1];

  254. 

  255.             if( FFABS( p0 - q0 ) < alpha &&

  256.                 FFABS( p1 - p0 ) < beta &&

  257.                 FFABS( q1 - q0 ) < beta ) {

  258.                 const int i_delta = av_clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );

  259. 

  260.                 pix[-1] = av_clip_uint8( p0 + i_delta );    /* p0' */

  261.                 pix[0]  = av_clip_uint8( q0 - i_delta );    /* q0' */

  262.                 tprintf(h->s.avctx, "filter_mb_mbaff_edgecv i:%d, qp:%d, indexA:%d, alpha:%d, beta:%d, tc:%d\n# bS:%d -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, qp[qp_index], index_a, alpha, beta, tc, bS[bS_index], pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);

  263.             }

  264.         }else{

  265.             const int p0 = pix[-1];

  266.             const int p1 = pix[-2];

  267.             const int q0 = pix[0];

  268.             const int q1 = pix[1];

  269. 

  270.             if( FFABS( p0 - q0 ) < alpha &&

  271.                 FFABS( p1 - p0 ) < beta &&

  272.                 FFABS( q1 - q0 ) < beta ) {

  273. 

  274.                 pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;   /* p0' */

  275.                 pix[0]  = ( 2*q1 + q0 + p1 + 2 ) >> 2;   /* q0' */

  276.                 tprintf(h->s.avctx, "filter_mb_mbaff_edgecv i:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x, %02x, %02x]\n", i, pix[-3], p1, p0, q0, q1, pix[2], pix[-3], pix[-2], pix[-1], pix[0], pix[1], pix[2]);

  277.             }

  278.         }

  279.     }

  280. }

  281. 

  282. static void av_noinline filter_mb_edgeh( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  283.     const int index_a = qp + h->slice_alpha_c0_offset;

  284.     const int alpha = (alpha_table+52)[index_a];

  285.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  286.     if (alpha ==0 || beta == 0) return;

  287. 

  288.     if( bS[0] < 4 ) {

  289.         int8_t tc[4];

  290.         tc[0] = (tc0_table+52)[index_a][bS[0]];

  291.         tc[1] = (tc0_table+52)[index_a][bS[1]];

  292.         tc[2] = (tc0_table+52)[index_a][bS[2]];

  293.         tc[3] = (tc0_table+52)[index_a][bS[3]];

  294.         h->s.dsp.h264_v_loop_filter_luma(pix, stride, alpha, beta, tc);

  295.     } else {

  296.         h->s.dsp.h264_v_loop_filter_luma_intra(pix, stride, alpha, beta);

  297.     }

  298. }

  299. 

  300. static void av_noinline filter_mb_edgech( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  301.     const int index_a = qp + h->slice_alpha_c0_offset;

  302.     const int alpha = (alpha_table+52)[index_a];

  303.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  304.     if (alpha ==0 || beta == 0) return;

  305. 

  306.     if( bS[0] < 4 ) {

  307.         int8_t tc[4];

  308.         tc[0] = (tc0_table+52)[index_a][bS[0]]+1;

  309.         tc[1] = (tc0_table+52)[index_a][bS[1]]+1;

  310.         tc[2] = (tc0_table+52)[index_a][bS[2]]+1;

  311.         tc[3] = (tc0_table+52)[index_a][bS[3]]+1;

  312.         h->s.dsp.h264_v_loop_filter_chroma(pix, stride, alpha, beta, tc);

  313.     } else {

  314.         h->s.dsp.h264_v_loop_filter_chroma_intra(pix, stride, alpha, beta);

  315.     }

  316. }

  317. 

  318. void ff_h264_filter_mb_fast( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize) {

  319.     MpegEncContext * const s = &h->s;

  320.     int mb_y_firstrow = s->picture_structure == PICT_BOTTOM_FIELD;

  321.     int mb_xy, mb_type;

  322.     int qp, qp0, qp1, qpc, qpc0, qpc1, qp_thresh;

  323. 

  324.     mb_xy = h->mb_xy;

  325. 

  326.     if(mb_x==0 || mb_y==mb_y_firstrow || !s->dsp.h264_loop_filter_strength || h->pps.chroma_qp_diff ||

  327.        !(h->slice_type_nos == FF_I_TYPE ||

  328.          h->slice_type_nos == FF_P_TYPE ||

  329.          (s->flags2 & CODEC_FLAG2_FAST)) ||

  330.        (h->deblocking_filter == 2 && (h->slice_num != h->slice_table[h->top_mb_xy] ||

  331.                                       h->slice_num != h->slice_table[mb_xy - 1]))) {

  332.         ff_h264_filter_mb(h, mb_x, mb_y, img_y, img_cb, img_cr, linesize, uvlinesize);

  333.         return;

  334.     }

  335.     assert(!FRAME_MBAFF);

  336. 

  337.     mb_type = s->current_picture.mb_type[mb_xy];

  338.     qp = s->current_picture.qscale_table[mb_xy];

  339.     qp0 = s->current_picture.qscale_table[mb_xy-1];

  340.     qp1 = s->current_picture.qscale_table[h->top_mb_xy];

  341.     qpc = get_chroma_qp( h, 0, qp );

  342.     qpc0 = get_chroma_qp( h, 0, qp0 );

  343.     qpc1 = get_chroma_qp( h, 0, qp1 );

  344.     qp0 = (qp + qp0 + 1) >> 1;

  345.     qp1 = (qp + qp1 + 1) >> 1;

  346.     qpc0 = (qpc + qpc0 + 1) >> 1;

  347.     qpc1 = (qpc + qpc1 + 1) >> 1;

  348.     qp_thresh = 15 - h->slice_alpha_c0_offset;

  349.     if(qp <= qp_thresh && qp0 <= qp_thresh && qp1 <= qp_thresh &&

  350.        qpc <= qp_thresh && qpc0 <= qp_thresh && qpc1 <= qp_thresh)

  351.         return;

  352. 

  353.     if( IS_INTRA(mb_type) ) {

  354.         int16_t bS4[4] = {4,4,4,4};

  355.         int16_t bS3[4] = {3,3,3,3};

  356.         int16_t *bSH = FIELD_PICTURE ? bS3 : bS4;

  357.         if( IS_8x8DCT(mb_type) ) {

  358.             filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );

  359.             filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );

  360.             filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bSH, qp1 );

  361.             filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );

  362.         } else {

  363.             filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );

  364.             filter_mb_edgev( h, &img_y[4*1], linesize, bS3, qp );

  365.             filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );

  366.             filter_mb_edgev( h, &img_y[4*3], linesize, bS3, qp );

  367.             filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bSH, qp1 );

  368.             filter_mb_edgeh( h, &img_y[4*1*linesize], linesize, bS3, qp );

  369.             filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );

  370.             filter_mb_edgeh( h, &img_y[4*3*linesize], linesize, bS3, qp );

  371.         }

  372.         filter_mb_edgecv( h, &img_cb[2*0], uvlinesize, bS4, qpc0 );

  373.         filter_mb_edgecv( h, &img_cb[2*2], uvlinesize, bS3, qpc );

  374.         filter_mb_edgecv( h, &img_cr[2*0], uvlinesize, bS4, qpc0 );

  375.         filter_mb_edgecv( h, &img_cr[2*2], uvlinesize, bS3, qpc );

  376.         filter_mb_edgech( h, &img_cb[2*0*uvlinesize], uvlinesize, bSH, qpc1 );

  377.         filter_mb_edgech( h, &img_cb[2*2*uvlinesize], uvlinesize, bS3, qpc );

  378.         filter_mb_edgech( h, &img_cr[2*0*uvlinesize], uvlinesize, bSH, qpc1 );

  379.         filter_mb_edgech( h, &img_cr[2*2*uvlinesize], uvlinesize, bS3, qpc );

  380.         return;

  381.     } else {

  382.         DECLARE_ALIGNED_8(int16_t, bS[2][4][4]);

  383.         uint64_t (*bSv)[4] = (uint64_t(*)[4])bS;

  384.         int edges;

  385.         if( IS_8x8DCT(mb_type) && (h->cbp&7) == 7 ) {

  386.             edges = 4;

  387.             bSv[0][0] = bSv[0][2] = bSv[1][0] = bSv[1][2] = 0x0002000200020002ULL;

  388.         } else {

  389.             int mask_edge1 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16)) ? 3 :

  390.                              (mb_type & MB_TYPE_16x8) ? 1 : 0;

  391.             int mask_edge0 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16))

  392.                              && (s->current_picture.mb_type[mb_xy-1] & (MB_TYPE_16x16 | MB_TYPE_8x16))

  393.                              ? 3 : 0;

  394.             int step = IS_8x8DCT(mb_type) ? 2 : 1;

  395.             edges = (mb_type & MB_TYPE_16x16) && !(h->cbp & 15) ? 1 : 4;

  396.             s->dsp.h264_loop_filter_strength( bS, h->non_zero_count_cache, h->ref_cache, h->mv_cache,

  397.                                               (h->slice_type_nos == FF_B_TYPE), edges, step, mask_edge0, mask_edge1, FIELD_PICTURE);

  398.         }

  399.         if( IS_INTRA(s->current_picture.mb_type[mb_xy-1]) )

  400.             bSv[0][0] = 0x0004000400040004ULL;

  401.         if( IS_INTRA(s->current_picture.mb_type[h->top_mb_xy]) )

  402.             bSv[1][0] = FIELD_PICTURE ? 0x0003000300030003ULL : 0x0004000400040004ULL;

  403. 

  404. #define FILTER(hv,dir,edge)\

  405.         if(bSv[dir][edge]) {\

  406.             filter_mb_edge##hv( h, &img_y[4*edge*(dir?linesize:1)], linesize, bS[dir][edge], edge ? qp : qp##dir );\

  407.             if(!(edge&1)) {\

  408.                 filter_mb_edgec##hv( h, &img_cb[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\

  409.                 filter_mb_edgec##hv( h, &img_cr[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\

  410.             }\

  411.         }

  412.         if( edges == 1 ) {

  413.             FILTER(v,0,0);

  414.             FILTER(h,1,0);

  415.         } else if( IS_8x8DCT(mb_type) ) {

  416.             FILTER(v,0,0);

  417.             FILTER(v,0,2);

  418.             FILTER(h,1,0);

  419.             FILTER(h,1,2);

  420.         } else {

  421.             FILTER(v,0,0);

  422.             FILTER(v,0,1);

  423.             FILTER(v,0,2);

  424.             FILTER(v,0,3);

  425.             FILTER(h,1,0);

  426.             FILTER(h,1,1);

  427.             FILTER(h,1,2);

  428.             FILTER(h,1,3);

  429.         }

  430. #undef FILTER

  431.     }

  432. }

  433. 

  434. 

  435. static av_always_inline void filter_mb_dir(H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize, int mb_xy, int mb_type, int mvy_limit, int first_vertical_edge_done, int dir) {

  436.     MpegEncContext * const s = &h->s;

  437.     int edge;

  438.     const int mbm_xy = dir == 0 ? mb_xy -1 : h->top_mb_xy;

  439.     const int mbm_type = s->current_picture.mb_type[mbm_xy];

  440.     int start = h->slice_table[mbm_xy] == 0xFFFF ? 1 : 0;

  441. 

  442.     const int edges = (mb_type & (MB_TYPE_16x16|MB_TYPE_SKIP))

  443.                               == (MB_TYPE_16x16|MB_TYPE_SKIP) ? 1 : 4;

  444.     // how often to recheck mv-based bS when iterating between edges

  445.     const int mask_edge = (mb_type & (MB_TYPE_16x16 | (MB_TYPE_16x8 << dir))) ? 3 :

  446.                           (mb_type & (MB_TYPE_8x16 >> dir)) ? 1 : 0;

  447.     // how often to recheck mv-based bS when iterating along each edge

  448.     const int mask_par0 = mb_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir));

  449. 

  450.     if (first_vertical_edge_done) {

  451.         start = 1;

  452.     }

  453. 

  454.     if (h->deblocking_filter==2 && h->slice_table[mbm_xy] != h->slice_num)

  455.         start = 1;

  456. 

  457.     if (FRAME_MBAFF && (dir == 1) && ((mb_y&1) == 0) && start == 0

  458.         && !IS_INTERLACED(mb_type)

  459.         && IS_INTERLACED(mbm_type)

  460.         ) {

  461.         // This is a special case in the norm where the filtering must

  462.         // be done twice (one each of the field) even if we are in a

  463.         // frame macroblock.

  464.         //

  465.         unsigned int tmp_linesize   = 2 *   linesize;

  466.         unsigned int tmp_uvlinesize = 2 * uvlinesize;

  467.         int mbn_xy = mb_xy - 2 * s->mb_stride;

  468.         int qp;

  469.         int i, j;

  470.         int16_t bS[4];

  471. 

  472.         for(j=0; j<2; j++, mbn_xy += s->mb_stride){

  473.             if( IS_INTRA(mb_type) ||

  474.                 IS_INTRA(s->current_picture.mb_type[mbn_xy]) ) {

  475.                 bS[0] = bS[1] = bS[2] = bS[3] = 3;

  476.             } else {

  477.                 const uint8_t *mbn_nnz = h->non_zero_count[mbn_xy];

  478.                 for( i = 0; i < 4; i++ ) {

  479.                     if( h->non_zero_count_cache[scan8[0]+i] != 0 ||

  480.                         mbn_nnz[i+4+3*8] != 0 )

  481.                         bS[i] = 2;

  482.                     else

  483.                         bS[i] = 1;

  484.                 }

  485.             }

  486.             // Do not use s->qscale as luma quantizer because it has not the same

  487.             // value in IPCM macroblocks.

  488.             qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;

  489.             tprintf(s->avctx, "filter mb:%d/%d dir:%d edge:%d, QPy:%d ls:%d uvls:%d", mb_x, mb_y, dir, edge, qp, tmp_linesize, tmp_uvlinesize);

  490.             { int i; for (i = 0; i < 4; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }

  491.             filter_mb_edgeh( h, &img_y[j*linesize], tmp_linesize, bS, qp );

  492.             filter_mb_edgech( h, &img_cb[j*uvlinesize], tmp_uvlinesize, bS,

  493.                               ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);

  494.             filter_mb_edgech( h, &img_cr[j*uvlinesize], tmp_uvlinesize, bS,

  495.                               ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);

  496.         }

  497. 

  498.         start = 1;

  499.     }

  500. 

  501.     /* Calculate bS */

  502.     for( edge = start; edge < edges; edge++ ) {

  503.         /* mbn_xy: neighbor macroblock */

  504.         const int mbn_xy = edge > 0 ? mb_xy : mbm_xy;

  505.         const int mbn_type = s->current_picture.mb_type[mbn_xy];

  506.         int16_t bS[4];

  507.         int qp;

  508. 

  509.         if( (edge&1) && IS_8x8DCT(mb_type) )

  510.             continue;

  511. 

  512.         if( IS_INTRA(mb_type) ||

  513.             IS_INTRA(mbn_type) ) {

  514.             int value;

  515.             if (edge == 0) {

  516.                 if (   (!IS_INTERLACED(mb_type) && !IS_INTERLACED(mbm_type))

  517.                     || ((FRAME_MBAFF || (s->picture_structure != PICT_FRAME)) && (dir == 0))

  518.                 ) {

  519.                     value = 4;

  520.                 } else {

  521.                     value = 3;

  522.                 }

  523.             } else {

  524.                 value = 3;

  525.             }

  526.             bS[0] = bS[1] = bS[2] = bS[3] = value;

  527.         } else {

  528.             int i, l;

  529.             int mv_done;

  530. 

  531.             if( edge & mask_edge ) {

  532.                 bS[0] = bS[1] = bS[2] = bS[3] = 0;

  533.                 mv_done = 1;

  534.             }

  535.             else if( FRAME_MBAFF && IS_INTERLACED(mb_type ^ mbn_type)) {

  536.                 bS[0] = bS[1] = bS[2] = bS[3] = 1;

  537.                 mv_done = 1;

  538.             }

  539.             else if( mask_par0 && (edge || (mbn_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir)))) ) {

  540.                 int b_idx= 8 + 4 + edge * (dir ? 8:1);

  541.                 int bn_idx= b_idx - (dir ? 8:1);

  542.                 int v = 0;

  543. 

  544.                 for( l = 0; !v && l < 1 + (h->slice_type_nos == FF_B_TYPE); l++ ) {

  545.                     v |= h->ref_cache[l][b_idx] != h->ref_cache[l][bn_idx] |

  546.                          h->mv_cache[l][b_idx][0] - h->mv_cache[l][bn_idx][0] + 3 >= 7U |

  547.                          FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[l][bn_idx][1] ) >= mvy_limit;

  548.                 }

  549. 

  550.                 if(h->slice_type_nos == FF_B_TYPE && v){

  551.                     v=0;

  552.                     for( l = 0; !v && l < 2; l++ ) {

  553.                         int ln= 1-l;

  554.                         v |= h->ref_cache[l][b_idx] != h->ref_cache[ln][bn_idx] |

  555.                             h->mv_cache[l][b_idx][0] - h->mv_cache[ln][bn_idx][0] + 3 >= 7U |

  556.                             FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[ln][bn_idx][1] ) >= mvy_limit;

  557.                     }

  558.                 }

  559. 

  560.                 bS[0] = bS[1] = bS[2] = bS[3] = v;

  561.                 mv_done = 1;

  562.             }

  563.             else

  564.                 mv_done = 0;

  565. 

  566.             for( i = 0; i < 4; i++ ) {

  567.                 int x = dir == 0 ? edge : i;

  568.                 int y = dir == 0 ? i    : edge;

  569.                 int b_idx= 8 + 4 + x + 8*y;

  570.                 int bn_idx= b_idx - (dir ? 8:1);

  571. 

  572.                 if( h->non_zero_count_cache[b_idx] |

  573.                     h->non_zero_count_cache[bn_idx] ) {

  574.                     bS[i] = 2;

  575.                 }

  576.                 else if(!mv_done)

  577.                 {

  578.                     bS[i] = 0;

  579.                     for( l = 0; l < 1 + (h->slice_type_nos == FF_B_TYPE); l++ ) {

  580.                         if( h->ref_cache[l][b_idx] != h->ref_cache[l][bn_idx] |

  581.                             h->mv_cache[l][b_idx][0] - h->mv_cache[l][bn_idx][0] + 3 >= 7U |

  582.                             FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[l][bn_idx][1] ) >= mvy_limit ) {

  583.                             bS[i] = 1;

  584.                             break;

  585.                         }

  586.                     }

  587. 

  588.                     if(h->slice_type_nos == FF_B_TYPE && bS[i]){

  589.                         bS[i] = 0;

  590.                         for( l = 0; l < 2; l++ ) {

  591.                             int ln= 1-l;

  592.                             if( h->ref_cache[l][b_idx] != h->ref_cache[ln][bn_idx] |

  593.                                 h->mv_cache[l][b_idx][0] - h->mv_cache[ln][bn_idx][0] + 3 >= 7U |

  594.                                 FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[ln][bn_idx][1] ) >= mvy_limit ) {

  595.                                 bS[i] = 1;

  596.                                 break;

  597.                             }

  598.                         }

  599.                     }

  600.                 }

  601.             }

  602. 

  603.             if(bS[0]+bS[1]+bS[2]+bS[3] == 0)

  604.                 continue;

  605.         }

  606. 

  607.         /* Filter edge */

  608.         // Do not use s->qscale as luma quantizer because it has not the same

  609.         // value in IPCM macroblocks.

  610.         qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;

  611.         //tprintf(s->avctx, "filter mb:%d/%d dir:%d edge:%d, QPy:%d, QPc:%d, QPcn:%d\n", mb_x, mb_y, dir, edge, qp, h->chroma_qp[0], s->current_picture.qscale_table[mbn_xy]);

  612.         tprintf(s->avctx, "filter mb:%d/%d dir:%d edge:%d, QPy:%d ls:%d uvls:%d", mb_x, mb_y, dir, edge, qp, linesize, uvlinesize);

  613.         //{ int i; for (i = 0; i < 4; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }

  614.         if( dir == 0 ) {

  615.             filter_mb_edgev( h, &img_y[4*edge], linesize, bS, qp );

  616.             if( (edge&1) == 0 ) {

  617.                 filter_mb_edgecv( h, &img_cb[2*edge], uvlinesize, bS,

  618.                                   ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);

  619.                 filter_mb_edgecv( h, &img_cr[2*edge], uvlinesize, bS,

  620.                                   ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);

  621.             }

  622.         } else {

  623.             filter_mb_edgeh( h, &img_y[4*edge*linesize], linesize, bS, qp );

  624.             if( (edge&1) == 0 ) {

  625.                 filter_mb_edgech( h, &img_cb[2*edge*uvlinesize], uvlinesize, bS,

  626.                                   ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);

  627.                 filter_mb_edgech( h, &img_cr[2*edge*uvlinesize], uvlinesize, bS,

  628.                                   ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);

  629.             }

  630.         }

  631.     }

  632. }

  633. 

  634. void ff_h264_filter_mb( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize) {

  635.     MpegEncContext * const s = &h->s;

  636.     const int mb_xy= mb_x + mb_y*s->mb_stride;

  637.     const int mb_type = s->current_picture.mb_type[mb_xy];

  638.     const int mvy_limit = IS_INTERLACED(mb_type) ? 2 : 4;

  639.     int first_vertical_edge_done = 0;

  640.     av_unused int dir;

  641.     int list;

  642. 

  643.     if (FRAME_MBAFF

  644.             // left mb is in picture

  645.             && h->slice_table[mb_xy-1] != 0xFFFF

  646.             // and current and left pair do not have the same interlaced type

  647.             && (IS_INTERLACED(mb_type) != IS_INTERLACED(s->current_picture.mb_type[mb_xy-1]))

  648.             // and left mb is in the same slice if deblocking_filter == 2

  649.             && (h->deblocking_filter!=2 || h->slice_table[mb_xy-1] == h->slice_num)) {

  650.         /* First vertical edge is different in MBAFF frames

  651.          * There are 8 different bS to compute and 2 different Qp

  652.          */

  653.         const int pair_xy = mb_x + (mb_y&~1)*s->mb_stride;

  654.         const int left_mb_xy[2] = { pair_xy-1, pair_xy-1+s->mb_stride };

  655.         int16_t bS[8];

  656.         int qp[2];

  657.         int bqp[2];

  658.         int rqp[2];

  659.         int mb_qp, mbn0_qp, mbn1_qp;

  660.         int i;

  661.         first_vertical_edge_done = 1;

  662. 

  663.         if( IS_INTRA(mb_type) )

  664.             bS[0] = bS[1] = bS[2] = bS[3] = bS[4] = bS[5] = bS[6] = bS[7] = 4;

  665.         else {

  666.             for( i = 0; i < 8; i++ ) {

  667.                 int mbn_xy = MB_FIELD ? left_mb_xy[i>>2] : left_mb_xy[i&1];

  668. 

  669.                 if( IS_INTRA( s->current_picture.mb_type[mbn_xy] ) )

  670.                     bS[i] = 4;

  671.                 else if( h->non_zero_count_cache[12+8*(i>>1)] != 0 ||

  672.                          ((!h->pps.cabac && IS_8x8DCT(s->current_picture.mb_type[mbn_xy])) ?

  673.                             (h->cbp_table[mbn_xy] & ((MB_FIELD ? (i&2) : (mb_y&1)) ? 8 : 2))

  674.                                                                        :

  675.                             h->non_zero_count[mbn_xy][7+(MB_FIELD ? (i&3) : (i>>2)+(mb_y&1)*2)*8]))

  676.                     bS[i] = 2;

  677.                 else

  678.                     bS[i] = 1;

  679.             }

  680.         }

  681. 

  682.         mb_qp = s->current_picture.qscale_table[mb_xy];

  683.         mbn0_qp = s->current_picture.qscale_table[left_mb_xy[0]];

  684.         mbn1_qp = s->current_picture.qscale_table[left_mb_xy[1]];

  685.         qp[0] = ( mb_qp + mbn0_qp + 1 ) >> 1;

  686.         bqp[0] = ( get_chroma_qp( h, 0, mb_qp ) +

  687.                    get_chroma_qp( h, 0, mbn0_qp ) + 1 ) >> 1;

  688.         rqp[0] = ( get_chroma_qp( h, 1, mb_qp ) +

  689.                    get_chroma_qp( h, 1, mbn0_qp ) + 1 ) >> 1;

  690.         qp[1] = ( mb_qp + mbn1_qp + 1 ) >> 1;

  691.         bqp[1] = ( get_chroma_qp( h, 0, mb_qp ) +

  692.                    get_chroma_qp( h, 0, mbn1_qp ) + 1 ) >> 1;

  693.         rqp[1] = ( get_chroma_qp( h, 1, mb_qp ) +

  694.                    get_chroma_qp( h, 1, mbn1_qp ) + 1 ) >> 1;

  695. 

  696.         /* Filter edge */

  697.         tprintf(s->avctx, "filter mb:%d/%d MBAFF, QPy:%d/%d, QPb:%d/%d QPr:%d/%d ls:%d uvls:%d", mb_x, mb_y, qp[0], qp[1], bqp[0], bqp[1], rqp[0], rqp[1], linesize, uvlinesize);

  698.         { int i; for (i = 0; i < 8; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }

  699.         if(MB_FIELD){

  700.             filter_mb_mbaff_edgev ( h, img_y                ,   linesize, bS  , 1, qp [0] );

  701.             filter_mb_mbaff_edgev ( h, img_y  + 8*  linesize,   linesize, bS+4, 1, qp [1] );

  702.             filter_mb_mbaff_edgecv( h, img_cb,                uvlinesize, bS  , 1, bqp[0] );

  703.             filter_mb_mbaff_edgecv( h, img_cb + 4*uvlinesize, uvlinesize, bS+4, 1, bqp[1] );

  704.             filter_mb_mbaff_edgecv( h, img_cr,                uvlinesize, bS  , 1, rqp[0] );

  705.             filter_mb_mbaff_edgecv( h, img_cr + 4*uvlinesize, uvlinesize, bS+4, 1, rqp[1] );

  706.         }else{

  707.             filter_mb_mbaff_edgev ( h, img_y              , 2*  linesize, bS  , 2, qp [0] );

  708.             filter_mb_mbaff_edgev ( h, img_y  +   linesize, 2*  linesize, bS+1, 2, qp [1] );

  709.             filter_mb_mbaff_edgecv( h, img_cb,              2*uvlinesize, bS  , 2, bqp[0] );

  710.             filter_mb_mbaff_edgecv( h, img_cb + uvlinesize, 2*uvlinesize, bS+1, 2, bqp[1] );

  711.             filter_mb_mbaff_edgecv( h, img_cr,              2*uvlinesize, bS  , 2, rqp[0] );

  712.             filter_mb_mbaff_edgecv( h, img_cr + uvlinesize, 2*uvlinesize, bS+1, 2, rqp[1] );

  713.         }

  714.     }

  715. 

  716. #if CONFIG_SMALL

  717.     for( dir = 0; dir < 2; dir++ )

  718.         filter_mb_dir(h, mb_x, mb_y, img_y, img_cb, img_cr, linesize, uvlinesize, mb_xy, mb_type, mvy_limit, dir ? 0 : first_vertical_edge_done, dir);

  719. #else

  720.     filter_mb_dir(h, mb_x, mb_y, img_y, img_cb, img_cr, linesize, uvlinesize, mb_xy, mb_type, mvy_limit, first_vertical_edge_done, 0);

  721.     filter_mb_dir(h, mb_x, mb_y, img_y, img_cb, img_cr, linesize, uvlinesize, mb_xy, mb_type, mvy_limit, 0, 1);

  722. #endif

  723. }