5 |
* |
* |
6 |
* Copyright(C) 2002 Pascal Massimino <skal@planet-d.net> |
* Copyright(C) 2002 Pascal Massimino <skal@planet-d.net> |
7 |
* |
* |
|
* This file is part of XviD, a free MPEG-4 video encoder/decoder |
|
|
* |
|
8 |
* XviD is free software; you can redistribute it and/or modify it |
* XviD is free software; you can redistribute it and/or modify it |
9 |
* under the terms of the GNU General Public License as published by |
* under the terms of the GNU General Public License as published by |
10 |
* the Free Software Foundation; either version 2 of the License, or |
* the Free Software Foundation; either version 2 of the License, or |
19 |
* along with this program; if not, write to the Free Software |
* along with this program; if not, write to the Free Software |
20 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
21 |
* |
* |
|
* 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. |
|
|
* |
|
22 |
* $Id$ |
* $Id$ |
23 |
* |
* |
24 |
****************************************************************************/ |
****************************************************************************/ |
25 |
|
|
26 |
#include "../portab.h" |
#include "../portab.h" |
27 |
|
#include "../global.h" |
28 |
#include "reduced.h" |
#include "reduced.h" |
29 |
|
|
30 |
// function pointers |
/* function pointers */ |
31 |
COPY_UPSAMPLED_8X8_16TO8 * copy_upsampled_8x8_16to8; |
COPY_UPSAMPLED_8X8_16TO8 * copy_upsampled_8x8_16to8; |
32 |
ADD_UPSAMPLED_8X8_16TO8 * add_upsampled_8x8_16to8; |
ADD_UPSAMPLED_8X8_16TO8 * add_upsampled_8x8_16to8; |
33 |
VFILTER_31 * vfilter_31; |
VFILTER_31 * vfilter_31; |
34 |
HFILTER_31 * hfilter_31; |
HFILTER_31 * hfilter_31; |
35 |
|
FILTER_18X18_TO_8X8 * filter_18x18_to_8x8; |
36 |
|
FILTER_DIFF_18X18_TO_8X8 * filter_diff_18x18_to_8x8; |
37 |
|
|
38 |
////////////////////////////////////////////////////////// |
/*---------------------------------------------------------------------------- |
39 |
// Upsampling (1/3/3/1) filter |
* Upsampling (1/3/3/1) filter |
40 |
|
*--------------------------------------------------------------------------*/ |
41 |
|
|
42 |
#define CLIP(x) ((x)<0 ? 0 : (x)>255 ? 255 : (x)) |
#define ADD(dst,src) (dst) = CLIP((dst)+(src), 0, 255) |
|
#define ADD(dst,src) (dst) = CLIP((dst)+(src)) |
|
43 |
|
|
44 |
static __inline void Filter_31(uint8_t *Dst1, uint8_t *Dst2, |
static __inline void Filter_31(uint8_t *Dst1, uint8_t *Dst2, |
45 |
const int16_t *Src1, const int16_t *Src2) |
const int16_t *Src1, const int16_t *Src2) |
47 |
/* Src[] is assumed to be >=0. So we can use ">>2" instead of "/2" */ |
/* Src[] is assumed to be >=0. So we can use ">>2" instead of "/2" */ |
48 |
int16_t a = (3*Src1[0]+ Src2[0]+2) >> 2; |
int16_t a = (3*Src1[0]+ Src2[0]+2) >> 2; |
49 |
int16_t b = ( Src1[0]+3*Src2[0]+2) >> 2; |
int16_t b = ( Src1[0]+3*Src2[0]+2) >> 2; |
50 |
Dst1[0] = CLIP(a); |
Dst1[0] = CLIP(a, 0, 255); |
51 |
Dst2[0] = CLIP(b); |
Dst2[0] = CLIP(b, 0, 255); |
52 |
} |
} |
53 |
|
|
54 |
static __inline void Filter_9331(uint8_t *Dst1, uint8_t *Dst2, |
static __inline void Filter_9331(uint8_t *Dst1, uint8_t *Dst2, |
59 |
int16_t b = (3*Src1[0]+ 9*Src1[1]+ 1*Src2[0] + 3*Src2[1] + 8) >> 4; |
int16_t b = (3*Src1[0]+ 9*Src1[1]+ 1*Src2[0] + 3*Src2[1] + 8) >> 4; |
60 |
int16_t c = (3*Src1[0]+ 1*Src1[1]+ 9*Src2[0] + 3*Src2[1] + 8) >> 4; |
int16_t c = (3*Src1[0]+ 1*Src1[1]+ 9*Src2[0] + 3*Src2[1] + 8) >> 4; |
61 |
int16_t d = (1*Src1[0]+ 3*Src1[1]+ 3*Src2[0] + 9*Src2[1] + 8) >> 4; |
int16_t d = (1*Src1[0]+ 3*Src1[1]+ 3*Src2[0] + 9*Src2[1] + 8) >> 4; |
62 |
Dst1[0] = CLIP(a); |
Dst1[0] = CLIP(a, 0, 255); |
63 |
Dst1[1] = CLIP(b); |
Dst1[1] = CLIP(b, 0, 255); |
64 |
Dst2[0] = CLIP(c); |
Dst2[0] = CLIP(c, 0, 255); |
65 |
Dst2[1] = CLIP(d); |
Dst2[1] = CLIP(d, 0, 255); |
66 |
} |
} |
67 |
|
|
68 |
void xvid_Copy_Upsampled_8x8_16To8_C(uint8_t *Dst, const int16_t *Src, const int BpS) |
void xvid_Copy_Upsampled_8x8_16To8_C(uint8_t *Dst, const int16_t *Src, const int BpS) |
69 |
{ |
{ |
70 |
int x, y; |
int x, y; |
71 |
|
|
72 |
Dst[0] = CLIP(Src[0]); |
Dst[0] = CLIP(Src[0], 0, 255); |
73 |
for(x=0; x<7; ++x) Filter_31(Dst+2*x+1, Dst+2*x+2, Src+x, Src+x+1); |
for(x=0; x<7; ++x) Filter_31(Dst+2*x+1, Dst+2*x+2, Src+x, Src+x+1); |
74 |
Dst[15] = CLIP(Src[7]); |
Dst[15] = CLIP(Src[7], 0, 255); |
75 |
Dst += BpS; |
Dst += BpS; |
76 |
for(y=0; y<7; ++y) { |
for(y=0; y<7; ++y) { |
77 |
uint8_t *const Dst2 = Dst + BpS; |
uint8_t *const Dst2 = Dst + BpS; |
82 |
Src += 8; |
Src += 8; |
83 |
Dst += 2*BpS; |
Dst += 2*BpS; |
84 |
} |
} |
85 |
Dst[0] = CLIP(Src[0]); |
Dst[0] = CLIP(Src[0], 0, 255); |
86 |
for(x=0; x<7; ++x) Filter_31(Dst+2*x+1, Dst+2*x+2, Src+x, Src+x+1); |
for(x=0; x<7; ++x) Filter_31(Dst+2*x+1, Dst+2*x+2, Src+x, Src+x+1); |
87 |
Dst[15] = CLIP(Src[7]); |
Dst[15] = CLIP(Src[7], 0, 255); |
88 |
} |
} |
89 |
|
|
90 |
static __inline void Filter_Add_31(uint8_t *Dst1, uint8_t *Dst2, |
static __inline void Filter_Add_31(uint8_t *Dst1, uint8_t *Dst2, |
131 |
for(x=0; x<7; ++x) Filter_Add_31(Dst+2*x+1, Dst+2*x+2, Src+x, Src+x+1); |
for(x=0; x<7; ++x) Filter_Add_31(Dst+2*x+1, Dst+2*x+2, Src+x, Src+x+1); |
132 |
ADD(Dst[15], Src[7]); |
ADD(Dst[15], Src[7]); |
133 |
} |
} |
|
#undef CLIP |
|
134 |
#undef ADD |
#undef ADD |
135 |
|
|
136 |
////////////////////////////////////////////////////////// |
/*---------------------------------------------------------------------------- |
137 |
// horizontal and vertical deblocking |
* horizontal and vertical deblocking |
138 |
|
*--------------------------------------------------------------------------*/ |
139 |
|
|
140 |
void xvid_HFilter_31_C(uint8_t *Src1, uint8_t *Src2, int Nb_Blks) |
void xvid_HFilter_31_C(uint8_t *Src1, uint8_t *Src2, int Nb_Blks) |
141 |
{ |
{ |
161 |
} |
} |
162 |
} |
} |
163 |
|
|
164 |
////////////////////////////////////////////////////////// |
/*---------------------------------------------------------------------------- |
165 |
// 16x16 -> 8x8 (1/3/3/1) downsampling |
* 16x16 -> 8x8 (1/3/3/1) downsampling |
166 |
// |
* |
167 |
// Warning! These read 1 pixel outside of the input 16x16 block! |
* Warning! These read 1 pixel outside of the input 16x16 block! |
168 |
// |
*--------------------------------------------------------------------------*/ |
|
////////////////////////////////////////////////////////// |
|
169 |
|
|
170 |
void xvid_Filter_18x18_To_8x8_C(int16_t *Dst, const uint8_t *Src, const int BpS) |
void xvid_Filter_18x18_To_8x8_C(int16_t *Dst, const uint8_t *Src, const int BpS) |
171 |
{ |
{ |
210 |
T += 16; |
T += 16; |
211 |
} |
} |
212 |
} |
} |
|
|
|
|
////////////////////////////////////////////////////////// |
|