You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

339 lines
9.6KB

  1. /*
  2. * MSMPEG4 backend for encoder and decoder
  3. * Copyright (c) 2001 Fabrice Bellard
  4. * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * msmpeg4v1 & v2 stuff by Michael Niedermayer <michaelni@gmx.at>
  7. *
  8. * This file is part of Libav.
  9. *
  10. * Libav is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU Lesser General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2.1 of the License, or (at your option) any later version.
  14. *
  15. * Libav is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * Lesser General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU Lesser General Public
  21. * License along with Libav; if not, write to the Free Software
  22. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  23. */
  24. /**
  25. * @file
  26. * MSMPEG4 backend for encoder and decoder
  27. */
  28. #include "avcodec.h"
  29. #include "idctdsp.h"
  30. #include "mpegvideo.h"
  31. #include "msmpeg4.h"
  32. #include "libavutil/x86/asm.h"
  33. #include "h263.h"
  34. #include "mpeg4video.h"
  35. #include "msmpeg4data.h"
  36. #include "mpegvideodata.h"
  37. #include "vc1data.h"
  38. /*
  39. * You can also call this codec: MPEG-4 with a twist!
  40. *
  41. * TODO:
  42. * - (encoding) select best mv table (two choices)
  43. * - (encoding) select best vlc/dc table
  44. */
  45. /* This table is practically identical to the one from H.263
  46. * except that it is inverted. */
  47. static av_cold void init_h263_dc_for_msmpeg4(void)
  48. {
  49. int level, uni_code, uni_len;
  50. for(level=-256; level<256; level++){
  51. int size, v, l;
  52. /* find number of bits */
  53. size = 0;
  54. v = abs(level);
  55. while (v) {
  56. v >>= 1;
  57. size++;
  58. }
  59. if (level < 0)
  60. l= (-level) ^ ((1 << size) - 1);
  61. else
  62. l= level;
  63. /* luminance H.263 */
  64. uni_code= ff_mpeg4_DCtab_lum[size][0];
  65. uni_len = ff_mpeg4_DCtab_lum[size][1];
  66. uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
  67. if (size > 0) {
  68. uni_code<<=size; uni_code|=l;
  69. uni_len+=size;
  70. if (size > 8){
  71. uni_code<<=1; uni_code|=1;
  72. uni_len++;
  73. }
  74. }
  75. ff_v2_dc_lum_table[level + 256][0] = uni_code;
  76. ff_v2_dc_lum_table[level + 256][1] = uni_len;
  77. /* chrominance H.263 */
  78. uni_code= ff_mpeg4_DCtab_chrom[size][0];
  79. uni_len = ff_mpeg4_DCtab_chrom[size][1];
  80. uni_code ^= (1<<uni_len)-1; //M$ does not like compatibility
  81. if (size > 0) {
  82. uni_code<<=size; uni_code|=l;
  83. uni_len+=size;
  84. if (size > 8){
  85. uni_code<<=1; uni_code|=1;
  86. uni_len++;
  87. }
  88. }
  89. ff_v2_dc_chroma_table[level + 256][0] = uni_code;
  90. ff_v2_dc_chroma_table[level + 256][1] = uni_len;
  91. }
  92. }
  93. av_cold void ff_msmpeg4_common_init(MpegEncContext *s)
  94. {
  95. static int initialized=0;
  96. switch(s->msmpeg4_version){
  97. case 1:
  98. case 2:
  99. s->y_dc_scale_table=
  100. s->c_dc_scale_table= ff_mpeg1_dc_scale_table;
  101. break;
  102. case 3:
  103. if(s->workaround_bugs){
  104. s->y_dc_scale_table= ff_old_ff_y_dc_scale_table;
  105. s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
  106. } else{
  107. s->y_dc_scale_table= ff_mpeg4_y_dc_scale_table;
  108. s->c_dc_scale_table= ff_mpeg4_c_dc_scale_table;
  109. }
  110. break;
  111. case 4:
  112. case 5:
  113. s->y_dc_scale_table= ff_wmv1_y_dc_scale_table;
  114. s->c_dc_scale_table= ff_wmv1_c_dc_scale_table;
  115. break;
  116. #if CONFIG_VC1_DECODER
  117. case 6:
  118. s->y_dc_scale_table= ff_wmv3_dc_scale_table;
  119. s->c_dc_scale_table= ff_wmv3_dc_scale_table;
  120. break;
  121. #endif
  122. }
  123. if(s->msmpeg4_version>=4){
  124. ff_init_scantable(s->idsp.idct_permutation, &s->intra_scantable, ff_wmv1_scantable[1]);
  125. ff_init_scantable(s->idsp.idct_permutation, &s->intra_h_scantable, ff_wmv1_scantable[2]);
  126. ff_init_scantable(s->idsp.idct_permutation, &s->intra_v_scantable, ff_wmv1_scantable[3]);
  127. ff_init_scantable(s->idsp.idct_permutation, &s->inter_scantable, ff_wmv1_scantable[0]);
  128. }
  129. //Note the default tables are set in common_init in mpegvideo.c
  130. if(!initialized){
  131. initialized=1;
  132. init_h263_dc_for_msmpeg4();
  133. }
  134. }
  135. /* predict coded block */
  136. int ff_msmpeg4_coded_block_pred(MpegEncContext * s, int n, uint8_t **coded_block_ptr)
  137. {
  138. int xy, wrap, pred, a, b, c;
  139. xy = s->block_index[n];
  140. wrap = s->b8_stride;
  141. /* B C
  142. * A X
  143. */
  144. a = s->coded_block[xy - 1 ];
  145. b = s->coded_block[xy - 1 - wrap];
  146. c = s->coded_block[xy - wrap];
  147. if (b == c) {
  148. pred = a;
  149. } else {
  150. pred = c;
  151. }
  152. /* store value */
  153. *coded_block_ptr = &s->coded_block[xy];
  154. return pred;
  155. }
  156. static int get_dc(uint8_t *src, int stride, int scale)
  157. {
  158. int y;
  159. int sum=0;
  160. for(y=0; y<8; y++){
  161. int x;
  162. for(x=0; x<8; x++){
  163. sum+=src[x + y*stride];
  164. }
  165. }
  166. return FASTDIV((sum + (scale>>1)), scale);
  167. }
  168. /* dir = 0: left, dir = 1: top prediction */
  169. int ff_msmpeg4_pred_dc(MpegEncContext *s, int n,
  170. int16_t **dc_val_ptr, int *dir_ptr)
  171. {
  172. int a, b, c, wrap, pred, scale;
  173. int16_t *dc_val;
  174. /* find prediction */
  175. if (n < 4) {
  176. scale = s->y_dc_scale;
  177. } else {
  178. scale = s->c_dc_scale;
  179. }
  180. wrap = s->block_wrap[n];
  181. dc_val= s->dc_val[0] + s->block_index[n];
  182. /* B C
  183. * A X
  184. */
  185. a = dc_val[ - 1];
  186. b = dc_val[ - 1 - wrap];
  187. c = dc_val[ - wrap];
  188. if(s->first_slice_line && (n&2)==0 && s->msmpeg4_version<4){
  189. b=c=1024;
  190. }
  191. /* XXX: the following solution consumes divisions, but it does not
  192. necessitate to modify mpegvideo.c. The problem comes from the
  193. fact they decided to store the quantized DC (which would lead
  194. to problems if Q could vary !) */
  195. #if ARCH_X86 && HAVE_7REGS && HAVE_EBX_AVAILABLE
  196. __asm__ volatile(
  197. "movl %3, %%eax \n\t"
  198. "shrl $1, %%eax \n\t"
  199. "addl %%eax, %2 \n\t"
  200. "addl %%eax, %1 \n\t"
  201. "addl %0, %%eax \n\t"
  202. "mull %4 \n\t"
  203. "movl %%edx, %0 \n\t"
  204. "movl %1, %%eax \n\t"
  205. "mull %4 \n\t"
  206. "movl %%edx, %1 \n\t"
  207. "movl %2, %%eax \n\t"
  208. "mull %4 \n\t"
  209. "movl %%edx, %2 \n\t"
  210. : "+b" (a), "+c" (b), "+D" (c)
  211. : "g" (scale), "S" (ff_inverse[scale])
  212. : "%eax", "%edx"
  213. );
  214. #else
  215. /* Divisions are costly everywhere; optimize the most common case. */
  216. if (scale == 8) {
  217. a = (a + (8 >> 1)) / 8;
  218. b = (b + (8 >> 1)) / 8;
  219. c = (c + (8 >> 1)) / 8;
  220. } else {
  221. a = FASTDIV((a + (scale >> 1)), scale);
  222. b = FASTDIV((b + (scale >> 1)), scale);
  223. c = FASTDIV((c + (scale >> 1)), scale);
  224. }
  225. #endif
  226. /* XXX: WARNING: they did not choose the same test as MPEG-4. This
  227. is very important ! */
  228. if(s->msmpeg4_version>3){
  229. if(s->inter_intra_pred){
  230. uint8_t *dest;
  231. int wrap;
  232. if(n==1){
  233. pred=a;
  234. *dir_ptr = 0;
  235. }else if(n==2){
  236. pred=c;
  237. *dir_ptr = 1;
  238. }else if(n==3){
  239. if (abs(a - b) < abs(b - c)) {
  240. pred = c;
  241. *dir_ptr = 1;
  242. } else {
  243. pred = a;
  244. *dir_ptr = 0;
  245. }
  246. }else{
  247. if(n<4){
  248. wrap= s->linesize;
  249. dest= s->current_picture.f->data[0] + (((n >> 1) + 2*s->mb_y) * 8* wrap ) + ((n & 1) + 2*s->mb_x) * 8;
  250. }else{
  251. wrap= s->uvlinesize;
  252. dest= s->current_picture.f->data[n - 3] + (s->mb_y * 8 * wrap) + s->mb_x * 8;
  253. }
  254. if(s->mb_x==0) a= (1024 + (scale>>1))/scale;
  255. else a= get_dc(dest-8, wrap, scale*8);
  256. if(s->mb_y==0) c= (1024 + (scale>>1))/scale;
  257. else c= get_dc(dest-8*wrap, wrap, scale*8);
  258. if (s->h263_aic_dir==0) {
  259. pred= a;
  260. *dir_ptr = 0;
  261. }else if (s->h263_aic_dir==1) {
  262. if(n==0){
  263. pred= c;
  264. *dir_ptr = 1;
  265. }else{
  266. pred= a;
  267. *dir_ptr = 0;
  268. }
  269. }else if (s->h263_aic_dir==2) {
  270. if(n==0){
  271. pred= a;
  272. *dir_ptr = 0;
  273. }else{
  274. pred= c;
  275. *dir_ptr = 1;
  276. }
  277. } else {
  278. pred= c;
  279. *dir_ptr = 1;
  280. }
  281. }
  282. }else{
  283. if (abs(a - b) < abs(b - c)) {
  284. pred = c;
  285. *dir_ptr = 1;
  286. } else {
  287. pred = a;
  288. *dir_ptr = 0;
  289. }
  290. }
  291. }else{
  292. if (abs(a - b) <= abs(b - c)) {
  293. pred = c;
  294. *dir_ptr = 1;
  295. } else {
  296. pred = a;
  297. *dir_ptr = 0;
  298. }
  299. }
  300. /* update predictor */
  301. *dc_val_ptr = &dc_val[0];
  302. return pred;
  303. }