1 |
/***************************************************************************** |
/***************************************************************************** |
2 |
* |
* |
3 |
* XVID MPEG-4 VIDEO CODEC |
* XVID MPEG-4 VIDEO CODEC |
4 |
* - cbp function (zero block flags) - |
* - CBP related function - |
5 |
* |
* |
6 |
* Copyright (C) 2001-2002 - Edouard Gomez <ed.gomez@free.fr> |
* Copyright(C) 2002-2003 Edouard Gomez <ed.gomez@free.fr> |
7 |
|
* 2003 Christoph Lampert <gruel@web.de> |
8 |
* |
* |
9 |
* 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 |
10 |
* |
* it under the terms of the GNU General Public License as published by |
|
* XviD is free software; you can redistribute it and/or modify it |
|
|
* under the terms of the GNU General Public License as published by |
|
11 |
* the Free Software Foundation; either version 2 of the License, or |
* the Free Software Foundation; either version 2 of the License, or |
12 |
* (at your option) any later version. |
* (at your option) any later version. |
13 |
* |
* |
20 |
* along with this program; if not, write to the Free Software |
* along with this program; if not, write to the Free Software |
21 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
22 |
* |
* |
|
* 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. |
|
|
* |
|
23 |
* $Id$ |
* $Id$ |
24 |
* |
* |
25 |
****************************************************************************/ |
****************************************************************************/ |
27 |
#include "../portab.h" |
#include "../portab.h" |
28 |
#include "cbp.h" |
#include "cbp.h" |
29 |
|
|
|
/***************************************************************************** |
|
|
* Global function pointer |
|
|
****************************************************************************/ |
|
|
|
|
30 |
cbpFuncPtr calc_cbp; |
cbpFuncPtr calc_cbp; |
31 |
|
|
|
/***************************************************************************** |
|
|
* Functions |
|
|
****************************************************************************/ |
|
|
|
|
32 |
/* |
/* |
33 |
* Returns a field of bits that indicates non zero ac blocks |
* Returns a field of bits that indicates non zero ac blocks |
34 |
* for this macro block |
* for this macro block |
35 |
*/ |
*/ |
36 |
|
|
37 |
|
/* naive C */ |
38 |
uint32_t |
uint32_t |
39 |
calc_cbp_c(const int16_t codes[6 * 64]) |
calc_cbp_plain(const int16_t codes[6 * 64]) |
40 |
{ |
{ |
41 |
uint32_t i, j; |
int i, j; |
42 |
uint32_t cbp = 0; |
uint32_t cbp = 0; |
43 |
|
|
44 |
for (i = 0; i < 6; i++) { |
for (i = 0; i < 6; i++) { |
45 |
for (j = 1; j < 61; j += 4) { |
for (j=1; j<64;j++) { |
46 |
if (codes[i * 64 + j] | codes[i * 64 + j + 1] | |
if (codes[64*i+j]) { |
|
codes[i * 64 + j + 2] | codes[i * 64 + j + 3]) { |
|
47 |
cbp |= 1 << (5 - i); |
cbp |= 1 << (5 - i); |
48 |
break; |
break; |
49 |
} |
} |
50 |
} |
} |
51 |
|
} |
52 |
|
return cbp; |
53 |
|
} |
54 |
|
|
55 |
if (codes[i * 64 + j] | codes[i * 64 + j + 1] | codes[i * 64 + j + 2]) |
/* optimized C */ |
56 |
cbp |= 1 << (5 - i); |
uint32_t |
57 |
|
calc_cbp_c(const int16_t codes[6 * 64]) |
58 |
|
{ |
59 |
|
unsigned int i=6; |
60 |
|
uint32_t cbp = 0; |
61 |
|
|
62 |
|
/* uses fixed relation: 4*codes = 1*codes64 */ |
63 |
|
/* if prototype is changed (e.g. from int16_t to something like int32) this routine |
64 |
|
has to be changed! */ |
65 |
|
|
66 |
|
do { |
67 |
|
uint64_t *codes64 = (uint64_t*)codes; /* the compiler doesn't really make this */ |
68 |
|
uint32_t *codes32 = (uint32_t*)codes; /* variables, just "addressing modes" */ |
69 |
|
|
70 |
|
cbp += cbp; |
71 |
|
if (codes[1] || codes32[1]) { |
72 |
|
cbp++; |
73 |
|
} |
74 |
|
else if (codes64[1] | codes64[2] | codes64[3]) { |
75 |
|
cbp++; |
76 |
|
} |
77 |
|
else if (codes64[4] | codes64[5] | codes64[6] | codes64[7]) { |
78 |
|
cbp++; |
79 |
} |
} |
80 |
|
else if (codes64[8] | codes64[9] | codes64[10] | codes64[11]) { |
81 |
|
cbp++; |
82 |
|
} |
83 |
|
else if (codes64[12] | codes64[13] | codes64[14] | codes64[15]) { |
84 |
|
cbp++; |
85 |
|
} |
86 |
|
codes += 64; |
87 |
|
i--; |
88 |
|
} while (i != 0); |
89 |
|
|
90 |
return cbp; |
return cbp; |
91 |
|
} |
92 |
|
|
93 |
|
|
94 |
|
|
95 |
|
|
96 |
|
/* older code maybe better on some plattforms? */ |
97 |
|
#if 0 |
98 |
|
for (i = 5; i >= 0; i--) { |
99 |
|
if (codes[1] | codes[2] | codes[3]) |
100 |
|
cbp |= 1 << i; |
101 |
|
else { |
102 |
|
for (j = 4; j <= 56; j+=4) /* [60],[61],[62],[63] are last */ |
103 |
|
if (codes[j] | codes[j+1] | codes[j+2] | codes[j+3]) { |
104 |
|
cbp |= 1 << i; |
105 |
|
break; |
106 |
|
} |
107 |
} |
} |
108 |
|
codes += 64; |
109 |
|
} |
110 |
|
|
111 |
|
return cbp; |
112 |
|
#endif |