2012-06-05 11:01:47 +00:00
|
|
|
/**
|
|
|
|
* Part of HEVC Encoder
|
2013-04-16 08:23:03 +00:00
|
|
|
* By Marko Viitanen ( fador at iki.fi ), Tampere University of Technology, Department of Pervasive Computing.
|
2012-06-05 11:01:47 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*! \file picture.c
|
|
|
|
\brief Functions to handle pictures
|
|
|
|
\author Marko Viitanen
|
2013-04-16 12:10:43 +00:00
|
|
|
\date 2013-04
|
2012-06-05 11:01:47 +00:00
|
|
|
|
|
|
|
This file contains all the needed functions to handle pictures
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "global.h"
|
|
|
|
#include "picture.h"
|
|
|
|
|
2013-04-17 14:08:52 +00:00
|
|
|
|
|
|
|
|
|
|
|
/*!
|
2013-04-18 11:04:15 +00:00
|
|
|
\brief Set block splitflag
|
2013-04-17 14:08:52 +00:00
|
|
|
\param pic picture to use
|
|
|
|
\param xCtb x CU position (smallest CU)
|
|
|
|
\param yCtb y CU position (smallest CU)
|
|
|
|
\param depth current CU depth
|
|
|
|
\param mode mode to set
|
|
|
|
\returns Void
|
|
|
|
*/
|
2013-04-18 11:04:15 +00:00
|
|
|
void picture_setBlockSplit(picture* pic,uint32_t xCtb, uint32_t yCtb, uint8_t depth, int8_t split)
|
|
|
|
{
|
|
|
|
uint32_t x,y,d;
|
|
|
|
//Width in smallest CU
|
|
|
|
int width_in_SCU = pic->width/(LCU_WIDTH>>MAX_DEPTH);
|
|
|
|
int block_SCU_width = (LCU_WIDTH>>depth)/(LCU_WIDTH>>MAX_DEPTH);
|
|
|
|
for(y = yCtb; y < yCtb+block_SCU_width; y++)
|
|
|
|
{
|
|
|
|
int CUpos = y*width_in_SCU;
|
|
|
|
for(x = xCtb; x < xCtb+block_SCU_width; x++)
|
|
|
|
{
|
|
|
|
pic->CU[depth][CUpos+x].split = split;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*!
|
|
|
|
\brief Set block coded status
|
|
|
|
\param pic picture to use
|
|
|
|
\param xCtb x CU position (smallest CU)
|
|
|
|
\param yCtb y CU position (smallest CU)
|
|
|
|
\param depth current CU depth
|
|
|
|
\param coded coded status
|
|
|
|
\returns Void
|
|
|
|
*/
|
2013-04-17 14:08:52 +00:00
|
|
|
void picture_setBlockCoded(picture* pic,uint32_t xCtb, uint32_t yCtb, uint8_t depth, int8_t coded)
|
|
|
|
{
|
|
|
|
uint32_t x,y,d;
|
|
|
|
//Width in smallest CU
|
|
|
|
int width_in_SCU = pic->width/(LCU_WIDTH>>MAX_DEPTH);
|
|
|
|
int block_SCU_width = (LCU_WIDTH>>depth)/(LCU_WIDTH>>MAX_DEPTH);
|
|
|
|
for(y = yCtb; y < yCtb+block_SCU_width; y++)
|
|
|
|
{
|
|
|
|
int CUpos = y*width_in_SCU;
|
|
|
|
for(x = xCtb; x < xCtb+block_SCU_width; x++)
|
2013-04-18 11:04:15 +00:00
|
|
|
{
|
2013-04-17 14:08:52 +00:00
|
|
|
for(d = 0; d < MAX_DEPTH+1; d++)
|
|
|
|
{
|
2013-04-18 11:04:15 +00:00
|
|
|
pic->CU[d][CUpos+x].coded = coded;
|
2013-04-17 14:08:52 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-06-05 11:01:47 +00:00
|
|
|
/** \defgroup picture_group Picture handler group
|
|
|
|
* This group contains all picture related stuff
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
/*!
|
|
|
|
\brief Allocate memory for picture_list
|
|
|
|
\param size initial array size
|
|
|
|
\return picture_list pointer, NULL on failure
|
|
|
|
*/
|
|
|
|
picture_list *picture_list_init(int size)
|
|
|
|
{
|
|
|
|
picture_list *list = (picture_list *)malloc(sizeof(picture_list));
|
|
|
|
list->size = size;
|
|
|
|
if(size > 0)
|
|
|
|
{
|
|
|
|
list->pics = (picture**)malloc(sizeof(picture*)*size);
|
|
|
|
}
|
|
|
|
|
|
|
|
list->used_size = 0;
|
|
|
|
|
|
|
|
return list;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
\brief Resize picture_list array
|
|
|
|
\param list picture_list pointer
|
|
|
|
\param size new array size
|
|
|
|
\return 1 on success, 0 on failure
|
|
|
|
*/
|
|
|
|
int picture_list_resize(picture_list *list, int size)
|
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
picture** old_pics = NULL;
|
|
|
|
|
|
|
|
//No need to do anything when resizing to same size
|
|
|
|
if(size == list->size)
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
//Save the old list
|
|
|
|
if(list->used_size > 0)
|
|
|
|
{
|
|
|
|
old_pics = list->pics;
|
|
|
|
}
|
|
|
|
|
|
|
|
//allocate space for the new list
|
|
|
|
list->pics = (picture**)malloc(sizeof(picture*)*size);
|
|
|
|
|
2013-04-16 08:23:03 +00:00
|
|
|
//Copy everything from the old list to the new if needed.
|
2012-06-05 11:01:47 +00:00
|
|
|
if(old_pics != NULL)
|
|
|
|
{
|
|
|
|
for(i = 0; i < list->used_size; i++)
|
|
|
|
{
|
|
|
|
list->pics[i] = old_pics[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
free(old_pics);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
\brief Free memory allocated to the picture_list
|
|
|
|
\param list picture_list pointer
|
|
|
|
\return 1 on success, 0 on failure
|
|
|
|
*/
|
|
|
|
int picture_list_destroy(picture_list *list)
|
|
|
|
{
|
|
|
|
unsigned int i;
|
|
|
|
if(list->used_size > 0)
|
|
|
|
{
|
|
|
|
for(i = 0; i < list->used_size; i++)
|
|
|
|
{
|
|
|
|
picture_destroy(list->pics[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(list->size > 0)
|
|
|
|
{
|
|
|
|
free(list->pics);
|
|
|
|
}
|
|
|
|
free(list);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
\brief Free memory allocated to picture
|
|
|
|
\param pic picture pointer
|
|
|
|
\return 1 on success, 0 on failure
|
|
|
|
*/
|
|
|
|
int picture_destroy(picture *pic)
|
|
|
|
{
|
|
|
|
free(pic->uData);
|
|
|
|
free(pic->vData);
|
|
|
|
free(pic->yData);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-03-12 15:06:21 +00:00
|
|
|
/** @} */ // end of group1
|
|
|
|
|
|
|
|
|
|
|
|
#include <math.h>
|
2013-03-13 13:56:43 +00:00
|
|
|
#define PSNRMAX (255.0*255.0)
|
2013-03-12 15:06:21 +00:00
|
|
|
|
|
|
|
//Calculates image PSNR value
|
2013-04-05 13:27:18 +00:00
|
|
|
double imagePSNR(uint8_t *frame1, uint8_t *frame2, int32_t x, int32_t y)
|
2013-03-12 15:06:21 +00:00
|
|
|
{
|
2013-04-05 13:27:18 +00:00
|
|
|
int64_t MSE=0;
|
|
|
|
int64_t MSEtemp=0;
|
2013-04-03 08:05:07 +00:00
|
|
|
double psnr=0.0;
|
2013-04-05 13:27:18 +00:00
|
|
|
double pixels = x*y;
|
2013-04-03 08:05:07 +00:00
|
|
|
int32_t index;
|
2013-03-12 15:06:21 +00:00
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
//Calculate MSE
|
2013-04-05 13:27:18 +00:00
|
|
|
for(index = 0; index < x*y; index++)
|
2013-04-03 08:05:07 +00:00
|
|
|
{
|
|
|
|
MSEtemp=frame1[index]-frame2[index];
|
|
|
|
MSE+=MSEtemp*MSEtemp;
|
|
|
|
}
|
2013-03-12 15:06:21 +00:00
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
//Avoid division by zero
|
|
|
|
if(MSE==0) return 99.0;
|
2013-03-12 15:06:21 +00:00
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
//The PSNR
|
2013-04-05 13:27:18 +00:00
|
|
|
psnr=10*log10(PSNRMAX/((double)MSE/pixels));
|
2013-03-12 15:06:21 +00:00
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
//Thats it.
|
|
|
|
return psnr;
|
2013-03-12 15:06:21 +00:00
|
|
|
}
|
|
|
|
|
2013-04-04 12:08:28 +00:00
|
|
|
uint32_t Hadamard8x8(int16_t *piOrg, int16_t *piCur, int32_t iStrideOrg, int32_t iStrideCur)
|
|
|
|
{
|
|
|
|
int32_t k, i, j, jj, sad=0;
|
|
|
|
int32_t diff[64], m1[8][8], m2[8][8], m3[8][8];
|
|
|
|
for( k = 0; k < 64; k += 8 )
|
|
|
|
{
|
|
|
|
diff[k+0] = piOrg[0] - piCur[0];
|
|
|
|
diff[k+1] = piOrg[1] - piCur[1];
|
|
|
|
diff[k+2] = piOrg[2] - piCur[2];
|
|
|
|
diff[k+3] = piOrg[3] - piCur[3];
|
|
|
|
diff[k+4] = piOrg[4] - piCur[4];
|
|
|
|
diff[k+5] = piOrg[5] - piCur[5];
|
|
|
|
diff[k+6] = piOrg[6] - piCur[6];
|
|
|
|
diff[k+7] = piOrg[7] - piCur[7];
|
|
|
|
|
|
|
|
piCur += iStrideCur;
|
|
|
|
piOrg += iStrideOrg;
|
|
|
|
}
|
|
|
|
|
|
|
|
//horizontal
|
|
|
|
for (j=0; j < 8; j++)
|
|
|
|
{
|
|
|
|
jj = j << 3;
|
|
|
|
m2[j][0] = diff[jj ] + diff[jj+4];
|
|
|
|
m2[j][1] = diff[jj+1] + diff[jj+5];
|
|
|
|
m2[j][2] = diff[jj+2] + diff[jj+6];
|
|
|
|
m2[j][3] = diff[jj+3] + diff[jj+7];
|
|
|
|
m2[j][4] = diff[jj ] - diff[jj+4];
|
|
|
|
m2[j][5] = diff[jj+1] - diff[jj+5];
|
|
|
|
m2[j][6] = diff[jj+2] - diff[jj+6];
|
|
|
|
m2[j][7] = diff[jj+3] - diff[jj+7];
|
|
|
|
|
|
|
|
m1[j][0] = m2[j][0] + m2[j][2];
|
|
|
|
m1[j][1] = m2[j][1] + m2[j][3];
|
|
|
|
m1[j][2] = m2[j][0] - m2[j][2];
|
|
|
|
m1[j][3] = m2[j][1] - m2[j][3];
|
|
|
|
m1[j][4] = m2[j][4] + m2[j][6];
|
|
|
|
m1[j][5] = m2[j][5] + m2[j][7];
|
|
|
|
m1[j][6] = m2[j][4] - m2[j][6];
|
|
|
|
m1[j][7] = m2[j][5] - m2[j][7];
|
|
|
|
|
|
|
|
m2[j][0] = m1[j][0] + m1[j][1];
|
|
|
|
m2[j][1] = m1[j][0] - m1[j][1];
|
|
|
|
m2[j][2] = m1[j][2] + m1[j][3];
|
|
|
|
m2[j][3] = m1[j][2] - m1[j][3];
|
|
|
|
m2[j][4] = m1[j][4] + m1[j][5];
|
|
|
|
m2[j][5] = m1[j][4] - m1[j][5];
|
|
|
|
m2[j][6] = m1[j][6] + m1[j][7];
|
|
|
|
m2[j][7] = m1[j][6] - m1[j][7];
|
|
|
|
}
|
|
|
|
|
|
|
|
//vertical
|
|
|
|
for (i=0; i < 8; i++)
|
|
|
|
{
|
|
|
|
m3[0][i] = m2[0][i] + m2[4][i];
|
|
|
|
m3[1][i] = m2[1][i] + m2[5][i];
|
|
|
|
m3[2][i] = m2[2][i] + m2[6][i];
|
|
|
|
m3[3][i] = m2[3][i] + m2[7][i];
|
|
|
|
m3[4][i] = m2[0][i] - m2[4][i];
|
|
|
|
m3[5][i] = m2[1][i] - m2[5][i];
|
|
|
|
m3[6][i] = m2[2][i] - m2[6][i];
|
|
|
|
m3[7][i] = m2[3][i] - m2[7][i];
|
|
|
|
|
|
|
|
m1[0][i] = m3[0][i] + m3[2][i];
|
|
|
|
m1[1][i] = m3[1][i] + m3[3][i];
|
|
|
|
m1[2][i] = m3[0][i] - m3[2][i];
|
|
|
|
m1[3][i] = m3[1][i] - m3[3][i];
|
|
|
|
m1[4][i] = m3[4][i] + m3[6][i];
|
|
|
|
m1[5][i] = m3[5][i] + m3[7][i];
|
|
|
|
m1[6][i] = m3[4][i] - m3[6][i];
|
|
|
|
m1[7][i] = m3[5][i] - m3[7][i];
|
|
|
|
|
|
|
|
m2[0][i] = m1[0][i] + m1[1][i];
|
|
|
|
m2[1][i] = m1[0][i] - m1[1][i];
|
|
|
|
m2[2][i] = m1[2][i] + m1[3][i];
|
|
|
|
m2[3][i] = m1[2][i] - m1[3][i];
|
|
|
|
m2[4][i] = m1[4][i] + m1[5][i];
|
|
|
|
m2[5][i] = m1[4][i] - m1[5][i];
|
|
|
|
m2[6][i] = m1[6][i] + m1[7][i];
|
|
|
|
m2[7][i] = m1[6][i] - m1[7][i];
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < 8; i++)
|
|
|
|
{
|
|
|
|
for (j = 0; j < 8; j++)
|
|
|
|
{
|
|
|
|
sad += abs(m2[i][j]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
sad=((sad+2)>>2);
|
|
|
|
|
|
|
|
return sad;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-03-12 15:06:21 +00:00
|
|
|
//Sum of Absolute Difference for block
|
|
|
|
uint32_t SAD(uint8_t *block,uint8_t* block2, uint32_t x, uint32_t y)
|
|
|
|
{
|
2013-04-03 08:05:07 +00:00
|
|
|
uint32_t i;
|
|
|
|
uint32_t sum=0;
|
|
|
|
for(i=0;i<x*y;i+=4)
|
|
|
|
{
|
|
|
|
sum+=abs((int32_t)block[i]-(int32_t)block2[i]);
|
|
|
|
sum+=abs((int32_t)block[i+1]-(int32_t)block2[i+1]);
|
|
|
|
sum+=abs((int32_t)block[i+2]-(int32_t)block2[i+2]);
|
|
|
|
sum+=abs((int32_t)block[i+3]-(int32_t)block2[i+3]);
|
|
|
|
}
|
2013-03-12 15:06:21 +00:00
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
return sum;
|
2013-03-12 15:06:21 +00:00
|
|
|
}
|
|
|
|
|
2013-03-25 15:17:24 +00:00
|
|
|
uint32_t SAD64x64(int16_t *block,uint32_t stride1,int16_t* block2, uint32_t stride2)
|
|
|
|
{
|
2013-04-03 08:05:07 +00:00
|
|
|
int32_t i,ii,y,x;
|
|
|
|
uint32_t sum=0;
|
|
|
|
for(y=0;y<64;y++)
|
|
|
|
{
|
|
|
|
i = y*stride1;
|
|
|
|
ii = y*stride2;
|
|
|
|
for(x = 0; x < 64;x++)
|
2013-03-25 15:17:24 +00:00
|
|
|
{
|
2013-04-03 08:05:07 +00:00
|
|
|
sum+=abs((int32_t)block[i+x]-(int32_t)block2[ii+x]);
|
2013-03-25 15:17:24 +00:00
|
|
|
}
|
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return sum;
|
2013-03-25 15:17:24 +00:00
|
|
|
}
|
|
|
|
|
2013-03-12 15:06:21 +00:00
|
|
|
uint32_t SAD32x32(int16_t *block,uint32_t stride1,int16_t* block2, uint32_t stride2)
|
|
|
|
{
|
2013-04-18 11:04:15 +00:00
|
|
|
int32_t y;
|
|
|
|
|
|
|
|
int32_t x,sum = 0;
|
|
|
|
int32_t iOffsetOrg = stride1<<3;
|
|
|
|
int32_t iOffsetCur = stride2<<3;
|
|
|
|
for ( y=0; y<32; y+= 8 )
|
|
|
|
{
|
|
|
|
for ( x=0; x<32; x+= 8 )
|
|
|
|
{
|
|
|
|
sum += Hadamard8x8( &block[x], &block2[x], stride1, stride2 );
|
|
|
|
}
|
|
|
|
block += iOffsetOrg;
|
|
|
|
block2 += iOffsetCur;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2013-04-03 08:05:07 +00:00
|
|
|
uint32_t sum=0;
|
2013-04-18 11:04:15 +00:00
|
|
|
int32_t i,ii;
|
2013-04-03 08:05:07 +00:00
|
|
|
for(y=0;y<32;y++)
|
|
|
|
{
|
|
|
|
i = y*stride1;
|
|
|
|
ii = y*stride2;
|
|
|
|
sum+=abs((int32_t)block[i]-(int32_t)block2[ii]);
|
|
|
|
sum+=abs((int32_t)block[i+1]-(int32_t)block2[ii+1]);
|
|
|
|
sum+=abs((int32_t)block[i+2]-(int32_t)block2[ii+2]);
|
|
|
|
sum+=abs((int32_t)block[i+3]-(int32_t)block2[ii+3]);
|
|
|
|
sum+=abs((int32_t)block[i+4]-(int32_t)block2[ii+4]);
|
|
|
|
sum+=abs((int32_t)block[i+5]-(int32_t)block2[ii+5]);
|
|
|
|
sum+=abs((int32_t)block[i+6]-(int32_t)block2[ii+6]);
|
|
|
|
sum+=abs((int32_t)block[i+7]-(int32_t)block2[ii+7]);
|
|
|
|
sum+=abs((int32_t)block[i+8]-(int32_t)block2[ii+8]);
|
|
|
|
sum+=abs((int32_t)block[i+9]-(int32_t)block2[ii+9]);
|
|
|
|
sum+=abs((int32_t)block[i+10]-(int32_t)block2[ii+10]);
|
|
|
|
sum+=abs((int32_t)block[i+11]-(int32_t)block2[ii+11]);
|
|
|
|
sum+=abs((int32_t)block[i+12]-(int32_t)block2[ii+12]);
|
|
|
|
sum+=abs((int32_t)block[i+13]-(int32_t)block2[ii+13]);
|
|
|
|
sum+=abs((int32_t)block[i+14]-(int32_t)block2[ii+14]);
|
|
|
|
sum+=abs((int32_t)block[i+15]-(int32_t)block2[ii+15]);
|
|
|
|
sum+=abs((int32_t)block[i+16]-(int32_t)block2[ii+16]);
|
|
|
|
sum+=abs((int32_t)block[i+17]-(int32_t)block2[ii+17]);
|
|
|
|
sum+=abs((int32_t)block[i+18]-(int32_t)block2[ii+18]);
|
|
|
|
sum+=abs((int32_t)block[i+19]-(int32_t)block2[ii+19]);
|
|
|
|
sum+=abs((int32_t)block[i+20]-(int32_t)block2[ii+20]);
|
|
|
|
sum+=abs((int32_t)block[i+21]-(int32_t)block2[ii+21]);
|
|
|
|
sum+=abs((int32_t)block[i+22]-(int32_t)block2[ii+22]);
|
|
|
|
sum+=abs((int32_t)block[i+23]-(int32_t)block2[ii+23]);
|
|
|
|
sum+=abs((int32_t)block[i+24]-(int32_t)block2[ii+24]);
|
|
|
|
sum+=abs((int32_t)block[i+25]-(int32_t)block2[ii+25]);
|
|
|
|
sum+=abs((int32_t)block[i+26]-(int32_t)block2[ii+26]);
|
|
|
|
sum+=abs((int32_t)block[i+27]-(int32_t)block2[ii+27]);
|
|
|
|
sum+=abs((int32_t)block[i+28]-(int32_t)block2[ii+28]);
|
|
|
|
sum+=abs((int32_t)block[i+29]-(int32_t)block2[ii+29]);
|
|
|
|
sum+=abs((int32_t)block[i+30]-(int32_t)block2[ii+30]);
|
|
|
|
sum+=abs((int32_t)block[i+31]-(int32_t)block2[ii+31]);
|
|
|
|
}
|
2013-04-18 11:04:15 +00:00
|
|
|
*/
|
2013-04-03 08:05:07 +00:00
|
|
|
return sum;
|
2013-03-12 15:06:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
uint32_t SAD16x16(int16_t *block,uint32_t stride1,int16_t* block2, uint32_t stride2)
|
|
|
|
{
|
2013-04-18 11:04:15 +00:00
|
|
|
int32_t y;
|
|
|
|
|
2013-04-04 12:08:28 +00:00
|
|
|
int32_t x,sum = 0;
|
|
|
|
int32_t iOffsetOrg = stride1<<3;
|
|
|
|
int32_t iOffsetCur = stride2<<3;
|
|
|
|
for ( y=0; y<16; y+= 8 )
|
|
|
|
{
|
|
|
|
for ( x=0; x<16; x+= 8 )
|
|
|
|
{
|
|
|
|
sum += Hadamard8x8( &block[x], &block2[x], stride1, stride2 );
|
|
|
|
}
|
|
|
|
block += iOffsetOrg;
|
|
|
|
block2 += iOffsetCur;
|
|
|
|
}
|
2013-04-05 13:27:18 +00:00
|
|
|
|
2013-04-18 11:04:15 +00:00
|
|
|
|
|
|
|
/*
|
2013-04-03 08:05:07 +00:00
|
|
|
uint32_t sum=0;
|
2013-04-18 11:04:15 +00:00
|
|
|
int32_t i,ii;
|
2013-04-03 08:05:07 +00:00
|
|
|
for(y=0;y<16;y++)
|
|
|
|
{
|
|
|
|
i = y*stride1;
|
|
|
|
ii = y*stride2;
|
|
|
|
sum+=abs((int32_t)block[i]-(int32_t)block2[ii]);
|
|
|
|
sum+=abs((int32_t)block[i+1]-(int32_t)block2[ii+1]);
|
|
|
|
sum+=abs((int32_t)block[i+2]-(int32_t)block2[ii+2]);
|
|
|
|
sum+=abs((int32_t)block[i+3]-(int32_t)block2[ii+3]);
|
|
|
|
sum+=abs((int32_t)block[i+4]-(int32_t)block2[ii+4]);
|
|
|
|
sum+=abs((int32_t)block[i+5]-(int32_t)block2[ii+5]);
|
|
|
|
sum+=abs((int32_t)block[i+6]-(int32_t)block2[ii+6]);
|
|
|
|
sum+=abs((int32_t)block[i+7]-(int32_t)block2[ii+7]);
|
|
|
|
sum+=abs((int32_t)block[i+8]-(int32_t)block2[ii+8]);
|
|
|
|
sum+=abs((int32_t)block[i+9]-(int32_t)block2[ii+9]);
|
|
|
|
sum+=abs((int32_t)block[i+10]-(int32_t)block2[ii+10]);
|
|
|
|
sum+=abs((int32_t)block[i+11]-(int32_t)block2[ii+11]);
|
|
|
|
sum+=abs((int32_t)block[i+12]-(int32_t)block2[ii+12]);
|
|
|
|
sum+=abs((int32_t)block[i+13]-(int32_t)block2[ii+13]);
|
|
|
|
sum+=abs((int32_t)block[i+14]-(int32_t)block2[ii+14]);
|
|
|
|
sum+=abs((int32_t)block[i+15]-(int32_t)block2[ii+15]);
|
|
|
|
}
|
2013-04-18 11:04:15 +00:00
|
|
|
*/
|
2013-04-03 08:05:07 +00:00
|
|
|
return sum;
|
2013-03-14 15:55:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
uint32_t SAD8x8(int16_t *block,uint32_t stride1,int16_t* block2, uint32_t stride2)
|
|
|
|
{
|
2013-04-03 08:05:07 +00:00
|
|
|
int32_t i,ii,y;
|
|
|
|
uint32_t sum=0;
|
|
|
|
for(y=0;y<8;y++)
|
|
|
|
{
|
|
|
|
i = y*stride1;
|
|
|
|
ii = y*stride2;
|
|
|
|
sum+=abs((int32_t)block[i]-(int32_t)block2[ii]);
|
|
|
|
sum+=abs((int32_t)block[i+1]-(int32_t)block2[ii+1]);
|
|
|
|
sum+=abs((int32_t)block[i+2]-(int32_t)block2[ii+2]);
|
|
|
|
sum+=abs((int32_t)block[i+3]-(int32_t)block2[ii+3]);
|
|
|
|
sum+=abs((int32_t)block[i+4]-(int32_t)block2[ii+4]);
|
|
|
|
sum+=abs((int32_t)block[i+5]-(int32_t)block2[ii+5]);
|
|
|
|
sum+=abs((int32_t)block[i+6]-(int32_t)block2[ii+6]);
|
|
|
|
sum+=abs((int32_t)block[i+7]-(int32_t)block2[ii+7]);
|
|
|
|
}
|
2013-03-14 15:55:06 +00:00
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
return sum;
|
2013-03-14 15:55:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t SAD4x4(int16_t *block,uint32_t stride1,int16_t* block2, uint32_t stride2)
|
|
|
|
{
|
2013-04-03 08:05:07 +00:00
|
|
|
int32_t i,ii,y;
|
|
|
|
uint32_t sum=0;
|
|
|
|
for(y=0;y<4;y++)
|
|
|
|
{
|
|
|
|
i = y*stride1;
|
|
|
|
ii = y*stride2;
|
|
|
|
sum+=abs((int32_t)block[i]-(int32_t)block2[ii]);
|
|
|
|
sum+=abs((int32_t)block[i+1]-(int32_t)block2[ii+1]);
|
|
|
|
sum+=abs((int32_t)block[i+2]-(int32_t)block2[ii+2]);
|
|
|
|
sum+=abs((int32_t)block[i+3]-(int32_t)block2[ii+3]);
|
|
|
|
}
|
2013-03-12 15:06:21 +00:00
|
|
|
|
2013-04-03 08:05:07 +00:00
|
|
|
return sum;
|
2013-03-12 15:06:21 +00:00
|
|
|
}
|