/*COPYRIGHT, LICENSE AND WARRANTY INFORMATIONThis software module has been originally developed by Nokia Corporation. Provided that a person, entity or a company willing to use the Software (hereinafter Licensee) comply with all the terms and conditions of this Statement and subject to the limitations set forth in this Statement Nokia grants to such Licensee a non-exclusive, sub-licensable, worldwide, limited license under copyrights owned by Nokia to use the Software for the sole purpose of creating, manufacturing, selling, marketing, or  distributing (including the right to make modifications to the Software) a fully compliant decoder implementation (hereinafter "Decoder") of ITU-T Recommendation H.264 / ISO/IEC International Standard 14496-10 and an encoder implementation producing output that is decodable with the Decoder.Nokia retains the ownership of copyrights to the Software. There is no patent nor other intellectual property right of Nokia licensed under this Statement (except the copyright license above). Licensee hereby assumes sole responsibility to secure any other intellectual property rights needed, if any. For example, if patent licenses  are required, it is their responsibility to acquire the license before utilizing the Software.The license by Nokia is subject to that the Licensee grants to Nokia the non-exclusive, worldwide, royalty-free, perpetual and irrevocable covenant that the Licensee(s) shall not bring a suit before any court or administrative agency or otherwise assert a claim for infringement under the Licensee intellectual property rights that, but for a license, would be infringed by the Software against     (a)  Nokia or Nokia's Affiliate; or     (b)  other recipient of a license and covenant not to sue with respect         to the Software from Nokia; or    (c)  contractor, customer or distributor of a party listed above in a         or b,  which suit or claim is related to the Software or use thereof.The Licensee(s) further agrees to grant a reciprocal license to Nokia (as granted by Nokia to the Licensee(s) on the modifications made by Licensee(s) to the Software. THE SOFTWARE IS PROVIDED "AS IS" AND THE ORIGINAL DEVELOPER DISCLAIMS ANY AND ALL WARRANTIES WHETHER EXPRESS, IMPLIED OR STATUTORY, INCLUDING BUT NOT LIMITED TO THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. THOSE INTENDING TO USE THE SOFTWARE ARE EXPRESSLY ADVISED THAT ITS USE MAY INFRINGE EXISTING PATENTS AND BE SUBJECT TO ROYALTY PAYMENTS TO PATENT OWNERS. ANYONE USING THE SOFTWARE ON THE BASIS OF THIS LICENSE AGREES TO OBTAIN THE NECESSARY PERMISSIONS FROM ANY AND ALL APPLICABLE PATENT OWNERS FOR SUCH USE.IN NO EVENT SHALL THE ORIGINAL DEVELOPER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.This copyright, license and warranty information notice must be retained in all copies and derivative works of the Software or substantial portions thereof.*/#include <stdlib.h>#include "globals.h"#include "loopfilter.h"typedef struct abIdx_s_ {  int alphaIdx;  int betaIdx;  int alphaIdxC;  int betaIdxC;} abIdx_s;static const u_int8 alphaTab[52] = {                    0,  0,  0,  0,    0,  0,  0,  0,  0,  0,  0,  0,    0,  0,  0,  0,  4,  4,  5,  6,    7,  8,  9, 10, 12, 13, 15, 17,   20, 22, 25, 28, 32, 36, 40, 45,   50, 56, 63, 71, 80, 90,101,113,  127,144,162,182,203,226,255,255};static const u_int8 betaTab[52] = {               0, 0, 0, 0,   0, 0, 0, 0, 0, 0, 0, 0,   0, 0, 0, 0, 2, 2, 2, 3,   3, 3, 3, 4, 4, 4, 6, 6,   7, 7, 8, 8, 9, 9,10,10,  11,11,12,12,13,13,14,14,  15,15,16,16,17,17,18,18};static const int8 clipTab[52][4] = {  { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0},  { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0},  { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0},  { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0}, { 0, 0, 0, 0},  { 0, 0, 0, 0}, { 0, 0, 1, 1}, { 0, 0, 1, 1}, { 0, 0, 1, 1},  { 0, 0, 1, 1}, { 0, 1, 1, 1}, { 0, 1, 1, 1}, { 1, 1, 1, 1},  { 1, 1, 1, 1}, { 1, 1, 1, 1}, { 1, 1, 1, 1}, { 1, 1, 2, 2},  { 1, 1, 2, 2}, { 1, 1, 2, 2}, { 1, 1, 2, 2}, { 1, 2, 3, 3},  { 1, 2, 3, 3}, { 2, 2, 3, 3}, { 2, 2, 4, 4}, { 2, 3, 4, 4},  { 2, 3, 4, 4}, { 3, 3, 5, 5}, { 3, 4, 6, 6}, { 3, 4, 6, 6},  { 4, 5, 7, 7}, { 4, 5, 8, 8}, { 4, 6, 9, 9}, { 5, 7,10,10},  { 6, 8,11,11}, { 6, 8,13,13}, { 7,10,14,14}, { 8,11,16,16},  { 9,12,18,18}, {10,13,20,20}, {11,15,23,23}, {13,17,25,25}};static void loopLuma(u_int8 *dest, int dir, int alphaIdx,                     int betaIdx, int edgeDir, int str);static void loopChroma(u_int8 *dest, int dir, int alphaIdx, int betaIdx,                       int edgeDir, int str, u_int8 *dest2);/* * * loopLuma: * * Parameters: *      dest                  Pixels to be filtered *      dir                   Filter direction (horiz/vert) *      edgeDir               Edge direction (horiz/vert) *      alphaIdx              Filter alpha index *      betaIdx               Filter beta index *      str                   Edge strength * * Function: *      Filter 4 pixel luma edge. * * Returns: *      - * */static void loopLuma(u_int8 *dest, int dir, int alphaIdx,                     int betaIdx, int edgeDir, int str){  int i;  int alpha, beta;  int delta;  int diff, c0, c;  int orig[2*BLK_SIZE];  int tmpSum;  alpha = alphaTab[alphaIdx];  beta = betaTab[betaIdx];  c0 = clipTab[alphaIdx][str-1];  for (i = 0; i < BLK_SIZE; i++, dest+=edgeDir) {    orig[2] = dest[-2*dir];    orig[3] = dest[  -dir];    orig[4] = dest[     0];    orig[5] = dest[   dir];    /* The step across the block boundaries */    delta = abs(orig[3]-orig[4]);        /* Find right activity parameter dr and left activity parameter dl */    if (delta < alpha && abs(orig[4]-orig[5]) < beta &&                         abs(orig[3]-orig[2]) < beta)    {      if (str == 4) {        /*         * Strength values is 4, use long filter         */        if (delta >= ((alpha>>2) + 2)) {          dest[  -dir] = (u_int8)((orig[3] + orig[5] + 2*orig[2] + 2) >> 2);          dest[     0] = (u_int8)((orig[2] + orig[4] + 2*orig[5] + 2) >> 2);        }        else {          orig[1] = dest[-3*dir];          orig[6] = dest[ 2*dir];          if (abs(orig[3]-orig[1]) < beta) {            tmpSum = orig[2] + orig[3] + orig[4] + 2;            dest[  -dir] = (u_int8)((orig[1] + 2*tmpSum + orig[5]) >> 3);            dest[-2*dir] = (u_int8)((orig[1] + tmpSum) >> 2);            dest[-3*dir] = (u_int8)((2*dest[-4*dir] + 3*orig[1] + tmpSum + 2) >> 3);          }          else            dest[  -dir] = (u_int8)((orig[3] + orig[5] + 2*orig[2] + 2) >> 2);          if (abs(orig[4]-orig[6]) < beta) {            tmpSum = orig[3] + orig[4] + orig[5] + 2;            dest[     0] = (u_int8)((orig[2] + 2*tmpSum + orig[6]) >> 3);            dest[   dir] = (u_int8)((tmpSum + orig[6]) >> 2);            dest[ 2*dir] = (u_int8)((2*dest[ 3*dir] + 3*orig[6] + tmpSum + 2) >> 3);          }          else            dest[     0] = (u_int8)((orig[2] + orig[4] + 2*orig[5] + 2) >> 2);        }      }      else {        /*         * Strength value is < 4, use short filter         */        c = c0;        orig[1] = dest[-3*dir];        orig[6] = dest[ 2*dir];        if (abs(orig[3]-orig[1]) < beta) {          diff = (orig[1] + ((orig[3]+orig[4]+1)>>1) - (orig[2]<<1)) >> 1;          diff = clip(-c0, c0, diff);          dest[-2*dir] = (u_int8)(orig[2]+diff);          c++;        }        if (abs(orig[4]-orig[6]) < beta) {          diff = (orig[6] + ((orig[3]+orig[4]+1)>>1) - (orig[5]<<1)) >> 1;          diff = clip(-c0, c0, diff);          dest[dir] = (u_int8)(orig[5]+diff);          c++;        }        diff = (((orig[4]-orig[3])<<2) + (orig[2]-orig[5]) + 4) >> 3;        diff = clip(-c, c, diff);        dest[-dir] = (u_int8)clip(0, 255, orig[3]+diff);        dest[   0] = (u_int8)clip(0, 255, orig[4]-diff);      }    }  }}/* * * loopChroma: * * Parameters: *      dest                  Pixels to be filtered (U) *      dir                   Filter direction (horiz/vert) *      alphaIdx              Filter alpha index *      betaIdx               Filter beta index *      edgeDir               Edge direction (horiz/vert) *      str                   Edge strength *      dest2                 Pixels to be filtered (V) * * Function: *      Filter 2 pixel chroma edge. * * Returns: *      - * */static void loopChroma(u_int8 *dest, int dir, int alphaIdx, int betaIdx,                       int edgeDir, int str, u_int8 *dest2){  int i;  int alpha, beta;  int delta;  int diff, c;  int orig[2*BLK_SIZE];  alpha = alphaTab[alphaIdx];  beta = betaTab[betaIdx];  c = clipTab[alphaIdx][str-1] + 1;  for (i = 0; i < BLK_SIZE; i++, dest+=edgeDir) {    if (i == 2) dest = dest2;    orig[2] = dest[-2*dir];    orig[3] = dest[  -dir];    orig[4] = dest[     0];    orig[5] = dest[   dir];    /* The step across the block boundaries */    delta = abs(orig[3]-orig[4]);        /* Find right activity parameter dr and left activity parameter dl */    if (delta < alpha && abs(orig[4]-orig[5]) < beta &&                         abs(orig[3]-orig[2]) < beta)    {      if (str == 4) {        /*         * Strength values is 4, use long filter         */        dest[  -dir] = (u_int8)((orig[3] + orig[5] + 2*orig[2] + 2) >> 2);        dest[     0] = (u_int8)((orig[2] + orig[4] + 2*orig[5] + 2) >> 2);      }      else {        /*         * Strength value is < 4, use short filter         */        diff = (((orig[4]-orig[3])<<2) + (orig[2]-orig[5]) + 4) >> 3;        diff = clip(-c, c, diff);