--- trunk/xvidcore/src/motion/sad.c 2003/02/15 08:39:17 850 +++ trunk/xvidcore/src/motion/sad.c 2003/02/15 15:22:19 851 @@ -1,115 +1,56 @@ -/***************************************************************************** +/************************************************************************** * - * XVID MPEG-4 VIDEO CODEC - * - SAD calculation module (C part) - + * XVID MPEG-4 VIDEO CODEC + * sum of absolute difference * - * Copyright(C) 2002 Michael Militzer - * 2002 Peter Ross + * This program is an implementation of a part of one or more MPEG-4 + * Video tools as specified in ISO/IEC 14496-2 standard. Those intending + * to use this software module in hardware or software products are + * advised that its use may infringe existing patents or copyrights, and + * any such use would be at such party's own risk. The original + * developer of this software module and his/her company, and subsequent + * editors and their companies, will have no liability for use of this + * software or modifications or derivatives thereof. * - * This file is part of XviD, a free MPEG-4 video encoder/decoder + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. * - * XviD is free software; you can redistribute it and/or modify it - * under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. * - * This program is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. * - * You should have received a copy of the GNU General Public License - * along with this program; if not, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA - * - * Under section 8 of the GNU General Public License, the copyright - * holders of XVID explicitly forbid distribution in the following - * countries: - * - * - Japan - * - United States of America - * - * Linking XviD statically or dynamically with other modules is making a - * combined work based on XviD. Thus, the terms and conditions of the - * GNU General Public License cover the whole combination. - * - * As a special exception, the copyright holders of XviD give you - * permission to link XviD with independent modules that communicate with - * XviD solely through the VFW1.1 and DShow interfaces, regardless of the - * license terms of these independent modules, and to copy and distribute - * the resulting combined work under terms of your choice, provided that - * every copy of the combined work is accompanied by a complete copy of - * the source code of XviD (the version of XviD used to produce the - * combined work), being distributed under the terms of the GNU General - * Public License plus this exception. An independent module is a module - * which is not derived from or based on XviD. + *************************************************************************/ + +/************************************************************************** * - * Note that people who make modified versions of XviD are not obligated - * to grant this special exception for their modified versions; it is - * their choice whether to do so. The GNU General Public License gives - * permission to release a modified version without this exception; this - * exception also makes it possible to release a modified version which - * carries forward this exception. + * History: * - * $Id: sad.c,v 1.12 2002-11-26 23:44:11 edgomez Exp $ + * 14.02.2002 added sad16bi_c() + * 10.11.2001 initial version; (c)2001 peter ross * - ****************************************************************************/ + *************************************************************************/ + #include "../portab.h" +#include "../global.h" #include "sad.h" sad16FuncPtr sad16; sad8FuncPtr sad8; sad16biFuncPtr sad16bi; -sad8biFuncPtr sad8bi; /* not really sad16, but no difference in prototype */ +sad8biFuncPtr sad8bi; // not really sad16, but no difference in prototype dev16FuncPtr dev16; +sad16vFuncPtr sad16v; sadInitFuncPtr sadInit; -#define ABS(X) (((X)>0)?(X):-(X)) - -#define MRSAD16_CORRFACTOR 8 -uint32_t -mrsad16_c(const uint8_t * const cur, - const uint8_t * const ref, - const uint32_t stride, - const uint32_t best_sad) -{ - - uint32_t sad = 0; - int32_t mean = 0; - uint32_t i, j; - uint8_t const *ptr_cur = cur; - uint8_t const *ptr_ref = ref; - - for (j = 0; j < 16; j++) { - for (i = 0; i < 16; i++) { - mean += ((int) *(ptr_cur + i) - (int) *(ptr_ref + i)); - } - ptr_cur += stride; - ptr_ref += stride; - - } - mean /= 256; - - for (j = 0; j < 16; j++) { - - ptr_cur -= stride; - ptr_ref -= stride; - - for (i = 0; i < 16; i++) { - - sad += ABS(*(ptr_cur + i) - *(ptr_ref + i) - mean); - if (sad >= best_sad) { - return MRSAD16_CORRFACTOR * sad; - } - } - } - - return MRSAD16_CORRFACTOR * sad; - -} - uint32_t sad16_c(const uint8_t * const cur, @@ -119,25 +60,33 @@ { uint32_t sad = 0; - uint32_t i, j; + uint32_t j; uint8_t const *ptr_cur = cur; uint8_t const *ptr_ref = ref; for (j = 0; j < 16; j++) { + sad += ABS(ptr_cur[0] - ptr_ref[0]); + sad += ABS(ptr_cur[1] - ptr_ref[1]); + sad += ABS(ptr_cur[2] - ptr_ref[2]); + sad += ABS(ptr_cur[3] - ptr_ref[3]); + sad += ABS(ptr_cur[4] - ptr_ref[4]); + sad += ABS(ptr_cur[5] - ptr_ref[5]); + sad += ABS(ptr_cur[6] - ptr_ref[6]); + sad += ABS(ptr_cur[7] - ptr_ref[7]); + sad += ABS(ptr_cur[8] - ptr_ref[8]); + sad += ABS(ptr_cur[9] - ptr_ref[9]); + sad += ABS(ptr_cur[10] - ptr_ref[10]); + sad += ABS(ptr_cur[11] - ptr_ref[11]); + sad += ABS(ptr_cur[12] - ptr_ref[12]); + sad += ABS(ptr_cur[13] - ptr_ref[13]); + sad += ABS(ptr_cur[14] - ptr_ref[14]); + sad += ABS(ptr_cur[15] - ptr_ref[15]); - for (i = 0; i < 16; i++) { - - sad += ABS(*(ptr_cur + i) - *(ptr_ref + i)); - - if (sad >= best_sad) { + if (sad >= best_sad) return sad; - } - - } - - ptr_cur += stride; - ptr_ref += stride; + ptr_cur += stride; + ptr_ref += stride; } @@ -145,8 +94,6 @@ } - - uint32_t sad16bi_c(const uint8_t * const cur, const uint8_t * const ref1, @@ -229,16 +176,21 @@ const uint32_t stride) { uint32_t sad = 0; - uint32_t i, j; + uint32_t j; uint8_t const *ptr_cur = cur; uint8_t const *ptr_ref = ref; for (j = 0; j < 8; j++) { - for (i = 0; i < 8; i++) { - sad += ABS(*(ptr_cur + i) - *(ptr_ref + i)); - } - + sad += ABS(ptr_cur[0] - ptr_ref[0]); + sad += ABS(ptr_cur[1] - ptr_ref[1]); + sad += ABS(ptr_cur[2] - ptr_ref[2]); + sad += ABS(ptr_cur[3] - ptr_ref[3]); + sad += ABS(ptr_cur[4] - ptr_ref[4]); + sad += ABS(ptr_cur[5] - ptr_ref[5]); + sad += ABS(ptr_cur[6] - ptr_ref[6]); + sad += ABS(ptr_cur[7] - ptr_ref[7]); + ptr_cur += stride; ptr_ref += stride; @@ -248,8 +200,6 @@ } - - /* average deviation from mean */ uint32_t @@ -285,3 +235,75 @@ return dev; } + +uint32_t sad16v_c(const uint8_t * const cur, + const uint8_t * const ref, + const uint32_t stride, + int32_t *sad) +{ + sad[0] = sad8(cur, ref, stride); + sad[1] = sad8(cur + 8, ref + 8, stride); + sad[2] = sad8(cur + 8*stride, ref + 8*stride, stride); + sad[3] = sad8(cur + 8*stride + 8, ref + 8*stride + 8, stride); + + return sad[0]+sad[1]+sad[2]+sad[3]; +} + +uint32_t sad32v_c(const uint8_t * const cur, + const uint8_t * const ref, + const uint32_t stride, + int32_t *sad) +{ + sad[0] = sad16(cur, ref, stride, 256*4096); + sad[1] = sad16(cur + 8, ref + 8, stride, 256*4096); + sad[2] = sad16(cur + 8*stride, ref + 8*stride, stride, 256*4096); + sad[3] = sad16(cur + 8*stride + 8, ref + 8*stride + 8, stride, 256*4096); + + return sad[0]+sad[1]+sad[2]+sad[3]; +} + + + +#define MRSAD16_CORRFACTOR 8 +uint32_t +mrsad16_c(const uint8_t * const cur, + const uint8_t * const ref, + const uint32_t stride, + const uint32_t best_sad) +{ + + uint32_t sad = 0; + int32_t mean = 0; + uint32_t i, j; + uint8_t const *ptr_cur = cur; + uint8_t const *ptr_ref = ref; + + for (j = 0; j < 16; j++) { + for (i = 0; i < 16; i++) { + mean += ((int) *(ptr_cur + i) - (int) *(ptr_ref + i)); + } + ptr_cur += stride; + ptr_ref += stride; + + } + mean /= 256; + + for (j = 0; j < 16; j++) { + + ptr_cur -= stride; + ptr_ref -= stride; + + for (i = 0; i < 16; i++) { + + sad += ABS(*(ptr_cur + i) - *(ptr_ref + i) - mean); + if (sad >= best_sad) { + return MRSAD16_CORRFACTOR * sad; + } + } + } + + return MRSAD16_CORRFACTOR * sad; + +} + +