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.

8140 lines
314KB

  1. /*
  2. * H.26L/H.264/AVC/JVT/14496-10/... encoder/decoder
  3. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file h264.c
  23. * H.264 / AVC / MPEG4 part10 codec.
  24. * @author Michael Niedermayer <michaelni@gmx.at>
  25. */
  26. #include "dsputil.h"
  27. #include "avcodec.h"
  28. #include "mpegvideo.h"
  29. #include "h264.h"
  30. #include "h264data.h"
  31. #include "h264_parser.h"
  32. #include "golomb.h"
  33. #include "rectangle.h"
  34. #include "cabac.h"
  35. #ifdef ARCH_X86
  36. #include "i386/h264_i386.h"
  37. #endif
  38. //#undef NDEBUG
  39. #include <assert.h>
  40. /**
  41. * Value of Picture.reference when Picture is not a reference picture, but
  42. * is held for delayed output.
  43. */
  44. #define DELAYED_PIC_REF 4
  45. static VLC coeff_token_vlc[4];
  46. static VLC chroma_dc_coeff_token_vlc;
  47. static VLC total_zeros_vlc[15];
  48. static VLC chroma_dc_total_zeros_vlc[3];
  49. static VLC run_vlc[6];
  50. static VLC run7_vlc;
  51. static void svq3_luma_dc_dequant_idct_c(DCTELEM *block, int qp);
  52. static void svq3_add_idct_c(uint8_t *dst, DCTELEM *block, int stride, int qp, int dc);
  53. static void filter_mb( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize);
  54. static void filter_mb_fast( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize);
  55. static av_always_inline uint32_t pack16to32(int a, int b){
  56. #ifdef WORDS_BIGENDIAN
  57. return (b&0xFFFF) + (a<<16);
  58. #else
  59. return (a&0xFFFF) + (b<<16);
  60. #endif
  61. }
  62. const uint8_t ff_rem6[52]={
  63. 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3,
  64. };
  65. const uint8_t ff_div6[52]={
  66. 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8,
  67. };
  68. static void fill_caches(H264Context *h, int mb_type, int for_deblock){
  69. MpegEncContext * const s = &h->s;
  70. const int mb_xy= h->mb_xy;
  71. int topleft_xy, top_xy, topright_xy, left_xy[2];
  72. int topleft_type, top_type, topright_type, left_type[2];
  73. int left_block[8];
  74. int topleft_partition= -1;
  75. int i;
  76. top_xy = mb_xy - (s->mb_stride << FIELD_PICTURE);
  77. //FIXME deblocking could skip the intra and nnz parts.
  78. if(for_deblock && (h->slice_num == 1 || h->slice_table[mb_xy] == h->slice_table[top_xy]) && !FRAME_MBAFF)
  79. return;
  80. /* Wow, what a mess, why didn't they simplify the interlacing & intra
  81. * stuff, I can't imagine that these complex rules are worth it. */
  82. topleft_xy = top_xy - 1;
  83. topright_xy= top_xy + 1;
  84. left_xy[1] = left_xy[0] = mb_xy-1;
  85. left_block[0]= 0;
  86. left_block[1]= 1;
  87. left_block[2]= 2;
  88. left_block[3]= 3;
  89. left_block[4]= 7;
  90. left_block[5]= 10;
  91. left_block[6]= 8;
  92. left_block[7]= 11;
  93. if(FRAME_MBAFF){
  94. const int pair_xy = s->mb_x + (s->mb_y & ~1)*s->mb_stride;
  95. const int top_pair_xy = pair_xy - s->mb_stride;
  96. const int topleft_pair_xy = top_pair_xy - 1;
  97. const int topright_pair_xy = top_pair_xy + 1;
  98. const int topleft_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[topleft_pair_xy]);
  99. const int top_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[top_pair_xy]);
  100. const int topright_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[topright_pair_xy]);
  101. const int left_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[pair_xy-1]);
  102. const int curr_mb_frame_flag = !IS_INTERLACED(mb_type);
  103. const int bottom = (s->mb_y & 1);
  104. tprintf(s->avctx, "fill_caches: curr_mb_frame_flag:%d, left_mb_frame_flag:%d, topleft_mb_frame_flag:%d, top_mb_frame_flag:%d, topright_mb_frame_flag:%d\n", curr_mb_frame_flag, left_mb_frame_flag, topleft_mb_frame_flag, top_mb_frame_flag, topright_mb_frame_flag);
  105. if (bottom
  106. ? !curr_mb_frame_flag // bottom macroblock
  107. : (!curr_mb_frame_flag && !top_mb_frame_flag) // top macroblock
  108. ) {
  109. top_xy -= s->mb_stride;
  110. }
  111. if (bottom
  112. ? !curr_mb_frame_flag // bottom macroblock
  113. : (!curr_mb_frame_flag && !topleft_mb_frame_flag) // top macroblock
  114. ) {
  115. topleft_xy -= s->mb_stride;
  116. } else if(bottom && curr_mb_frame_flag && !left_mb_frame_flag) {
  117. topleft_xy += s->mb_stride;
  118. // take topleft mv from the middle of the mb, as opposed to all other modes which use the bottom-right partition
  119. topleft_partition = 0;
  120. }
  121. if (bottom
  122. ? !curr_mb_frame_flag // bottom macroblock
  123. : (!curr_mb_frame_flag && !topright_mb_frame_flag) // top macroblock
  124. ) {
  125. topright_xy -= s->mb_stride;
  126. }
  127. if (left_mb_frame_flag != curr_mb_frame_flag) {
  128. left_xy[1] = left_xy[0] = pair_xy - 1;
  129. if (curr_mb_frame_flag) {
  130. if (bottom) {
  131. left_block[0]= 2;
  132. left_block[1]= 2;
  133. left_block[2]= 3;
  134. left_block[3]= 3;
  135. left_block[4]= 8;
  136. left_block[5]= 11;
  137. left_block[6]= 8;
  138. left_block[7]= 11;
  139. } else {
  140. left_block[0]= 0;
  141. left_block[1]= 0;
  142. left_block[2]= 1;
  143. left_block[3]= 1;
  144. left_block[4]= 7;
  145. left_block[5]= 10;
  146. left_block[6]= 7;
  147. left_block[7]= 10;
  148. }
  149. } else {
  150. left_xy[1] += s->mb_stride;
  151. //left_block[0]= 0;
  152. left_block[1]= 2;
  153. left_block[2]= 0;
  154. left_block[3]= 2;
  155. //left_block[4]= 7;
  156. left_block[5]= 10;
  157. left_block[6]= 7;
  158. left_block[7]= 10;
  159. }
  160. }
  161. }
  162. h->top_mb_xy = top_xy;
  163. h->left_mb_xy[0] = left_xy[0];
  164. h->left_mb_xy[1] = left_xy[1];
  165. if(for_deblock){
  166. topleft_type = 0;
  167. topright_type = 0;
  168. top_type = h->slice_table[top_xy ] < 255 ? s->current_picture.mb_type[top_xy] : 0;
  169. left_type[0] = h->slice_table[left_xy[0] ] < 255 ? s->current_picture.mb_type[left_xy[0]] : 0;
  170. left_type[1] = h->slice_table[left_xy[1] ] < 255 ? s->current_picture.mb_type[left_xy[1]] : 0;
  171. if(FRAME_MBAFF && !IS_INTRA(mb_type)){
  172. int list;
  173. int v = *(uint16_t*)&h->non_zero_count[mb_xy][14];
  174. for(i=0; i<16; i++)
  175. h->non_zero_count_cache[scan8[i]] = (v>>i)&1;
  176. for(list=0; list<h->list_count; list++){
  177. if(USES_LIST(mb_type,list)){
  178. uint32_t *src = (uint32_t*)s->current_picture.motion_val[list][h->mb2b_xy[mb_xy]];
  179. uint32_t *dst = (uint32_t*)h->mv_cache[list][scan8[0]];
  180. int8_t *ref = &s->current_picture.ref_index[list][h->mb2b8_xy[mb_xy]];
  181. for(i=0; i<4; i++, dst+=8, src+=h->b_stride){
  182. dst[0] = src[0];
  183. dst[1] = src[1];
  184. dst[2] = src[2];
  185. dst[3] = src[3];
  186. }
  187. *(uint32_t*)&h->ref_cache[list][scan8[ 0]] =
  188. *(uint32_t*)&h->ref_cache[list][scan8[ 2]] = pack16to32(ref[0],ref[1])*0x0101;
  189. ref += h->b8_stride;
  190. *(uint32_t*)&h->ref_cache[list][scan8[ 8]] =
  191. *(uint32_t*)&h->ref_cache[list][scan8[10]] = pack16to32(ref[0],ref[1])*0x0101;
  192. }else{
  193. fill_rectangle(&h-> mv_cache[list][scan8[ 0]], 4, 4, 8, 0, 4);
  194. fill_rectangle(&h->ref_cache[list][scan8[ 0]], 4, 4, 8, (uint8_t)LIST_NOT_USED, 1);
  195. }
  196. }
  197. }
  198. }else{
  199. topleft_type = h->slice_table[topleft_xy ] == h->slice_num ? s->current_picture.mb_type[topleft_xy] : 0;
  200. top_type = h->slice_table[top_xy ] == h->slice_num ? s->current_picture.mb_type[top_xy] : 0;
  201. topright_type= h->slice_table[topright_xy] == h->slice_num ? s->current_picture.mb_type[topright_xy]: 0;
  202. left_type[0] = h->slice_table[left_xy[0] ] == h->slice_num ? s->current_picture.mb_type[left_xy[0]] : 0;
  203. left_type[1] = h->slice_table[left_xy[1] ] == h->slice_num ? s->current_picture.mb_type[left_xy[1]] : 0;
  204. }
  205. if(IS_INTRA(mb_type)){
  206. h->topleft_samples_available=
  207. h->top_samples_available=
  208. h->left_samples_available= 0xFFFF;
  209. h->topright_samples_available= 0xEEEA;
  210. if(!IS_INTRA(top_type) && (top_type==0 || h->pps.constrained_intra_pred)){
  211. h->topleft_samples_available= 0xB3FF;
  212. h->top_samples_available= 0x33FF;
  213. h->topright_samples_available= 0x26EA;
  214. }
  215. for(i=0; i<2; i++){
  216. if(!IS_INTRA(left_type[i]) && (left_type[i]==0 || h->pps.constrained_intra_pred)){
  217. h->topleft_samples_available&= 0xDF5F;
  218. h->left_samples_available&= 0x5F5F;
  219. }
  220. }
  221. if(!IS_INTRA(topleft_type) && (topleft_type==0 || h->pps.constrained_intra_pred))
  222. h->topleft_samples_available&= 0x7FFF;
  223. if(!IS_INTRA(topright_type) && (topright_type==0 || h->pps.constrained_intra_pred))
  224. h->topright_samples_available&= 0xFBFF;
  225. if(IS_INTRA4x4(mb_type)){
  226. if(IS_INTRA4x4(top_type)){
  227. h->intra4x4_pred_mode_cache[4+8*0]= h->intra4x4_pred_mode[top_xy][4];
  228. h->intra4x4_pred_mode_cache[5+8*0]= h->intra4x4_pred_mode[top_xy][5];
  229. h->intra4x4_pred_mode_cache[6+8*0]= h->intra4x4_pred_mode[top_xy][6];
  230. h->intra4x4_pred_mode_cache[7+8*0]= h->intra4x4_pred_mode[top_xy][3];
  231. }else{
  232. int pred;
  233. if(!top_type || (IS_INTER(top_type) && h->pps.constrained_intra_pred))
  234. pred= -1;
  235. else{
  236. pred= 2;
  237. }
  238. h->intra4x4_pred_mode_cache[4+8*0]=
  239. h->intra4x4_pred_mode_cache[5+8*0]=
  240. h->intra4x4_pred_mode_cache[6+8*0]=
  241. h->intra4x4_pred_mode_cache[7+8*0]= pred;
  242. }
  243. for(i=0; i<2; i++){
  244. if(IS_INTRA4x4(left_type[i])){
  245. h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[0+2*i]];
  246. h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[1+2*i]];
  247. }else{
  248. int pred;
  249. if(!left_type[i] || (IS_INTER(left_type[i]) && h->pps.constrained_intra_pred))
  250. pred= -1;
  251. else{
  252. pred= 2;
  253. }
  254. h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]=
  255. h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= pred;
  256. }
  257. }
  258. }
  259. }
  260. /*
  261. 0 . T T. T T T T
  262. 1 L . .L . . . .
  263. 2 L . .L . . . .
  264. 3 . T TL . . . .
  265. 4 L . .L . . . .
  266. 5 L . .. . . . .
  267. */
  268. //FIXME constraint_intra_pred & partitioning & nnz (lets hope this is just a typo in the spec)
  269. if(top_type){
  270. h->non_zero_count_cache[4+8*0]= h->non_zero_count[top_xy][4];
  271. h->non_zero_count_cache[5+8*0]= h->non_zero_count[top_xy][5];
  272. h->non_zero_count_cache[6+8*0]= h->non_zero_count[top_xy][6];
  273. h->non_zero_count_cache[7+8*0]= h->non_zero_count[top_xy][3];
  274. h->non_zero_count_cache[1+8*0]= h->non_zero_count[top_xy][9];
  275. h->non_zero_count_cache[2+8*0]= h->non_zero_count[top_xy][8];
  276. h->non_zero_count_cache[1+8*3]= h->non_zero_count[top_xy][12];
  277. h->non_zero_count_cache[2+8*3]= h->non_zero_count[top_xy][11];
  278. }else{
  279. h->non_zero_count_cache[4+8*0]=
  280. h->non_zero_count_cache[5+8*0]=
  281. h->non_zero_count_cache[6+8*0]=
  282. h->non_zero_count_cache[7+8*0]=
  283. h->non_zero_count_cache[1+8*0]=
  284. h->non_zero_count_cache[2+8*0]=
  285. h->non_zero_count_cache[1+8*3]=
  286. h->non_zero_count_cache[2+8*3]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;
  287. }
  288. for (i=0; i<2; i++) {
  289. if(left_type[i]){
  290. h->non_zero_count_cache[3+8*1 + 2*8*i]= h->non_zero_count[left_xy[i]][left_block[0+2*i]];
  291. h->non_zero_count_cache[3+8*2 + 2*8*i]= h->non_zero_count[left_xy[i]][left_block[1+2*i]];
  292. h->non_zero_count_cache[0+8*1 + 8*i]= h->non_zero_count[left_xy[i]][left_block[4+2*i]];
  293. h->non_zero_count_cache[0+8*4 + 8*i]= h->non_zero_count[left_xy[i]][left_block[5+2*i]];
  294. }else{
  295. h->non_zero_count_cache[3+8*1 + 2*8*i]=
  296. h->non_zero_count_cache[3+8*2 + 2*8*i]=
  297. h->non_zero_count_cache[0+8*1 + 8*i]=
  298. h->non_zero_count_cache[0+8*4 + 8*i]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;
  299. }
  300. }
  301. if( h->pps.cabac ) {
  302. // top_cbp
  303. if(top_type) {
  304. h->top_cbp = h->cbp_table[top_xy];
  305. } else if(IS_INTRA(mb_type)) {
  306. h->top_cbp = 0x1C0;
  307. } else {
  308. h->top_cbp = 0;
  309. }
  310. // left_cbp
  311. if (left_type[0]) {
  312. h->left_cbp = h->cbp_table[left_xy[0]] & 0x1f0;
  313. } else if(IS_INTRA(mb_type)) {
  314. h->left_cbp = 0x1C0;
  315. } else {
  316. h->left_cbp = 0;
  317. }
  318. if (left_type[0]) {
  319. h->left_cbp |= ((h->cbp_table[left_xy[0]]>>((left_block[0]&(~1))+1))&0x1) << 1;
  320. }
  321. if (left_type[1]) {
  322. h->left_cbp |= ((h->cbp_table[left_xy[1]]>>((left_block[2]&(~1))+1))&0x1) << 3;
  323. }
  324. }
  325. #if 1
  326. if(IS_INTER(mb_type) || IS_DIRECT(mb_type)){
  327. int list;
  328. for(list=0; list<h->list_count; list++){
  329. if(!USES_LIST(mb_type, list) && !IS_DIRECT(mb_type) && !h->deblocking_filter){
  330. /*if(!h->mv_cache_clean[list]){
  331. memset(h->mv_cache [list], 0, 8*5*2*sizeof(int16_t)); //FIXME clean only input? clean at all?
  332. memset(h->ref_cache[list], PART_NOT_AVAILABLE, 8*5*sizeof(int8_t));
  333. h->mv_cache_clean[list]= 1;
  334. }*/
  335. continue;
  336. }
  337. h->mv_cache_clean[list]= 0;
  338. if(USES_LIST(top_type, list)){
  339. const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;
  340. const int b8_xy= h->mb2b8_xy[top_xy] + h->b8_stride;
  341. *(uint32_t*)h->mv_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 0];
  342. *(uint32_t*)h->mv_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 1];
  343. *(uint32_t*)h->mv_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 2];
  344. *(uint32_t*)h->mv_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 3];
  345. h->ref_cache[list][scan8[0] + 0 - 1*8]=
  346. h->ref_cache[list][scan8[0] + 1 - 1*8]= s->current_picture.ref_index[list][b8_xy + 0];
  347. h->ref_cache[list][scan8[0] + 2 - 1*8]=
  348. h->ref_cache[list][scan8[0] + 3 - 1*8]= s->current_picture.ref_index[list][b8_xy + 1];
  349. }else{
  350. *(uint32_t*)h->mv_cache [list][scan8[0] + 0 - 1*8]=
  351. *(uint32_t*)h->mv_cache [list][scan8[0] + 1 - 1*8]=
  352. *(uint32_t*)h->mv_cache [list][scan8[0] + 2 - 1*8]=
  353. *(uint32_t*)h->mv_cache [list][scan8[0] + 3 - 1*8]= 0;
  354. *(uint32_t*)&h->ref_cache[list][scan8[0] + 0 - 1*8]= ((top_type ? LIST_NOT_USED : PART_NOT_AVAILABLE)&0xFF)*0x01010101;
  355. }
  356. for(i=0; i<2; i++){
  357. int cache_idx = scan8[0] - 1 + i*2*8;
  358. if(USES_LIST(left_type[i], list)){
  359. const int b_xy= h->mb2b_xy[left_xy[i]] + 3;
  360. const int b8_xy= h->mb2b8_xy[left_xy[i]] + 1;
  361. *(uint32_t*)h->mv_cache[list][cache_idx ]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + h->b_stride*left_block[0+i*2]];
  362. *(uint32_t*)h->mv_cache[list][cache_idx+8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + h->b_stride*left_block[1+i*2]];
  363. h->ref_cache[list][cache_idx ]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[0+i*2]>>1)];
  364. h->ref_cache[list][cache_idx+8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[1+i*2]>>1)];
  365. }else{
  366. *(uint32_t*)h->mv_cache [list][cache_idx ]=
  367. *(uint32_t*)h->mv_cache [list][cache_idx+8]= 0;
  368. h->ref_cache[list][cache_idx ]=
  369. h->ref_cache[list][cache_idx+8]= left_type[i] ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  370. }
  371. }
  372. if((for_deblock || (IS_DIRECT(mb_type) && !h->direct_spatial_mv_pred)) && !FRAME_MBAFF)
  373. continue;
  374. if(USES_LIST(topleft_type, list)){
  375. const int b_xy = h->mb2b_xy[topleft_xy] + 3 + h->b_stride + (topleft_partition & 2*h->b_stride);
  376. const int b8_xy= h->mb2b8_xy[topleft_xy] + 1 + (topleft_partition & h->b8_stride);
  377. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];
  378. h->ref_cache[list][scan8[0] - 1 - 1*8]= s->current_picture.ref_index[list][b8_xy];
  379. }else{
  380. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= 0;
  381. h->ref_cache[list][scan8[0] - 1 - 1*8]= topleft_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  382. }
  383. if(USES_LIST(topright_type, list)){
  384. const int b_xy= h->mb2b_xy[topright_xy] + 3*h->b_stride;
  385. const int b8_xy= h->mb2b8_xy[topright_xy] + h->b8_stride;
  386. *(uint32_t*)h->mv_cache[list][scan8[0] + 4 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];
  387. h->ref_cache[list][scan8[0] + 4 - 1*8]= s->current_picture.ref_index[list][b8_xy];
  388. }else{
  389. *(uint32_t*)h->mv_cache [list][scan8[0] + 4 - 1*8]= 0;
  390. h->ref_cache[list][scan8[0] + 4 - 1*8]= topright_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  391. }
  392. if((IS_SKIP(mb_type) || IS_DIRECT(mb_type)) && !FRAME_MBAFF)
  393. continue;
  394. h->ref_cache[list][scan8[5 ]+1] =
  395. h->ref_cache[list][scan8[7 ]+1] =
  396. h->ref_cache[list][scan8[13]+1] = //FIXME remove past 3 (init somewhere else)
  397. h->ref_cache[list][scan8[4 ]] =
  398. h->ref_cache[list][scan8[12]] = PART_NOT_AVAILABLE;
  399. *(uint32_t*)h->mv_cache [list][scan8[5 ]+1]=
  400. *(uint32_t*)h->mv_cache [list][scan8[7 ]+1]=
  401. *(uint32_t*)h->mv_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewhere else)
  402. *(uint32_t*)h->mv_cache [list][scan8[4 ]]=
  403. *(uint32_t*)h->mv_cache [list][scan8[12]]= 0;
  404. if( h->pps.cabac ) {
  405. /* XXX beurk, Load mvd */
  406. if(USES_LIST(top_type, list)){
  407. const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;
  408. *(uint32_t*)h->mvd_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 0];
  409. *(uint32_t*)h->mvd_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 1];
  410. *(uint32_t*)h->mvd_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 2];
  411. *(uint32_t*)h->mvd_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 3];
  412. }else{
  413. *(uint32_t*)h->mvd_cache [list][scan8[0] + 0 - 1*8]=
  414. *(uint32_t*)h->mvd_cache [list][scan8[0] + 1 - 1*8]=
  415. *(uint32_t*)h->mvd_cache [list][scan8[0] + 2 - 1*8]=
  416. *(uint32_t*)h->mvd_cache [list][scan8[0] + 3 - 1*8]= 0;
  417. }
  418. if(USES_LIST(left_type[0], list)){
  419. const int b_xy= h->mb2b_xy[left_xy[0]] + 3;
  420. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 0*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[0]];
  421. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[1]];
  422. }else{
  423. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 0*8]=
  424. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 1*8]= 0;
  425. }
  426. if(USES_LIST(left_type[1], list)){
  427. const int b_xy= h->mb2b_xy[left_xy[1]] + 3;
  428. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 2*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[2]];
  429. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 3*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[3]];
  430. }else{
  431. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 2*8]=
  432. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 3*8]= 0;
  433. }
  434. *(uint32_t*)h->mvd_cache [list][scan8[5 ]+1]=
  435. *(uint32_t*)h->mvd_cache [list][scan8[7 ]+1]=
  436. *(uint32_t*)h->mvd_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewhere else)
  437. *(uint32_t*)h->mvd_cache [list][scan8[4 ]]=
  438. *(uint32_t*)h->mvd_cache [list][scan8[12]]= 0;
  439. if(h->slice_type == FF_B_TYPE){
  440. fill_rectangle(&h->direct_cache[scan8[0]], 4, 4, 8, 0, 1);
  441. if(IS_DIRECT(top_type)){
  442. *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0x01010101;
  443. }else if(IS_8X8(top_type)){
  444. int b8_xy = h->mb2b8_xy[top_xy] + h->b8_stride;
  445. h->direct_cache[scan8[0] + 0 - 1*8]= h->direct_table[b8_xy];
  446. h->direct_cache[scan8[0] + 2 - 1*8]= h->direct_table[b8_xy + 1];
  447. }else{
  448. *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0;
  449. }
  450. if(IS_DIRECT(left_type[0]))
  451. h->direct_cache[scan8[0] - 1 + 0*8]= 1;
  452. else if(IS_8X8(left_type[0]))
  453. h->direct_cache[scan8[0] - 1 + 0*8]= h->direct_table[h->mb2b8_xy[left_xy[0]] + 1 + h->b8_stride*(left_block[0]>>1)];
  454. else
  455. h->direct_cache[scan8[0] - 1 + 0*8]= 0;
  456. if(IS_DIRECT(left_type[1]))
  457. h->direct_cache[scan8[0] - 1 + 2*8]= 1;
  458. else if(IS_8X8(left_type[1]))
  459. h->direct_cache[scan8[0] - 1 + 2*8]= h->direct_table[h->mb2b8_xy[left_xy[1]] + 1 + h->b8_stride*(left_block[2]>>1)];
  460. else
  461. h->direct_cache[scan8[0] - 1 + 2*8]= 0;
  462. }
  463. }
  464. if(FRAME_MBAFF){
  465. #define MAP_MVS\
  466. MAP_F2F(scan8[0] - 1 - 1*8, topleft_type)\
  467. MAP_F2F(scan8[0] + 0 - 1*8, top_type)\
  468. MAP_F2F(scan8[0] + 1 - 1*8, top_type)\
  469. MAP_F2F(scan8[0] + 2 - 1*8, top_type)\
  470. MAP_F2F(scan8[0] + 3 - 1*8, top_type)\
  471. MAP_F2F(scan8[0] + 4 - 1*8, topright_type)\
  472. MAP_F2F(scan8[0] - 1 + 0*8, left_type[0])\
  473. MAP_F2F(scan8[0] - 1 + 1*8, left_type[0])\
  474. MAP_F2F(scan8[0] - 1 + 2*8, left_type[1])\
  475. MAP_F2F(scan8[0] - 1 + 3*8, left_type[1])
  476. if(MB_FIELD){
  477. #define MAP_F2F(idx, mb_type)\
  478. if(!IS_INTERLACED(mb_type) && h->ref_cache[list][idx] >= 0){\
  479. h->ref_cache[list][idx] <<= 1;\
  480. h->mv_cache[list][idx][1] /= 2;\
  481. h->mvd_cache[list][idx][1] /= 2;\
  482. }
  483. MAP_MVS
  484. #undef MAP_F2F
  485. }else{
  486. #define MAP_F2F(idx, mb_type)\
  487. if(IS_INTERLACED(mb_type) && h->ref_cache[list][idx] >= 0){\
  488. h->ref_cache[list][idx] >>= 1;\
  489. h->mv_cache[list][idx][1] <<= 1;\
  490. h->mvd_cache[list][idx][1] <<= 1;\
  491. }
  492. MAP_MVS
  493. #undef MAP_F2F
  494. }
  495. }
  496. }
  497. }
  498. #endif
  499. h->neighbor_transform_size= !!IS_8x8DCT(top_type) + !!IS_8x8DCT(left_type[0]);
  500. }
  501. static inline void write_back_intra_pred_mode(H264Context *h){
  502. const int mb_xy= h->mb_xy;
  503. h->intra4x4_pred_mode[mb_xy][0]= h->intra4x4_pred_mode_cache[7+8*1];
  504. h->intra4x4_pred_mode[mb_xy][1]= h->intra4x4_pred_mode_cache[7+8*2];
  505. h->intra4x4_pred_mode[mb_xy][2]= h->intra4x4_pred_mode_cache[7+8*3];
  506. h->intra4x4_pred_mode[mb_xy][3]= h->intra4x4_pred_mode_cache[7+8*4];
  507. h->intra4x4_pred_mode[mb_xy][4]= h->intra4x4_pred_mode_cache[4+8*4];
  508. h->intra4x4_pred_mode[mb_xy][5]= h->intra4x4_pred_mode_cache[5+8*4];
  509. h->intra4x4_pred_mode[mb_xy][6]= h->intra4x4_pred_mode_cache[6+8*4];
  510. }
  511. /**
  512. * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.
  513. */
  514. static inline int check_intra4x4_pred_mode(H264Context *h){
  515. MpegEncContext * const s = &h->s;
  516. static const int8_t top [12]= {-1, 0,LEFT_DC_PRED,-1,-1,-1,-1,-1, 0};
  517. static const int8_t left[12]= { 0,-1, TOP_DC_PRED, 0,-1,-1,-1, 0,-1,DC_128_PRED};
  518. int i;
  519. if(!(h->top_samples_available&0x8000)){
  520. for(i=0; i<4; i++){
  521. int status= top[ h->intra4x4_pred_mode_cache[scan8[0] + i] ];
  522. if(status<0){
  523. av_log(h->s.avctx, AV_LOG_ERROR, "top block unavailable for requested intra4x4 mode %d at %d %d\n", status, s->mb_x, s->mb_y);
  524. return -1;
  525. } else if(status){
  526. h->intra4x4_pred_mode_cache[scan8[0] + i]= status;
  527. }
  528. }
  529. }
  530. if(!(h->left_samples_available&0x8000)){
  531. for(i=0; i<4; i++){
  532. int status= left[ h->intra4x4_pred_mode_cache[scan8[0] + 8*i] ];
  533. if(status<0){
  534. av_log(h->s.avctx, AV_LOG_ERROR, "left block unavailable for requested intra4x4 mode %d at %d %d\n", status, s->mb_x, s->mb_y);
  535. return -1;
  536. } else if(status){
  537. h->intra4x4_pred_mode_cache[scan8[0] + 8*i]= status;
  538. }
  539. }
  540. }
  541. return 0;
  542. } //FIXME cleanup like next
  543. /**
  544. * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.
  545. */
  546. static inline int check_intra_pred_mode(H264Context *h, int mode){
  547. MpegEncContext * const s = &h->s;
  548. static const int8_t top [7]= {LEFT_DC_PRED8x8, 1,-1,-1};
  549. static const int8_t left[7]= { TOP_DC_PRED8x8,-1, 2,-1,DC_128_PRED8x8};
  550. if(mode > 6U) {
  551. av_log(h->s.avctx, AV_LOG_ERROR, "out of range intra chroma pred mode at %d %d\n", s->mb_x, s->mb_y);
  552. return -1;
  553. }
  554. if(!(h->top_samples_available&0x8000)){
  555. mode= top[ mode ];
  556. if(mode<0){
  557. av_log(h->s.avctx, AV_LOG_ERROR, "top block unavailable for requested intra mode at %d %d\n", s->mb_x, s->mb_y);
  558. return -1;
  559. }
  560. }
  561. if(!(h->left_samples_available&0x8000)){
  562. mode= left[ mode ];
  563. if(mode<0){
  564. av_log(h->s.avctx, AV_LOG_ERROR, "left block unavailable for requested intra mode at %d %d\n", s->mb_x, s->mb_y);
  565. return -1;
  566. }
  567. }
  568. return mode;
  569. }
  570. /**
  571. * gets the predicted intra4x4 prediction mode.
  572. */
  573. static inline int pred_intra_mode(H264Context *h, int n){
  574. const int index8= scan8[n];
  575. const int left= h->intra4x4_pred_mode_cache[index8 - 1];
  576. const int top = h->intra4x4_pred_mode_cache[index8 - 8];
  577. const int min= FFMIN(left, top);
  578. tprintf(h->s.avctx, "mode:%d %d min:%d\n", left ,top, min);
  579. if(min<0) return DC_PRED;
  580. else return min;
  581. }
  582. static inline void write_back_non_zero_count(H264Context *h){
  583. const int mb_xy= h->mb_xy;
  584. h->non_zero_count[mb_xy][0]= h->non_zero_count_cache[7+8*1];
  585. h->non_zero_count[mb_xy][1]= h->non_zero_count_cache[7+8*2];
  586. h->non_zero_count[mb_xy][2]= h->non_zero_count_cache[7+8*3];
  587. h->non_zero_count[mb_xy][3]= h->non_zero_count_cache[7+8*4];
  588. h->non_zero_count[mb_xy][4]= h->non_zero_count_cache[4+8*4];
  589. h->non_zero_count[mb_xy][5]= h->non_zero_count_cache[5+8*4];
  590. h->non_zero_count[mb_xy][6]= h->non_zero_count_cache[6+8*4];
  591. h->non_zero_count[mb_xy][9]= h->non_zero_count_cache[1+8*2];
  592. h->non_zero_count[mb_xy][8]= h->non_zero_count_cache[2+8*2];
  593. h->non_zero_count[mb_xy][7]= h->non_zero_count_cache[2+8*1];
  594. h->non_zero_count[mb_xy][12]=h->non_zero_count_cache[1+8*5];
  595. h->non_zero_count[mb_xy][11]=h->non_zero_count_cache[2+8*5];
  596. h->non_zero_count[mb_xy][10]=h->non_zero_count_cache[2+8*4];
  597. if(FRAME_MBAFF){
  598. // store all luma nnzs, for deblocking
  599. int v = 0, i;
  600. for(i=0; i<16; i++)
  601. v += (!!h->non_zero_count_cache[scan8[i]]) << i;
  602. *(uint16_t*)&h->non_zero_count[mb_xy][14] = v;
  603. }
  604. }
  605. /**
  606. * gets the predicted number of non zero coefficients.
  607. * @param n block index
  608. */
  609. static inline int pred_non_zero_count(H264Context *h, int n){
  610. const int index8= scan8[n];
  611. const int left= h->non_zero_count_cache[index8 - 1];
  612. const int top = h->non_zero_count_cache[index8 - 8];
  613. int i= left + top;
  614. if(i<64) i= (i+1)>>1;
  615. tprintf(h->s.avctx, "pred_nnz L%X T%X n%d s%d P%X\n", left, top, n, scan8[n], i&31);
  616. return i&31;
  617. }
  618. static inline int fetch_diagonal_mv(H264Context *h, const int16_t **C, int i, int list, int part_width){
  619. const int topright_ref= h->ref_cache[list][ i - 8 + part_width ];
  620. MpegEncContext *s = &h->s;
  621. /* there is no consistent mapping of mvs to neighboring locations that will
  622. * make mbaff happy, so we can't move all this logic to fill_caches */
  623. if(FRAME_MBAFF){
  624. const uint32_t *mb_types = s->current_picture_ptr->mb_type;
  625. const int16_t *mv;
  626. *(uint32_t*)h->mv_cache[list][scan8[0]-2] = 0;
  627. *C = h->mv_cache[list][scan8[0]-2];
  628. if(!MB_FIELD
  629. && (s->mb_y&1) && i < scan8[0]+8 && topright_ref != PART_NOT_AVAILABLE){
  630. int topright_xy = s->mb_x + (s->mb_y-1)*s->mb_stride + (i == scan8[0]+3);
  631. if(IS_INTERLACED(mb_types[topright_xy])){
  632. #define SET_DIAG_MV(MV_OP, REF_OP, X4, Y4)\
  633. const int x4 = X4, y4 = Y4;\
  634. const int mb_type = mb_types[(x4>>2)+(y4>>2)*s->mb_stride];\
  635. if(!USES_LIST(mb_type,list))\
  636. return LIST_NOT_USED;\
  637. mv = s->current_picture_ptr->motion_val[list][x4 + y4*h->b_stride];\
  638. h->mv_cache[list][scan8[0]-2][0] = mv[0];\
  639. h->mv_cache[list][scan8[0]-2][1] = mv[1] MV_OP;\
  640. return s->current_picture_ptr->ref_index[list][(x4>>1) + (y4>>1)*h->b8_stride] REF_OP;
  641. SET_DIAG_MV(*2, >>1, s->mb_x*4+(i&7)-4+part_width, s->mb_y*4-1);
  642. }
  643. }
  644. if(topright_ref == PART_NOT_AVAILABLE
  645. && ((s->mb_y&1) || i >= scan8[0]+8) && (i&7)==4
  646. && h->ref_cache[list][scan8[0]-1] != PART_NOT_AVAILABLE){
  647. if(!MB_FIELD
  648. && IS_INTERLACED(mb_types[h->left_mb_xy[0]])){
  649. SET_DIAG_MV(*2, >>1, s->mb_x*4-1, (s->mb_y|1)*4+(s->mb_y&1)*2+(i>>4)-1);
  650. }
  651. if(MB_FIELD
  652. && !IS_INTERLACED(mb_types[h->left_mb_xy[0]])
  653. && i >= scan8[0]+8){
  654. // leftshift will turn LIST_NOT_USED into PART_NOT_AVAILABLE, but that's ok.
  655. SET_DIAG_MV(/2, <<1, s->mb_x*4-1, (s->mb_y&~1)*4 - 1 + ((i-scan8[0])>>3)*2);
  656. }
  657. }
  658. #undef SET_DIAG_MV
  659. }
  660. if(topright_ref != PART_NOT_AVAILABLE){
  661. *C= h->mv_cache[list][ i - 8 + part_width ];
  662. return topright_ref;
  663. }else{
  664. tprintf(s->avctx, "topright MV not available\n");
  665. *C= h->mv_cache[list][ i - 8 - 1 ];
  666. return h->ref_cache[list][ i - 8 - 1 ];
  667. }
  668. }
  669. /**
  670. * gets the predicted MV.
  671. * @param n the block index
  672. * @param part_width the width of the partition (4, 8,16) -> (1, 2, 4)
  673. * @param mx the x component of the predicted motion vector
  674. * @param my the y component of the predicted motion vector
  675. */
  676. static inline void pred_motion(H264Context * const h, int n, int part_width, int list, int ref, int * const mx, int * const my){
  677. const int index8= scan8[n];
  678. const int top_ref= h->ref_cache[list][ index8 - 8 ];
  679. const int left_ref= h->ref_cache[list][ index8 - 1 ];
  680. const int16_t * const A= h->mv_cache[list][ index8 - 1 ];
  681. const int16_t * const B= h->mv_cache[list][ index8 - 8 ];
  682. const int16_t * C;
  683. int diagonal_ref, match_count;
  684. assert(part_width==1 || part_width==2 || part_width==4);
  685. /* mv_cache
  686. B . . A T T T T
  687. U . . L . . , .
  688. U . . L . . . .
  689. U . . L . . , .
  690. . . . L . . . .
  691. */
  692. diagonal_ref= fetch_diagonal_mv(h, &C, index8, list, part_width);
  693. match_count= (diagonal_ref==ref) + (top_ref==ref) + (left_ref==ref);
  694. tprintf(h->s.avctx, "pred_motion match_count=%d\n", match_count);
  695. if(match_count > 1){ //most common
  696. *mx= mid_pred(A[0], B[0], C[0]);
  697. *my= mid_pred(A[1], B[1], C[1]);
  698. }else if(match_count==1){
  699. if(left_ref==ref){
  700. *mx= A[0];
  701. *my= A[1];
  702. }else if(top_ref==ref){
  703. *mx= B[0];
  704. *my= B[1];
  705. }else{
  706. *mx= C[0];
  707. *my= C[1];
  708. }
  709. }else{
  710. if(top_ref == PART_NOT_AVAILABLE && diagonal_ref == PART_NOT_AVAILABLE && left_ref != PART_NOT_AVAILABLE){
  711. *mx= A[0];
  712. *my= A[1];
  713. }else{
  714. *mx= mid_pred(A[0], B[0], C[0]);
  715. *my= mid_pred(A[1], B[1], C[1]);
  716. }
  717. }
  718. tprintf(h->s.avctx, "pred_motion (%2d %2d %2d) (%2d %2d %2d) (%2d %2d %2d) -> (%2d %2d %2d) at %2d %2d %d list %d\n", top_ref, B[0], B[1], diagonal_ref, C[0], C[1], left_ref, A[0], A[1], ref, *mx, *my, h->s.mb_x, h->s.mb_y, n, list);
  719. }
  720. /**
  721. * gets the directionally predicted 16x8 MV.
  722. * @param n the block index
  723. * @param mx the x component of the predicted motion vector
  724. * @param my the y component of the predicted motion vector
  725. */
  726. static inline void pred_16x8_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  727. if(n==0){
  728. const int top_ref= h->ref_cache[list][ scan8[0] - 8 ];
  729. const int16_t * const B= h->mv_cache[list][ scan8[0] - 8 ];
  730. tprintf(h->s.avctx, "pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n", top_ref, B[0], B[1], h->s.mb_x, h->s.mb_y, n, list);
  731. if(top_ref == ref){
  732. *mx= B[0];
  733. *my= B[1];
  734. return;
  735. }
  736. }else{
  737. const int left_ref= h->ref_cache[list][ scan8[8] - 1 ];
  738. const int16_t * const A= h->mv_cache[list][ scan8[8] - 1 ];
  739. tprintf(h->s.avctx, "pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n", left_ref, A[0], A[1], h->s.mb_x, h->s.mb_y, n, list);
  740. if(left_ref == ref){
  741. *mx= A[0];
  742. *my= A[1];
  743. return;
  744. }
  745. }
  746. //RARE
  747. pred_motion(h, n, 4, list, ref, mx, my);
  748. }
  749. /**
  750. * gets the directionally predicted 8x16 MV.
  751. * @param n the block index
  752. * @param mx the x component of the predicted motion vector
  753. * @param my the y component of the predicted motion vector
  754. */
  755. static inline void pred_8x16_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  756. if(n==0){
  757. const int left_ref= h->ref_cache[list][ scan8[0] - 1 ];
  758. const int16_t * const A= h->mv_cache[list][ scan8[0] - 1 ];
  759. tprintf(h->s.avctx, "pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n", left_ref, A[0], A[1], h->s.mb_x, h->s.mb_y, n, list);
  760. if(left_ref == ref){
  761. *mx= A[0];
  762. *my= A[1];
  763. return;
  764. }
  765. }else{
  766. const int16_t * C;
  767. int diagonal_ref;
  768. diagonal_ref= fetch_diagonal_mv(h, &C, scan8[4], list, 2);
  769. tprintf(h->s.avctx, "pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n", diagonal_ref, C[0], C[1], h->s.mb_x, h->s.mb_y, n, list);
  770. if(diagonal_ref == ref){
  771. *mx= C[0];
  772. *my= C[1];
  773. return;
  774. }
  775. }
  776. //RARE
  777. pred_motion(h, n, 2, list, ref, mx, my);
  778. }
  779. static inline void pred_pskip_motion(H264Context * const h, int * const mx, int * const my){
  780. const int top_ref = h->ref_cache[0][ scan8[0] - 8 ];
  781. const int left_ref= h->ref_cache[0][ scan8[0] - 1 ];
  782. tprintf(h->s.avctx, "pred_pskip: (%d) (%d) at %2d %2d\n", top_ref, left_ref, h->s.mb_x, h->s.mb_y);
  783. if(top_ref == PART_NOT_AVAILABLE || left_ref == PART_NOT_AVAILABLE
  784. || (top_ref == 0 && *(uint32_t*)h->mv_cache[0][ scan8[0] - 8 ] == 0)
  785. || (left_ref == 0 && *(uint32_t*)h->mv_cache[0][ scan8[0] - 1 ] == 0)){
  786. *mx = *my = 0;
  787. return;
  788. }
  789. pred_motion(h, 0, 4, 0, 0, mx, my);
  790. return;
  791. }
  792. static inline void direct_dist_scale_factor(H264Context * const h){
  793. const int poc = h->s.current_picture_ptr->poc;
  794. const int poc1 = h->ref_list[1][0].poc;
  795. int i;
  796. for(i=0; i<h->ref_count[0]; i++){
  797. int poc0 = h->ref_list[0][i].poc;
  798. int td = av_clip(poc1 - poc0, -128, 127);
  799. if(td == 0 /* FIXME || pic0 is a long-term ref */){
  800. h->dist_scale_factor[i] = 256;
  801. }else{
  802. int tb = av_clip(poc - poc0, -128, 127);
  803. int tx = (16384 + (FFABS(td) >> 1)) / td;
  804. h->dist_scale_factor[i] = av_clip((tb*tx + 32) >> 6, -1024, 1023);
  805. }
  806. }
  807. if(FRAME_MBAFF){
  808. for(i=0; i<h->ref_count[0]; i++){
  809. h->dist_scale_factor_field[2*i] =
  810. h->dist_scale_factor_field[2*i+1] = h->dist_scale_factor[i];
  811. }
  812. }
  813. }
  814. static inline void direct_ref_list_init(H264Context * const h){
  815. MpegEncContext * const s = &h->s;
  816. Picture * const ref1 = &h->ref_list[1][0];
  817. Picture * const cur = s->current_picture_ptr;
  818. int list, i, j;
  819. if(cur->pict_type == FF_I_TYPE)
  820. cur->ref_count[0] = 0;
  821. if(cur->pict_type != FF_B_TYPE)
  822. cur->ref_count[1] = 0;
  823. for(list=0; list<2; list++){
  824. cur->ref_count[list] = h->ref_count[list];
  825. for(j=0; j<h->ref_count[list]; j++)
  826. cur->ref_poc[list][j] = h->ref_list[list][j].poc;
  827. }
  828. if(cur->pict_type != FF_B_TYPE || h->direct_spatial_mv_pred)
  829. return;
  830. for(list=0; list<2; list++){
  831. for(i=0; i<ref1->ref_count[list]; i++){
  832. const int poc = ref1->ref_poc[list][i];
  833. h->map_col_to_list0[list][i] = 0; /* bogus; fills in for missing frames */
  834. for(j=0; j<h->ref_count[list]; j++)
  835. if(h->ref_list[list][j].poc == poc){
  836. h->map_col_to_list0[list][i] = j;
  837. break;
  838. }
  839. }
  840. }
  841. if(FRAME_MBAFF){
  842. for(list=0; list<2; list++){
  843. for(i=0; i<ref1->ref_count[list]; i++){
  844. j = h->map_col_to_list0[list][i];
  845. h->map_col_to_list0_field[list][2*i] = 2*j;
  846. h->map_col_to_list0_field[list][2*i+1] = 2*j+1;
  847. }
  848. }
  849. }
  850. }
  851. static inline void pred_direct_motion(H264Context * const h, int *mb_type){
  852. MpegEncContext * const s = &h->s;
  853. const int mb_xy = h->mb_xy;
  854. const int b8_xy = 2*s->mb_x + 2*s->mb_y*h->b8_stride;
  855. const int b4_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;
  856. const int mb_type_col = h->ref_list[1][0].mb_type[mb_xy];
  857. const int16_t (*l1mv0)[2] = (const int16_t (*)[2]) &h->ref_list[1][0].motion_val[0][b4_xy];
  858. const int16_t (*l1mv1)[2] = (const int16_t (*)[2]) &h->ref_list[1][0].motion_val[1][b4_xy];
  859. const int8_t *l1ref0 = &h->ref_list[1][0].ref_index[0][b8_xy];
  860. const int8_t *l1ref1 = &h->ref_list[1][0].ref_index[1][b8_xy];
  861. const int is_b8x8 = IS_8X8(*mb_type);
  862. unsigned int sub_mb_type;
  863. int i8, i4;
  864. #define MB_TYPE_16x16_OR_INTRA (MB_TYPE_16x16|MB_TYPE_INTRA4x4|MB_TYPE_INTRA16x16|MB_TYPE_INTRA_PCM)
  865. if(IS_8X8(mb_type_col) && !h->sps.direct_8x8_inference_flag){
  866. /* FIXME save sub mb types from previous frames (or derive from MVs)
  867. * so we know exactly what block size to use */
  868. sub_mb_type = MB_TYPE_8x8|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_4x4 */
  869. *mb_type = MB_TYPE_8x8|MB_TYPE_L0L1;
  870. }else if(!is_b8x8 && (mb_type_col & MB_TYPE_16x16_OR_INTRA)){
  871. sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */
  872. *mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_16x16 */
  873. }else{
  874. sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */
  875. *mb_type = MB_TYPE_8x8|MB_TYPE_L0L1;
  876. }
  877. if(!is_b8x8)
  878. *mb_type |= MB_TYPE_DIRECT2;
  879. if(MB_FIELD)
  880. *mb_type |= MB_TYPE_INTERLACED;
  881. tprintf(s->avctx, "mb_type = %08x, sub_mb_type = %08x, is_b8x8 = %d, mb_type_col = %08x\n", *mb_type, sub_mb_type, is_b8x8, mb_type_col);
  882. if(h->direct_spatial_mv_pred){
  883. int ref[2];
  884. int mv[2][2];
  885. int list;
  886. /* FIXME interlacing + spatial direct uses wrong colocated block positions */
  887. /* ref = min(neighbors) */
  888. for(list=0; list<2; list++){
  889. int refa = h->ref_cache[list][scan8[0] - 1];
  890. int refb = h->ref_cache[list][scan8[0] - 8];
  891. int refc = h->ref_cache[list][scan8[0] - 8 + 4];
  892. if(refc == -2)
  893. refc = h->ref_cache[list][scan8[0] - 8 - 1];
  894. ref[list] = FFMIN3((unsigned)refa, (unsigned)refb, (unsigned)refc);
  895. if(ref[list] < 0)
  896. ref[list] = -1;
  897. }
  898. if(ref[0] < 0 && ref[1] < 0){
  899. ref[0] = ref[1] = 0;
  900. mv[0][0] = mv[0][1] =
  901. mv[1][0] = mv[1][1] = 0;
  902. }else{
  903. for(list=0; list<2; list++){
  904. if(ref[list] >= 0)
  905. pred_motion(h, 0, 4, list, ref[list], &mv[list][0], &mv[list][1]);
  906. else
  907. mv[list][0] = mv[list][1] = 0;
  908. }
  909. }
  910. if(ref[1] < 0){
  911. if(!is_b8x8)
  912. *mb_type &= ~MB_TYPE_L1;
  913. sub_mb_type &= ~MB_TYPE_L1;
  914. }else if(ref[0] < 0){
  915. if(!is_b8x8)
  916. *mb_type &= ~MB_TYPE_L0;
  917. sub_mb_type &= ~MB_TYPE_L0;
  918. }
  919. if(IS_INTERLACED(*mb_type) != IS_INTERLACED(mb_type_col)){
  920. int pair_xy = s->mb_x + (s->mb_y&~1)*s->mb_stride;
  921. int mb_types_col[2];
  922. int b8_stride = h->b8_stride;
  923. int b4_stride = h->b_stride;
  924. *mb_type = (*mb_type & ~MB_TYPE_16x16) | MB_TYPE_8x8;
  925. if(IS_INTERLACED(*mb_type)){
  926. mb_types_col[0] = h->ref_list[1][0].mb_type[pair_xy];
  927. mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy+s->mb_stride];
  928. if(s->mb_y&1){
  929. l1ref0 -= 2*b8_stride;
  930. l1ref1 -= 2*b8_stride;
  931. l1mv0 -= 4*b4_stride;
  932. l1mv1 -= 4*b4_stride;
  933. }
  934. b8_stride *= 3;
  935. b4_stride *= 6;
  936. }else{
  937. int cur_poc = s->current_picture_ptr->poc;
  938. int *col_poc = h->ref_list[1]->field_poc;
  939. int col_parity = FFABS(col_poc[0] - cur_poc) >= FFABS(col_poc[1] - cur_poc);
  940. int dy = 2*col_parity - (s->mb_y&1);
  941. mb_types_col[0] =
  942. mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy + col_parity*s->mb_stride];
  943. l1ref0 += dy*b8_stride;
  944. l1ref1 += dy*b8_stride;
  945. l1mv0 += 2*dy*b4_stride;
  946. l1mv1 += 2*dy*b4_stride;
  947. b8_stride = 0;
  948. }
  949. for(i8=0; i8<4; i8++){
  950. int x8 = i8&1;
  951. int y8 = i8>>1;
  952. int xy8 = x8+y8*b8_stride;
  953. int xy4 = 3*x8+y8*b4_stride;
  954. int a=0, b=0;
  955. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  956. continue;
  957. h->sub_mb_type[i8] = sub_mb_type;
  958. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[0], 1);
  959. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[1], 1);
  960. if(!IS_INTRA(mb_types_col[y8])
  961. && ( (l1ref0[xy8] == 0 && FFABS(l1mv0[xy4][0]) <= 1 && FFABS(l1mv0[xy4][1]) <= 1)
  962. || (l1ref0[xy8] < 0 && l1ref1[xy8] == 0 && FFABS(l1mv1[xy4][0]) <= 1 && FFABS(l1mv1[xy4][1]) <= 1))){
  963. if(ref[0] > 0)
  964. a= pack16to32(mv[0][0],mv[0][1]);
  965. if(ref[1] > 0)
  966. b= pack16to32(mv[1][0],mv[1][1]);
  967. }else{
  968. a= pack16to32(mv[0][0],mv[0][1]);
  969. b= pack16to32(mv[1][0],mv[1][1]);
  970. }
  971. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, a, 4);
  972. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, b, 4);
  973. }
  974. }else if(IS_16X16(*mb_type)){
  975. int a=0, b=0;
  976. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, (uint8_t)ref[0], 1);
  977. fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, (uint8_t)ref[1], 1);
  978. if(!IS_INTRA(mb_type_col)
  979. && ( (l1ref0[0] == 0 && FFABS(l1mv0[0][0]) <= 1 && FFABS(l1mv0[0][1]) <= 1)
  980. || (l1ref0[0] < 0 && l1ref1[0] == 0 && FFABS(l1mv1[0][0]) <= 1 && FFABS(l1mv1[0][1]) <= 1
  981. && (h->x264_build>33 || !h->x264_build)))){
  982. if(ref[0] > 0)
  983. a= pack16to32(mv[0][0],mv[0][1]);
  984. if(ref[1] > 0)
  985. b= pack16to32(mv[1][0],mv[1][1]);
  986. }else{
  987. a= pack16to32(mv[0][0],mv[0][1]);
  988. b= pack16to32(mv[1][0],mv[1][1]);
  989. }
  990. fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, a, 4);
  991. fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, b, 4);
  992. }else{
  993. for(i8=0; i8<4; i8++){
  994. const int x8 = i8&1;
  995. const int y8 = i8>>1;
  996. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  997. continue;
  998. h->sub_mb_type[i8] = sub_mb_type;
  999. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mv[0][0],mv[0][1]), 4);
  1000. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mv[1][0],mv[1][1]), 4);
  1001. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[0], 1);
  1002. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[1], 1);
  1003. /* col_zero_flag */
  1004. if(!IS_INTRA(mb_type_col) && ( l1ref0[x8 + y8*h->b8_stride] == 0
  1005. || (l1ref0[x8 + y8*h->b8_stride] < 0 && l1ref1[x8 + y8*h->b8_stride] == 0
  1006. && (h->x264_build>33 || !h->x264_build)))){
  1007. const int16_t (*l1mv)[2]= l1ref0[x8 + y8*h->b8_stride] == 0 ? l1mv0 : l1mv1;
  1008. if(IS_SUB_8X8(sub_mb_type)){
  1009. const int16_t *mv_col = l1mv[x8*3 + y8*3*h->b_stride];
  1010. if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){
  1011. if(ref[0] == 0)
  1012. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);
  1013. if(ref[1] == 0)
  1014. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);
  1015. }
  1016. }else
  1017. for(i4=0; i4<4; i4++){
  1018. const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];
  1019. if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){
  1020. if(ref[0] == 0)
  1021. *(uint32_t*)h->mv_cache[0][scan8[i8*4+i4]] = 0;
  1022. if(ref[1] == 0)
  1023. *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] = 0;
  1024. }
  1025. }
  1026. }
  1027. }
  1028. }
  1029. }else{ /* direct temporal mv pred */
  1030. const int *map_col_to_list0[2] = {h->map_col_to_list0[0], h->map_col_to_list0[1]};
  1031. const int *dist_scale_factor = h->dist_scale_factor;
  1032. if(FRAME_MBAFF){
  1033. if(IS_INTERLACED(*mb_type)){
  1034. map_col_to_list0[0] = h->map_col_to_list0_field[0];
  1035. map_col_to_list0[1] = h->map_col_to_list0_field[1];
  1036. dist_scale_factor = h->dist_scale_factor_field;
  1037. }
  1038. if(IS_INTERLACED(*mb_type) != IS_INTERLACED(mb_type_col)){
  1039. /* FIXME assumes direct_8x8_inference == 1 */
  1040. const int pair_xy = s->mb_x + (s->mb_y&~1)*s->mb_stride;
  1041. int mb_types_col[2];
  1042. int y_shift;
  1043. *mb_type = MB_TYPE_8x8|MB_TYPE_L0L1
  1044. | (is_b8x8 ? 0 : MB_TYPE_DIRECT2)
  1045. | (*mb_type & MB_TYPE_INTERLACED);
  1046. sub_mb_type = MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2|MB_TYPE_16x16;
  1047. if(IS_INTERLACED(*mb_type)){
  1048. /* frame to field scaling */
  1049. mb_types_col[0] = h->ref_list[1][0].mb_type[pair_xy];
  1050. mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy+s->mb_stride];
  1051. if(s->mb_y&1){
  1052. l1ref0 -= 2*h->b8_stride;
  1053. l1ref1 -= 2*h->b8_stride;
  1054. l1mv0 -= 4*h->b_stride;
  1055. l1mv1 -= 4*h->b_stride;
  1056. }
  1057. y_shift = 0;
  1058. if( (mb_types_col[0] & MB_TYPE_16x16_OR_INTRA)
  1059. && (mb_types_col[1] & MB_TYPE_16x16_OR_INTRA)
  1060. && !is_b8x8)
  1061. *mb_type |= MB_TYPE_16x8;
  1062. else
  1063. *mb_type |= MB_TYPE_8x8;
  1064. }else{
  1065. /* field to frame scaling */
  1066. /* col_mb_y = (mb_y&~1) + (topAbsDiffPOC < bottomAbsDiffPOC ? 0 : 1)
  1067. * but in MBAFF, top and bottom POC are equal */
  1068. int dy = (s->mb_y&1) ? 1 : 2;
  1069. mb_types_col[0] =
  1070. mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy+s->mb_stride];
  1071. l1ref0 += dy*h->b8_stride;
  1072. l1ref1 += dy*h->b8_stride;
  1073. l1mv0 += 2*dy*h->b_stride;
  1074. l1mv1 += 2*dy*h->b_stride;
  1075. y_shift = 2;
  1076. if((mb_types_col[0] & (MB_TYPE_16x16_OR_INTRA|MB_TYPE_16x8))
  1077. && !is_b8x8)
  1078. *mb_type |= MB_TYPE_16x16;
  1079. else
  1080. *mb_type |= MB_TYPE_8x8;
  1081. }
  1082. for(i8=0; i8<4; i8++){
  1083. const int x8 = i8&1;
  1084. const int y8 = i8>>1;
  1085. int ref0, scale;
  1086. const int16_t (*l1mv)[2]= l1mv0;
  1087. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  1088. continue;
  1089. h->sub_mb_type[i8] = sub_mb_type;
  1090. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);
  1091. if(IS_INTRA(mb_types_col[y8])){
  1092. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);
  1093. fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);
  1094. fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);
  1095. continue;
  1096. }
  1097. ref0 = l1ref0[x8 + (y8*2>>y_shift)*h->b8_stride];
  1098. if(ref0 >= 0)
  1099. ref0 = map_col_to_list0[0][ref0*2>>y_shift];
  1100. else{
  1101. ref0 = map_col_to_list0[1][l1ref1[x8 + (y8*2>>y_shift)*h->b8_stride]*2>>y_shift];
  1102. l1mv= l1mv1;
  1103. }
  1104. scale = dist_scale_factor[ref0];
  1105. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);
  1106. {
  1107. const int16_t *mv_col = l1mv[x8*3 + (y8*6>>y_shift)*h->b_stride];
  1108. int my_col = (mv_col[1]<<y_shift)/2;
  1109. int mx = (scale * mv_col[0] + 128) >> 8;
  1110. int my = (scale * my_col + 128) >> 8;
  1111. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);
  1112. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-my_col), 4);
  1113. }
  1114. }
  1115. return;
  1116. }
  1117. }
  1118. /* one-to-one mv scaling */
  1119. if(IS_16X16(*mb_type)){
  1120. int ref, mv0, mv1;
  1121. fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, 0, 1);
  1122. if(IS_INTRA(mb_type_col)){
  1123. ref=mv0=mv1=0;
  1124. }else{
  1125. const int ref0 = l1ref0[0] >= 0 ? map_col_to_list0[0][l1ref0[0]]
  1126. : map_col_to_list0[1][l1ref1[0]];
  1127. const int scale = dist_scale_factor[ref0];
  1128. const int16_t *mv_col = l1ref0[0] >= 0 ? l1mv0[0] : l1mv1[0];
  1129. int mv_l0[2];
  1130. mv_l0[0] = (scale * mv_col[0] + 128) >> 8;
  1131. mv_l0[1] = (scale * mv_col[1] + 128) >> 8;
  1132. ref= ref0;
  1133. mv0= pack16to32(mv_l0[0],mv_l0[1]);
  1134. mv1= pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);
  1135. }
  1136. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref, 1);
  1137. fill_rectangle(&h-> mv_cache[0][scan8[0]], 4, 4, 8, mv0, 4);
  1138. fill_rectangle(&h-> mv_cache[1][scan8[0]], 4, 4, 8, mv1, 4);
  1139. }else{
  1140. for(i8=0; i8<4; i8++){
  1141. const int x8 = i8&1;
  1142. const int y8 = i8>>1;
  1143. int ref0, scale;
  1144. const int16_t (*l1mv)[2]= l1mv0;
  1145. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  1146. continue;
  1147. h->sub_mb_type[i8] = sub_mb_type;
  1148. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);
  1149. if(IS_INTRA(mb_type_col)){
  1150. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);
  1151. fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);
  1152. fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);
  1153. continue;
  1154. }
  1155. ref0 = l1ref0[x8 + y8*h->b8_stride];
  1156. if(ref0 >= 0)
  1157. ref0 = map_col_to_list0[0][ref0];
  1158. else{
  1159. ref0 = map_col_to_list0[1][l1ref1[x8 + y8*h->b8_stride]];
  1160. l1mv= l1mv1;
  1161. }
  1162. scale = dist_scale_factor[ref0];
  1163. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);
  1164. if(IS_SUB_8X8(sub_mb_type)){
  1165. const int16_t *mv_col = l1mv[x8*3 + y8*3*h->b_stride];
  1166. int mx = (scale * mv_col[0] + 128) >> 8;
  1167. int my = (scale * mv_col[1] + 128) >> 8;
  1168. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);
  1169. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-mv_col[1]), 4);
  1170. }else
  1171. for(i4=0; i4<4; i4++){
  1172. const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];
  1173. int16_t *mv_l0 = h->mv_cache[0][scan8[i8*4+i4]];
  1174. mv_l0[0] = (scale * mv_col[0] + 128) >> 8;
  1175. mv_l0[1] = (scale * mv_col[1] + 128) >> 8;
  1176. *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] =
  1177. pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);
  1178. }
  1179. }
  1180. }
  1181. }
  1182. }
  1183. static inline void write_back_motion(H264Context *h, int mb_type){
  1184. MpegEncContext * const s = &h->s;
  1185. const int b_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;
  1186. const int b8_xy= 2*s->mb_x + 2*s->mb_y*h->b8_stride;
  1187. int list;
  1188. if(!USES_LIST(mb_type, 0))
  1189. fill_rectangle(&s->current_picture.ref_index[0][b8_xy], 2, 2, h->b8_stride, (uint8_t)LIST_NOT_USED, 1);
  1190. for(list=0; list<h->list_count; list++){
  1191. int y;
  1192. if(!USES_LIST(mb_type, list))
  1193. continue;
  1194. for(y=0; y<4; y++){
  1195. *(uint64_t*)s->current_picture.motion_val[list][b_xy + 0 + y*h->b_stride]= *(uint64_t*)h->mv_cache[list][scan8[0]+0 + 8*y];
  1196. *(uint64_t*)s->current_picture.motion_val[list][b_xy + 2 + y*h->b_stride]= *(uint64_t*)h->mv_cache[list][scan8[0]+2 + 8*y];
  1197. }
  1198. if( h->pps.cabac ) {
  1199. if(IS_SKIP(mb_type))
  1200. fill_rectangle(h->mvd_table[list][b_xy], 4, 4, h->b_stride, 0, 4);
  1201. else
  1202. for(y=0; y<4; y++){
  1203. *(uint64_t*)h->mvd_table[list][b_xy + 0 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+0 + 8*y];
  1204. *(uint64_t*)h->mvd_table[list][b_xy + 2 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+2 + 8*y];
  1205. }
  1206. }
  1207. {
  1208. int8_t *ref_index = &s->current_picture.ref_index[list][b8_xy];
  1209. ref_index[0+0*h->b8_stride]= h->ref_cache[list][scan8[0]];
  1210. ref_index[1+0*h->b8_stride]= h->ref_cache[list][scan8[4]];
  1211. ref_index[0+1*h->b8_stride]= h->ref_cache[list][scan8[8]];
  1212. ref_index[1+1*h->b8_stride]= h->ref_cache[list][scan8[12]];
  1213. }
  1214. }
  1215. if(h->slice_type == FF_B_TYPE && h->pps.cabac){
  1216. if(IS_8X8(mb_type)){
  1217. uint8_t *direct_table = &h->direct_table[b8_xy];
  1218. direct_table[1+0*h->b8_stride] = IS_DIRECT(h->sub_mb_type[1]) ? 1 : 0;
  1219. direct_table[0+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[2]) ? 1 : 0;
  1220. direct_table[1+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[3]) ? 1 : 0;
  1221. }
  1222. }
  1223. }
  1224. /**
  1225. * Decodes a network abstraction layer unit.
  1226. * @param consumed is the number of bytes used as input
  1227. * @param length is the length of the array
  1228. * @param dst_length is the number of decoded bytes FIXME here or a decode rbsp tailing?
  1229. * @returns decoded bytes, might be src+1 if no escapes
  1230. */
  1231. static const uint8_t *decode_nal(H264Context *h, const uint8_t *src, int *dst_length, int *consumed, int length){
  1232. int i, si, di;
  1233. uint8_t *dst;
  1234. int bufidx;
  1235. // src[0]&0x80; //forbidden bit
  1236. h->nal_ref_idc= src[0]>>5;
  1237. h->nal_unit_type= src[0]&0x1F;
  1238. src++; length--;
  1239. #if 0
  1240. for(i=0; i<length; i++)
  1241. printf("%2X ", src[i]);
  1242. #endif
  1243. for(i=0; i+1<length; i+=2){
  1244. if(src[i]) continue;
  1245. if(i>0 && src[i-1]==0) i--;
  1246. if(i+2<length && src[i+1]==0 && src[i+2]<=3){
  1247. if(src[i+2]!=3){
  1248. /* startcode, so we must be past the end */
  1249. length=i;
  1250. }
  1251. break;
  1252. }
  1253. }
  1254. if(i>=length-1){ //no escaped 0
  1255. *dst_length= length;
  1256. *consumed= length+1; //+1 for the header
  1257. return src;
  1258. }
  1259. bufidx = h->nal_unit_type == NAL_DPC ? 1 : 0; // use second escape buffer for inter data
  1260. h->rbsp_buffer[bufidx]= av_fast_realloc(h->rbsp_buffer[bufidx], &h->rbsp_buffer_size[bufidx], length);
  1261. dst= h->rbsp_buffer[bufidx];
  1262. if (dst == NULL){
  1263. return NULL;
  1264. }
  1265. //printf("decoding esc\n");
  1266. si=di=0;
  1267. while(si<length){
  1268. //remove escapes (very rare 1:2^22)
  1269. if(si+2<length && src[si]==0 && src[si+1]==0 && src[si+2]<=3){
  1270. if(src[si+2]==3){ //escape
  1271. dst[di++]= 0;
  1272. dst[di++]= 0;
  1273. si+=3;
  1274. continue;
  1275. }else //next start code
  1276. break;
  1277. }
  1278. dst[di++]= src[si++];
  1279. }
  1280. *dst_length= di;
  1281. *consumed= si + 1;//+1 for the header
  1282. //FIXME store exact number of bits in the getbitcontext (it is needed for decoding)
  1283. return dst;
  1284. }
  1285. /**
  1286. * identifies the exact end of the bitstream
  1287. * @return the length of the trailing, or 0 if damaged
  1288. */
  1289. static int decode_rbsp_trailing(H264Context *h, const uint8_t *src){
  1290. int v= *src;
  1291. int r;
  1292. tprintf(h->s.avctx, "rbsp trailing %X\n", v);
  1293. for(r=1; r<9; r++){
  1294. if(v&1) return r;
  1295. v>>=1;
  1296. }
  1297. return 0;
  1298. }
  1299. /**
  1300. * idct tranforms the 16 dc values and dequantize them.
  1301. * @param qp quantization parameter
  1302. */
  1303. static void h264_luma_dc_dequant_idct_c(DCTELEM *block, int qp, int qmul){
  1304. #define stride 16
  1305. int i;
  1306. int temp[16]; //FIXME check if this is a good idea
  1307. static const int x_offset[4]={0, 1*stride, 4* stride, 5*stride};
  1308. static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};
  1309. //memset(block, 64, 2*256);
  1310. //return;
  1311. for(i=0; i<4; i++){
  1312. const int offset= y_offset[i];
  1313. const int z0= block[offset+stride*0] + block[offset+stride*4];
  1314. const int z1= block[offset+stride*0] - block[offset+stride*4];
  1315. const int z2= block[offset+stride*1] - block[offset+stride*5];
  1316. const int z3= block[offset+stride*1] + block[offset+stride*5];
  1317. temp[4*i+0]= z0+z3;
  1318. temp[4*i+1]= z1+z2;
  1319. temp[4*i+2]= z1-z2;
  1320. temp[4*i+3]= z0-z3;
  1321. }
  1322. for(i=0; i<4; i++){
  1323. const int offset= x_offset[i];
  1324. const int z0= temp[4*0+i] + temp[4*2+i];
  1325. const int z1= temp[4*0+i] - temp[4*2+i];
  1326. const int z2= temp[4*1+i] - temp[4*3+i];
  1327. const int z3= temp[4*1+i] + temp[4*3+i];
  1328. block[stride*0 +offset]= ((((z0 + z3)*qmul + 128 ) >> 8)); //FIXME think about merging this into decode_resdual
  1329. block[stride*2 +offset]= ((((z1 + z2)*qmul + 128 ) >> 8));
  1330. block[stride*8 +offset]= ((((z1 - z2)*qmul + 128 ) >> 8));
  1331. block[stride*10+offset]= ((((z0 - z3)*qmul + 128 ) >> 8));
  1332. }
  1333. }
  1334. #if 0
  1335. /**
  1336. * dct tranforms the 16 dc values.
  1337. * @param qp quantization parameter ??? FIXME
  1338. */
  1339. static void h264_luma_dc_dct_c(DCTELEM *block/*, int qp*/){
  1340. // const int qmul= dequant_coeff[qp][0];
  1341. int i;
  1342. int temp[16]; //FIXME check if this is a good idea
  1343. static const int x_offset[4]={0, 1*stride, 4* stride, 5*stride};
  1344. static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};
  1345. for(i=0; i<4; i++){
  1346. const int offset= y_offset[i];
  1347. const int z0= block[offset+stride*0] + block[offset+stride*4];
  1348. const int z1= block[offset+stride*0] - block[offset+stride*4];
  1349. const int z2= block[offset+stride*1] - block[offset+stride*5];
  1350. const int z3= block[offset+stride*1] + block[offset+stride*5];
  1351. temp[4*i+0]= z0+z3;
  1352. temp[4*i+1]= z1+z2;
  1353. temp[4*i+2]= z1-z2;
  1354. temp[4*i+3]= z0-z3;
  1355. }
  1356. for(i=0; i<4; i++){
  1357. const int offset= x_offset[i];
  1358. const int z0= temp[4*0+i] + temp[4*2+i];
  1359. const int z1= temp[4*0+i] - temp[4*2+i];
  1360. const int z2= temp[4*1+i] - temp[4*3+i];
  1361. const int z3= temp[4*1+i] + temp[4*3+i];
  1362. block[stride*0 +offset]= (z0 + z3)>>1;
  1363. block[stride*2 +offset]= (z1 + z2)>>1;
  1364. block[stride*8 +offset]= (z1 - z2)>>1;
  1365. block[stride*10+offset]= (z0 - z3)>>1;
  1366. }
  1367. }
  1368. #endif
  1369. #undef xStride
  1370. #undef stride
  1371. static void chroma_dc_dequant_idct_c(DCTELEM *block, int qp, int qmul){
  1372. const int stride= 16*2;
  1373. const int xStride= 16;
  1374. int a,b,c,d,e;
  1375. a= block[stride*0 + xStride*0];
  1376. b= block[stride*0 + xStride*1];
  1377. c= block[stride*1 + xStride*0];
  1378. d= block[stride*1 + xStride*1];
  1379. e= a-b;
  1380. a= a+b;
  1381. b= c-d;
  1382. c= c+d;
  1383. block[stride*0 + xStride*0]= ((a+c)*qmul) >> 7;
  1384. block[stride*0 + xStride*1]= ((e+b)*qmul) >> 7;
  1385. block[stride*1 + xStride*0]= ((a-c)*qmul) >> 7;
  1386. block[stride*1 + xStride*1]= ((e-b)*qmul) >> 7;
  1387. }
  1388. #if 0
  1389. static void chroma_dc_dct_c(DCTELEM *block){
  1390. const int stride= 16*2;
  1391. const int xStride= 16;
  1392. int a,b,c,d,e;
  1393. a= block[stride*0 + xStride*0];
  1394. b= block[stride*0 + xStride*1];
  1395. c= block[stride*1 + xStride*0];
  1396. d= block[stride*1 + xStride*1];
  1397. e= a-b;
  1398. a= a+b;
  1399. b= c-d;
  1400. c= c+d;
  1401. block[stride*0 + xStride*0]= (a+c);
  1402. block[stride*0 + xStride*1]= (e+b);
  1403. block[stride*1 + xStride*0]= (a-c);
  1404. block[stride*1 + xStride*1]= (e-b);
  1405. }
  1406. #endif
  1407. /**
  1408. * gets the chroma qp.
  1409. */
  1410. static inline int get_chroma_qp(H264Context *h, int t, int qscale){
  1411. return h->pps.chroma_qp_table[t][qscale & 0xff];
  1412. }
  1413. //FIXME need to check that this does not overflow signed 32 bit for low qp, I am not sure, it's very close
  1414. //FIXME check that gcc inlines this (and optimizes intra & separate_dc stuff away)
  1415. static inline int quantize_c(DCTELEM *block, uint8_t *scantable, int qscale, int intra, int separate_dc){
  1416. int i;
  1417. const int * const quant_table= quant_coeff[qscale];
  1418. const int bias= intra ? (1<<QUANT_SHIFT)/3 : (1<<QUANT_SHIFT)/6;
  1419. const unsigned int threshold1= (1<<QUANT_SHIFT) - bias - 1;
  1420. const unsigned int threshold2= (threshold1<<1);
  1421. int last_non_zero;
  1422. if(separate_dc){
  1423. if(qscale<=18){
  1424. //avoid overflows
  1425. const int dc_bias= intra ? (1<<(QUANT_SHIFT-2))/3 : (1<<(QUANT_SHIFT-2))/6;
  1426. const unsigned int dc_threshold1= (1<<(QUANT_SHIFT-2)) - dc_bias - 1;
  1427. const unsigned int dc_threshold2= (dc_threshold1<<1);
  1428. int level= block[0]*quant_coeff[qscale+18][0];
  1429. if(((unsigned)(level+dc_threshold1))>dc_threshold2){
  1430. if(level>0){
  1431. level= (dc_bias + level)>>(QUANT_SHIFT-2);
  1432. block[0]= level;
  1433. }else{
  1434. level= (dc_bias - level)>>(QUANT_SHIFT-2);
  1435. block[0]= -level;
  1436. }
  1437. // last_non_zero = i;
  1438. }else{
  1439. block[0]=0;
  1440. }
  1441. }else{
  1442. const int dc_bias= intra ? (1<<(QUANT_SHIFT+1))/3 : (1<<(QUANT_SHIFT+1))/6;
  1443. const unsigned int dc_threshold1= (1<<(QUANT_SHIFT+1)) - dc_bias - 1;
  1444. const unsigned int dc_threshold2= (dc_threshold1<<1);
  1445. int level= block[0]*quant_table[0];
  1446. if(((unsigned)(level+dc_threshold1))>dc_threshold2){
  1447. if(level>0){
  1448. level= (dc_bias + level)>>(QUANT_SHIFT+1);
  1449. block[0]= level;
  1450. }else{
  1451. level= (dc_bias - level)>>(QUANT_SHIFT+1);
  1452. block[0]= -level;
  1453. }
  1454. // last_non_zero = i;
  1455. }else{
  1456. block[0]=0;
  1457. }
  1458. }
  1459. last_non_zero= 0;
  1460. i=1;
  1461. }else{
  1462. last_non_zero= -1;
  1463. i=0;
  1464. }
  1465. for(; i<16; i++){
  1466. const int j= scantable[i];
  1467. int level= block[j]*quant_table[j];
  1468. // if( bias+level >= (1<<(QMAT_SHIFT - 3))
  1469. // || bias-level >= (1<<(QMAT_SHIFT - 3))){
  1470. if(((unsigned)(level+threshold1))>threshold2){
  1471. if(level>0){
  1472. level= (bias + level)>>QUANT_SHIFT;
  1473. block[j]= level;
  1474. }else{
  1475. level= (bias - level)>>QUANT_SHIFT;
  1476. block[j]= -level;
  1477. }
  1478. last_non_zero = i;
  1479. }else{
  1480. block[j]=0;
  1481. }
  1482. }
  1483. return last_non_zero;
  1484. }
  1485. static inline void mc_dir_part(H264Context *h, Picture *pic, int n, int square, int chroma_height, int delta, int list,
  1486. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1487. int src_x_offset, int src_y_offset,
  1488. qpel_mc_func *qpix_op, h264_chroma_mc_func chroma_op){
  1489. MpegEncContext * const s = &h->s;
  1490. const int mx= h->mv_cache[list][ scan8[n] ][0] + src_x_offset*8;
  1491. int my= h->mv_cache[list][ scan8[n] ][1] + src_y_offset*8;
  1492. const int luma_xy= (mx&3) + ((my&3)<<2);
  1493. uint8_t * src_y = pic->data[0] + (mx>>2) + (my>>2)*h->mb_linesize;
  1494. uint8_t * src_cb, * src_cr;
  1495. int extra_width= h->emu_edge_width;
  1496. int extra_height= h->emu_edge_height;
  1497. int emu=0;
  1498. const int full_mx= mx>>2;
  1499. const int full_my= my>>2;
  1500. const int pic_width = 16*s->mb_width;
  1501. const int pic_height = 16*s->mb_height >> MB_FIELD;
  1502. if(!pic->data[0]) //FIXME this is unacceptable, some senseable error concealment must be done for missing reference frames
  1503. return;
  1504. if(mx&7) extra_width -= 3;
  1505. if(my&7) extra_height -= 3;
  1506. if( full_mx < 0-extra_width
  1507. || full_my < 0-extra_height
  1508. || full_mx + 16/*FIXME*/ > pic_width + extra_width
  1509. || full_my + 16/*FIXME*/ > pic_height + extra_height){
  1510. ff_emulated_edge_mc(s->edge_emu_buffer, src_y - 2 - 2*h->mb_linesize, h->mb_linesize, 16+5, 16+5/*FIXME*/, full_mx-2, full_my-2, pic_width, pic_height);
  1511. src_y= s->edge_emu_buffer + 2 + 2*h->mb_linesize;
  1512. emu=1;
  1513. }
  1514. qpix_op[luma_xy](dest_y, src_y, h->mb_linesize); //FIXME try variable height perhaps?
  1515. if(!square){
  1516. qpix_op[luma_xy](dest_y + delta, src_y + delta, h->mb_linesize);
  1517. }
  1518. if(ENABLE_GRAY && s->flags&CODEC_FLAG_GRAY) return;
  1519. if(MB_FIELD){
  1520. // chroma offset when predicting from a field of opposite parity
  1521. my += 2 * ((s->mb_y & 1) - (pic->reference - 1));
  1522. emu |= (my>>3) < 0 || (my>>3) + 8 >= (pic_height>>1);
  1523. }
  1524. src_cb= pic->data[1] + (mx>>3) + (my>>3)*h->mb_uvlinesize;
  1525. src_cr= pic->data[2] + (mx>>3) + (my>>3)*h->mb_uvlinesize;
  1526. if(emu){
  1527. ff_emulated_edge_mc(s->edge_emu_buffer, src_cb, h->mb_uvlinesize, 9, 9/*FIXME*/, (mx>>3), (my>>3), pic_width>>1, pic_height>>1);
  1528. src_cb= s->edge_emu_buffer;
  1529. }
  1530. chroma_op(dest_cb, src_cb, h->mb_uvlinesize, chroma_height, mx&7, my&7);
  1531. if(emu){
  1532. ff_emulated_edge_mc(s->edge_emu_buffer, src_cr, h->mb_uvlinesize, 9, 9/*FIXME*/, (mx>>3), (my>>3), pic_width>>1, pic_height>>1);
  1533. src_cr= s->edge_emu_buffer;
  1534. }
  1535. chroma_op(dest_cr, src_cr, h->mb_uvlinesize, chroma_height, mx&7, my&7);
  1536. }
  1537. static inline void mc_part_std(H264Context *h, int n, int square, int chroma_height, int delta,
  1538. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1539. int x_offset, int y_offset,
  1540. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  1541. qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,
  1542. int list0, int list1){
  1543. MpegEncContext * const s = &h->s;
  1544. qpel_mc_func *qpix_op= qpix_put;
  1545. h264_chroma_mc_func chroma_op= chroma_put;
  1546. dest_y += 2*x_offset + 2*y_offset*h-> mb_linesize;
  1547. dest_cb += x_offset + y_offset*h->mb_uvlinesize;
  1548. dest_cr += x_offset + y_offset*h->mb_uvlinesize;
  1549. x_offset += 8*s->mb_x;
  1550. y_offset += 8*(s->mb_y >> MB_FIELD);
  1551. if(list0){
  1552. Picture *ref= &h->ref_list[0][ h->ref_cache[0][ scan8[n] ] ];
  1553. mc_dir_part(h, ref, n, square, chroma_height, delta, 0,
  1554. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1555. qpix_op, chroma_op);
  1556. qpix_op= qpix_avg;
  1557. chroma_op= chroma_avg;
  1558. }
  1559. if(list1){
  1560. Picture *ref= &h->ref_list[1][ h->ref_cache[1][ scan8[n] ] ];
  1561. mc_dir_part(h, ref, n, square, chroma_height, delta, 1,
  1562. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1563. qpix_op, chroma_op);
  1564. }
  1565. }
  1566. static inline void mc_part_weighted(H264Context *h, int n, int square, int chroma_height, int delta,
  1567. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1568. int x_offset, int y_offset,
  1569. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  1570. h264_weight_func luma_weight_op, h264_weight_func chroma_weight_op,
  1571. h264_biweight_func luma_weight_avg, h264_biweight_func chroma_weight_avg,
  1572. int list0, int list1){
  1573. MpegEncContext * const s = &h->s;
  1574. dest_y += 2*x_offset + 2*y_offset*h-> mb_linesize;
  1575. dest_cb += x_offset + y_offset*h->mb_uvlinesize;
  1576. dest_cr += x_offset + y_offset*h->mb_uvlinesize;
  1577. x_offset += 8*s->mb_x;
  1578. y_offset += 8*(s->mb_y >> MB_FIELD);
  1579. if(list0 && list1){
  1580. /* don't optimize for luma-only case, since B-frames usually
  1581. * use implicit weights => chroma too. */
  1582. uint8_t *tmp_cb = s->obmc_scratchpad;
  1583. uint8_t *tmp_cr = s->obmc_scratchpad + 8;
  1584. uint8_t *tmp_y = s->obmc_scratchpad + 8*h->mb_uvlinesize;
  1585. int refn0 = h->ref_cache[0][ scan8[n] ];
  1586. int refn1 = h->ref_cache[1][ scan8[n] ];
  1587. mc_dir_part(h, &h->ref_list[0][refn0], n, square, chroma_height, delta, 0,
  1588. dest_y, dest_cb, dest_cr,
  1589. x_offset, y_offset, qpix_put, chroma_put);
  1590. mc_dir_part(h, &h->ref_list[1][refn1], n, square, chroma_height, delta, 1,
  1591. tmp_y, tmp_cb, tmp_cr,
  1592. x_offset, y_offset, qpix_put, chroma_put);
  1593. if(h->use_weight == 2){
  1594. int weight0 = h->implicit_weight[refn0][refn1];
  1595. int weight1 = 64 - weight0;
  1596. luma_weight_avg( dest_y, tmp_y, h-> mb_linesize, 5, weight0, weight1, 0);
  1597. chroma_weight_avg(dest_cb, tmp_cb, h->mb_uvlinesize, 5, weight0, weight1, 0);
  1598. chroma_weight_avg(dest_cr, tmp_cr, h->mb_uvlinesize, 5, weight0, weight1, 0);
  1599. }else{
  1600. luma_weight_avg(dest_y, tmp_y, h->mb_linesize, h->luma_log2_weight_denom,
  1601. h->luma_weight[0][refn0], h->luma_weight[1][refn1],
  1602. h->luma_offset[0][refn0] + h->luma_offset[1][refn1]);
  1603. chroma_weight_avg(dest_cb, tmp_cb, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  1604. h->chroma_weight[0][refn0][0], h->chroma_weight[1][refn1][0],
  1605. h->chroma_offset[0][refn0][0] + h->chroma_offset[1][refn1][0]);
  1606. chroma_weight_avg(dest_cr, tmp_cr, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  1607. h->chroma_weight[0][refn0][1], h->chroma_weight[1][refn1][1],
  1608. h->chroma_offset[0][refn0][1] + h->chroma_offset[1][refn1][1]);
  1609. }
  1610. }else{
  1611. int list = list1 ? 1 : 0;
  1612. int refn = h->ref_cache[list][ scan8[n] ];
  1613. Picture *ref= &h->ref_list[list][refn];
  1614. mc_dir_part(h, ref, n, square, chroma_height, delta, list,
  1615. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1616. qpix_put, chroma_put);
  1617. luma_weight_op(dest_y, h->mb_linesize, h->luma_log2_weight_denom,
  1618. h->luma_weight[list][refn], h->luma_offset[list][refn]);
  1619. if(h->use_weight_chroma){
  1620. chroma_weight_op(dest_cb, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  1621. h->chroma_weight[list][refn][0], h->chroma_offset[list][refn][0]);
  1622. chroma_weight_op(dest_cr, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  1623. h->chroma_weight[list][refn][1], h->chroma_offset[list][refn][1]);
  1624. }
  1625. }
  1626. }
  1627. static inline void mc_part(H264Context *h, int n, int square, int chroma_height, int delta,
  1628. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1629. int x_offset, int y_offset,
  1630. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  1631. qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,
  1632. h264_weight_func *weight_op, h264_biweight_func *weight_avg,
  1633. int list0, int list1){
  1634. if((h->use_weight==2 && list0 && list1
  1635. && (h->implicit_weight[ h->ref_cache[0][scan8[n]] ][ h->ref_cache[1][scan8[n]] ] != 32))
  1636. || h->use_weight==1)
  1637. mc_part_weighted(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,
  1638. x_offset, y_offset, qpix_put, chroma_put,
  1639. weight_op[0], weight_op[3], weight_avg[0], weight_avg[3], list0, list1);
  1640. else
  1641. mc_part_std(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,
  1642. x_offset, y_offset, qpix_put, chroma_put, qpix_avg, chroma_avg, list0, list1);
  1643. }
  1644. static inline void prefetch_motion(H264Context *h, int list){
  1645. /* fetch pixels for estimated mv 4 macroblocks ahead
  1646. * optimized for 64byte cache lines */
  1647. MpegEncContext * const s = &h->s;
  1648. const int refn = h->ref_cache[list][scan8[0]];
  1649. if(refn >= 0){
  1650. const int mx= (h->mv_cache[list][scan8[0]][0]>>2) + 16*s->mb_x + 8;
  1651. const int my= (h->mv_cache[list][scan8[0]][1]>>2) + 16*s->mb_y;
  1652. uint8_t **src= h->ref_list[list][refn].data;
  1653. int off= mx + (my + (s->mb_x&3)*4)*h->mb_linesize + 64;
  1654. s->dsp.prefetch(src[0]+off, s->linesize, 4);
  1655. off= (mx>>1) + ((my>>1) + (s->mb_x&7))*s->uvlinesize + 64;
  1656. s->dsp.prefetch(src[1]+off, src[2]-src[1], 2);
  1657. }
  1658. }
  1659. static void hl_motion(H264Context *h, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1660. qpel_mc_func (*qpix_put)[16], h264_chroma_mc_func (*chroma_put),
  1661. qpel_mc_func (*qpix_avg)[16], h264_chroma_mc_func (*chroma_avg),
  1662. h264_weight_func *weight_op, h264_biweight_func *weight_avg){
  1663. MpegEncContext * const s = &h->s;
  1664. const int mb_xy= h->mb_xy;
  1665. const int mb_type= s->current_picture.mb_type[mb_xy];
  1666. assert(IS_INTER(mb_type));
  1667. prefetch_motion(h, 0);
  1668. if(IS_16X16(mb_type)){
  1669. mc_part(h, 0, 1, 8, 0, dest_y, dest_cb, dest_cr, 0, 0,
  1670. qpix_put[0], chroma_put[0], qpix_avg[0], chroma_avg[0],
  1671. &weight_op[0], &weight_avg[0],
  1672. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  1673. }else if(IS_16X8(mb_type)){
  1674. mc_part(h, 0, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 0,
  1675. qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],
  1676. &weight_op[1], &weight_avg[1],
  1677. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  1678. mc_part(h, 8, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 4,
  1679. qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],
  1680. &weight_op[1], &weight_avg[1],
  1681. IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));
  1682. }else if(IS_8X16(mb_type)){
  1683. mc_part(h, 0, 0, 8, 8*h->mb_linesize, dest_y, dest_cb, dest_cr, 0, 0,
  1684. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  1685. &weight_op[2], &weight_avg[2],
  1686. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  1687. mc_part(h, 4, 0, 8, 8*h->mb_linesize, dest_y, dest_cb, dest_cr, 4, 0,
  1688. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  1689. &weight_op[2], &weight_avg[2],
  1690. IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));
  1691. }else{
  1692. int i;
  1693. assert(IS_8X8(mb_type));
  1694. for(i=0; i<4; i++){
  1695. const int sub_mb_type= h->sub_mb_type[i];
  1696. const int n= 4*i;
  1697. int x_offset= (i&1)<<2;
  1698. int y_offset= (i&2)<<1;
  1699. if(IS_SUB_8X8(sub_mb_type)){
  1700. mc_part(h, n, 1, 4, 0, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1701. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  1702. &weight_op[3], &weight_avg[3],
  1703. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  1704. }else if(IS_SUB_8X4(sub_mb_type)){
  1705. mc_part(h, n , 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1706. qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],
  1707. &weight_op[4], &weight_avg[4],
  1708. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  1709. mc_part(h, n+2, 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset+2,
  1710. qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],
  1711. &weight_op[4], &weight_avg[4],
  1712. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  1713. }else if(IS_SUB_4X8(sub_mb_type)){
  1714. mc_part(h, n , 0, 4, 4*h->mb_linesize, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1715. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  1716. &weight_op[5], &weight_avg[5],
  1717. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  1718. mc_part(h, n+1, 0, 4, 4*h->mb_linesize, dest_y, dest_cb, dest_cr, x_offset+2, y_offset,
  1719. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  1720. &weight_op[5], &weight_avg[5],
  1721. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  1722. }else{
  1723. int j;
  1724. assert(IS_SUB_4X4(sub_mb_type));
  1725. for(j=0; j<4; j++){
  1726. int sub_x_offset= x_offset + 2*(j&1);
  1727. int sub_y_offset= y_offset + (j&2);
  1728. mc_part(h, n+j, 1, 2, 0, dest_y, dest_cb, dest_cr, sub_x_offset, sub_y_offset,
  1729. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  1730. &weight_op[6], &weight_avg[6],
  1731. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  1732. }
  1733. }
  1734. }
  1735. }
  1736. prefetch_motion(h, 1);
  1737. }
  1738. static av_cold void decode_init_vlc(void){
  1739. static int done = 0;
  1740. if (!done) {
  1741. int i;
  1742. done = 1;
  1743. init_vlc(&chroma_dc_coeff_token_vlc, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 4*5,
  1744. &chroma_dc_coeff_token_len [0], 1, 1,
  1745. &chroma_dc_coeff_token_bits[0], 1, 1, 1);
  1746. for(i=0; i<4; i++){
  1747. init_vlc(&coeff_token_vlc[i], COEFF_TOKEN_VLC_BITS, 4*17,
  1748. &coeff_token_len [i][0], 1, 1,
  1749. &coeff_token_bits[i][0], 1, 1, 1);
  1750. }
  1751. for(i=0; i<3; i++){
  1752. init_vlc(&chroma_dc_total_zeros_vlc[i], CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 4,
  1753. &chroma_dc_total_zeros_len [i][0], 1, 1,
  1754. &chroma_dc_total_zeros_bits[i][0], 1, 1, 1);
  1755. }
  1756. for(i=0; i<15; i++){
  1757. init_vlc(&total_zeros_vlc[i], TOTAL_ZEROS_VLC_BITS, 16,
  1758. &total_zeros_len [i][0], 1, 1,
  1759. &total_zeros_bits[i][0], 1, 1, 1);
  1760. }
  1761. for(i=0; i<6; i++){
  1762. init_vlc(&run_vlc[i], RUN_VLC_BITS, 7,
  1763. &run_len [i][0], 1, 1,
  1764. &run_bits[i][0], 1, 1, 1);
  1765. }
  1766. init_vlc(&run7_vlc, RUN7_VLC_BITS, 16,
  1767. &run_len [6][0], 1, 1,
  1768. &run_bits[6][0], 1, 1, 1);
  1769. }
  1770. }
  1771. static void free_tables(H264Context *h){
  1772. int i;
  1773. H264Context *hx;
  1774. av_freep(&h->intra4x4_pred_mode);
  1775. av_freep(&h->chroma_pred_mode_table);
  1776. av_freep(&h->cbp_table);
  1777. av_freep(&h->mvd_table[0]);
  1778. av_freep(&h->mvd_table[1]);
  1779. av_freep(&h->direct_table);
  1780. av_freep(&h->non_zero_count);
  1781. av_freep(&h->slice_table_base);
  1782. h->slice_table= NULL;
  1783. av_freep(&h->mb2b_xy);
  1784. av_freep(&h->mb2b8_xy);
  1785. for(i = 0; i < MAX_SPS_COUNT; i++)
  1786. av_freep(h->sps_buffers + i);
  1787. for(i = 0; i < MAX_PPS_COUNT; i++)
  1788. av_freep(h->pps_buffers + i);
  1789. for(i = 0; i < h->s.avctx->thread_count; i++) {
  1790. hx = h->thread_context[i];
  1791. if(!hx) continue;
  1792. av_freep(&hx->top_borders[1]);
  1793. av_freep(&hx->top_borders[0]);
  1794. av_freep(&hx->s.obmc_scratchpad);
  1795. }
  1796. }
  1797. static void init_dequant8_coeff_table(H264Context *h){
  1798. int i,q,x;
  1799. const int transpose = (h->s.dsp.h264_idct8_add != ff_h264_idct8_add_c); //FIXME ugly
  1800. h->dequant8_coeff[0] = h->dequant8_buffer[0];
  1801. h->dequant8_coeff[1] = h->dequant8_buffer[1];
  1802. for(i=0; i<2; i++ ){
  1803. if(i && !memcmp(h->pps.scaling_matrix8[0], h->pps.scaling_matrix8[1], 64*sizeof(uint8_t))){
  1804. h->dequant8_coeff[1] = h->dequant8_buffer[0];
  1805. break;
  1806. }
  1807. for(q=0; q<52; q++){
  1808. int shift = ff_div6[q];
  1809. int idx = ff_rem6[q];
  1810. for(x=0; x<64; x++)
  1811. h->dequant8_coeff[i][q][transpose ? (x>>3)|((x&7)<<3) : x] =
  1812. ((uint32_t)dequant8_coeff_init[idx][ dequant8_coeff_init_scan[((x>>1)&12) | (x&3)] ] *
  1813. h->pps.scaling_matrix8[i][x]) << shift;
  1814. }
  1815. }
  1816. }
  1817. static void init_dequant4_coeff_table(H264Context *h){
  1818. int i,j,q,x;
  1819. const int transpose = (h->s.dsp.h264_idct_add != ff_h264_idct_add_c); //FIXME ugly
  1820. for(i=0; i<6; i++ ){
  1821. h->dequant4_coeff[i] = h->dequant4_buffer[i];
  1822. for(j=0; j<i; j++){
  1823. if(!memcmp(h->pps.scaling_matrix4[j], h->pps.scaling_matrix4[i], 16*sizeof(uint8_t))){
  1824. h->dequant4_coeff[i] = h->dequant4_buffer[j];
  1825. break;
  1826. }
  1827. }
  1828. if(j<i)
  1829. continue;
  1830. for(q=0; q<52; q++){
  1831. int shift = ff_div6[q] + 2;
  1832. int idx = ff_rem6[q];
  1833. for(x=0; x<16; x++)
  1834. h->dequant4_coeff[i][q][transpose ? (x>>2)|((x<<2)&0xF) : x] =
  1835. ((uint32_t)dequant4_coeff_init[idx][(x&1) + ((x>>2)&1)] *
  1836. h->pps.scaling_matrix4[i][x]) << shift;
  1837. }
  1838. }
  1839. }
  1840. static void init_dequant_tables(H264Context *h){
  1841. int i,x;
  1842. init_dequant4_coeff_table(h);
  1843. if(h->pps.transform_8x8_mode)
  1844. init_dequant8_coeff_table(h);
  1845. if(h->sps.transform_bypass){
  1846. for(i=0; i<6; i++)
  1847. for(x=0; x<16; x++)
  1848. h->dequant4_coeff[i][0][x] = 1<<6;
  1849. if(h->pps.transform_8x8_mode)
  1850. for(i=0; i<2; i++)
  1851. for(x=0; x<64; x++)
  1852. h->dequant8_coeff[i][0][x] = 1<<6;
  1853. }
  1854. }
  1855. /**
  1856. * allocates tables.
  1857. * needs width/height
  1858. */
  1859. static int alloc_tables(H264Context *h){
  1860. MpegEncContext * const s = &h->s;
  1861. const int big_mb_num= s->mb_stride * (s->mb_height+1);
  1862. int x,y;
  1863. CHECKED_ALLOCZ(h->intra4x4_pred_mode, big_mb_num * 8 * sizeof(uint8_t))
  1864. CHECKED_ALLOCZ(h->non_zero_count , big_mb_num * 16 * sizeof(uint8_t))
  1865. CHECKED_ALLOCZ(h->slice_table_base , (big_mb_num+s->mb_stride) * sizeof(uint8_t))
  1866. CHECKED_ALLOCZ(h->cbp_table, big_mb_num * sizeof(uint16_t))
  1867. CHECKED_ALLOCZ(h->chroma_pred_mode_table, big_mb_num * sizeof(uint8_t))
  1868. CHECKED_ALLOCZ(h->mvd_table[0], 32*big_mb_num * sizeof(uint16_t));
  1869. CHECKED_ALLOCZ(h->mvd_table[1], 32*big_mb_num * sizeof(uint16_t));
  1870. CHECKED_ALLOCZ(h->direct_table, 32*big_mb_num * sizeof(uint8_t));
  1871. memset(h->slice_table_base, -1, (big_mb_num+s->mb_stride) * sizeof(uint8_t));
  1872. h->slice_table= h->slice_table_base + s->mb_stride*2 + 1;
  1873. CHECKED_ALLOCZ(h->mb2b_xy , big_mb_num * sizeof(uint32_t));
  1874. CHECKED_ALLOCZ(h->mb2b8_xy , big_mb_num * sizeof(uint32_t));
  1875. for(y=0; y<s->mb_height; y++){
  1876. for(x=0; x<s->mb_width; x++){
  1877. const int mb_xy= x + y*s->mb_stride;
  1878. const int b_xy = 4*x + 4*y*h->b_stride;
  1879. const int b8_xy= 2*x + 2*y*h->b8_stride;
  1880. h->mb2b_xy [mb_xy]= b_xy;
  1881. h->mb2b8_xy[mb_xy]= b8_xy;
  1882. }
  1883. }
  1884. s->obmc_scratchpad = NULL;
  1885. if(!h->dequant4_coeff[0])
  1886. init_dequant_tables(h);
  1887. return 0;
  1888. fail:
  1889. free_tables(h);
  1890. return -1;
  1891. }
  1892. /**
  1893. * Mimic alloc_tables(), but for every context thread.
  1894. */
  1895. static void clone_tables(H264Context *dst, H264Context *src){
  1896. dst->intra4x4_pred_mode = src->intra4x4_pred_mode;
  1897. dst->non_zero_count = src->non_zero_count;
  1898. dst->slice_table = src->slice_table;
  1899. dst->cbp_table = src->cbp_table;
  1900. dst->mb2b_xy = src->mb2b_xy;
  1901. dst->mb2b8_xy = src->mb2b8_xy;
  1902. dst->chroma_pred_mode_table = src->chroma_pred_mode_table;
  1903. dst->mvd_table[0] = src->mvd_table[0];
  1904. dst->mvd_table[1] = src->mvd_table[1];
  1905. dst->direct_table = src->direct_table;
  1906. dst->s.obmc_scratchpad = NULL;
  1907. ff_h264_pred_init(&dst->hpc, src->s.codec_id);
  1908. }
  1909. /**
  1910. * Init context
  1911. * Allocate buffers which are not shared amongst multiple threads.
  1912. */
  1913. static int context_init(H264Context *h){
  1914. CHECKED_ALLOCZ(h->top_borders[0], h->s.mb_width * (16+8+8) * sizeof(uint8_t))
  1915. CHECKED_ALLOCZ(h->top_borders[1], h->s.mb_width * (16+8+8) * sizeof(uint8_t))
  1916. return 0;
  1917. fail:
  1918. return -1; // free_tables will clean up for us
  1919. }
  1920. static av_cold void common_init(H264Context *h){
  1921. MpegEncContext * const s = &h->s;
  1922. s->width = s->avctx->width;
  1923. s->height = s->avctx->height;
  1924. s->codec_id= s->avctx->codec->id;
  1925. ff_h264_pred_init(&h->hpc, s->codec_id);
  1926. h->dequant_coeff_pps= -1;
  1927. s->unrestricted_mv=1;
  1928. s->decode=1; //FIXME
  1929. memset(h->pps.scaling_matrix4, 16, 6*16*sizeof(uint8_t));
  1930. memset(h->pps.scaling_matrix8, 16, 2*64*sizeof(uint8_t));
  1931. }
  1932. static av_cold int decode_init(AVCodecContext *avctx){
  1933. H264Context *h= avctx->priv_data;
  1934. MpegEncContext * const s = &h->s;
  1935. MPV_decode_defaults(s);
  1936. s->avctx = avctx;
  1937. common_init(h);
  1938. s->out_format = FMT_H264;
  1939. s->workaround_bugs= avctx->workaround_bugs;
  1940. // set defaults
  1941. // s->decode_mb= ff_h263_decode_mb;
  1942. s->quarter_sample = 1;
  1943. s->low_delay= 1;
  1944. if(avctx->codec_id == CODEC_ID_SVQ3)
  1945. avctx->pix_fmt= PIX_FMT_YUVJ420P;
  1946. else
  1947. avctx->pix_fmt= PIX_FMT_YUV420P;
  1948. decode_init_vlc();
  1949. if(avctx->extradata_size > 0 && avctx->extradata &&
  1950. *(char *)avctx->extradata == 1){
  1951. h->is_avc = 1;
  1952. h->got_avcC = 0;
  1953. } else {
  1954. h->is_avc = 0;
  1955. }
  1956. h->thread_context[0] = h;
  1957. return 0;
  1958. }
  1959. static int frame_start(H264Context *h){
  1960. MpegEncContext * const s = &h->s;
  1961. int i;
  1962. if(MPV_frame_start(s, s->avctx) < 0)
  1963. return -1;
  1964. ff_er_frame_start(s);
  1965. /*
  1966. * MPV_frame_start uses pict_type to derive key_frame.
  1967. * This is incorrect for H.264; IDR markings must be used.
  1968. * Zero here; IDR markings per slice in frame or fields are OR'd in later.
  1969. * See decode_nal_units().
  1970. */
  1971. s->current_picture_ptr->key_frame= 0;
  1972. assert(s->linesize && s->uvlinesize);
  1973. for(i=0; i<16; i++){
  1974. h->block_offset[i]= 4*((scan8[i] - scan8[0])&7) + 4*s->linesize*((scan8[i] - scan8[0])>>3);
  1975. h->block_offset[24+i]= 4*((scan8[i] - scan8[0])&7) + 8*s->linesize*((scan8[i] - scan8[0])>>3);
  1976. }
  1977. for(i=0; i<4; i++){
  1978. h->block_offset[16+i]=
  1979. h->block_offset[20+i]= 4*((scan8[i] - scan8[0])&7) + 4*s->uvlinesize*((scan8[i] - scan8[0])>>3);
  1980. h->block_offset[24+16+i]=
  1981. h->block_offset[24+20+i]= 4*((scan8[i] - scan8[0])&7) + 8*s->uvlinesize*((scan8[i] - scan8[0])>>3);
  1982. }
  1983. /* can't be in alloc_tables because linesize isn't known there.
  1984. * FIXME: redo bipred weight to not require extra buffer? */
  1985. for(i = 0; i < s->avctx->thread_count; i++)
  1986. if(!h->thread_context[i]->s.obmc_scratchpad)
  1987. h->thread_context[i]->s.obmc_scratchpad = av_malloc(16*2*s->linesize + 8*2*s->uvlinesize);
  1988. /* some macroblocks will be accessed before they're available */
  1989. if(FRAME_MBAFF || s->avctx->thread_count > 1)
  1990. memset(h->slice_table, -1, (s->mb_height*s->mb_stride-1) * sizeof(uint8_t));
  1991. // s->decode= (s->flags&CODEC_FLAG_PSNR) || !s->encoding || s->current_picture.reference /*|| h->contains_intra*/ || 1;
  1992. // We mark the current picture as non reference after allocating it, so
  1993. // that if we break out due to an error it can be released automatically
  1994. // in the next MPV_frame_start().
  1995. // SVQ3 as well as most other codecs have only last/next/current and thus
  1996. // get released even with set reference, besides SVQ3 and others do not
  1997. // mark frames as reference later "naturally".
  1998. if(s->codec_id != CODEC_ID_SVQ3)
  1999. s->current_picture_ptr->reference= 0;
  2000. return 0;
  2001. }
  2002. static inline void backup_mb_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize, int simple){
  2003. MpegEncContext * const s = &h->s;
  2004. int i;
  2005. src_y -= linesize;
  2006. src_cb -= uvlinesize;
  2007. src_cr -= uvlinesize;
  2008. // There are two lines saved, the line above the the top macroblock of a pair,
  2009. // and the line above the bottom macroblock
  2010. h->left_border[0]= h->top_borders[0][s->mb_x][15];
  2011. for(i=1; i<17; i++){
  2012. h->left_border[i]= src_y[15+i* linesize];
  2013. }
  2014. *(uint64_t*)(h->top_borders[0][s->mb_x]+0)= *(uint64_t*)(src_y + 16*linesize);
  2015. *(uint64_t*)(h->top_borders[0][s->mb_x]+8)= *(uint64_t*)(src_y +8+16*linesize);
  2016. if(simple || !ENABLE_GRAY || !(s->flags&CODEC_FLAG_GRAY)){
  2017. h->left_border[17 ]= h->top_borders[0][s->mb_x][16+7];
  2018. h->left_border[17+9]= h->top_borders[0][s->mb_x][24+7];
  2019. for(i=1; i<9; i++){
  2020. h->left_border[i+17 ]= src_cb[7+i*uvlinesize];
  2021. h->left_border[i+17+9]= src_cr[7+i*uvlinesize];
  2022. }
  2023. *(uint64_t*)(h->top_borders[0][s->mb_x]+16)= *(uint64_t*)(src_cb+8*uvlinesize);
  2024. *(uint64_t*)(h->top_borders[0][s->mb_x]+24)= *(uint64_t*)(src_cr+8*uvlinesize);
  2025. }
  2026. }
  2027. static inline void xchg_mb_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize, int xchg, int simple){
  2028. MpegEncContext * const s = &h->s;
  2029. int temp8, i;
  2030. uint64_t temp64;
  2031. int deblock_left;
  2032. int deblock_top;
  2033. int mb_xy;
  2034. if(h->deblocking_filter == 2) {
  2035. mb_xy = h->mb_xy;
  2036. deblock_left = h->slice_table[mb_xy] == h->slice_table[mb_xy - 1];
  2037. deblock_top = h->slice_table[mb_xy] == h->slice_table[h->top_mb_xy];
  2038. } else {
  2039. deblock_left = (s->mb_x > 0);
  2040. deblock_top = (s->mb_y > 0);
  2041. }
  2042. src_y -= linesize + 1;
  2043. src_cb -= uvlinesize + 1;
  2044. src_cr -= uvlinesize + 1;
  2045. #define XCHG(a,b,t,xchg)\
  2046. t= a;\
  2047. if(xchg)\
  2048. a= b;\
  2049. b= t;
  2050. if(deblock_left){
  2051. for(i = !deblock_top; i<17; i++){
  2052. XCHG(h->left_border[i ], src_y [i* linesize], temp8, xchg);
  2053. }
  2054. }
  2055. if(deblock_top){
  2056. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+0), *(uint64_t*)(src_y +1), temp64, xchg);
  2057. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+8), *(uint64_t*)(src_y +9), temp64, 1);
  2058. if(s->mb_x+1 < s->mb_width){
  2059. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x+1]), *(uint64_t*)(src_y +17), temp64, 1);
  2060. }
  2061. }
  2062. if(simple || !ENABLE_GRAY || !(s->flags&CODEC_FLAG_GRAY)){
  2063. if(deblock_left){
  2064. for(i = !deblock_top; i<9; i++){
  2065. XCHG(h->left_border[i+17 ], src_cb[i*uvlinesize], temp8, xchg);
  2066. XCHG(h->left_border[i+17+9], src_cr[i*uvlinesize], temp8, xchg);
  2067. }
  2068. }
  2069. if(deblock_top){
  2070. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+16), *(uint64_t*)(src_cb+1), temp64, 1);
  2071. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+24), *(uint64_t*)(src_cr+1), temp64, 1);
  2072. }
  2073. }
  2074. }
  2075. static inline void backup_pair_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize){
  2076. MpegEncContext * const s = &h->s;
  2077. int i;
  2078. src_y -= 2 * linesize;
  2079. src_cb -= 2 * uvlinesize;
  2080. src_cr -= 2 * uvlinesize;
  2081. // There are two lines saved, the line above the the top macroblock of a pair,
  2082. // and the line above the bottom macroblock
  2083. h->left_border[0]= h->top_borders[0][s->mb_x][15];
  2084. h->left_border[1]= h->top_borders[1][s->mb_x][15];
  2085. for(i=2; i<34; i++){
  2086. h->left_border[i]= src_y[15+i* linesize];
  2087. }
  2088. *(uint64_t*)(h->top_borders[0][s->mb_x]+0)= *(uint64_t*)(src_y + 32*linesize);
  2089. *(uint64_t*)(h->top_borders[0][s->mb_x]+8)= *(uint64_t*)(src_y +8+32*linesize);
  2090. *(uint64_t*)(h->top_borders[1][s->mb_x]+0)= *(uint64_t*)(src_y + 33*linesize);
  2091. *(uint64_t*)(h->top_borders[1][s->mb_x]+8)= *(uint64_t*)(src_y +8+33*linesize);
  2092. if(!ENABLE_GRAY || !(s->flags&CODEC_FLAG_GRAY)){
  2093. h->left_border[34 ]= h->top_borders[0][s->mb_x][16+7];
  2094. h->left_border[34+ 1]= h->top_borders[1][s->mb_x][16+7];
  2095. h->left_border[34+18 ]= h->top_borders[0][s->mb_x][24+7];
  2096. h->left_border[34+18+1]= h->top_borders[1][s->mb_x][24+7];
  2097. for(i=2; i<18; i++){
  2098. h->left_border[i+34 ]= src_cb[7+i*uvlinesize];
  2099. h->left_border[i+34+18]= src_cr[7+i*uvlinesize];
  2100. }
  2101. *(uint64_t*)(h->top_borders[0][s->mb_x]+16)= *(uint64_t*)(src_cb+16*uvlinesize);
  2102. *(uint64_t*)(h->top_borders[0][s->mb_x]+24)= *(uint64_t*)(src_cr+16*uvlinesize);
  2103. *(uint64_t*)(h->top_borders[1][s->mb_x]+16)= *(uint64_t*)(src_cb+17*uvlinesize);
  2104. *(uint64_t*)(h->top_borders[1][s->mb_x]+24)= *(uint64_t*)(src_cr+17*uvlinesize);
  2105. }
  2106. }
  2107. static inline void xchg_pair_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize, int xchg){
  2108. MpegEncContext * const s = &h->s;
  2109. int temp8, i;
  2110. uint64_t temp64;
  2111. int deblock_left = (s->mb_x > 0);
  2112. int deblock_top = (s->mb_y > 1);
  2113. tprintf(s->avctx, "xchg_pair_border: src_y:%p src_cb:%p src_cr:%p ls:%d uvls:%d\n", src_y, src_cb, src_cr, linesize, uvlinesize);
  2114. src_y -= 2 * linesize + 1;
  2115. src_cb -= 2 * uvlinesize + 1;
  2116. src_cr -= 2 * uvlinesize + 1;
  2117. #define XCHG(a,b,t,xchg)\
  2118. t= a;\
  2119. if(xchg)\
  2120. a= b;\
  2121. b= t;
  2122. if(deblock_left){
  2123. for(i = (!deblock_top)<<1; i<34; i++){
  2124. XCHG(h->left_border[i ], src_y [i* linesize], temp8, xchg);
  2125. }
  2126. }
  2127. if(deblock_top){
  2128. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+0), *(uint64_t*)(src_y +1), temp64, xchg);
  2129. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+8), *(uint64_t*)(src_y +9), temp64, 1);
  2130. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+0), *(uint64_t*)(src_y +1 +linesize), temp64, xchg);
  2131. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+8), *(uint64_t*)(src_y +9 +linesize), temp64, 1);
  2132. if(s->mb_x+1 < s->mb_width){
  2133. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x+1]), *(uint64_t*)(src_y +17), temp64, 1);
  2134. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x+1]), *(uint64_t*)(src_y +17 +linesize), temp64, 1);
  2135. }
  2136. }
  2137. if(!ENABLE_GRAY || !(s->flags&CODEC_FLAG_GRAY)){
  2138. if(deblock_left){
  2139. for(i = (!deblock_top) << 1; i<18; i++){
  2140. XCHG(h->left_border[i+34 ], src_cb[i*uvlinesize], temp8, xchg);
  2141. XCHG(h->left_border[i+34+18], src_cr[i*uvlinesize], temp8, xchg);
  2142. }
  2143. }
  2144. if(deblock_top){
  2145. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+16), *(uint64_t*)(src_cb+1), temp64, 1);
  2146. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+24), *(uint64_t*)(src_cr+1), temp64, 1);
  2147. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+16), *(uint64_t*)(src_cb+1 +uvlinesize), temp64, 1);
  2148. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+24), *(uint64_t*)(src_cr+1 +uvlinesize), temp64, 1);
  2149. }
  2150. }
  2151. }
  2152. static av_always_inline void hl_decode_mb_internal(H264Context *h, int simple){
  2153. MpegEncContext * const s = &h->s;
  2154. const int mb_x= s->mb_x;
  2155. const int mb_y= s->mb_y;
  2156. const int mb_xy= h->mb_xy;
  2157. const int mb_type= s->current_picture.mb_type[mb_xy];
  2158. uint8_t *dest_y, *dest_cb, *dest_cr;
  2159. int linesize, uvlinesize /*dct_offset*/;
  2160. int i;
  2161. int *block_offset = &h->block_offset[0];
  2162. const unsigned int bottom = mb_y & 1;
  2163. const int transform_bypass = (s->qscale == 0 && h->sps.transform_bypass), is_h264 = (simple || s->codec_id == CODEC_ID_H264);
  2164. void (*idct_add)(uint8_t *dst, DCTELEM *block, int stride);
  2165. void (*idct_dc_add)(uint8_t *dst, DCTELEM *block, int stride);
  2166. dest_y = s->current_picture.data[0] + (mb_y * 16* s->linesize ) + mb_x * 16;
  2167. dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2168. dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2169. s->dsp.prefetch(dest_y + (s->mb_x&3)*4*s->linesize + 64, s->linesize, 4);
  2170. s->dsp.prefetch(dest_cb + (s->mb_x&7)*s->uvlinesize + 64, dest_cr - dest_cb, 2);
  2171. if (!simple && MB_FIELD) {
  2172. linesize = h->mb_linesize = s->linesize * 2;
  2173. uvlinesize = h->mb_uvlinesize = s->uvlinesize * 2;
  2174. block_offset = &h->block_offset[24];
  2175. if(mb_y&1){ //FIXME move out of this func?
  2176. dest_y -= s->linesize*15;
  2177. dest_cb-= s->uvlinesize*7;
  2178. dest_cr-= s->uvlinesize*7;
  2179. }
  2180. if(FRAME_MBAFF) {
  2181. int list;
  2182. for(list=0; list<h->list_count; list++){
  2183. if(!USES_LIST(mb_type, list))
  2184. continue;
  2185. if(IS_16X16(mb_type)){
  2186. int8_t *ref = &h->ref_cache[list][scan8[0]];
  2187. fill_rectangle(ref, 4, 4, 8, (16+*ref)^(s->mb_y&1), 1);
  2188. }else{
  2189. for(i=0; i<16; i+=4){
  2190. //FIXME can refs be smaller than 8x8 when !direct_8x8_inference ?
  2191. int ref = h->ref_cache[list][scan8[i]];
  2192. if(ref >= 0)
  2193. fill_rectangle(&h->ref_cache[list][scan8[i]], 2, 2, 8, (16+ref)^(s->mb_y&1), 1);
  2194. }
  2195. }
  2196. }
  2197. }
  2198. } else {
  2199. linesize = h->mb_linesize = s->linesize;
  2200. uvlinesize = h->mb_uvlinesize = s->uvlinesize;
  2201. // dct_offset = s->linesize * 16;
  2202. }
  2203. if(transform_bypass){
  2204. idct_dc_add =
  2205. idct_add = IS_8x8DCT(mb_type) ? s->dsp.add_pixels8 : s->dsp.add_pixels4;
  2206. }else if(IS_8x8DCT(mb_type)){
  2207. idct_dc_add = s->dsp.h264_idct8_dc_add;
  2208. idct_add = s->dsp.h264_idct8_add;
  2209. }else{
  2210. idct_dc_add = s->dsp.h264_idct_dc_add;
  2211. idct_add = s->dsp.h264_idct_add;
  2212. }
  2213. if(!simple && FRAME_MBAFF && h->deblocking_filter && IS_INTRA(mb_type)
  2214. && (!bottom || !IS_INTRA(s->current_picture.mb_type[mb_xy-s->mb_stride]))){
  2215. int mbt_y = mb_y&~1;
  2216. uint8_t *top_y = s->current_picture.data[0] + (mbt_y * 16* s->linesize ) + mb_x * 16;
  2217. uint8_t *top_cb = s->current_picture.data[1] + (mbt_y * 8 * s->uvlinesize) + mb_x * 8;
  2218. uint8_t *top_cr = s->current_picture.data[2] + (mbt_y * 8 * s->uvlinesize) + mb_x * 8;
  2219. xchg_pair_border(h, top_y, top_cb, top_cr, s->linesize, s->uvlinesize, 1);
  2220. }
  2221. if (!simple && IS_INTRA_PCM(mb_type)) {
  2222. unsigned int x, y;
  2223. // The pixels are stored in h->mb array in the same order as levels,
  2224. // copy them in output in the correct order.
  2225. for(i=0; i<16; i++) {
  2226. for (y=0; y<4; y++) {
  2227. for (x=0; x<4; x++) {
  2228. *(dest_y + block_offset[i] + y*linesize + x) = h->mb[i*16+y*4+x];
  2229. }
  2230. }
  2231. }
  2232. for(i=16; i<16+4; i++) {
  2233. for (y=0; y<4; y++) {
  2234. for (x=0; x<4; x++) {
  2235. *(dest_cb + block_offset[i] + y*uvlinesize + x) = h->mb[i*16+y*4+x];
  2236. }
  2237. }
  2238. }
  2239. for(i=20; i<20+4; i++) {
  2240. for (y=0; y<4; y++) {
  2241. for (x=0; x<4; x++) {
  2242. *(dest_cr + block_offset[i] + y*uvlinesize + x) = h->mb[i*16+y*4+x];
  2243. }
  2244. }
  2245. }
  2246. } else {
  2247. if(IS_INTRA(mb_type)){
  2248. if(h->deblocking_filter && (simple || !FRAME_MBAFF))
  2249. xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 1, simple);
  2250. if(simple || !ENABLE_GRAY || !(s->flags&CODEC_FLAG_GRAY)){
  2251. h->hpc.pred8x8[ h->chroma_pred_mode ](dest_cb, uvlinesize);
  2252. h->hpc.pred8x8[ h->chroma_pred_mode ](dest_cr, uvlinesize);
  2253. }
  2254. if(IS_INTRA4x4(mb_type)){
  2255. if(simple || !s->encoding){
  2256. if(IS_8x8DCT(mb_type)){
  2257. for(i=0; i<16; i+=4){
  2258. uint8_t * const ptr= dest_y + block_offset[i];
  2259. const int dir= h->intra4x4_pred_mode_cache[ scan8[i] ];
  2260. const int nnz = h->non_zero_count_cache[ scan8[i] ];
  2261. h->hpc.pred8x8l[ dir ](ptr, (h->topleft_samples_available<<i)&0x8000,
  2262. (h->topright_samples_available<<i)&0x4000, linesize);
  2263. if(nnz){
  2264. if(nnz == 1 && h->mb[i*16])
  2265. idct_dc_add(ptr, h->mb + i*16, linesize);
  2266. else
  2267. idct_add(ptr, h->mb + i*16, linesize);
  2268. }
  2269. }
  2270. }else
  2271. for(i=0; i<16; i++){
  2272. uint8_t * const ptr= dest_y + block_offset[i];
  2273. uint8_t *topright;
  2274. const int dir= h->intra4x4_pred_mode_cache[ scan8[i] ];
  2275. int nnz, tr;
  2276. if(dir == DIAG_DOWN_LEFT_PRED || dir == VERT_LEFT_PRED){
  2277. const int topright_avail= (h->topright_samples_available<<i)&0x8000;
  2278. assert(mb_y || linesize <= block_offset[i]);
  2279. if(!topright_avail){
  2280. tr= ptr[3 - linesize]*0x01010101;
  2281. topright= (uint8_t*) &tr;
  2282. }else
  2283. topright= ptr + 4 - linesize;
  2284. }else
  2285. topright= NULL;
  2286. h->hpc.pred4x4[ dir ](ptr, topright, linesize);
  2287. nnz = h->non_zero_count_cache[ scan8[i] ];
  2288. if(nnz){
  2289. if(is_h264){
  2290. if(nnz == 1 && h->mb[i*16])
  2291. idct_dc_add(ptr, h->mb + i*16, linesize);
  2292. else
  2293. idct_add(ptr, h->mb + i*16, linesize);
  2294. }else
  2295. svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, 0);
  2296. }
  2297. }
  2298. }
  2299. }else{
  2300. h->hpc.pred16x16[ h->intra16x16_pred_mode ](dest_y , linesize);
  2301. if(is_h264){
  2302. if(!transform_bypass)
  2303. h264_luma_dc_dequant_idct_c(h->mb, s->qscale, h->dequant4_coeff[0][s->qscale][0]);
  2304. }else
  2305. svq3_luma_dc_dequant_idct_c(h->mb, s->qscale);
  2306. }
  2307. if(h->deblocking_filter && (simple || !FRAME_MBAFF))
  2308. xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 0, simple);
  2309. }else if(is_h264){
  2310. hl_motion(h, dest_y, dest_cb, dest_cr,
  2311. s->me.qpel_put, s->dsp.put_h264_chroma_pixels_tab,
  2312. s->me.qpel_avg, s->dsp.avg_h264_chroma_pixels_tab,
  2313. s->dsp.weight_h264_pixels_tab, s->dsp.biweight_h264_pixels_tab);
  2314. }
  2315. if(!IS_INTRA4x4(mb_type)){
  2316. if(is_h264){
  2317. if(IS_INTRA16x16(mb_type)){
  2318. for(i=0; i<16; i++){
  2319. if(h->non_zero_count_cache[ scan8[i] ])
  2320. idct_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2321. else if(h->mb[i*16])
  2322. idct_dc_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2323. }
  2324. }else{
  2325. const int di = IS_8x8DCT(mb_type) ? 4 : 1;
  2326. for(i=0; i<16; i+=di){
  2327. int nnz = h->non_zero_count_cache[ scan8[i] ];
  2328. if(nnz){
  2329. if(nnz==1 && h->mb[i*16])
  2330. idct_dc_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2331. else
  2332. idct_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2333. }
  2334. }
  2335. }
  2336. }else{
  2337. for(i=0; i<16; i++){
  2338. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){ //FIXME benchmark weird rule, & below
  2339. uint8_t * const ptr= dest_y + block_offset[i];
  2340. svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, IS_INTRA(mb_type) ? 1 : 0);
  2341. }
  2342. }
  2343. }
  2344. }
  2345. if(simple || !ENABLE_GRAY || !(s->flags&CODEC_FLAG_GRAY)){
  2346. uint8_t *dest[2] = {dest_cb, dest_cr};
  2347. if(transform_bypass){
  2348. idct_add = idct_dc_add = s->dsp.add_pixels4;
  2349. }else{
  2350. idct_add = s->dsp.h264_idct_add;
  2351. idct_dc_add = s->dsp.h264_idct_dc_add;
  2352. chroma_dc_dequant_idct_c(h->mb + 16*16, h->chroma_qp[0], h->dequant4_coeff[IS_INTRA(mb_type) ? 1:4][h->chroma_qp[0]][0]);
  2353. chroma_dc_dequant_idct_c(h->mb + 16*16+4*16, h->chroma_qp[1], h->dequant4_coeff[IS_INTRA(mb_type) ? 2:5][h->chroma_qp[1]][0]);
  2354. }
  2355. if(is_h264){
  2356. for(i=16; i<16+8; i++){
  2357. if(h->non_zero_count_cache[ scan8[i] ])
  2358. idct_add(dest[(i&4)>>2] + block_offset[i], h->mb + i*16, uvlinesize);
  2359. else if(h->mb[i*16])
  2360. idct_dc_add(dest[(i&4)>>2] + block_offset[i], h->mb + i*16, uvlinesize);
  2361. }
  2362. }else{
  2363. for(i=16; i<16+8; i++){
  2364. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){
  2365. uint8_t * const ptr= dest[(i&4)>>2] + block_offset[i];
  2366. svq3_add_idct_c(ptr, h->mb + i*16, uvlinesize, chroma_qp[s->qscale + 12] - 12, 2);
  2367. }
  2368. }
  2369. }
  2370. }
  2371. }
  2372. if(h->deblocking_filter) {
  2373. if (!simple && FRAME_MBAFF) {
  2374. //FIXME try deblocking one mb at a time?
  2375. // the reduction in load/storing mvs and such might outweigh the extra backup/xchg_border
  2376. const int mb_y = s->mb_y - 1;
  2377. uint8_t *pair_dest_y, *pair_dest_cb, *pair_dest_cr;
  2378. const int mb_xy= mb_x + mb_y*s->mb_stride;
  2379. const int mb_type_top = s->current_picture.mb_type[mb_xy];
  2380. const int mb_type_bottom= s->current_picture.mb_type[mb_xy+s->mb_stride];
  2381. if (!bottom) return;
  2382. pair_dest_y = s->current_picture.data[0] + (mb_y * 16* s->linesize ) + mb_x * 16;
  2383. pair_dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2384. pair_dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2385. if(IS_INTRA(mb_type_top | mb_type_bottom))
  2386. xchg_pair_border(h, pair_dest_y, pair_dest_cb, pair_dest_cr, s->linesize, s->uvlinesize, 0);
  2387. backup_pair_border(h, pair_dest_y, pair_dest_cb, pair_dest_cr, s->linesize, s->uvlinesize);
  2388. // deblock a pair
  2389. // top
  2390. s->mb_y--; h->mb_xy -= s->mb_stride;
  2391. tprintf(h->s.avctx, "call mbaff filter_mb mb_x:%d mb_y:%d pair_dest_y = %p, dest_y = %p\n", mb_x, mb_y, pair_dest_y, dest_y);
  2392. fill_caches(h, mb_type_top, 1); //FIXME don't fill stuff which isn't used by filter_mb
  2393. h->chroma_qp[0] = get_chroma_qp(h, 0, s->current_picture.qscale_table[mb_xy]);
  2394. h->chroma_qp[1] = get_chroma_qp(h, 1, s->current_picture.qscale_table[mb_xy]);
  2395. filter_mb(h, mb_x, mb_y, pair_dest_y, pair_dest_cb, pair_dest_cr, linesize, uvlinesize);
  2396. // bottom
  2397. s->mb_y++; h->mb_xy += s->mb_stride;
  2398. tprintf(h->s.avctx, "call mbaff filter_mb\n");
  2399. fill_caches(h, mb_type_bottom, 1); //FIXME don't fill stuff which isn't used by filter_mb
  2400. h->chroma_qp[0] = get_chroma_qp(h, 0, s->current_picture.qscale_table[mb_xy+s->mb_stride]);
  2401. h->chroma_qp[1] = get_chroma_qp(h, 1, s->current_picture.qscale_table[mb_xy+s->mb_stride]);
  2402. filter_mb(h, mb_x, mb_y+1, dest_y, dest_cb, dest_cr, linesize, uvlinesize);
  2403. } else {
  2404. tprintf(h->s.avctx, "call filter_mb\n");
  2405. backup_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, simple);
  2406. fill_caches(h, mb_type, 1); //FIXME don't fill stuff which isn't used by filter_mb
  2407. filter_mb_fast(h, mb_x, mb_y, dest_y, dest_cb, dest_cr, linesize, uvlinesize);
  2408. }
  2409. }
  2410. }
  2411. /**
  2412. * Process a macroblock; this case avoids checks for expensive uncommon cases.
  2413. */
  2414. static void hl_decode_mb_simple(H264Context *h){
  2415. hl_decode_mb_internal(h, 1);
  2416. }
  2417. /**
  2418. * Process a macroblock; this handles edge cases, such as interlacing.
  2419. */
  2420. static void av_noinline hl_decode_mb_complex(H264Context *h){
  2421. hl_decode_mb_internal(h, 0);
  2422. }
  2423. static void hl_decode_mb(H264Context *h){
  2424. MpegEncContext * const s = &h->s;
  2425. const int mb_xy= h->mb_xy;
  2426. const int mb_type= s->current_picture.mb_type[mb_xy];
  2427. int is_complex = FRAME_MBAFF || MB_FIELD || IS_INTRA_PCM(mb_type) || s->codec_id != CODEC_ID_H264 ||
  2428. (ENABLE_GRAY && (s->flags&CODEC_FLAG_GRAY)) || (ENABLE_H264_ENCODER && s->encoding) || ENABLE_SMALL;
  2429. if(ENABLE_H264_ENCODER && !s->decode)
  2430. return;
  2431. if (is_complex)
  2432. hl_decode_mb_complex(h);
  2433. else hl_decode_mb_simple(h);
  2434. }
  2435. static void pic_as_field(Picture *pic, const int parity){
  2436. int i;
  2437. for (i = 0; i < 4; ++i) {
  2438. if (parity == PICT_BOTTOM_FIELD)
  2439. pic->data[i] += pic->linesize[i];
  2440. pic->reference = parity;
  2441. pic->linesize[i] *= 2;
  2442. }
  2443. }
  2444. static int split_field_copy(Picture *dest, Picture *src,
  2445. int parity, int id_add){
  2446. int match = !!(src->reference & parity);
  2447. if (match) {
  2448. *dest = *src;
  2449. pic_as_field(dest, parity);
  2450. dest->pic_id *= 2;
  2451. dest->pic_id += id_add;
  2452. }
  2453. return match;
  2454. }
  2455. /**
  2456. * Split one reference list into field parts, interleaving by parity
  2457. * as per H.264 spec section 8.2.4.2.5. Output fields have their data pointers
  2458. * set to look at the actual start of data for that field.
  2459. *
  2460. * @param dest output list
  2461. * @param dest_len maximum number of fields to put in dest
  2462. * @param src the source reference list containing fields and/or field pairs
  2463. * (aka short_ref/long_ref, or
  2464. * refFrameListXShortTerm/refFrameListLongTerm in spec-speak)
  2465. * @param src_len number of Picture's in source (pairs and unmatched fields)
  2466. * @param parity the parity of the picture being decoded/needing
  2467. * these ref pics (PICT_{TOP,BOTTOM}_FIELD)
  2468. * @return number of fields placed in dest
  2469. */
  2470. static int split_field_half_ref_list(Picture *dest, int dest_len,
  2471. Picture *src, int src_len, int parity){
  2472. int same_parity = 1;
  2473. int same_i = 0;
  2474. int opp_i = 0;
  2475. int out_i;
  2476. int field_output;
  2477. for (out_i = 0; out_i < dest_len; out_i += field_output) {
  2478. if (same_parity && same_i < src_len) {
  2479. field_output = split_field_copy(dest + out_i, src + same_i,
  2480. parity, 1);
  2481. same_parity = !field_output;
  2482. same_i++;
  2483. } else if (opp_i < src_len) {
  2484. field_output = split_field_copy(dest + out_i, src + opp_i,
  2485. PICT_FRAME - parity, 0);
  2486. same_parity = field_output;
  2487. opp_i++;
  2488. } else {
  2489. break;
  2490. }
  2491. }
  2492. return out_i;
  2493. }
  2494. /**
  2495. * Split the reference frame list into a reference field list.
  2496. * This implements H.264 spec 8.2.4.2.5 for a combined input list.
  2497. * The input list contains both reference field pairs and
  2498. * unmatched reference fields; it is ordered as spec describes
  2499. * RefPicListX for frames in 8.2.4.2.1 and 8.2.4.2.3, except that
  2500. * unmatched field pairs are also present. Conceptually this is equivalent
  2501. * to concatenation of refFrameListXShortTerm with refFrameListLongTerm.
  2502. *
  2503. * @param dest output reference list where ordered fields are to be placed
  2504. * @param dest_len max number of fields to place at dest
  2505. * @param src source reference list, as described above
  2506. * @param src_len number of pictures (pairs and unmatched fields) in src
  2507. * @param parity parity of field being currently decoded
  2508. * (one of PICT_{TOP,BOTTOM}_FIELD)
  2509. * @param long_i index into src array that holds first long reference picture,
  2510. * or src_len if no long refs present.
  2511. */
  2512. static int split_field_ref_list(Picture *dest, int dest_len,
  2513. Picture *src, int src_len,
  2514. int parity, int long_i){
  2515. int i = split_field_half_ref_list(dest, dest_len, src, long_i, parity);
  2516. dest += i;
  2517. dest_len -= i;
  2518. i += split_field_half_ref_list(dest, dest_len, src + long_i,
  2519. src_len - long_i, parity);
  2520. return i;
  2521. }
  2522. /**
  2523. * fills the default_ref_list.
  2524. */
  2525. static int fill_default_ref_list(H264Context *h){
  2526. MpegEncContext * const s = &h->s;
  2527. int i;
  2528. int smallest_poc_greater_than_current = -1;
  2529. int structure_sel;
  2530. Picture sorted_short_ref[32];
  2531. Picture field_entry_list[2][32];
  2532. Picture *frame_list[2];
  2533. if (FIELD_PICTURE) {
  2534. structure_sel = PICT_FRAME;
  2535. frame_list[0] = field_entry_list[0];
  2536. frame_list[1] = field_entry_list[1];
  2537. } else {
  2538. structure_sel = 0;
  2539. frame_list[0] = h->default_ref_list[0];
  2540. frame_list[1] = h->default_ref_list[1];
  2541. }
  2542. if(h->slice_type==FF_B_TYPE){
  2543. int list;
  2544. int len[2];
  2545. int short_len[2];
  2546. int out_i;
  2547. int limit= INT_MIN;
  2548. /* sort frame according to poc in B slice */
  2549. for(out_i=0; out_i<h->short_ref_count; out_i++){
  2550. int best_i=INT_MIN;
  2551. int best_poc=INT_MAX;
  2552. for(i=0; i<h->short_ref_count; i++){
  2553. const int poc= h->short_ref[i]->poc;
  2554. if(poc > limit && poc < best_poc){
  2555. best_poc= poc;
  2556. best_i= i;
  2557. }
  2558. }
  2559. assert(best_i != INT_MIN);
  2560. limit= best_poc;
  2561. sorted_short_ref[out_i]= *h->short_ref[best_i];
  2562. tprintf(h->s.avctx, "sorted poc: %d->%d poc:%d fn:%d\n", best_i, out_i, sorted_short_ref[out_i].poc, sorted_short_ref[out_i].frame_num);
  2563. if (-1 == smallest_poc_greater_than_current) {
  2564. if (h->short_ref[best_i]->poc >= s->current_picture_ptr->poc) {
  2565. smallest_poc_greater_than_current = out_i;
  2566. }
  2567. }
  2568. }
  2569. tprintf(h->s.avctx, "current poc: %d, smallest_poc_greater_than_current: %d\n", s->current_picture_ptr->poc, smallest_poc_greater_than_current);
  2570. // find the largest poc
  2571. for(list=0; list<2; list++){
  2572. int index = 0;
  2573. int j= -99;
  2574. int step= list ? -1 : 1;
  2575. for(i=0; i<h->short_ref_count && index < h->ref_count[list]; i++, j+=step) {
  2576. int sel;
  2577. while(j<0 || j>= h->short_ref_count){
  2578. if(j != -99 && step == (list ? -1 : 1))
  2579. return -1;
  2580. step = -step;
  2581. j= smallest_poc_greater_than_current + (step>>1);
  2582. }
  2583. sel = sorted_short_ref[j].reference | structure_sel;
  2584. if(sel != PICT_FRAME) continue;
  2585. frame_list[list][index ]= sorted_short_ref[j];
  2586. frame_list[list][index++].pic_id= sorted_short_ref[j].frame_num;
  2587. }
  2588. short_len[list] = index;
  2589. for(i = 0; i < 16 && index < h->ref_count[ list ]; i++){
  2590. int sel;
  2591. if(h->long_ref[i] == NULL) continue;
  2592. sel = h->long_ref[i]->reference | structure_sel;
  2593. if(sel != PICT_FRAME) continue;
  2594. frame_list[ list ][index ]= *h->long_ref[i];
  2595. frame_list[ list ][index++].pic_id= i;
  2596. }
  2597. len[list] = index;
  2598. }
  2599. for(list=0; list<2; list++){
  2600. if (FIELD_PICTURE)
  2601. len[list] = split_field_ref_list(h->default_ref_list[list],
  2602. h->ref_count[list],
  2603. frame_list[list],
  2604. len[list],
  2605. s->picture_structure,
  2606. short_len[list]);
  2607. // swap the two first elements of L1 when L0 and L1 are identical
  2608. if(list && len[0] > 1 && len[0] == len[1])
  2609. for(i=0; h->default_ref_list[0][i].data[0] == h->default_ref_list[1][i].data[0]; i++)
  2610. if(i == len[0]){
  2611. FFSWAP(Picture, h->default_ref_list[1][0], h->default_ref_list[1][1]);
  2612. break;
  2613. }
  2614. if(len[list] < h->ref_count[ list ])
  2615. memset(&h->default_ref_list[list][len[list]], 0, sizeof(Picture)*(h->ref_count[ list ] - len[list]));
  2616. }
  2617. }else{
  2618. int index=0;
  2619. int short_len;
  2620. for(i=0; i<h->short_ref_count; i++){
  2621. int sel;
  2622. sel = h->short_ref[i]->reference | structure_sel;
  2623. if(sel != PICT_FRAME) continue;
  2624. frame_list[0][index ]= *h->short_ref[i];
  2625. frame_list[0][index++].pic_id= h->short_ref[i]->frame_num;
  2626. }
  2627. short_len = index;
  2628. for(i = 0; i < 16; i++){
  2629. int sel;
  2630. if(h->long_ref[i] == NULL) continue;
  2631. sel = h->long_ref[i]->reference | structure_sel;
  2632. if(sel != PICT_FRAME) continue;
  2633. frame_list[0][index ]= *h->long_ref[i];
  2634. frame_list[0][index++].pic_id= i;
  2635. }
  2636. if (FIELD_PICTURE)
  2637. index = split_field_ref_list(h->default_ref_list[0],
  2638. h->ref_count[0], frame_list[0],
  2639. index, s->picture_structure,
  2640. short_len);
  2641. if(index < h->ref_count[0])
  2642. memset(&h->default_ref_list[0][index], 0, sizeof(Picture)*(h->ref_count[0] - index));
  2643. }
  2644. #ifdef TRACE
  2645. for (i=0; i<h->ref_count[0]; i++) {
  2646. tprintf(h->s.avctx, "List0: %s fn:%d 0x%p\n", (h->default_ref_list[0][i].long_ref ? "LT" : "ST"), h->default_ref_list[0][i].pic_id, h->default_ref_list[0][i].data[0]);
  2647. }
  2648. if(h->slice_type==FF_B_TYPE){
  2649. for (i=0; i<h->ref_count[1]; i++) {
  2650. tprintf(h->s.avctx, "List1: %s fn:%d 0x%p\n", (h->default_ref_list[1][i].long_ref ? "LT" : "ST"), h->default_ref_list[1][i].pic_id, h->default_ref_list[1][i].data[0]);
  2651. }
  2652. }
  2653. #endif
  2654. return 0;
  2655. }
  2656. static void print_short_term(H264Context *h);
  2657. static void print_long_term(H264Context *h);
  2658. /**
  2659. * Extract structure information about the picture described by pic_num in
  2660. * the current decoding context (frame or field). Note that pic_num is
  2661. * picture number without wrapping (so, 0<=pic_num<max_pic_num).
  2662. * @param pic_num picture number for which to extract structure information
  2663. * @param structure one of PICT_XXX describing structure of picture
  2664. * with pic_num
  2665. * @return frame number (short term) or long term index of picture
  2666. * described by pic_num
  2667. */
  2668. static int pic_num_extract(H264Context *h, int pic_num, int *structure){
  2669. MpegEncContext * const s = &h->s;
  2670. *structure = s->picture_structure;
  2671. if(FIELD_PICTURE){
  2672. if (!(pic_num & 1))
  2673. /* opposite field */
  2674. *structure ^= PICT_FRAME;
  2675. pic_num >>= 1;
  2676. }
  2677. return pic_num;
  2678. }
  2679. static int decode_ref_pic_list_reordering(H264Context *h){
  2680. MpegEncContext * const s = &h->s;
  2681. int list, index, pic_structure;
  2682. print_short_term(h);
  2683. print_long_term(h);
  2684. if(h->slice_type==FF_I_TYPE || h->slice_type==FF_SI_TYPE) return 0; //FIXME move before func
  2685. for(list=0; list<h->list_count; list++){
  2686. memcpy(h->ref_list[list], h->default_ref_list[list], sizeof(Picture)*h->ref_count[list]);
  2687. if(get_bits1(&s->gb)){
  2688. int pred= h->curr_pic_num;
  2689. for(index=0; ; index++){
  2690. unsigned int reordering_of_pic_nums_idc= get_ue_golomb(&s->gb);
  2691. unsigned int pic_id;
  2692. int i;
  2693. Picture *ref = NULL;
  2694. if(reordering_of_pic_nums_idc==3)
  2695. break;
  2696. if(index >= h->ref_count[list]){
  2697. av_log(h->s.avctx, AV_LOG_ERROR, "reference count overflow\n");
  2698. return -1;
  2699. }
  2700. if(reordering_of_pic_nums_idc<3){
  2701. if(reordering_of_pic_nums_idc<2){
  2702. const unsigned int abs_diff_pic_num= get_ue_golomb(&s->gb) + 1;
  2703. int frame_num;
  2704. if(abs_diff_pic_num > h->max_pic_num){
  2705. av_log(h->s.avctx, AV_LOG_ERROR, "abs_diff_pic_num overflow\n");
  2706. return -1;
  2707. }
  2708. if(reordering_of_pic_nums_idc == 0) pred-= abs_diff_pic_num;
  2709. else pred+= abs_diff_pic_num;
  2710. pred &= h->max_pic_num - 1;
  2711. frame_num = pic_num_extract(h, pred, &pic_structure);
  2712. for(i= h->short_ref_count-1; i>=0; i--){
  2713. ref = h->short_ref[i];
  2714. assert(ref->reference);
  2715. assert(!ref->long_ref);
  2716. if(ref->data[0] != NULL &&
  2717. ref->frame_num == frame_num &&
  2718. (ref->reference & pic_structure) &&
  2719. ref->long_ref == 0) // ignore non existing pictures by testing data[0] pointer
  2720. break;
  2721. }
  2722. if(i>=0)
  2723. ref->pic_id= pred;
  2724. }else{
  2725. int long_idx;
  2726. pic_id= get_ue_golomb(&s->gb); //long_term_pic_idx
  2727. long_idx= pic_num_extract(h, pic_id, &pic_structure);
  2728. if(long_idx>31){
  2729. av_log(h->s.avctx, AV_LOG_ERROR, "long_term_pic_idx overflow\n");
  2730. return -1;
  2731. }
  2732. ref = h->long_ref[long_idx];
  2733. assert(!(ref && !ref->reference));
  2734. if(ref && (ref->reference & pic_structure)){
  2735. ref->pic_id= pic_id;
  2736. assert(ref->long_ref);
  2737. i=0;
  2738. }else{
  2739. i=-1;
  2740. }
  2741. }
  2742. if (i < 0) {
  2743. av_log(h->s.avctx, AV_LOG_ERROR, "reference picture missing during reorder\n");
  2744. memset(&h->ref_list[list][index], 0, sizeof(Picture)); //FIXME
  2745. } else {
  2746. for(i=index; i+1<h->ref_count[list]; i++){
  2747. if(ref->long_ref == h->ref_list[list][i].long_ref && ref->pic_id == h->ref_list[list][i].pic_id)
  2748. break;
  2749. }
  2750. for(; i > index; i--){
  2751. h->ref_list[list][i]= h->ref_list[list][i-1];
  2752. }
  2753. h->ref_list[list][index]= *ref;
  2754. if (FIELD_PICTURE){
  2755. pic_as_field(&h->ref_list[list][index], pic_structure);
  2756. }
  2757. }
  2758. }else{
  2759. av_log(h->s.avctx, AV_LOG_ERROR, "illegal reordering_of_pic_nums_idc\n");
  2760. return -1;
  2761. }
  2762. }
  2763. }
  2764. }
  2765. for(list=0; list<h->list_count; list++){
  2766. for(index= 0; index < h->ref_count[list]; index++){
  2767. if(!h->ref_list[list][index].data[0])
  2768. h->ref_list[list][index]= s->current_picture;
  2769. }
  2770. }
  2771. if(h->slice_type==FF_B_TYPE && !h->direct_spatial_mv_pred)
  2772. direct_dist_scale_factor(h);
  2773. direct_ref_list_init(h);
  2774. return 0;
  2775. }
  2776. static void fill_mbaff_ref_list(H264Context *h){
  2777. int list, i, j;
  2778. for(list=0; list<2; list++){ //FIXME try list_count
  2779. for(i=0; i<h->ref_count[list]; i++){
  2780. Picture *frame = &h->ref_list[list][i];
  2781. Picture *field = &h->ref_list[list][16+2*i];
  2782. field[0] = *frame;
  2783. for(j=0; j<3; j++)
  2784. field[0].linesize[j] <<= 1;
  2785. field[0].reference = PICT_TOP_FIELD;
  2786. field[1] = field[0];
  2787. for(j=0; j<3; j++)
  2788. field[1].data[j] += frame->linesize[j];
  2789. field[1].reference = PICT_BOTTOM_FIELD;
  2790. h->luma_weight[list][16+2*i] = h->luma_weight[list][16+2*i+1] = h->luma_weight[list][i];
  2791. h->luma_offset[list][16+2*i] = h->luma_offset[list][16+2*i+1] = h->luma_offset[list][i];
  2792. for(j=0; j<2; j++){
  2793. h->chroma_weight[list][16+2*i][j] = h->chroma_weight[list][16+2*i+1][j] = h->chroma_weight[list][i][j];
  2794. h->chroma_offset[list][16+2*i][j] = h->chroma_offset[list][16+2*i+1][j] = h->chroma_offset[list][i][j];
  2795. }
  2796. }
  2797. }
  2798. for(j=0; j<h->ref_count[1]; j++){
  2799. for(i=0; i<h->ref_count[0]; i++)
  2800. h->implicit_weight[j][16+2*i] = h->implicit_weight[j][16+2*i+1] = h->implicit_weight[j][i];
  2801. memcpy(h->implicit_weight[16+2*j], h->implicit_weight[j], sizeof(*h->implicit_weight));
  2802. memcpy(h->implicit_weight[16+2*j+1], h->implicit_weight[j], sizeof(*h->implicit_weight));
  2803. }
  2804. }
  2805. static int pred_weight_table(H264Context *h){
  2806. MpegEncContext * const s = &h->s;
  2807. int list, i;
  2808. int luma_def, chroma_def;
  2809. h->use_weight= 0;
  2810. h->use_weight_chroma= 0;
  2811. h->luma_log2_weight_denom= get_ue_golomb(&s->gb);
  2812. h->chroma_log2_weight_denom= get_ue_golomb(&s->gb);
  2813. luma_def = 1<<h->luma_log2_weight_denom;
  2814. chroma_def = 1<<h->chroma_log2_weight_denom;
  2815. for(list=0; list<2; list++){
  2816. for(i=0; i<h->ref_count[list]; i++){
  2817. int luma_weight_flag, chroma_weight_flag;
  2818. luma_weight_flag= get_bits1(&s->gb);
  2819. if(luma_weight_flag){
  2820. h->luma_weight[list][i]= get_se_golomb(&s->gb);
  2821. h->luma_offset[list][i]= get_se_golomb(&s->gb);
  2822. if( h->luma_weight[list][i] != luma_def
  2823. || h->luma_offset[list][i] != 0)
  2824. h->use_weight= 1;
  2825. }else{
  2826. h->luma_weight[list][i]= luma_def;
  2827. h->luma_offset[list][i]= 0;
  2828. }
  2829. chroma_weight_flag= get_bits1(&s->gb);
  2830. if(chroma_weight_flag){
  2831. int j;
  2832. for(j=0; j<2; j++){
  2833. h->chroma_weight[list][i][j]= get_se_golomb(&s->gb);
  2834. h->chroma_offset[list][i][j]= get_se_golomb(&s->gb);
  2835. if( h->chroma_weight[list][i][j] != chroma_def
  2836. || h->chroma_offset[list][i][j] != 0)
  2837. h->use_weight_chroma= 1;
  2838. }
  2839. }else{
  2840. int j;
  2841. for(j=0; j<2; j++){
  2842. h->chroma_weight[list][i][j]= chroma_def;
  2843. h->chroma_offset[list][i][j]= 0;
  2844. }
  2845. }
  2846. }
  2847. if(h->slice_type != FF_B_TYPE) break;
  2848. }
  2849. h->use_weight= h->use_weight || h->use_weight_chroma;
  2850. return 0;
  2851. }
  2852. static void implicit_weight_table(H264Context *h){
  2853. MpegEncContext * const s = &h->s;
  2854. int ref0, ref1;
  2855. int cur_poc = s->current_picture_ptr->poc;
  2856. if( h->ref_count[0] == 1 && h->ref_count[1] == 1
  2857. && h->ref_list[0][0].poc + h->ref_list[1][0].poc == 2*cur_poc){
  2858. h->use_weight= 0;
  2859. h->use_weight_chroma= 0;
  2860. return;
  2861. }
  2862. h->use_weight= 2;
  2863. h->use_weight_chroma= 2;
  2864. h->luma_log2_weight_denom= 5;
  2865. h->chroma_log2_weight_denom= 5;
  2866. for(ref0=0; ref0 < h->ref_count[0]; ref0++){
  2867. int poc0 = h->ref_list[0][ref0].poc;
  2868. for(ref1=0; ref1 < h->ref_count[1]; ref1++){
  2869. int poc1 = h->ref_list[1][ref1].poc;
  2870. int td = av_clip(poc1 - poc0, -128, 127);
  2871. if(td){
  2872. int tb = av_clip(cur_poc - poc0, -128, 127);
  2873. int tx = (16384 + (FFABS(td) >> 1)) / td;
  2874. int dist_scale_factor = av_clip((tb*tx + 32) >> 6, -1024, 1023) >> 2;
  2875. if(dist_scale_factor < -64 || dist_scale_factor > 128)
  2876. h->implicit_weight[ref0][ref1] = 32;
  2877. else
  2878. h->implicit_weight[ref0][ref1] = 64 - dist_scale_factor;
  2879. }else
  2880. h->implicit_weight[ref0][ref1] = 32;
  2881. }
  2882. }
  2883. }
  2884. /**
  2885. * Mark a picture as no longer needed for reference. The refmask
  2886. * argument allows unreferencing of individual fields or the whole frame.
  2887. * If the picture becomes entirely unreferenced, but is being held for
  2888. * display purposes, it is marked as such.
  2889. * @param refmask mask of fields to unreference; the mask is bitwise
  2890. * anded with the reference marking of pic
  2891. * @return non-zero if pic becomes entirely unreferenced (except possibly
  2892. * for display purposes) zero if one of the fields remains in
  2893. * reference
  2894. */
  2895. static inline int unreference_pic(H264Context *h, Picture *pic, int refmask){
  2896. int i;
  2897. if (pic->reference &= refmask) {
  2898. return 0;
  2899. } else {
  2900. for(i = 0; h->delayed_pic[i]; i++)
  2901. if(pic == h->delayed_pic[i]){
  2902. pic->reference=DELAYED_PIC_REF;
  2903. break;
  2904. }
  2905. return 1;
  2906. }
  2907. }
  2908. /**
  2909. * instantaneous decoder refresh.
  2910. */
  2911. static void idr(H264Context *h){
  2912. int i;
  2913. for(i=0; i<16; i++){
  2914. if (h->long_ref[i] != NULL) {
  2915. unreference_pic(h, h->long_ref[i], 0);
  2916. h->long_ref[i]= NULL;
  2917. }
  2918. }
  2919. h->long_ref_count=0;
  2920. for(i=0; i<h->short_ref_count; i++){
  2921. unreference_pic(h, h->short_ref[i], 0);
  2922. h->short_ref[i]= NULL;
  2923. }
  2924. h->short_ref_count=0;
  2925. }
  2926. /* forget old pics after a seek */
  2927. static void flush_dpb(AVCodecContext *avctx){
  2928. H264Context *h= avctx->priv_data;
  2929. int i;
  2930. for(i=0; i<MAX_DELAYED_PIC_COUNT; i++) {
  2931. if(h->delayed_pic[i])
  2932. h->delayed_pic[i]->reference= 0;
  2933. h->delayed_pic[i]= NULL;
  2934. }
  2935. h->outputed_poc= INT_MIN;
  2936. idr(h);
  2937. if(h->s.current_picture_ptr)
  2938. h->s.current_picture_ptr->reference= 0;
  2939. h->s.first_field= 0;
  2940. ff_mpeg_flush(avctx);
  2941. }
  2942. /**
  2943. * Find a Picture in the short term reference list by frame number.
  2944. * @param frame_num frame number to search for
  2945. * @param idx the index into h->short_ref where returned picture is found
  2946. * undefined if no picture found.
  2947. * @return pointer to the found picture, or NULL if no pic with the provided
  2948. * frame number is found
  2949. */
  2950. static Picture * find_short(H264Context *h, int frame_num, int *idx){
  2951. MpegEncContext * const s = &h->s;
  2952. int i;
  2953. for(i=0; i<h->short_ref_count; i++){
  2954. Picture *pic= h->short_ref[i];
  2955. if(s->avctx->debug&FF_DEBUG_MMCO)
  2956. av_log(h->s.avctx, AV_LOG_DEBUG, "%d %d %p\n", i, pic->frame_num, pic);
  2957. if(pic->frame_num == frame_num) {
  2958. *idx = i;
  2959. return pic;
  2960. }
  2961. }
  2962. return NULL;
  2963. }
  2964. /**
  2965. * Remove a picture from the short term reference list by its index in
  2966. * that list. This does no checking on the provided index; it is assumed
  2967. * to be valid. Other list entries are shifted down.
  2968. * @param i index into h->short_ref of picture to remove.
  2969. */
  2970. static void remove_short_at_index(H264Context *h, int i){
  2971. assert(i >= 0 && i < h->short_ref_count);
  2972. h->short_ref[i]= NULL;
  2973. if (--h->short_ref_count)
  2974. memmove(&h->short_ref[i], &h->short_ref[i+1], (h->short_ref_count - i)*sizeof(Picture*));
  2975. }
  2976. /**
  2977. *
  2978. * @return the removed picture or NULL if an error occurs
  2979. */
  2980. static Picture * remove_short(H264Context *h, int frame_num){
  2981. MpegEncContext * const s = &h->s;
  2982. Picture *pic;
  2983. int i;
  2984. if(s->avctx->debug&FF_DEBUG_MMCO)
  2985. av_log(h->s.avctx, AV_LOG_DEBUG, "remove short %d count %d\n", frame_num, h->short_ref_count);
  2986. pic = find_short(h, frame_num, &i);
  2987. if (pic)
  2988. remove_short_at_index(h, i);
  2989. return pic;
  2990. }
  2991. /**
  2992. * Remove a picture from the long term reference list by its index in
  2993. * that list. This does no checking on the provided index; it is assumed
  2994. * to be valid. The removed entry is set to NULL. Other entries are unaffected.
  2995. * @param i index into h->long_ref of picture to remove.
  2996. */
  2997. static void remove_long_at_index(H264Context *h, int i){
  2998. h->long_ref[i]= NULL;
  2999. h->long_ref_count--;
  3000. }
  3001. /**
  3002. *
  3003. * @return the removed picture or NULL if an error occurs
  3004. */
  3005. static Picture * remove_long(H264Context *h, int i){
  3006. Picture *pic;
  3007. pic= h->long_ref[i];
  3008. if (pic)
  3009. remove_long_at_index(h, i);
  3010. return pic;
  3011. }
  3012. /**
  3013. * print short term list
  3014. */
  3015. static void print_short_term(H264Context *h) {
  3016. uint32_t i;
  3017. if(h->s.avctx->debug&FF_DEBUG_MMCO) {
  3018. av_log(h->s.avctx, AV_LOG_DEBUG, "short term list:\n");
  3019. for(i=0; i<h->short_ref_count; i++){
  3020. Picture *pic= h->short_ref[i];
  3021. av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);
  3022. }
  3023. }
  3024. }
  3025. /**
  3026. * print long term list
  3027. */
  3028. static void print_long_term(H264Context *h) {
  3029. uint32_t i;
  3030. if(h->s.avctx->debug&FF_DEBUG_MMCO) {
  3031. av_log(h->s.avctx, AV_LOG_DEBUG, "long term list:\n");
  3032. for(i = 0; i < 16; i++){
  3033. Picture *pic= h->long_ref[i];
  3034. if (pic) {
  3035. av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);
  3036. }
  3037. }
  3038. }
  3039. }
  3040. /**
  3041. * Executes the reference picture marking (memory management control operations).
  3042. */
  3043. static int execute_ref_pic_marking(H264Context *h, MMCO *mmco, int mmco_count){
  3044. MpegEncContext * const s = &h->s;
  3045. int i, j;
  3046. int current_ref_assigned=0;
  3047. Picture *pic;
  3048. if((s->avctx->debug&FF_DEBUG_MMCO) && mmco_count==0)
  3049. av_log(h->s.avctx, AV_LOG_DEBUG, "no mmco here\n");
  3050. for(i=0; i<mmco_count; i++){
  3051. int structure, frame_num, unref_pic;
  3052. if(s->avctx->debug&FF_DEBUG_MMCO)
  3053. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco:%d %d %d\n", h->mmco[i].opcode, h->mmco[i].short_pic_num, h->mmco[i].long_arg);
  3054. switch(mmco[i].opcode){
  3055. case MMCO_SHORT2UNUSED:
  3056. if(s->avctx->debug&FF_DEBUG_MMCO)
  3057. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: unref short %d count %d\n", h->mmco[i].short_pic_num, h->short_ref_count);
  3058. frame_num = pic_num_extract(h, mmco[i].short_pic_num, &structure);
  3059. pic = find_short(h, frame_num, &j);
  3060. if (pic) {
  3061. if (unreference_pic(h, pic, structure ^ PICT_FRAME))
  3062. remove_short_at_index(h, j);
  3063. } else if(s->avctx->debug&FF_DEBUG_MMCO)
  3064. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: unref short failure\n");
  3065. break;
  3066. case MMCO_SHORT2LONG:
  3067. if (FIELD_PICTURE && mmco[i].long_arg < h->long_ref_count &&
  3068. h->long_ref[mmco[i].long_arg]->frame_num ==
  3069. mmco[i].short_pic_num / 2) {
  3070. /* do nothing, we've already moved this field pair. */
  3071. } else {
  3072. int frame_num = mmco[i].short_pic_num >> FIELD_PICTURE;
  3073. pic= remove_long(h, mmco[i].long_arg);
  3074. if(pic) unreference_pic(h, pic, 0);
  3075. h->long_ref[ mmco[i].long_arg ]= remove_short(h, frame_num);
  3076. if (h->long_ref[ mmco[i].long_arg ]){
  3077. h->long_ref[ mmco[i].long_arg ]->long_ref=1;
  3078. h->long_ref_count++;
  3079. }
  3080. }
  3081. break;
  3082. case MMCO_LONG2UNUSED:
  3083. j = pic_num_extract(h, mmco[i].long_arg, &structure);
  3084. pic = h->long_ref[j];
  3085. if (pic) {
  3086. if (unreference_pic(h, pic, structure ^ PICT_FRAME))
  3087. remove_long_at_index(h, j);
  3088. } else if(s->avctx->debug&FF_DEBUG_MMCO)
  3089. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: unref long failure\n");
  3090. break;
  3091. case MMCO_LONG:
  3092. unref_pic = 1;
  3093. if (FIELD_PICTURE && !s->first_field) {
  3094. if (h->long_ref[mmco[i].long_arg] == s->current_picture_ptr) {
  3095. /* Just mark second field as referenced */
  3096. unref_pic = 0;
  3097. } else if (s->current_picture_ptr->reference) {
  3098. /* First field in pair is in short term list or
  3099. * at a different long term index.
  3100. * This is not allowed; see 7.4.3, notes 2 and 3.
  3101. * Report the problem and keep the pair where it is,
  3102. * and mark this field valid.
  3103. */
  3104. av_log(h->s.avctx, AV_LOG_ERROR,
  3105. "illegal long term reference assignment for second "
  3106. "field in complementary field pair (first field is "
  3107. "short term or has non-matching long index)\n");
  3108. unref_pic = 0;
  3109. }
  3110. }
  3111. if (unref_pic) {
  3112. pic= remove_long(h, mmco[i].long_arg);
  3113. if(pic) unreference_pic(h, pic, 0);
  3114. h->long_ref[ mmco[i].long_arg ]= s->current_picture_ptr;
  3115. h->long_ref[ mmco[i].long_arg ]->long_ref=1;
  3116. h->long_ref_count++;
  3117. }
  3118. s->current_picture_ptr->reference |= s->picture_structure;
  3119. current_ref_assigned=1;
  3120. break;
  3121. case MMCO_SET_MAX_LONG:
  3122. assert(mmco[i].long_arg <= 16);
  3123. // just remove the long term which index is greater than new max
  3124. for(j = mmco[i].long_arg; j<16; j++){
  3125. pic = remove_long(h, j);
  3126. if (pic) unreference_pic(h, pic, 0);
  3127. }
  3128. break;
  3129. case MMCO_RESET:
  3130. while(h->short_ref_count){
  3131. pic= remove_short(h, h->short_ref[0]->frame_num);
  3132. if(pic) unreference_pic(h, pic, 0);
  3133. }
  3134. for(j = 0; j < 16; j++) {
  3135. pic= remove_long(h, j);
  3136. if(pic) unreference_pic(h, pic, 0);
  3137. }
  3138. break;
  3139. default: assert(0);
  3140. }
  3141. }
  3142. if (!current_ref_assigned && FIELD_PICTURE &&
  3143. !s->first_field && s->current_picture_ptr->reference) {
  3144. /* Second field of complementary field pair; the first field of
  3145. * which is already referenced. If short referenced, it
  3146. * should be first entry in short_ref. If not, it must exist
  3147. * in long_ref; trying to put it on the short list here is an
  3148. * error in the encoded bit stream (ref: 7.4.3, NOTE 2 and 3).
  3149. */
  3150. if (h->short_ref_count && h->short_ref[0] == s->current_picture_ptr) {
  3151. /* Just mark the second field valid */
  3152. s->current_picture_ptr->reference = PICT_FRAME;
  3153. } else if (s->current_picture_ptr->long_ref) {
  3154. av_log(h->s.avctx, AV_LOG_ERROR, "illegal short term reference "
  3155. "assignment for second field "
  3156. "in complementary field pair "
  3157. "(first field is long term)\n");
  3158. } else {
  3159. /*
  3160. * First field in reference, but not in any sensible place on our
  3161. * reference lists. This shouldn't happen unless reference
  3162. * handling somewhere else is wrong.
  3163. */
  3164. assert(0);
  3165. }
  3166. current_ref_assigned = 1;
  3167. }
  3168. if(!current_ref_assigned){
  3169. pic= remove_short(h, s->current_picture_ptr->frame_num);
  3170. if(pic){
  3171. unreference_pic(h, pic, 0);
  3172. av_log(h->s.avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");
  3173. }
  3174. if(h->short_ref_count)
  3175. memmove(&h->short_ref[1], &h->short_ref[0], h->short_ref_count*sizeof(Picture*));
  3176. h->short_ref[0]= s->current_picture_ptr;
  3177. h->short_ref[0]->long_ref=0;
  3178. h->short_ref_count++;
  3179. s->current_picture_ptr->reference |= s->picture_structure;
  3180. }
  3181. if (h->long_ref_count + h->short_ref_count > h->sps.ref_frame_count){
  3182. /* We have too many reference frames, probably due to corrupted
  3183. * stream. Need to discard one frame. Prevents overrun of the
  3184. * short_ref and long_ref buffers.
  3185. */
  3186. av_log(h->s.avctx, AV_LOG_ERROR,
  3187. "number of reference frames exceeds max (probably "
  3188. "corrupt input), discarding one\n");
  3189. if (h->long_ref_count) {
  3190. for (i = 0; i < 16; ++i)
  3191. if (h->long_ref[i])
  3192. break;
  3193. assert(i < 16);
  3194. pic = h->long_ref[i];
  3195. remove_long_at_index(h, i);
  3196. } else {
  3197. pic = h->short_ref[h->short_ref_count - 1];
  3198. remove_short_at_index(h, h->short_ref_count - 1);
  3199. }
  3200. unreference_pic(h, pic, 0);
  3201. }
  3202. print_short_term(h);
  3203. print_long_term(h);
  3204. return 0;
  3205. }
  3206. static int decode_ref_pic_marking(H264Context *h, GetBitContext *gb){
  3207. MpegEncContext * const s = &h->s;
  3208. int i;
  3209. if(h->nal_unit_type == NAL_IDR_SLICE){ //FIXME fields
  3210. s->broken_link= get_bits1(gb) -1;
  3211. h->mmco[0].long_arg= get_bits1(gb) - 1; // current_long_term_idx
  3212. if(h->mmco[0].long_arg == -1)
  3213. h->mmco_index= 0;
  3214. else{
  3215. h->mmco[0].opcode= MMCO_LONG;
  3216. h->mmco_index= 1;
  3217. }
  3218. }else{
  3219. if(get_bits1(gb)){ // adaptive_ref_pic_marking_mode_flag
  3220. for(i= 0; i<MAX_MMCO_COUNT; i++) {
  3221. MMCOOpcode opcode= get_ue_golomb(gb);
  3222. h->mmco[i].opcode= opcode;
  3223. if(opcode==MMCO_SHORT2UNUSED || opcode==MMCO_SHORT2LONG){
  3224. h->mmco[i].short_pic_num= (h->curr_pic_num - get_ue_golomb(gb) - 1) & (h->max_pic_num - 1);
  3225. /* if(h->mmco[i].short_pic_num >= h->short_ref_count || h->short_ref[ h->mmco[i].short_pic_num ] == NULL){
  3226. av_log(s->avctx, AV_LOG_ERROR, "illegal short ref in memory management control operation %d\n", mmco);
  3227. return -1;
  3228. }*/
  3229. }
  3230. if(opcode==MMCO_SHORT2LONG || opcode==MMCO_LONG2UNUSED || opcode==MMCO_LONG || opcode==MMCO_SET_MAX_LONG){
  3231. unsigned int long_arg= get_ue_golomb(gb);
  3232. if(long_arg >= 32 || (long_arg >= 16 && !(opcode == MMCO_LONG2UNUSED && FIELD_PICTURE))){
  3233. av_log(h->s.avctx, AV_LOG_ERROR, "illegal long ref in memory management control operation %d\n", opcode);
  3234. return -1;
  3235. }
  3236. h->mmco[i].long_arg= long_arg;
  3237. }
  3238. if(opcode > (unsigned)MMCO_LONG){
  3239. av_log(h->s.avctx, AV_LOG_ERROR, "illegal memory management control operation %d\n", opcode);
  3240. return -1;
  3241. }
  3242. if(opcode == MMCO_END)
  3243. break;
  3244. }
  3245. h->mmco_index= i;
  3246. }else{
  3247. assert(h->long_ref_count + h->short_ref_count <= h->sps.ref_frame_count);
  3248. if(h->short_ref_count && h->long_ref_count + h->short_ref_count == h->sps.ref_frame_count &&
  3249. !(FIELD_PICTURE && !s->first_field && s->current_picture_ptr->reference)) {
  3250. h->mmco[0].opcode= MMCO_SHORT2UNUSED;
  3251. h->mmco[0].short_pic_num= h->short_ref[ h->short_ref_count - 1 ]->frame_num;
  3252. h->mmco_index= 1;
  3253. if (FIELD_PICTURE) {
  3254. h->mmco[0].short_pic_num *= 2;
  3255. h->mmco[1].opcode= MMCO_SHORT2UNUSED;
  3256. h->mmco[1].short_pic_num= h->mmco[0].short_pic_num + 1;
  3257. h->mmco_index= 2;
  3258. }
  3259. }else
  3260. h->mmco_index= 0;
  3261. }
  3262. }
  3263. return 0;
  3264. }
  3265. static int init_poc(H264Context *h){
  3266. MpegEncContext * const s = &h->s;
  3267. const int max_frame_num= 1<<h->sps.log2_max_frame_num;
  3268. int field_poc[2];
  3269. if(h->nal_unit_type == NAL_IDR_SLICE){
  3270. h->frame_num_offset= 0;
  3271. }else{
  3272. if(h->frame_num < h->prev_frame_num)
  3273. h->frame_num_offset= h->prev_frame_num_offset + max_frame_num;
  3274. else
  3275. h->frame_num_offset= h->prev_frame_num_offset;
  3276. }
  3277. if(h->sps.poc_type==0){
  3278. const int max_poc_lsb= 1<<h->sps.log2_max_poc_lsb;
  3279. if(h->nal_unit_type == NAL_IDR_SLICE){
  3280. h->prev_poc_msb=
  3281. h->prev_poc_lsb= 0;
  3282. }
  3283. if (h->poc_lsb < h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb >= max_poc_lsb/2)
  3284. h->poc_msb = h->prev_poc_msb + max_poc_lsb;
  3285. else if(h->poc_lsb > h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb < -max_poc_lsb/2)
  3286. h->poc_msb = h->prev_poc_msb - max_poc_lsb;
  3287. else
  3288. h->poc_msb = h->prev_poc_msb;
  3289. //printf("poc: %d %d\n", h->poc_msb, h->poc_lsb);
  3290. field_poc[0] =
  3291. field_poc[1] = h->poc_msb + h->poc_lsb;
  3292. if(s->picture_structure == PICT_FRAME)
  3293. field_poc[1] += h->delta_poc_bottom;
  3294. }else if(h->sps.poc_type==1){
  3295. int abs_frame_num, expected_delta_per_poc_cycle, expectedpoc;
  3296. int i;
  3297. if(h->sps.poc_cycle_length != 0)
  3298. abs_frame_num = h->frame_num_offset + h->frame_num;
  3299. else
  3300. abs_frame_num = 0;
  3301. if(h->nal_ref_idc==0 && abs_frame_num > 0)
  3302. abs_frame_num--;
  3303. expected_delta_per_poc_cycle = 0;
  3304. for(i=0; i < h->sps.poc_cycle_length; i++)
  3305. expected_delta_per_poc_cycle += h->sps.offset_for_ref_frame[ i ]; //FIXME integrate during sps parse
  3306. if(abs_frame_num > 0){
  3307. int poc_cycle_cnt = (abs_frame_num - 1) / h->sps.poc_cycle_length;
  3308. int frame_num_in_poc_cycle = (abs_frame_num - 1) % h->sps.poc_cycle_length;
  3309. expectedpoc = poc_cycle_cnt * expected_delta_per_poc_cycle;
  3310. for(i = 0; i <= frame_num_in_poc_cycle; i++)
  3311. expectedpoc = expectedpoc + h->sps.offset_for_ref_frame[ i ];
  3312. } else
  3313. expectedpoc = 0;
  3314. if(h->nal_ref_idc == 0)
  3315. expectedpoc = expectedpoc + h->sps.offset_for_non_ref_pic;
  3316. field_poc[0] = expectedpoc + h->delta_poc[0];
  3317. field_poc[1] = field_poc[0] + h->sps.offset_for_top_to_bottom_field;
  3318. if(s->picture_structure == PICT_FRAME)
  3319. field_poc[1] += h->delta_poc[1];
  3320. }else{
  3321. int poc;
  3322. if(h->nal_unit_type == NAL_IDR_SLICE){
  3323. poc= 0;
  3324. }else{
  3325. if(h->nal_ref_idc) poc= 2*(h->frame_num_offset + h->frame_num);
  3326. else poc= 2*(h->frame_num_offset + h->frame_num) - 1;
  3327. }
  3328. field_poc[0]= poc;
  3329. field_poc[1]= poc;
  3330. }
  3331. if(s->picture_structure != PICT_BOTTOM_FIELD) {
  3332. s->current_picture_ptr->field_poc[0]= field_poc[0];
  3333. s->current_picture_ptr->poc = field_poc[0];
  3334. }
  3335. if(s->picture_structure != PICT_TOP_FIELD) {
  3336. s->current_picture_ptr->field_poc[1]= field_poc[1];
  3337. s->current_picture_ptr->poc = field_poc[1];
  3338. }
  3339. if(!FIELD_PICTURE || !s->first_field) {
  3340. Picture *cur = s->current_picture_ptr;
  3341. cur->poc= FFMIN(cur->field_poc[0], cur->field_poc[1]);
  3342. }
  3343. return 0;
  3344. }
  3345. /**
  3346. * initialize scan tables
  3347. */
  3348. static void init_scan_tables(H264Context *h){
  3349. MpegEncContext * const s = &h->s;
  3350. int i;
  3351. if(s->dsp.h264_idct_add == ff_h264_idct_add_c){ //FIXME little ugly
  3352. memcpy(h->zigzag_scan, zigzag_scan, 16*sizeof(uint8_t));
  3353. memcpy(h-> field_scan, field_scan, 16*sizeof(uint8_t));
  3354. }else{
  3355. for(i=0; i<16; i++){
  3356. #define T(x) (x>>2) | ((x<<2) & 0xF)
  3357. h->zigzag_scan[i] = T(zigzag_scan[i]);
  3358. h-> field_scan[i] = T( field_scan[i]);
  3359. #undef T
  3360. }
  3361. }
  3362. if(s->dsp.h264_idct8_add == ff_h264_idct8_add_c){
  3363. memcpy(h->zigzag_scan8x8, zigzag_scan8x8, 64*sizeof(uint8_t));
  3364. memcpy(h->zigzag_scan8x8_cavlc, zigzag_scan8x8_cavlc, 64*sizeof(uint8_t));
  3365. memcpy(h->field_scan8x8, field_scan8x8, 64*sizeof(uint8_t));
  3366. memcpy(h->field_scan8x8_cavlc, field_scan8x8_cavlc, 64*sizeof(uint8_t));
  3367. }else{
  3368. for(i=0; i<64; i++){
  3369. #define T(x) (x>>3) | ((x&7)<<3)
  3370. h->zigzag_scan8x8[i] = T(zigzag_scan8x8[i]);
  3371. h->zigzag_scan8x8_cavlc[i] = T(zigzag_scan8x8_cavlc[i]);
  3372. h->field_scan8x8[i] = T(field_scan8x8[i]);
  3373. h->field_scan8x8_cavlc[i] = T(field_scan8x8_cavlc[i]);
  3374. #undef T
  3375. }
  3376. }
  3377. if(h->sps.transform_bypass){ //FIXME same ugly
  3378. h->zigzag_scan_q0 = zigzag_scan;
  3379. h->zigzag_scan8x8_q0 = zigzag_scan8x8;
  3380. h->zigzag_scan8x8_cavlc_q0 = zigzag_scan8x8_cavlc;
  3381. h->field_scan_q0 = field_scan;
  3382. h->field_scan8x8_q0 = field_scan8x8;
  3383. h->field_scan8x8_cavlc_q0 = field_scan8x8_cavlc;
  3384. }else{
  3385. h->zigzag_scan_q0 = h->zigzag_scan;
  3386. h->zigzag_scan8x8_q0 = h->zigzag_scan8x8;
  3387. h->zigzag_scan8x8_cavlc_q0 = h->zigzag_scan8x8_cavlc;
  3388. h->field_scan_q0 = h->field_scan;
  3389. h->field_scan8x8_q0 = h->field_scan8x8;
  3390. h->field_scan8x8_cavlc_q0 = h->field_scan8x8_cavlc;
  3391. }
  3392. }
  3393. /**
  3394. * Replicates H264 "master" context to thread contexts.
  3395. */
  3396. static void clone_slice(H264Context *dst, H264Context *src)
  3397. {
  3398. memcpy(dst->block_offset, src->block_offset, sizeof(dst->block_offset));
  3399. dst->s.current_picture_ptr = src->s.current_picture_ptr;
  3400. dst->s.current_picture = src->s.current_picture;
  3401. dst->s.linesize = src->s.linesize;
  3402. dst->s.uvlinesize = src->s.uvlinesize;
  3403. dst->s.first_field = src->s.first_field;
  3404. dst->prev_poc_msb = src->prev_poc_msb;
  3405. dst->prev_poc_lsb = src->prev_poc_lsb;
  3406. dst->prev_frame_num_offset = src->prev_frame_num_offset;
  3407. dst->prev_frame_num = src->prev_frame_num;
  3408. dst->short_ref_count = src->short_ref_count;
  3409. memcpy(dst->short_ref, src->short_ref, sizeof(dst->short_ref));
  3410. memcpy(dst->long_ref, src->long_ref, sizeof(dst->long_ref));
  3411. memcpy(dst->default_ref_list, src->default_ref_list, sizeof(dst->default_ref_list));
  3412. memcpy(dst->ref_list, src->ref_list, sizeof(dst->ref_list));
  3413. memcpy(dst->dequant4_coeff, src->dequant4_coeff, sizeof(src->dequant4_coeff));
  3414. memcpy(dst->dequant8_coeff, src->dequant8_coeff, sizeof(src->dequant8_coeff));
  3415. }
  3416. /**
  3417. * decodes a slice header.
  3418. * This will also call MPV_common_init() and frame_start() as needed.
  3419. *
  3420. * @param h h264context
  3421. * @param h0 h264 master context (differs from 'h' when doing sliced based parallel decoding)
  3422. *
  3423. * @return 0 if okay, <0 if an error occurred, 1 if decoding must not be multithreaded
  3424. */
  3425. static int decode_slice_header(H264Context *h, H264Context *h0){
  3426. MpegEncContext * const s = &h->s;
  3427. MpegEncContext * const s0 = &h0->s;
  3428. unsigned int first_mb_in_slice;
  3429. unsigned int pps_id;
  3430. int num_ref_idx_active_override_flag;
  3431. static const uint8_t slice_type_map[5]= {FF_P_TYPE, FF_B_TYPE, FF_I_TYPE, FF_SP_TYPE, FF_SI_TYPE};
  3432. unsigned int slice_type, tmp, i, j;
  3433. int default_ref_list_done = 0;
  3434. int last_pic_structure;
  3435. s->dropable= h->nal_ref_idc == 0;
  3436. if((s->avctx->flags2 & CODEC_FLAG2_FAST) && !h->nal_ref_idc){
  3437. s->me.qpel_put= s->dsp.put_2tap_qpel_pixels_tab;
  3438. s->me.qpel_avg= s->dsp.avg_2tap_qpel_pixels_tab;
  3439. }else{
  3440. s->me.qpel_put= s->dsp.put_h264_qpel_pixels_tab;
  3441. s->me.qpel_avg= s->dsp.avg_h264_qpel_pixels_tab;
  3442. }
  3443. first_mb_in_slice= get_ue_golomb(&s->gb);
  3444. if((s->flags2 & CODEC_FLAG2_CHUNKS) && first_mb_in_slice == 0){
  3445. h0->current_slice = 0;
  3446. if (!s0->first_field)
  3447. s->current_picture_ptr= NULL;
  3448. }
  3449. slice_type= get_ue_golomb(&s->gb);
  3450. if(slice_type > 9){
  3451. av_log(h->s.avctx, AV_LOG_ERROR, "slice type too large (%d) at %d %d\n", h->slice_type, s->mb_x, s->mb_y);
  3452. return -1;
  3453. }
  3454. if(slice_type > 4){
  3455. slice_type -= 5;
  3456. h->slice_type_fixed=1;
  3457. }else
  3458. h->slice_type_fixed=0;
  3459. slice_type= slice_type_map[ slice_type ];
  3460. if (slice_type == FF_I_TYPE
  3461. || (h0->current_slice != 0 && slice_type == h0->last_slice_type) ) {
  3462. default_ref_list_done = 1;
  3463. }
  3464. h->slice_type= slice_type;
  3465. s->pict_type= h->slice_type; // to make a few old func happy, it's wrong though
  3466. if (s->pict_type == FF_B_TYPE && s0->last_picture_ptr == NULL) {
  3467. av_log(h->s.avctx, AV_LOG_ERROR,
  3468. "B picture before any references, skipping\n");
  3469. return -1;
  3470. }
  3471. pps_id= get_ue_golomb(&s->gb);
  3472. if(pps_id>=MAX_PPS_COUNT){
  3473. av_log(h->s.avctx, AV_LOG_ERROR, "pps_id out of range\n");
  3474. return -1;
  3475. }
  3476. if(!h0->pps_buffers[pps_id]) {
  3477. av_log(h->s.avctx, AV_LOG_ERROR, "non existing PPS referenced\n");
  3478. return -1;
  3479. }
  3480. h->pps= *h0->pps_buffers[pps_id];
  3481. if(!h0->sps_buffers[h->pps.sps_id]) {
  3482. av_log(h->s.avctx, AV_LOG_ERROR, "non existing SPS referenced\n");
  3483. return -1;
  3484. }
  3485. h->sps = *h0->sps_buffers[h->pps.sps_id];
  3486. if(h == h0 && h->dequant_coeff_pps != pps_id){
  3487. h->dequant_coeff_pps = pps_id;
  3488. init_dequant_tables(h);
  3489. }
  3490. s->mb_width= h->sps.mb_width;
  3491. s->mb_height= h->sps.mb_height * (2 - h->sps.frame_mbs_only_flag);
  3492. h->b_stride= s->mb_width*4;
  3493. h->b8_stride= s->mb_width*2;
  3494. s->width = 16*s->mb_width - 2*FFMIN(h->sps.crop_right, 7);
  3495. if(h->sps.frame_mbs_only_flag)
  3496. s->height= 16*s->mb_height - 2*FFMIN(h->sps.crop_bottom, 7);
  3497. else
  3498. s->height= 16*s->mb_height - 4*FFMIN(h->sps.crop_bottom, 3);
  3499. if (s->context_initialized
  3500. && ( s->width != s->avctx->width || s->height != s->avctx->height)) {
  3501. if(h != h0)
  3502. return -1; // width / height changed during parallelized decoding
  3503. free_tables(h);
  3504. MPV_common_end(s);
  3505. }
  3506. if (!s->context_initialized) {
  3507. if(h != h0)
  3508. return -1; // we cant (re-)initialize context during parallel decoding
  3509. if (MPV_common_init(s) < 0)
  3510. return -1;
  3511. s->first_field = 0;
  3512. init_scan_tables(h);
  3513. alloc_tables(h);
  3514. for(i = 1; i < s->avctx->thread_count; i++) {
  3515. H264Context *c;
  3516. c = h->thread_context[i] = av_malloc(sizeof(H264Context));
  3517. memcpy(c, h->s.thread_context[i], sizeof(MpegEncContext));
  3518. memset(&c->s + 1, 0, sizeof(H264Context) - sizeof(MpegEncContext));
  3519. c->sps = h->sps;
  3520. c->pps = h->pps;
  3521. init_scan_tables(c);
  3522. clone_tables(c, h);
  3523. }
  3524. for(i = 0; i < s->avctx->thread_count; i++)
  3525. if(context_init(h->thread_context[i]) < 0)
  3526. return -1;
  3527. s->avctx->width = s->width;
  3528. s->avctx->height = s->height;
  3529. s->avctx->sample_aspect_ratio= h->sps.sar;
  3530. if(!s->avctx->sample_aspect_ratio.den)
  3531. s->avctx->sample_aspect_ratio.den = 1;
  3532. if(h->sps.timing_info_present_flag){
  3533. s->avctx->time_base= (AVRational){h->sps.num_units_in_tick * 2, h->sps.time_scale};
  3534. if(h->x264_build > 0 && h->x264_build < 44)
  3535. s->avctx->time_base.den *= 2;
  3536. av_reduce(&s->avctx->time_base.num, &s->avctx->time_base.den,
  3537. s->avctx->time_base.num, s->avctx->time_base.den, 1<<30);
  3538. }
  3539. }
  3540. h->frame_num= get_bits(&s->gb, h->sps.log2_max_frame_num);
  3541. h->mb_mbaff = 0;
  3542. h->mb_aff_frame = 0;
  3543. last_pic_structure = s0->picture_structure;
  3544. if(h->sps.frame_mbs_only_flag){
  3545. s->picture_structure= PICT_FRAME;
  3546. }else{
  3547. if(get_bits1(&s->gb)) { //field_pic_flag
  3548. s->picture_structure= PICT_TOP_FIELD + get_bits1(&s->gb); //bottom_field_flag
  3549. } else {
  3550. s->picture_structure= PICT_FRAME;
  3551. h->mb_aff_frame = h->sps.mb_aff;
  3552. }
  3553. }
  3554. if(h0->current_slice == 0){
  3555. /* See if we have a decoded first field looking for a pair... */
  3556. if (s0->first_field) {
  3557. assert(s0->current_picture_ptr);
  3558. assert(s0->current_picture_ptr->data[0]);
  3559. assert(s0->current_picture_ptr->reference != DELAYED_PIC_REF);
  3560. /* figure out if we have a complementary field pair */
  3561. if (!FIELD_PICTURE || s->picture_structure == last_pic_structure) {
  3562. /*
  3563. * Previous field is unmatched. Don't display it, but let it
  3564. * remain for reference if marked as such.
  3565. */
  3566. s0->current_picture_ptr = NULL;
  3567. s0->first_field = FIELD_PICTURE;
  3568. } else {
  3569. if (h->nal_ref_idc &&
  3570. s0->current_picture_ptr->reference &&
  3571. s0->current_picture_ptr->frame_num != h->frame_num) {
  3572. /*
  3573. * This and previous field were reference, but had
  3574. * different frame_nums. Consider this field first in
  3575. * pair. Throw away previous field except for reference
  3576. * purposes.
  3577. */
  3578. s0->first_field = 1;
  3579. s0->current_picture_ptr = NULL;
  3580. } else {
  3581. /* Second field in complementary pair */
  3582. s0->first_field = 0;
  3583. }
  3584. }
  3585. } else {
  3586. /* Frame or first field in a potentially complementary pair */
  3587. assert(!s0->current_picture_ptr);
  3588. s0->first_field = FIELD_PICTURE;
  3589. }
  3590. if((!FIELD_PICTURE || s0->first_field) && frame_start(h) < 0) {
  3591. s0->first_field = 0;
  3592. return -1;
  3593. }
  3594. }
  3595. if(h != h0)
  3596. clone_slice(h, h0);
  3597. s->current_picture_ptr->frame_num= h->frame_num; //FIXME frame_num cleanup
  3598. assert(s->mb_num == s->mb_width * s->mb_height);
  3599. if(first_mb_in_slice << FIELD_OR_MBAFF_PICTURE >= s->mb_num ||
  3600. first_mb_in_slice >= s->mb_num){
  3601. av_log(h->s.avctx, AV_LOG_ERROR, "first_mb_in_slice overflow\n");
  3602. return -1;
  3603. }
  3604. s->resync_mb_x = s->mb_x = first_mb_in_slice % s->mb_width;
  3605. s->resync_mb_y = s->mb_y = (first_mb_in_slice / s->mb_width) << FIELD_OR_MBAFF_PICTURE;
  3606. if (s->picture_structure == PICT_BOTTOM_FIELD)
  3607. s->resync_mb_y = s->mb_y = s->mb_y + 1;
  3608. assert(s->mb_y < s->mb_height);
  3609. if(s->picture_structure==PICT_FRAME){
  3610. h->curr_pic_num= h->frame_num;
  3611. h->max_pic_num= 1<< h->sps.log2_max_frame_num;
  3612. }else{
  3613. h->curr_pic_num= 2*h->frame_num + 1;
  3614. h->max_pic_num= 1<<(h->sps.log2_max_frame_num + 1);
  3615. }
  3616. if(h->nal_unit_type == NAL_IDR_SLICE){
  3617. get_ue_golomb(&s->gb); /* idr_pic_id */
  3618. }
  3619. if(h->sps.poc_type==0){
  3620. h->poc_lsb= get_bits(&s->gb, h->sps.log2_max_poc_lsb);
  3621. if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME){
  3622. h->delta_poc_bottom= get_se_golomb(&s->gb);
  3623. }
  3624. }
  3625. if(h->sps.poc_type==1 && !h->sps.delta_pic_order_always_zero_flag){
  3626. h->delta_poc[0]= get_se_golomb(&s->gb);
  3627. if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME)
  3628. h->delta_poc[1]= get_se_golomb(&s->gb);
  3629. }
  3630. init_poc(h);
  3631. if(h->pps.redundant_pic_cnt_present){
  3632. h->redundant_pic_count= get_ue_golomb(&s->gb);
  3633. }
  3634. //set defaults, might be overriden a few line later
  3635. h->ref_count[0]= h->pps.ref_count[0];
  3636. h->ref_count[1]= h->pps.ref_count[1];
  3637. if(h->slice_type == FF_P_TYPE || h->slice_type == FF_SP_TYPE || h->slice_type == FF_B_TYPE){
  3638. if(h->slice_type == FF_B_TYPE){
  3639. h->direct_spatial_mv_pred= get_bits1(&s->gb);
  3640. if(FIELD_PICTURE && h->direct_spatial_mv_pred)
  3641. av_log(h->s.avctx, AV_LOG_ERROR, "PAFF + spatial direct mode is not implemented\n");
  3642. }
  3643. num_ref_idx_active_override_flag= get_bits1(&s->gb);
  3644. if(num_ref_idx_active_override_flag){
  3645. h->ref_count[0]= get_ue_golomb(&s->gb) + 1;
  3646. if(h->slice_type==FF_B_TYPE)
  3647. h->ref_count[1]= get_ue_golomb(&s->gb) + 1;
  3648. if(h->ref_count[0]-1 > 32-1 || h->ref_count[1]-1 > 32-1){
  3649. av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow\n");
  3650. h->ref_count[0]= h->ref_count[1]= 1;
  3651. return -1;
  3652. }
  3653. }
  3654. if(h->slice_type == FF_B_TYPE)
  3655. h->list_count= 2;
  3656. else
  3657. h->list_count= 1;
  3658. }else
  3659. h->list_count= 0;
  3660. if(!default_ref_list_done){
  3661. fill_default_ref_list(h);
  3662. }
  3663. if(decode_ref_pic_list_reordering(h) < 0)
  3664. return -1;
  3665. if( (h->pps.weighted_pred && (h->slice_type == FF_P_TYPE || h->slice_type == FF_SP_TYPE ))
  3666. || (h->pps.weighted_bipred_idc==1 && h->slice_type==FF_B_TYPE ) )
  3667. pred_weight_table(h);
  3668. else if(h->pps.weighted_bipred_idc==2 && h->slice_type==FF_B_TYPE)
  3669. implicit_weight_table(h);
  3670. else
  3671. h->use_weight = 0;
  3672. if(h->nal_ref_idc)
  3673. decode_ref_pic_marking(h0, &s->gb);
  3674. if(FRAME_MBAFF)
  3675. fill_mbaff_ref_list(h);
  3676. h->ref2frm[1][0]= h->ref2frm[1][1]= -1;
  3677. for(j=0; j<2; j++){
  3678. h->ref2frm[j][ 0]=
  3679. h->ref2frm[j][ 1]= -1;
  3680. for(i=0; i<48; i++)
  3681. h->ref2frm[j][i+2]= 4*h->ref_list[j][i].frame_num
  3682. +(h->ref_list[j][i].reference&3);
  3683. }
  3684. if( h->slice_type != FF_I_TYPE && h->slice_type != FF_SI_TYPE && h->pps.cabac ){
  3685. tmp = get_ue_golomb(&s->gb);
  3686. if(tmp > 2){
  3687. av_log(s->avctx, AV_LOG_ERROR, "cabac_init_idc overflow\n");
  3688. return -1;
  3689. }
  3690. h->cabac_init_idc= tmp;
  3691. }
  3692. h->last_qscale_diff = 0;
  3693. tmp = h->pps.init_qp + get_se_golomb(&s->gb);
  3694. if(tmp>51){
  3695. av_log(s->avctx, AV_LOG_ERROR, "QP %u out of range\n", tmp);
  3696. return -1;
  3697. }
  3698. s->qscale= tmp;
  3699. h->chroma_qp[0] = get_chroma_qp(h, 0, s->qscale);
  3700. h->chroma_qp[1] = get_chroma_qp(h, 1, s->qscale);
  3701. //FIXME qscale / qp ... stuff
  3702. if(h->slice_type == FF_SP_TYPE){
  3703. get_bits1(&s->gb); /* sp_for_switch_flag */
  3704. }
  3705. if(h->slice_type==FF_SP_TYPE || h->slice_type == FF_SI_TYPE){
  3706. get_se_golomb(&s->gb); /* slice_qs_delta */
  3707. }
  3708. h->deblocking_filter = 1;
  3709. h->slice_alpha_c0_offset = 0;
  3710. h->slice_beta_offset = 0;
  3711. if( h->pps.deblocking_filter_parameters_present ) {
  3712. tmp= get_ue_golomb(&s->gb);
  3713. if(tmp > 2){
  3714. av_log(s->avctx, AV_LOG_ERROR, "deblocking_filter_idc %u out of range\n", tmp);
  3715. return -1;
  3716. }
  3717. h->deblocking_filter= tmp;
  3718. if(h->deblocking_filter < 2)
  3719. h->deblocking_filter^= 1; // 1<->0
  3720. if( h->deblocking_filter ) {
  3721. h->slice_alpha_c0_offset = get_se_golomb(&s->gb) << 1;
  3722. h->slice_beta_offset = get_se_golomb(&s->gb) << 1;
  3723. }
  3724. }
  3725. if( s->avctx->skip_loop_filter >= AVDISCARD_ALL
  3726. ||(s->avctx->skip_loop_filter >= AVDISCARD_NONKEY && h->slice_type != FF_I_TYPE)
  3727. ||(s->avctx->skip_loop_filter >= AVDISCARD_BIDIR && h->slice_type == FF_B_TYPE)
  3728. ||(s->avctx->skip_loop_filter >= AVDISCARD_NONREF && h->nal_ref_idc == 0))
  3729. h->deblocking_filter= 0;
  3730. if(h->deblocking_filter == 1 && h0->max_contexts > 1) {
  3731. if(s->avctx->flags2 & CODEC_FLAG2_FAST) {
  3732. /* Cheat slightly for speed:
  3733. Do not bother to deblock across slices. */
  3734. h->deblocking_filter = 2;
  3735. } else {
  3736. h0->max_contexts = 1;
  3737. if(!h0->single_decode_warning) {
  3738. av_log(s->avctx, AV_LOG_INFO, "Cannot parallelize deblocking type 1, decoding such frames in sequential order\n");
  3739. h0->single_decode_warning = 1;
  3740. }
  3741. if(h != h0)
  3742. return 1; // deblocking switched inside frame
  3743. }
  3744. }
  3745. #if 0 //FMO
  3746. if( h->pps.num_slice_groups > 1 && h->pps.mb_slice_group_map_type >= 3 && h->pps.mb_slice_group_map_type <= 5)
  3747. slice_group_change_cycle= get_bits(&s->gb, ?);
  3748. #endif
  3749. h0->last_slice_type = slice_type;
  3750. h->slice_num = ++h0->current_slice;
  3751. h->emu_edge_width= (s->flags&CODEC_FLAG_EMU_EDGE) ? 0 : 16;
  3752. h->emu_edge_height= (FRAME_MBAFF || FIELD_PICTURE) ? 0 : h->emu_edge_width;
  3753. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  3754. av_log(h->s.avctx, AV_LOG_DEBUG, "slice:%d %s mb:%d %c pps:%u frame:%d poc:%d/%d ref:%d/%d qp:%d loop:%d:%d:%d weight:%d%s %s\n",
  3755. h->slice_num,
  3756. (s->picture_structure==PICT_FRAME ? "F" : s->picture_structure==PICT_TOP_FIELD ? "T" : "B"),
  3757. first_mb_in_slice,
  3758. av_get_pict_type_char(h->slice_type),
  3759. pps_id, h->frame_num,
  3760. s->current_picture_ptr->field_poc[0], s->current_picture_ptr->field_poc[1],
  3761. h->ref_count[0], h->ref_count[1],
  3762. s->qscale,
  3763. h->deblocking_filter, h->slice_alpha_c0_offset/2, h->slice_beta_offset/2,
  3764. h->use_weight,
  3765. h->use_weight==1 && h->use_weight_chroma ? "c" : "",
  3766. h->slice_type == FF_B_TYPE ? (h->direct_spatial_mv_pred ? "SPAT" : "TEMP") : ""
  3767. );
  3768. }
  3769. return 0;
  3770. }
  3771. /**
  3772. *
  3773. */
  3774. static inline int get_level_prefix(GetBitContext *gb){
  3775. unsigned int buf;
  3776. int log;
  3777. OPEN_READER(re, gb);
  3778. UPDATE_CACHE(re, gb);
  3779. buf=GET_CACHE(re, gb);
  3780. log= 32 - av_log2(buf);
  3781. #ifdef TRACE
  3782. print_bin(buf>>(32-log), log);
  3783. av_log(NULL, AV_LOG_DEBUG, "%5d %2d %3d lpr @%5d in %s get_level_prefix\n", buf>>(32-log), log, log-1, get_bits_count(gb), __FILE__);
  3784. #endif
  3785. LAST_SKIP_BITS(re, gb, log);
  3786. CLOSE_READER(re, gb);
  3787. return log-1;
  3788. }
  3789. static inline int get_dct8x8_allowed(H264Context *h){
  3790. int i;
  3791. for(i=0; i<4; i++){
  3792. if(!IS_SUB_8X8(h->sub_mb_type[i])
  3793. || (!h->sps.direct_8x8_inference_flag && IS_DIRECT(h->sub_mb_type[i])))
  3794. return 0;
  3795. }
  3796. return 1;
  3797. }
  3798. /**
  3799. * decodes a residual block.
  3800. * @param n block index
  3801. * @param scantable scantable
  3802. * @param max_coeff number of coefficients in the block
  3803. * @return <0 if an error occurred
  3804. */
  3805. static int decode_residual(H264Context *h, GetBitContext *gb, DCTELEM *block, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff){
  3806. MpegEncContext * const s = &h->s;
  3807. static const int coeff_token_table_index[17]= {0, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3};
  3808. int level[16];
  3809. int zeros_left, coeff_num, coeff_token, total_coeff, i, j, trailing_ones, run_before;
  3810. //FIXME put trailing_onex into the context
  3811. if(n == CHROMA_DC_BLOCK_INDEX){
  3812. coeff_token= get_vlc2(gb, chroma_dc_coeff_token_vlc.table, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 1);
  3813. total_coeff= coeff_token>>2;
  3814. }else{
  3815. if(n == LUMA_DC_BLOCK_INDEX){
  3816. total_coeff= pred_non_zero_count(h, 0);
  3817. coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);
  3818. total_coeff= coeff_token>>2;
  3819. }else{
  3820. total_coeff= pred_non_zero_count(h, n);
  3821. coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);
  3822. total_coeff= coeff_token>>2;
  3823. h->non_zero_count_cache[ scan8[n] ]= total_coeff;
  3824. }
  3825. }
  3826. //FIXME set last_non_zero?
  3827. if(total_coeff==0)
  3828. return 0;
  3829. if(total_coeff > (unsigned)max_coeff) {
  3830. av_log(h->s.avctx, AV_LOG_ERROR, "corrupted macroblock %d %d (total_coeff=%d)\n", s->mb_x, s->mb_y, total_coeff);
  3831. return -1;
  3832. }
  3833. trailing_ones= coeff_token&3;
  3834. tprintf(h->s.avctx, "trailing:%d, total:%d\n", trailing_ones, total_coeff);
  3835. assert(total_coeff<=16);
  3836. for(i=0; i<trailing_ones; i++){
  3837. level[i]= 1 - 2*get_bits1(gb);
  3838. }
  3839. if(i<total_coeff) {
  3840. int level_code, mask;
  3841. int suffix_length = total_coeff > 10 && trailing_ones < 3;
  3842. int prefix= get_level_prefix(gb);
  3843. //first coefficient has suffix_length equal to 0 or 1
  3844. if(prefix<14){ //FIXME try to build a large unified VLC table for all this
  3845. if(suffix_length)
  3846. level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part
  3847. else
  3848. level_code= (prefix<<suffix_length); //part
  3849. }else if(prefix==14){
  3850. if(suffix_length)
  3851. level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part
  3852. else
  3853. level_code= prefix + get_bits(gb, 4); //part
  3854. }else{
  3855. level_code= (15<<suffix_length) + get_bits(gb, prefix-3); //part
  3856. if(suffix_length==0) level_code+=15; //FIXME doesn't make (much)sense
  3857. if(prefix>=16)
  3858. level_code += (1<<(prefix-3))-4096;
  3859. }
  3860. if(trailing_ones < 3) level_code += 2;
  3861. suffix_length = 1;
  3862. if(level_code > 5)
  3863. suffix_length++;
  3864. mask= -(level_code&1);
  3865. level[i]= (((2+level_code)>>1) ^ mask) - mask;
  3866. i++;
  3867. //remaining coefficients have suffix_length > 0
  3868. for(;i<total_coeff;i++) {
  3869. static const int suffix_limit[7] = {0,5,11,23,47,95,INT_MAX };
  3870. prefix = get_level_prefix(gb);
  3871. if(prefix<15){
  3872. level_code = (prefix<<suffix_length) + get_bits(gb, suffix_length);
  3873. }else{
  3874. level_code = (15<<suffix_length) + get_bits(gb, prefix-3);
  3875. if(prefix>=16)
  3876. level_code += (1<<(prefix-3))-4096;
  3877. }
  3878. mask= -(level_code&1);
  3879. level[i]= (((2+level_code)>>1) ^ mask) - mask;
  3880. if(level_code > suffix_limit[suffix_length])
  3881. suffix_length++;
  3882. }
  3883. }
  3884. if(total_coeff == max_coeff)
  3885. zeros_left=0;
  3886. else{
  3887. if(n == CHROMA_DC_BLOCK_INDEX)
  3888. zeros_left= get_vlc2(gb, chroma_dc_total_zeros_vlc[ total_coeff-1 ].table, CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 1);
  3889. else
  3890. zeros_left= get_vlc2(gb, total_zeros_vlc[ total_coeff-1 ].table, TOTAL_ZEROS_VLC_BITS, 1);
  3891. }
  3892. coeff_num = zeros_left + total_coeff - 1;
  3893. j = scantable[coeff_num];
  3894. if(n > 24){
  3895. block[j] = level[0];
  3896. for(i=1;i<total_coeff;i++) {
  3897. if(zeros_left <= 0)
  3898. run_before = 0;
  3899. else if(zeros_left < 7){
  3900. run_before= get_vlc2(gb, run_vlc[zeros_left-1].table, RUN_VLC_BITS, 1);
  3901. }else{
  3902. run_before= get_vlc2(gb, run7_vlc.table, RUN7_VLC_BITS, 2);
  3903. }
  3904. zeros_left -= run_before;
  3905. coeff_num -= 1 + run_before;
  3906. j= scantable[ coeff_num ];
  3907. block[j]= level[i];
  3908. }
  3909. }else{
  3910. block[j] = (level[0] * qmul[j] + 32)>>6;
  3911. for(i=1;i<total_coeff;i++) {
  3912. if(zeros_left <= 0)
  3913. run_before = 0;
  3914. else if(zeros_left < 7){
  3915. run_before= get_vlc2(gb, run_vlc[zeros_left-1].table, RUN_VLC_BITS, 1);
  3916. }else{
  3917. run_before= get_vlc2(gb, run7_vlc.table, RUN7_VLC_BITS, 2);
  3918. }
  3919. zeros_left -= run_before;
  3920. coeff_num -= 1 + run_before;
  3921. j= scantable[ coeff_num ];
  3922. block[j]= (level[i] * qmul[j] + 32)>>6;
  3923. }
  3924. }
  3925. if(zeros_left<0){
  3926. av_log(h->s.avctx, AV_LOG_ERROR, "negative number of zero coeffs at %d %d\n", s->mb_x, s->mb_y);
  3927. return -1;
  3928. }
  3929. return 0;
  3930. }
  3931. static void predict_field_decoding_flag(H264Context *h){
  3932. MpegEncContext * const s = &h->s;
  3933. const int mb_xy= h->mb_xy;
  3934. int mb_type = (h->slice_table[mb_xy-1] == h->slice_num)
  3935. ? s->current_picture.mb_type[mb_xy-1]
  3936. : (h->slice_table[mb_xy-s->mb_stride] == h->slice_num)
  3937. ? s->current_picture.mb_type[mb_xy-s->mb_stride]
  3938. : 0;
  3939. h->mb_mbaff = h->mb_field_decoding_flag = IS_INTERLACED(mb_type) ? 1 : 0;
  3940. }
  3941. /**
  3942. * decodes a P_SKIP or B_SKIP macroblock
  3943. */
  3944. static void decode_mb_skip(H264Context *h){
  3945. MpegEncContext * const s = &h->s;
  3946. const int mb_xy= h->mb_xy;
  3947. int mb_type=0;
  3948. memset(h->non_zero_count[mb_xy], 0, 16);
  3949. memset(h->non_zero_count_cache + 8, 0, 8*5); //FIXME ugly, remove pfui
  3950. if(MB_FIELD)
  3951. mb_type|= MB_TYPE_INTERLACED;
  3952. if( h->slice_type == FF_B_TYPE )
  3953. {
  3954. // just for fill_caches. pred_direct_motion will set the real mb_type
  3955. mb_type|= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2|MB_TYPE_SKIP;
  3956. fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...
  3957. pred_direct_motion(h, &mb_type);
  3958. mb_type|= MB_TYPE_SKIP;
  3959. }
  3960. else
  3961. {
  3962. int mx, my;
  3963. mb_type|= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P1L0|MB_TYPE_SKIP;
  3964. fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...
  3965. pred_pskip_motion(h, &mx, &my);
  3966. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, 0, 1);
  3967. fill_rectangle( h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mx,my), 4);
  3968. }
  3969. write_back_motion(h, mb_type);
  3970. s->current_picture.mb_type[mb_xy]= mb_type;
  3971. s->current_picture.qscale_table[mb_xy]= s->qscale;
  3972. h->slice_table[ mb_xy ]= h->slice_num;
  3973. h->prev_mb_skipped= 1;
  3974. }
  3975. /**
  3976. * decodes a macroblock
  3977. * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed
  3978. */
  3979. static int decode_mb_cavlc(H264Context *h){
  3980. MpegEncContext * const s = &h->s;
  3981. int mb_xy;
  3982. int partition_count;
  3983. unsigned int mb_type, cbp;
  3984. int dct8x8_allowed= h->pps.transform_8x8_mode;
  3985. mb_xy = h->mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  3986. s->dsp.clear_blocks(h->mb); //FIXME avoid if already clear (move after skip handlong?
  3987. tprintf(s->avctx, "pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);
  3988. cbp = 0; /* avoid warning. FIXME: find a solution without slowing
  3989. down the code */
  3990. if(h->slice_type != FF_I_TYPE && h->slice_type != FF_SI_TYPE){
  3991. if(s->mb_skip_run==-1)
  3992. s->mb_skip_run= get_ue_golomb(&s->gb);
  3993. if (s->mb_skip_run--) {
  3994. if(FRAME_MBAFF && (s->mb_y&1) == 0){
  3995. if(s->mb_skip_run==0)
  3996. h->mb_mbaff = h->mb_field_decoding_flag = get_bits1(&s->gb);
  3997. else
  3998. predict_field_decoding_flag(h);
  3999. }
  4000. decode_mb_skip(h);
  4001. return 0;
  4002. }
  4003. }
  4004. if(FRAME_MBAFF){
  4005. if( (s->mb_y&1) == 0 )
  4006. h->mb_mbaff = h->mb_field_decoding_flag = get_bits1(&s->gb);
  4007. }else
  4008. h->mb_field_decoding_flag= (s->picture_structure!=PICT_FRAME);
  4009. h->prev_mb_skipped= 0;
  4010. mb_type= get_ue_golomb(&s->gb);
  4011. if(h->slice_type == FF_B_TYPE){
  4012. if(mb_type < 23){
  4013. partition_count= b_mb_type_info[mb_type].partition_count;
  4014. mb_type= b_mb_type_info[mb_type].type;
  4015. }else{
  4016. mb_type -= 23;
  4017. goto decode_intra_mb;
  4018. }
  4019. }else if(h->slice_type == FF_P_TYPE /*|| h->slice_type == FF_SP_TYPE */){
  4020. if(mb_type < 5){
  4021. partition_count= p_mb_type_info[mb_type].partition_count;
  4022. mb_type= p_mb_type_info[mb_type].type;
  4023. }else{
  4024. mb_type -= 5;
  4025. goto decode_intra_mb;
  4026. }
  4027. }else{
  4028. assert(h->slice_type == FF_I_TYPE);
  4029. decode_intra_mb:
  4030. if(mb_type > 25){
  4031. av_log(h->s.avctx, AV_LOG_ERROR, "mb_type %d in %c slice too large at %d %d\n", mb_type, av_get_pict_type_char(h->slice_type), s->mb_x, s->mb_y);
  4032. return -1;
  4033. }
  4034. partition_count=0;
  4035. cbp= i_mb_type_info[mb_type].cbp;
  4036. h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;
  4037. mb_type= i_mb_type_info[mb_type].type;
  4038. }
  4039. if(MB_FIELD)
  4040. mb_type |= MB_TYPE_INTERLACED;
  4041. h->slice_table[ mb_xy ]= h->slice_num;
  4042. if(IS_INTRA_PCM(mb_type)){
  4043. unsigned int x, y;
  4044. // We assume these blocks are very rare so we do not optimize it.
  4045. align_get_bits(&s->gb);
  4046. // The pixels are stored in the same order as levels in h->mb array.
  4047. for(y=0; y<16; y++){
  4048. const int index= 4*(y&3) + 32*((y>>2)&1) + 128*(y>>3);
  4049. for(x=0; x<16; x++){
  4050. tprintf(s->avctx, "LUMA ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));
  4051. h->mb[index + (x&3) + 16*((x>>2)&1) + 64*(x>>3)]= get_bits(&s->gb, 8);
  4052. }
  4053. }
  4054. for(y=0; y<8; y++){
  4055. const int index= 256 + 4*(y&3) + 32*(y>>2);
  4056. for(x=0; x<8; x++){
  4057. tprintf(s->avctx, "CHROMA U ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));
  4058. h->mb[index + (x&3) + 16*(x>>2)]= get_bits(&s->gb, 8);
  4059. }
  4060. }
  4061. for(y=0; y<8; y++){
  4062. const int index= 256 + 64 + 4*(y&3) + 32*(y>>2);
  4063. for(x=0; x<8; x++){
  4064. tprintf(s->avctx, "CHROMA V ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));
  4065. h->mb[index + (x&3) + 16*(x>>2)]= get_bits(&s->gb, 8);
  4066. }
  4067. }
  4068. // In deblocking, the quantizer is 0
  4069. s->current_picture.qscale_table[mb_xy]= 0;
  4070. h->chroma_qp[0] = get_chroma_qp(h, 0, 0);
  4071. h->chroma_qp[1] = get_chroma_qp(h, 1, 0);
  4072. // All coeffs are present
  4073. memset(h->non_zero_count[mb_xy], 16, 16);
  4074. s->current_picture.mb_type[mb_xy]= mb_type;
  4075. return 0;
  4076. }
  4077. if(MB_MBAFF){
  4078. h->ref_count[0] <<= 1;
  4079. h->ref_count[1] <<= 1;
  4080. }
  4081. fill_caches(h, mb_type, 0);
  4082. //mb_pred
  4083. if(IS_INTRA(mb_type)){
  4084. int pred_mode;
  4085. // init_top_left_availability(h);
  4086. if(IS_INTRA4x4(mb_type)){
  4087. int i;
  4088. int di = 1;
  4089. if(dct8x8_allowed && get_bits1(&s->gb)){
  4090. mb_type |= MB_TYPE_8x8DCT;
  4091. di = 4;
  4092. }
  4093. // fill_intra4x4_pred_table(h);
  4094. for(i=0; i<16; i+=di){
  4095. int mode= pred_intra_mode(h, i);
  4096. if(!get_bits1(&s->gb)){
  4097. const int rem_mode= get_bits(&s->gb, 3);
  4098. mode = rem_mode + (rem_mode >= mode);
  4099. }
  4100. if(di==4)
  4101. fill_rectangle( &h->intra4x4_pred_mode_cache[ scan8[i] ], 2, 2, 8, mode, 1 );
  4102. else
  4103. h->intra4x4_pred_mode_cache[ scan8[i] ] = mode;
  4104. }
  4105. write_back_intra_pred_mode(h);
  4106. if( check_intra4x4_pred_mode(h) < 0)
  4107. return -1;
  4108. }else{
  4109. h->intra16x16_pred_mode= check_intra_pred_mode(h, h->intra16x16_pred_mode);
  4110. if(h->intra16x16_pred_mode < 0)
  4111. return -1;
  4112. }
  4113. pred_mode= check_intra_pred_mode(h, get_ue_golomb(&s->gb));
  4114. if(pred_mode < 0)
  4115. return -1;
  4116. h->chroma_pred_mode= pred_mode;
  4117. }else if(partition_count==4){
  4118. int i, j, sub_partition_count[4], list, ref[2][4];
  4119. if(h->slice_type == FF_B_TYPE){
  4120. for(i=0; i<4; i++){
  4121. h->sub_mb_type[i]= get_ue_golomb(&s->gb);
  4122. if(h->sub_mb_type[i] >=13){
  4123. av_log(h->s.avctx, AV_LOG_ERROR, "B sub_mb_type %u out of range at %d %d\n", h->sub_mb_type[i], s->mb_x, s->mb_y);
  4124. return -1;
  4125. }
  4126. sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  4127. h->sub_mb_type[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  4128. }
  4129. if( IS_DIRECT(h->sub_mb_type[0]) || IS_DIRECT(h->sub_mb_type[1])
  4130. || IS_DIRECT(h->sub_mb_type[2]) || IS_DIRECT(h->sub_mb_type[3])) {
  4131. pred_direct_motion(h, &mb_type);
  4132. h->ref_cache[0][scan8[4]] =
  4133. h->ref_cache[1][scan8[4]] =
  4134. h->ref_cache[0][scan8[12]] =
  4135. h->ref_cache[1][scan8[12]] = PART_NOT_AVAILABLE;
  4136. }
  4137. }else{
  4138. assert(h->slice_type == FF_P_TYPE || h->slice_type == FF_SP_TYPE); //FIXME SP correct ?
  4139. for(i=0; i<4; i++){
  4140. h->sub_mb_type[i]= get_ue_golomb(&s->gb);
  4141. if(h->sub_mb_type[i] >=4){
  4142. av_log(h->s.avctx, AV_LOG_ERROR, "P sub_mb_type %u out of range at %d %d\n", h->sub_mb_type[i], s->mb_x, s->mb_y);
  4143. return -1;
  4144. }
  4145. sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  4146. h->sub_mb_type[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  4147. }
  4148. }
  4149. for(list=0; list<h->list_count; list++){
  4150. int ref_count= IS_REF0(mb_type) ? 1 : h->ref_count[list];
  4151. for(i=0; i<4; i++){
  4152. if(IS_DIRECT(h->sub_mb_type[i])) continue;
  4153. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  4154. unsigned int tmp = get_te0_golomb(&s->gb, ref_count); //FIXME init to 0 before and skip?
  4155. if(tmp>=ref_count){
  4156. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", tmp);
  4157. return -1;
  4158. }
  4159. ref[list][i]= tmp;
  4160. }else{
  4161. //FIXME
  4162. ref[list][i] = -1;
  4163. }
  4164. }
  4165. }
  4166. if(dct8x8_allowed)
  4167. dct8x8_allowed = get_dct8x8_allowed(h);
  4168. for(list=0; list<h->list_count; list++){
  4169. for(i=0; i<4; i++){
  4170. if(IS_DIRECT(h->sub_mb_type[i])) {
  4171. h->ref_cache[list][ scan8[4*i] ] = h->ref_cache[list][ scan8[4*i]+1 ];
  4172. continue;
  4173. }
  4174. h->ref_cache[list][ scan8[4*i] ]=h->ref_cache[list][ scan8[4*i]+1 ]=
  4175. h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];
  4176. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  4177. const int sub_mb_type= h->sub_mb_type[i];
  4178. const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;
  4179. for(j=0; j<sub_partition_count[i]; j++){
  4180. int mx, my;
  4181. const int index= 4*i + block_width*j;
  4182. int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];
  4183. pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mx, &my);
  4184. mx += get_se_golomb(&s->gb);
  4185. my += get_se_golomb(&s->gb);
  4186. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4187. if(IS_SUB_8X8(sub_mb_type)){
  4188. mv_cache[ 1 ][0]=
  4189. mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;
  4190. mv_cache[ 1 ][1]=
  4191. mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;
  4192. }else if(IS_SUB_8X4(sub_mb_type)){
  4193. mv_cache[ 1 ][0]= mx;
  4194. mv_cache[ 1 ][1]= my;
  4195. }else if(IS_SUB_4X8(sub_mb_type)){
  4196. mv_cache[ 8 ][0]= mx;
  4197. mv_cache[ 8 ][1]= my;
  4198. }
  4199. mv_cache[ 0 ][0]= mx;
  4200. mv_cache[ 0 ][1]= my;
  4201. }
  4202. }else{
  4203. uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];
  4204. p[0] = p[1]=
  4205. p[8] = p[9]= 0;
  4206. }
  4207. }
  4208. }
  4209. }else if(IS_DIRECT(mb_type)){
  4210. pred_direct_motion(h, &mb_type);
  4211. dct8x8_allowed &= h->sps.direct_8x8_inference_flag;
  4212. }else{
  4213. int list, mx, my, i;
  4214. //FIXME we should set ref_idx_l? to 0 if we use that later ...
  4215. if(IS_16X16(mb_type)){
  4216. for(list=0; list<h->list_count; list++){
  4217. unsigned int val;
  4218. if(IS_DIR(mb_type, 0, list)){
  4219. val= get_te0_golomb(&s->gb, h->ref_count[list]);
  4220. if(val >= h->ref_count[list]){
  4221. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", val);
  4222. return -1;
  4223. }
  4224. }else
  4225. val= LIST_NOT_USED&0xFF;
  4226. fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, val, 1);
  4227. }
  4228. for(list=0; list<h->list_count; list++){
  4229. unsigned int val;
  4230. if(IS_DIR(mb_type, 0, list)){
  4231. pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mx, &my);
  4232. mx += get_se_golomb(&s->gb);
  4233. my += get_se_golomb(&s->gb);
  4234. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4235. val= pack16to32(mx,my);
  4236. }else
  4237. val=0;
  4238. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, val, 4);
  4239. }
  4240. }
  4241. else if(IS_16X8(mb_type)){
  4242. for(list=0; list<h->list_count; list++){
  4243. for(i=0; i<2; i++){
  4244. unsigned int val;
  4245. if(IS_DIR(mb_type, i, list)){
  4246. val= get_te0_golomb(&s->gb, h->ref_count[list]);
  4247. if(val >= h->ref_count[list]){
  4248. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", val);
  4249. return -1;
  4250. }
  4251. }else
  4252. val= LIST_NOT_USED&0xFF;
  4253. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, val, 1);
  4254. }
  4255. }
  4256. for(list=0; list<h->list_count; list++){
  4257. for(i=0; i<2; i++){
  4258. unsigned int val;
  4259. if(IS_DIR(mb_type, i, list)){
  4260. pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mx, &my);
  4261. mx += get_se_golomb(&s->gb);
  4262. my += get_se_golomb(&s->gb);
  4263. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4264. val= pack16to32(mx,my);
  4265. }else
  4266. val=0;
  4267. fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, val, 4);
  4268. }
  4269. }
  4270. }else{
  4271. assert(IS_8X16(mb_type));
  4272. for(list=0; list<h->list_count; list++){
  4273. for(i=0; i<2; i++){
  4274. unsigned int val;
  4275. if(IS_DIR(mb_type, i, list)){ //FIXME optimize
  4276. val= get_te0_golomb(&s->gb, h->ref_count[list]);
  4277. if(val >= h->ref_count[list]){
  4278. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", val);
  4279. return -1;
  4280. }
  4281. }else
  4282. val= LIST_NOT_USED&0xFF;
  4283. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, val, 1);
  4284. }
  4285. }
  4286. for(list=0; list<h->list_count; list++){
  4287. for(i=0; i<2; i++){
  4288. unsigned int val;
  4289. if(IS_DIR(mb_type, i, list)){
  4290. pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mx, &my);
  4291. mx += get_se_golomb(&s->gb);
  4292. my += get_se_golomb(&s->gb);
  4293. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4294. val= pack16to32(mx,my);
  4295. }else
  4296. val=0;
  4297. fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, val, 4);
  4298. }
  4299. }
  4300. }
  4301. }
  4302. if(IS_INTER(mb_type))
  4303. write_back_motion(h, mb_type);
  4304. if(!IS_INTRA16x16(mb_type)){
  4305. cbp= get_ue_golomb(&s->gb);
  4306. if(cbp > 47){
  4307. av_log(h->s.avctx, AV_LOG_ERROR, "cbp too large (%u) at %d %d\n", cbp, s->mb_x, s->mb_y);
  4308. return -1;
  4309. }
  4310. if(IS_INTRA4x4(mb_type))
  4311. cbp= golomb_to_intra4x4_cbp[cbp];
  4312. else
  4313. cbp= golomb_to_inter_cbp[cbp];
  4314. }
  4315. h->cbp = cbp;
  4316. if(dct8x8_allowed && (cbp&15) && !IS_INTRA(mb_type)){
  4317. if(get_bits1(&s->gb))
  4318. mb_type |= MB_TYPE_8x8DCT;
  4319. }
  4320. s->current_picture.mb_type[mb_xy]= mb_type;
  4321. if(cbp || IS_INTRA16x16(mb_type)){
  4322. int i8x8, i4x4, chroma_idx;
  4323. int dquant;
  4324. GetBitContext *gb= IS_INTRA(mb_type) ? h->intra_gb_ptr : h->inter_gb_ptr;
  4325. const uint8_t *scan, *scan8x8, *dc_scan;
  4326. // fill_non_zero_count_cache(h);
  4327. if(IS_INTERLACED(mb_type)){
  4328. scan8x8= s->qscale ? h->field_scan8x8_cavlc : h->field_scan8x8_cavlc_q0;
  4329. scan= s->qscale ? h->field_scan : h->field_scan_q0;
  4330. dc_scan= luma_dc_field_scan;
  4331. }else{
  4332. scan8x8= s->qscale ? h->zigzag_scan8x8_cavlc : h->zigzag_scan8x8_cavlc_q0;
  4333. scan= s->qscale ? h->zigzag_scan : h->zigzag_scan_q0;
  4334. dc_scan= luma_dc_zigzag_scan;
  4335. }
  4336. dquant= get_se_golomb(&s->gb);
  4337. if( dquant > 25 || dquant < -26 ){
  4338. av_log(h->s.avctx, AV_LOG_ERROR, "dquant out of range (%d) at %d %d\n", dquant, s->mb_x, s->mb_y);
  4339. return -1;
  4340. }
  4341. s->qscale += dquant;
  4342. if(((unsigned)s->qscale) > 51){
  4343. if(s->qscale<0) s->qscale+= 52;
  4344. else s->qscale-= 52;
  4345. }
  4346. h->chroma_qp[0]= get_chroma_qp(h, 0, s->qscale);
  4347. h->chroma_qp[1]= get_chroma_qp(h, 1, s->qscale);
  4348. if(IS_INTRA16x16(mb_type)){
  4349. if( decode_residual(h, h->intra_gb_ptr, h->mb, LUMA_DC_BLOCK_INDEX, dc_scan, h->dequant4_coeff[0][s->qscale], 16) < 0){
  4350. return -1; //FIXME continue if partitioned and other return -1 too
  4351. }
  4352. assert((cbp&15) == 0 || (cbp&15) == 15);
  4353. if(cbp&15){
  4354. for(i8x8=0; i8x8<4; i8x8++){
  4355. for(i4x4=0; i4x4<4; i4x4++){
  4356. const int index= i4x4 + 4*i8x8;
  4357. if( decode_residual(h, h->intra_gb_ptr, h->mb + 16*index, index, scan + 1, h->dequant4_coeff[0][s->qscale], 15) < 0 ){
  4358. return -1;
  4359. }
  4360. }
  4361. }
  4362. }else{
  4363. fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);
  4364. }
  4365. }else{
  4366. for(i8x8=0; i8x8<4; i8x8++){
  4367. if(cbp & (1<<i8x8)){
  4368. if(IS_8x8DCT(mb_type)){
  4369. DCTELEM *buf = &h->mb[64*i8x8];
  4370. uint8_t *nnz;
  4371. for(i4x4=0; i4x4<4; i4x4++){
  4372. if( decode_residual(h, gb, buf, i4x4+4*i8x8, scan8x8+16*i4x4,
  4373. h->dequant8_coeff[IS_INTRA( mb_type ) ? 0:1][s->qscale], 16) <0 )
  4374. return -1;
  4375. }
  4376. nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  4377. nnz[0] += nnz[1] + nnz[8] + nnz[9];
  4378. }else{
  4379. for(i4x4=0; i4x4<4; i4x4++){
  4380. const int index= i4x4 + 4*i8x8;
  4381. if( decode_residual(h, gb, h->mb + 16*index, index, scan, h->dequant4_coeff[IS_INTRA( mb_type ) ? 0:3][s->qscale], 16) <0 ){
  4382. return -1;
  4383. }
  4384. }
  4385. }
  4386. }else{
  4387. uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  4388. nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;
  4389. }
  4390. }
  4391. }
  4392. if(cbp&0x30){
  4393. for(chroma_idx=0; chroma_idx<2; chroma_idx++)
  4394. if( decode_residual(h, gb, h->mb + 256 + 16*4*chroma_idx, CHROMA_DC_BLOCK_INDEX, chroma_dc_scan, NULL, 4) < 0){
  4395. return -1;
  4396. }
  4397. }
  4398. if(cbp&0x20){
  4399. for(chroma_idx=0; chroma_idx<2; chroma_idx++){
  4400. const uint32_t *qmul = h->dequant4_coeff[chroma_idx+1+(IS_INTRA( mb_type ) ? 0:3)][h->chroma_qp[chroma_idx]];
  4401. for(i4x4=0; i4x4<4; i4x4++){
  4402. const int index= 16 + 4*chroma_idx + i4x4;
  4403. if( decode_residual(h, gb, h->mb + 16*index, index, scan + 1, qmul, 15) < 0){
  4404. return -1;
  4405. }
  4406. }
  4407. }
  4408. }else{
  4409. uint8_t * const nnz= &h->non_zero_count_cache[0];
  4410. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  4411. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  4412. }
  4413. }else{
  4414. uint8_t * const nnz= &h->non_zero_count_cache[0];
  4415. fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);
  4416. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  4417. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  4418. }
  4419. s->current_picture.qscale_table[mb_xy]= s->qscale;
  4420. write_back_non_zero_count(h);
  4421. if(MB_MBAFF){
  4422. h->ref_count[0] >>= 1;
  4423. h->ref_count[1] >>= 1;
  4424. }
  4425. return 0;
  4426. }
  4427. static int decode_cabac_field_decoding_flag(H264Context *h) {
  4428. MpegEncContext * const s = &h->s;
  4429. const int mb_x = s->mb_x;
  4430. const int mb_y = s->mb_y & ~1;
  4431. const int mba_xy = mb_x - 1 + mb_y *s->mb_stride;
  4432. const int mbb_xy = mb_x + (mb_y-2)*s->mb_stride;
  4433. unsigned int ctx = 0;
  4434. if( h->slice_table[mba_xy] == h->slice_num && IS_INTERLACED( s->current_picture.mb_type[mba_xy] ) ) {
  4435. ctx += 1;
  4436. }
  4437. if( h->slice_table[mbb_xy] == h->slice_num && IS_INTERLACED( s->current_picture.mb_type[mbb_xy] ) ) {
  4438. ctx += 1;
  4439. }
  4440. return get_cabac_noinline( &h->cabac, &h->cabac_state[70 + ctx] );
  4441. }
  4442. static int decode_cabac_intra_mb_type(H264Context *h, int ctx_base, int intra_slice) {
  4443. uint8_t *state= &h->cabac_state[ctx_base];
  4444. int mb_type;
  4445. if(intra_slice){
  4446. MpegEncContext * const s = &h->s;
  4447. const int mba_xy = h->left_mb_xy[0];
  4448. const int mbb_xy = h->top_mb_xy;
  4449. int ctx=0;
  4450. if( h->slice_table[mba_xy] == h->slice_num && !IS_INTRA4x4( s->current_picture.mb_type[mba_xy] ) )
  4451. ctx++;
  4452. if( h->slice_table[mbb_xy] == h->slice_num && !IS_INTRA4x4( s->current_picture.mb_type[mbb_xy] ) )
  4453. ctx++;
  4454. if( get_cabac_noinline( &h->cabac, &state[ctx] ) == 0 )
  4455. return 0; /* I4x4 */
  4456. state += 2;
  4457. }else{
  4458. if( get_cabac_noinline( &h->cabac, &state[0] ) == 0 )
  4459. return 0; /* I4x4 */
  4460. }
  4461. if( get_cabac_terminate( &h->cabac ) )
  4462. return 25; /* PCM */
  4463. mb_type = 1; /* I16x16 */
  4464. mb_type += 12 * get_cabac_noinline( &h->cabac, &state[1] ); /* cbp_luma != 0 */
  4465. if( get_cabac_noinline( &h->cabac, &state[2] ) ) /* cbp_chroma */
  4466. mb_type += 4 + 4 * get_cabac_noinline( &h->cabac, &state[2+intra_slice] );
  4467. mb_type += 2 * get_cabac_noinline( &h->cabac, &state[3+intra_slice] );
  4468. mb_type += 1 * get_cabac_noinline( &h->cabac, &state[3+2*intra_slice] );
  4469. return mb_type;
  4470. }
  4471. static int decode_cabac_mb_type( H264Context *h ) {
  4472. MpegEncContext * const s = &h->s;
  4473. if( h->slice_type == FF_I_TYPE ) {
  4474. return decode_cabac_intra_mb_type(h, 3, 1);
  4475. } else if( h->slice_type == FF_P_TYPE ) {
  4476. if( get_cabac_noinline( &h->cabac, &h->cabac_state[14] ) == 0 ) {
  4477. /* P-type */
  4478. if( get_cabac_noinline( &h->cabac, &h->cabac_state[15] ) == 0 ) {
  4479. /* P_L0_D16x16, P_8x8 */
  4480. return 3 * get_cabac_noinline( &h->cabac, &h->cabac_state[16] );
  4481. } else {
  4482. /* P_L0_D8x16, P_L0_D16x8 */
  4483. return 2 - get_cabac_noinline( &h->cabac, &h->cabac_state[17] );
  4484. }
  4485. } else {
  4486. return decode_cabac_intra_mb_type(h, 17, 0) + 5;
  4487. }
  4488. } else if( h->slice_type == FF_B_TYPE ) {
  4489. const int mba_xy = h->left_mb_xy[0];
  4490. const int mbb_xy = h->top_mb_xy;
  4491. int ctx = 0;
  4492. int bits;
  4493. if( h->slice_table[mba_xy] == h->slice_num && !IS_DIRECT( s->current_picture.mb_type[mba_xy] ) )
  4494. ctx++;
  4495. if( h->slice_table[mbb_xy] == h->slice_num && !IS_DIRECT( s->current_picture.mb_type[mbb_xy] ) )
  4496. ctx++;
  4497. if( !get_cabac_noinline( &h->cabac, &h->cabac_state[27+ctx] ) )
  4498. return 0; /* B_Direct_16x16 */
  4499. if( !get_cabac_noinline( &h->cabac, &h->cabac_state[27+3] ) ) {
  4500. return 1 + get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ); /* B_L[01]_16x16 */
  4501. }
  4502. bits = get_cabac_noinline( &h->cabac, &h->cabac_state[27+4] ) << 3;
  4503. bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ) << 2;
  4504. bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ) << 1;
  4505. bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] );
  4506. if( bits < 8 )
  4507. return bits + 3; /* B_Bi_16x16 through B_L1_L0_16x8 */
  4508. else if( bits == 13 ) {
  4509. return decode_cabac_intra_mb_type(h, 32, 0) + 23;
  4510. } else if( bits == 14 )
  4511. return 11; /* B_L1_L0_8x16 */
  4512. else if( bits == 15 )
  4513. return 22; /* B_8x8 */
  4514. bits= ( bits<<1 ) | get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] );
  4515. return bits - 4; /* B_L0_Bi_* through B_Bi_Bi_* */
  4516. } else {
  4517. /* TODO SI/SP frames? */
  4518. return -1;
  4519. }
  4520. }
  4521. static int decode_cabac_mb_skip( H264Context *h, int mb_x, int mb_y ) {
  4522. MpegEncContext * const s = &h->s;
  4523. int mba_xy, mbb_xy;
  4524. int ctx = 0;
  4525. if(FRAME_MBAFF){ //FIXME merge with the stuff in fill_caches?
  4526. int mb_xy = mb_x + (mb_y&~1)*s->mb_stride;
  4527. mba_xy = mb_xy - 1;
  4528. if( (mb_y&1)
  4529. && h->slice_table[mba_xy] == h->slice_num
  4530. && MB_FIELD == !!IS_INTERLACED( s->current_picture.mb_type[mba_xy] ) )
  4531. mba_xy += s->mb_stride;
  4532. if( MB_FIELD ){
  4533. mbb_xy = mb_xy - s->mb_stride;
  4534. if( !(mb_y&1)
  4535. && h->slice_table[mbb_xy] == h->slice_num
  4536. && IS_INTERLACED( s->current_picture.mb_type[mbb_xy] ) )
  4537. mbb_xy -= s->mb_stride;
  4538. }else
  4539. mbb_xy = mb_x + (mb_y-1)*s->mb_stride;
  4540. }else{
  4541. int mb_xy = h->mb_xy;
  4542. mba_xy = mb_xy - 1;
  4543. mbb_xy = mb_xy - (s->mb_stride << FIELD_PICTURE);
  4544. }
  4545. if( h->slice_table[mba_xy] == h->slice_num && !IS_SKIP( s->current_picture.mb_type[mba_xy] ))
  4546. ctx++;
  4547. if( h->slice_table[mbb_xy] == h->slice_num && !IS_SKIP( s->current_picture.mb_type[mbb_xy] ))
  4548. ctx++;
  4549. if( h->slice_type == FF_B_TYPE )
  4550. ctx += 13;
  4551. return get_cabac_noinline( &h->cabac, &h->cabac_state[11+ctx] );
  4552. }
  4553. static int decode_cabac_mb_intra4x4_pred_mode( H264Context *h, int pred_mode ) {
  4554. int mode = 0;
  4555. if( get_cabac( &h->cabac, &h->cabac_state[68] ) )
  4556. return pred_mode;
  4557. mode += 1 * get_cabac( &h->cabac, &h->cabac_state[69] );
  4558. mode += 2 * get_cabac( &h->cabac, &h->cabac_state[69] );
  4559. mode += 4 * get_cabac( &h->cabac, &h->cabac_state[69] );
  4560. if( mode >= pred_mode )
  4561. return mode + 1;
  4562. else
  4563. return mode;
  4564. }
  4565. static int decode_cabac_mb_chroma_pre_mode( H264Context *h) {
  4566. const int mba_xy = h->left_mb_xy[0];
  4567. const int mbb_xy = h->top_mb_xy;
  4568. int ctx = 0;
  4569. /* No need to test for IS_INTRA4x4 and IS_INTRA16x16, as we set chroma_pred_mode_table to 0 */
  4570. if( h->slice_table[mba_xy] == h->slice_num && h->chroma_pred_mode_table[mba_xy] != 0 )
  4571. ctx++;
  4572. if( h->slice_table[mbb_xy] == h->slice_num && h->chroma_pred_mode_table[mbb_xy] != 0 )
  4573. ctx++;
  4574. if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+ctx] ) == 0 )
  4575. return 0;
  4576. if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+3] ) == 0 )
  4577. return 1;
  4578. if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+3] ) == 0 )
  4579. return 2;
  4580. else
  4581. return 3;
  4582. }
  4583. static int decode_cabac_mb_cbp_luma( H264Context *h) {
  4584. int cbp_b, cbp_a, ctx, cbp = 0;
  4585. cbp_a = h->slice_table[h->left_mb_xy[0]] == h->slice_num ? h->left_cbp : -1;
  4586. cbp_b = h->slice_table[h->top_mb_xy] == h->slice_num ? h->top_cbp : -1;
  4587. ctx = !(cbp_a & 0x02) + 2 * !(cbp_b & 0x04);
  4588. cbp |= get_cabac_noinline(&h->cabac, &h->cabac_state[73 + ctx]);
  4589. ctx = !(cbp & 0x01) + 2 * !(cbp_b & 0x08);
  4590. cbp |= get_cabac_noinline(&h->cabac, &h->cabac_state[73 + ctx]) << 1;
  4591. ctx = !(cbp_a & 0x08) + 2 * !(cbp & 0x01);
  4592. cbp |= get_cabac_noinline(&h->cabac, &h->cabac_state[73 + ctx]) << 2;
  4593. ctx = !(cbp & 0x04) + 2 * !(cbp & 0x02);
  4594. cbp |= get_cabac_noinline(&h->cabac, &h->cabac_state[73 + ctx]) << 3;
  4595. return cbp;
  4596. }
  4597. static int decode_cabac_mb_cbp_chroma( H264Context *h) {
  4598. int ctx;
  4599. int cbp_a, cbp_b;
  4600. cbp_a = (h->left_cbp>>4)&0x03;
  4601. cbp_b = (h-> top_cbp>>4)&0x03;
  4602. ctx = 0;
  4603. if( cbp_a > 0 ) ctx++;
  4604. if( cbp_b > 0 ) ctx += 2;
  4605. if( get_cabac_noinline( &h->cabac, &h->cabac_state[77 + ctx] ) == 0 )
  4606. return 0;
  4607. ctx = 4;
  4608. if( cbp_a == 2 ) ctx++;
  4609. if( cbp_b == 2 ) ctx += 2;
  4610. return 1 + get_cabac_noinline( &h->cabac, &h->cabac_state[77 + ctx] );
  4611. }
  4612. static int decode_cabac_mb_dqp( H264Context *h) {
  4613. int ctx = 0;
  4614. int val = 0;
  4615. if( h->last_qscale_diff != 0 )
  4616. ctx++;
  4617. while( get_cabac_noinline( &h->cabac, &h->cabac_state[60 + ctx] ) ) {
  4618. if( ctx < 2 )
  4619. ctx = 2;
  4620. else
  4621. ctx = 3;
  4622. val++;
  4623. if(val > 102) //prevent infinite loop
  4624. return INT_MIN;
  4625. }
  4626. if( val&0x01 )
  4627. return (val + 1)/2;
  4628. else
  4629. return -(val + 1)/2;
  4630. }
  4631. static int decode_cabac_p_mb_sub_type( H264Context *h ) {
  4632. if( get_cabac( &h->cabac, &h->cabac_state[21] ) )
  4633. return 0; /* 8x8 */
  4634. if( !get_cabac( &h->cabac, &h->cabac_state[22] ) )
  4635. return 1; /* 8x4 */
  4636. if( get_cabac( &h->cabac, &h->cabac_state[23] ) )
  4637. return 2; /* 4x8 */
  4638. return 3; /* 4x4 */
  4639. }
  4640. static int decode_cabac_b_mb_sub_type( H264Context *h ) {
  4641. int type;
  4642. if( !get_cabac( &h->cabac, &h->cabac_state[36] ) )
  4643. return 0; /* B_Direct_8x8 */
  4644. if( !get_cabac( &h->cabac, &h->cabac_state[37] ) )
  4645. return 1 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L0_8x8, B_L1_8x8 */
  4646. type = 3;
  4647. if( get_cabac( &h->cabac, &h->cabac_state[38] ) ) {
  4648. if( get_cabac( &h->cabac, &h->cabac_state[39] ) )
  4649. return 11 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L1_4x4, B_Bi_4x4 */
  4650. type += 4;
  4651. }
  4652. type += 2*get_cabac( &h->cabac, &h->cabac_state[39] );
  4653. type += get_cabac( &h->cabac, &h->cabac_state[39] );
  4654. return type;
  4655. }
  4656. static inline int decode_cabac_mb_transform_size( H264Context *h ) {
  4657. return get_cabac_noinline( &h->cabac, &h->cabac_state[399 + h->neighbor_transform_size] );
  4658. }
  4659. static int decode_cabac_mb_ref( H264Context *h, int list, int n ) {
  4660. int refa = h->ref_cache[list][scan8[n] - 1];
  4661. int refb = h->ref_cache[list][scan8[n] - 8];
  4662. int ref = 0;
  4663. int ctx = 0;
  4664. if( h->slice_type == FF_B_TYPE) {
  4665. if( refa > 0 && !h->direct_cache[scan8[n] - 1] )
  4666. ctx++;
  4667. if( refb > 0 && !h->direct_cache[scan8[n] - 8] )
  4668. ctx += 2;
  4669. } else {
  4670. if( refa > 0 )
  4671. ctx++;
  4672. if( refb > 0 )
  4673. ctx += 2;
  4674. }
  4675. while( get_cabac( &h->cabac, &h->cabac_state[54+ctx] ) ) {
  4676. ref++;
  4677. if( ctx < 4 )
  4678. ctx = 4;
  4679. else
  4680. ctx = 5;
  4681. if(ref >= 32 /*h->ref_list[list]*/){
  4682. av_log(h->s.avctx, AV_LOG_ERROR, "overflow in decode_cabac_mb_ref\n");
  4683. return 0; //FIXME we should return -1 and check the return everywhere
  4684. }
  4685. }
  4686. return ref;
  4687. }
  4688. static int decode_cabac_mb_mvd( H264Context *h, int list, int n, int l ) {
  4689. int amvd = abs( h->mvd_cache[list][scan8[n] - 1][l] ) +
  4690. abs( h->mvd_cache[list][scan8[n] - 8][l] );
  4691. int ctxbase = (l == 0) ? 40 : 47;
  4692. int ctx, mvd;
  4693. if( amvd < 3 )
  4694. ctx = 0;
  4695. else if( amvd > 32 )
  4696. ctx = 2;
  4697. else
  4698. ctx = 1;
  4699. if(!get_cabac(&h->cabac, &h->cabac_state[ctxbase+ctx]))
  4700. return 0;
  4701. mvd= 1;
  4702. ctx= 3;
  4703. while( mvd < 9 && get_cabac( &h->cabac, &h->cabac_state[ctxbase+ctx] ) ) {
  4704. mvd++;
  4705. if( ctx < 6 )
  4706. ctx++;
  4707. }
  4708. if( mvd >= 9 ) {
  4709. int k = 3;
  4710. while( get_cabac_bypass( &h->cabac ) ) {
  4711. mvd += 1 << k;
  4712. k++;
  4713. if(k>24){
  4714. av_log(h->s.avctx, AV_LOG_ERROR, "overflow in decode_cabac_mb_mvd\n");
  4715. return INT_MIN;
  4716. }
  4717. }
  4718. while( k-- ) {
  4719. if( get_cabac_bypass( &h->cabac ) )
  4720. mvd += 1 << k;
  4721. }
  4722. }
  4723. return get_cabac_bypass_sign( &h->cabac, -mvd );
  4724. }
  4725. static av_always_inline int get_cabac_cbf_ctx( H264Context *h, int cat, int idx, int is_dc ) {
  4726. int nza, nzb;
  4727. int ctx = 0;
  4728. if( is_dc ) {
  4729. if( cat == 0 ) {
  4730. nza = h->left_cbp&0x100;
  4731. nzb = h-> top_cbp&0x100;
  4732. } else {
  4733. nza = (h->left_cbp>>(6+idx))&0x01;
  4734. nzb = (h-> top_cbp>>(6+idx))&0x01;
  4735. }
  4736. } else {
  4737. if( cat == 4 ) {
  4738. nza = h->non_zero_count_cache[scan8[16+idx] - 1];
  4739. nzb = h->non_zero_count_cache[scan8[16+idx] - 8];
  4740. } else {
  4741. assert(cat == 1 || cat == 2);
  4742. nza = h->non_zero_count_cache[scan8[idx] - 1];
  4743. nzb = h->non_zero_count_cache[scan8[idx] - 8];
  4744. }
  4745. }
  4746. if( nza > 0 )
  4747. ctx++;
  4748. if( nzb > 0 )
  4749. ctx += 2;
  4750. return ctx + 4 * cat;
  4751. }
  4752. DECLARE_ASM_CONST(1, uint8_t, last_coeff_flag_offset_8x8[63]) = {
  4753. 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  4754. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  4755. 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
  4756. 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8
  4757. };
  4758. static av_always_inline void decode_cabac_residual_internal( H264Context *h, DCTELEM *block, int cat, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff, int is_dc ) {
  4759. static const int significant_coeff_flag_offset[2][6] = {
  4760. { 105+0, 105+15, 105+29, 105+44, 105+47, 402 },
  4761. { 277+0, 277+15, 277+29, 277+44, 277+47, 436 }
  4762. };
  4763. static const int last_coeff_flag_offset[2][6] = {
  4764. { 166+0, 166+15, 166+29, 166+44, 166+47, 417 },
  4765. { 338+0, 338+15, 338+29, 338+44, 338+47, 451 }
  4766. };
  4767. static const int coeff_abs_level_m1_offset[6] = {
  4768. 227+0, 227+10, 227+20, 227+30, 227+39, 426
  4769. };
  4770. static const uint8_t significant_coeff_flag_offset_8x8[2][63] = {
  4771. { 0, 1, 2, 3, 4, 5, 5, 4, 4, 3, 3, 4, 4, 4, 5, 5,
  4772. 4, 4, 4, 4, 3, 3, 6, 7, 7, 7, 8, 9,10, 9, 8, 7,
  4773. 7, 6,11,12,13,11, 6, 7, 8, 9,14,10, 9, 8, 6,11,
  4774. 12,13,11, 6, 9,14,10, 9,11,12,13,11,14,10,12 },
  4775. { 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 7, 7, 8, 4, 5,
  4776. 6, 9,10,10, 8,11,12,11, 9, 9,10,10, 8,11,12,11,
  4777. 9, 9,10,10, 8,11,12,11, 9, 9,10,10, 8,13,13, 9,
  4778. 9,10,10, 8,13,13, 9, 9,10,10,14,14,14,14,14 }
  4779. };
  4780. /* node ctx: 0..3: abslevel1 (with abslevelgt1 == 0).
  4781. * 4..7: abslevelgt1 + 3 (and abslevel1 doesn't matter).
  4782. * map node ctx => cabac ctx for level=1 */
  4783. static const uint8_t coeff_abs_level1_ctx[8] = { 1, 2, 3, 4, 0, 0, 0, 0 };
  4784. /* map node ctx => cabac ctx for level>1 */
  4785. static const uint8_t coeff_abs_levelgt1_ctx[8] = { 5, 5, 5, 5, 6, 7, 8, 9 };
  4786. static const uint8_t coeff_abs_level_transition[2][8] = {
  4787. /* update node ctx after decoding a level=1 */
  4788. { 1, 2, 3, 3, 4, 5, 6, 7 },
  4789. /* update node ctx after decoding a level>1 */
  4790. { 4, 4, 4, 4, 5, 6, 7, 7 }
  4791. };
  4792. int index[64];
  4793. int av_unused last;
  4794. int coeff_count = 0;
  4795. int node_ctx = 0;
  4796. uint8_t *significant_coeff_ctx_base;
  4797. uint8_t *last_coeff_ctx_base;
  4798. uint8_t *abs_level_m1_ctx_base;
  4799. #ifndef ARCH_X86
  4800. #define CABAC_ON_STACK
  4801. #endif
  4802. #ifdef CABAC_ON_STACK
  4803. #define CC &cc
  4804. CABACContext cc;
  4805. cc.range = h->cabac.range;
  4806. cc.low = h->cabac.low;
  4807. cc.bytestream= h->cabac.bytestream;
  4808. #else
  4809. #define CC &h->cabac
  4810. #endif
  4811. /* cat: 0-> DC 16x16 n = 0
  4812. * 1-> AC 16x16 n = luma4x4idx
  4813. * 2-> Luma4x4 n = luma4x4idx
  4814. * 3-> DC Chroma n = iCbCr
  4815. * 4-> AC Chroma n = 4 * iCbCr + chroma4x4idx
  4816. * 5-> Luma8x8 n = 4 * luma8x8idx
  4817. */
  4818. /* read coded block flag */
  4819. if( is_dc || cat != 5 ) {
  4820. if( get_cabac( CC, &h->cabac_state[85 + get_cabac_cbf_ctx( h, cat, n, is_dc ) ] ) == 0 ) {
  4821. if( !is_dc ) {
  4822. if( cat == 4 )
  4823. h->non_zero_count_cache[scan8[16+n]] = 0;
  4824. else
  4825. h->non_zero_count_cache[scan8[n]] = 0;
  4826. }
  4827. #ifdef CABAC_ON_STACK
  4828. h->cabac.range = cc.range ;
  4829. h->cabac.low = cc.low ;
  4830. h->cabac.bytestream= cc.bytestream;
  4831. #endif
  4832. return;
  4833. }
  4834. }
  4835. significant_coeff_ctx_base = h->cabac_state
  4836. + significant_coeff_flag_offset[MB_FIELD][cat];
  4837. last_coeff_ctx_base = h->cabac_state
  4838. + last_coeff_flag_offset[MB_FIELD][cat];
  4839. abs_level_m1_ctx_base = h->cabac_state
  4840. + coeff_abs_level_m1_offset[cat];
  4841. if( !is_dc && cat == 5 ) {
  4842. #define DECODE_SIGNIFICANCE( coefs, sig_off, last_off ) \
  4843. for(last= 0; last < coefs; last++) { \
  4844. uint8_t *sig_ctx = significant_coeff_ctx_base + sig_off; \
  4845. if( get_cabac( CC, sig_ctx )) { \
  4846. uint8_t *last_ctx = last_coeff_ctx_base + last_off; \
  4847. index[coeff_count++] = last; \
  4848. if( get_cabac( CC, last_ctx ) ) { \
  4849. last= max_coeff; \
  4850. break; \
  4851. } \
  4852. } \
  4853. }\
  4854. if( last == max_coeff -1 ) {\
  4855. index[coeff_count++] = last;\
  4856. }
  4857. const uint8_t *sig_off = significant_coeff_flag_offset_8x8[MB_FIELD];
  4858. #if defined(ARCH_X86) && defined(HAVE_7REGS) && defined(HAVE_EBX_AVAILABLE) && !defined(BROKEN_RELOCATIONS)
  4859. coeff_count= decode_significance_8x8_x86(CC, significant_coeff_ctx_base, index, sig_off);
  4860. } else {
  4861. coeff_count= decode_significance_x86(CC, max_coeff, significant_coeff_ctx_base, index);
  4862. #else
  4863. DECODE_SIGNIFICANCE( 63, sig_off[last], last_coeff_flag_offset_8x8[last] );
  4864. } else {
  4865. DECODE_SIGNIFICANCE( max_coeff - 1, last, last );
  4866. #endif
  4867. }
  4868. assert(coeff_count > 0);
  4869. if( is_dc ) {
  4870. if( cat == 0 )
  4871. h->cbp_table[h->mb_xy] |= 0x100;
  4872. else
  4873. h->cbp_table[h->mb_xy] |= 0x40 << n;
  4874. } else {
  4875. if( cat == 5 )
  4876. fill_rectangle(&h->non_zero_count_cache[scan8[n]], 2, 2, 8, coeff_count, 1);
  4877. else if( cat == 4 )
  4878. h->non_zero_count_cache[scan8[16+n]] = coeff_count;
  4879. else {
  4880. assert( cat == 1 || cat == 2 );
  4881. h->non_zero_count_cache[scan8[n]] = coeff_count;
  4882. }
  4883. }
  4884. while( coeff_count-- ) {
  4885. uint8_t *ctx = coeff_abs_level1_ctx[node_ctx] + abs_level_m1_ctx_base;
  4886. int j= scantable[index[coeff_count]];
  4887. if( get_cabac( CC, ctx ) == 0 ) {
  4888. node_ctx = coeff_abs_level_transition[0][node_ctx];
  4889. if( is_dc ) {
  4890. block[j] = get_cabac_bypass_sign( CC, -1);
  4891. }else{
  4892. block[j] = (get_cabac_bypass_sign( CC, -qmul[j]) + 32) >> 6;
  4893. }
  4894. } else {
  4895. int coeff_abs = 2;
  4896. ctx = coeff_abs_levelgt1_ctx[node_ctx] + abs_level_m1_ctx_base;
  4897. node_ctx = coeff_abs_level_transition[1][node_ctx];
  4898. while( coeff_abs < 15 && get_cabac( CC, ctx ) ) {
  4899. coeff_abs++;
  4900. }
  4901. if( coeff_abs >= 15 ) {
  4902. int j = 0;
  4903. while( get_cabac_bypass( CC ) ) {
  4904. j++;
  4905. }
  4906. coeff_abs=1;
  4907. while( j-- ) {
  4908. coeff_abs += coeff_abs + get_cabac_bypass( CC );
  4909. }
  4910. coeff_abs+= 14;
  4911. }
  4912. if( is_dc ) {
  4913. block[j] = get_cabac_bypass_sign( CC, -coeff_abs );
  4914. }else{
  4915. block[j] = (get_cabac_bypass_sign( CC, -coeff_abs ) * qmul[j] + 32) >> 6;
  4916. }
  4917. }
  4918. }
  4919. #ifdef CABAC_ON_STACK
  4920. h->cabac.range = cc.range ;
  4921. h->cabac.low = cc.low ;
  4922. h->cabac.bytestream= cc.bytestream;
  4923. #endif
  4924. }
  4925. #ifndef CONFIG_SMALL
  4926. static void decode_cabac_residual_dc( H264Context *h, DCTELEM *block, int cat, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff ) {
  4927. decode_cabac_residual_internal(h, block, cat, n, scantable, qmul, max_coeff, 1);
  4928. }
  4929. static void decode_cabac_residual_nondc( H264Context *h, DCTELEM *block, int cat, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff ) {
  4930. decode_cabac_residual_internal(h, block, cat, n, scantable, qmul, max_coeff, 0);
  4931. }
  4932. #endif
  4933. static void decode_cabac_residual( H264Context *h, DCTELEM *block, int cat, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff ) {
  4934. #ifdef CONFIG_SMALL
  4935. decode_cabac_residual_internal(h, block, cat, n, scantable, qmul, max_coeff, cat == 0 || cat == 3);
  4936. #else
  4937. if( cat == 0 || cat == 3 ) decode_cabac_residual_dc(h, block, cat, n, scantable, qmul, max_coeff);
  4938. else decode_cabac_residual_nondc(h, block, cat, n, scantable, qmul, max_coeff);
  4939. #endif
  4940. }
  4941. static inline void compute_mb_neighbors(H264Context *h)
  4942. {
  4943. MpegEncContext * const s = &h->s;
  4944. const int mb_xy = h->mb_xy;
  4945. h->top_mb_xy = mb_xy - s->mb_stride;
  4946. h->left_mb_xy[0] = mb_xy - 1;
  4947. if(FRAME_MBAFF){
  4948. const int pair_xy = s->mb_x + (s->mb_y & ~1)*s->mb_stride;
  4949. const int top_pair_xy = pair_xy - s->mb_stride;
  4950. const int top_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[top_pair_xy]);
  4951. const int left_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[pair_xy-1]);
  4952. const int curr_mb_frame_flag = !MB_FIELD;
  4953. const int bottom = (s->mb_y & 1);
  4954. if (bottom
  4955. ? !curr_mb_frame_flag // bottom macroblock
  4956. : (!curr_mb_frame_flag && !top_mb_frame_flag) // top macroblock
  4957. ) {
  4958. h->top_mb_xy -= s->mb_stride;
  4959. }
  4960. if (left_mb_frame_flag != curr_mb_frame_flag) {
  4961. h->left_mb_xy[0] = pair_xy - 1;
  4962. }
  4963. } else if (FIELD_PICTURE) {
  4964. h->top_mb_xy -= s->mb_stride;
  4965. }
  4966. return;
  4967. }
  4968. /**
  4969. * decodes a macroblock
  4970. * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed
  4971. */
  4972. static int decode_mb_cabac(H264Context *h) {
  4973. MpegEncContext * const s = &h->s;
  4974. int mb_xy;
  4975. int mb_type, partition_count, cbp = 0;
  4976. int dct8x8_allowed= h->pps.transform_8x8_mode;
  4977. mb_xy = h->mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  4978. s->dsp.clear_blocks(h->mb); //FIXME avoid if already clear (move after skip handlong?)
  4979. tprintf(s->avctx, "pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);
  4980. if( h->slice_type != FF_I_TYPE && h->slice_type != FF_SI_TYPE ) {
  4981. int skip;
  4982. /* a skipped mb needs the aff flag from the following mb */
  4983. if( FRAME_MBAFF && s->mb_x==0 && (s->mb_y&1)==0 )
  4984. predict_field_decoding_flag(h);
  4985. if( FRAME_MBAFF && (s->mb_y&1)==1 && h->prev_mb_skipped )
  4986. skip = h->next_mb_skipped;
  4987. else
  4988. skip = decode_cabac_mb_skip( h, s->mb_x, s->mb_y );
  4989. /* read skip flags */
  4990. if( skip ) {
  4991. if( FRAME_MBAFF && (s->mb_y&1)==0 ){
  4992. s->current_picture.mb_type[mb_xy] = MB_TYPE_SKIP;
  4993. h->next_mb_skipped = decode_cabac_mb_skip( h, s->mb_x, s->mb_y+1 );
  4994. if(h->next_mb_skipped)
  4995. predict_field_decoding_flag(h);
  4996. else
  4997. h->mb_mbaff = h->mb_field_decoding_flag = decode_cabac_field_decoding_flag(h);
  4998. }
  4999. decode_mb_skip(h);
  5000. h->cbp_table[mb_xy] = 0;
  5001. h->chroma_pred_mode_table[mb_xy] = 0;
  5002. h->last_qscale_diff = 0;
  5003. return 0;
  5004. }
  5005. }
  5006. if(FRAME_MBAFF){
  5007. if( (s->mb_y&1) == 0 )
  5008. h->mb_mbaff =
  5009. h->mb_field_decoding_flag = decode_cabac_field_decoding_flag(h);
  5010. }else
  5011. h->mb_field_decoding_flag= (s->picture_structure!=PICT_FRAME);
  5012. h->prev_mb_skipped = 0;
  5013. compute_mb_neighbors(h);
  5014. if( ( mb_type = decode_cabac_mb_type( h ) ) < 0 ) {
  5015. av_log( h->s.avctx, AV_LOG_ERROR, "decode_cabac_mb_type failed\n" );
  5016. return -1;
  5017. }
  5018. if( h->slice_type == FF_B_TYPE ) {
  5019. if( mb_type < 23 ){
  5020. partition_count= b_mb_type_info[mb_type].partition_count;
  5021. mb_type= b_mb_type_info[mb_type].type;
  5022. }else{
  5023. mb_type -= 23;
  5024. goto decode_intra_mb;
  5025. }
  5026. } else if( h->slice_type == FF_P_TYPE ) {
  5027. if( mb_type < 5) {
  5028. partition_count= p_mb_type_info[mb_type].partition_count;
  5029. mb_type= p_mb_type_info[mb_type].type;
  5030. } else {
  5031. mb_type -= 5;
  5032. goto decode_intra_mb;
  5033. }
  5034. } else {
  5035. assert(h->slice_type == FF_I_TYPE);
  5036. decode_intra_mb:
  5037. partition_count = 0;
  5038. cbp= i_mb_type_info[mb_type].cbp;
  5039. h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;
  5040. mb_type= i_mb_type_info[mb_type].type;
  5041. }
  5042. if(MB_FIELD)
  5043. mb_type |= MB_TYPE_INTERLACED;
  5044. h->slice_table[ mb_xy ]= h->slice_num;
  5045. if(IS_INTRA_PCM(mb_type)) {
  5046. const uint8_t *ptr;
  5047. unsigned int x, y;
  5048. // We assume these blocks are very rare so we do not optimize it.
  5049. // FIXME The two following lines get the bitstream position in the cabac
  5050. // decode, I think it should be done by a function in cabac.h (or cabac.c).
  5051. ptr= h->cabac.bytestream;
  5052. if(h->cabac.low&0x1) ptr--;
  5053. if(CABAC_BITS==16){
  5054. if(h->cabac.low&0x1FF) ptr--;
  5055. }
  5056. // The pixels are stored in the same order as levels in h->mb array.
  5057. for(y=0; y<16; y++){
  5058. const int index= 4*(y&3) + 32*((y>>2)&1) + 128*(y>>3);
  5059. for(x=0; x<16; x++){
  5060. tprintf(s->avctx, "LUMA ICPM LEVEL (%3d)\n", *ptr);
  5061. h->mb[index + (x&3) + 16*((x>>2)&1) + 64*(x>>3)]= *ptr++;
  5062. }
  5063. }
  5064. for(y=0; y<8; y++){
  5065. const int index= 256 + 4*(y&3) + 32*(y>>2);
  5066. for(x=0; x<8; x++){
  5067. tprintf(s->avctx, "CHROMA U ICPM LEVEL (%3d)\n", *ptr);
  5068. h->mb[index + (x&3) + 16*(x>>2)]= *ptr++;
  5069. }
  5070. }
  5071. for(y=0; y<8; y++){
  5072. const int index= 256 + 64 + 4*(y&3) + 32*(y>>2);
  5073. for(x=0; x<8; x++){
  5074. tprintf(s->avctx, "CHROMA V ICPM LEVEL (%3d)\n", *ptr);
  5075. h->mb[index + (x&3) + 16*(x>>2)]= *ptr++;
  5076. }
  5077. }
  5078. ff_init_cabac_decoder(&h->cabac, ptr, h->cabac.bytestream_end - ptr);
  5079. // All blocks are present
  5080. h->cbp_table[mb_xy] = 0x1ef;
  5081. h->chroma_pred_mode_table[mb_xy] = 0;
  5082. // In deblocking, the quantizer is 0
  5083. s->current_picture.qscale_table[mb_xy]= 0;
  5084. h->chroma_qp[0] = get_chroma_qp(h, 0, 0);
  5085. h->chroma_qp[1] = get_chroma_qp(h, 1, 0);
  5086. // All coeffs are present
  5087. memset(h->non_zero_count[mb_xy], 16, 16);
  5088. s->current_picture.mb_type[mb_xy]= mb_type;
  5089. h->last_qscale_diff = 0;
  5090. return 0;
  5091. }
  5092. if(MB_MBAFF){
  5093. h->ref_count[0] <<= 1;
  5094. h->ref_count[1] <<= 1;
  5095. }
  5096. fill_caches(h, mb_type, 0);
  5097. if( IS_INTRA( mb_type ) ) {
  5098. int i, pred_mode;
  5099. if( IS_INTRA4x4( mb_type ) ) {
  5100. if( dct8x8_allowed && decode_cabac_mb_transform_size( h ) ) {
  5101. mb_type |= MB_TYPE_8x8DCT;
  5102. for( i = 0; i < 16; i+=4 ) {
  5103. int pred = pred_intra_mode( h, i );
  5104. int mode = decode_cabac_mb_intra4x4_pred_mode( h, pred );
  5105. fill_rectangle( &h->intra4x4_pred_mode_cache[ scan8[i] ], 2, 2, 8, mode, 1 );
  5106. }
  5107. } else {
  5108. for( i = 0; i < 16; i++ ) {
  5109. int pred = pred_intra_mode( h, i );
  5110. h->intra4x4_pred_mode_cache[ scan8[i] ] = decode_cabac_mb_intra4x4_pred_mode( h, pred );
  5111. //av_log( s->avctx, AV_LOG_ERROR, "i4x4 pred=%d mode=%d\n", pred, h->intra4x4_pred_mode_cache[ scan8[i] ] );
  5112. }
  5113. }
  5114. write_back_intra_pred_mode(h);
  5115. if( check_intra4x4_pred_mode(h) < 0 ) return -1;
  5116. } else {
  5117. h->intra16x16_pred_mode= check_intra_pred_mode( h, h->intra16x16_pred_mode );
  5118. if( h->intra16x16_pred_mode < 0 ) return -1;
  5119. }
  5120. h->chroma_pred_mode_table[mb_xy] =
  5121. pred_mode = decode_cabac_mb_chroma_pre_mode( h );
  5122. pred_mode= check_intra_pred_mode( h, pred_mode );
  5123. if( pred_mode < 0 ) return -1;
  5124. h->chroma_pred_mode= pred_mode;
  5125. } else if( partition_count == 4 ) {
  5126. int i, j, sub_partition_count[4], list, ref[2][4];
  5127. if( h->slice_type == FF_B_TYPE ) {
  5128. for( i = 0; i < 4; i++ ) {
  5129. h->sub_mb_type[i] = decode_cabac_b_mb_sub_type( h );
  5130. sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  5131. h->sub_mb_type[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  5132. }
  5133. if( IS_DIRECT(h->sub_mb_type[0] | h->sub_mb_type[1] |
  5134. h->sub_mb_type[2] | h->sub_mb_type[3]) ) {
  5135. pred_direct_motion(h, &mb_type);
  5136. h->ref_cache[0][scan8[4]] =
  5137. h->ref_cache[1][scan8[4]] =
  5138. h->ref_cache[0][scan8[12]] =
  5139. h->ref_cache[1][scan8[12]] = PART_NOT_AVAILABLE;
  5140. if( h->ref_count[0] > 1 || h->ref_count[1] > 1 ) {
  5141. for( i = 0; i < 4; i++ )
  5142. if( IS_DIRECT(h->sub_mb_type[i]) )
  5143. fill_rectangle( &h->direct_cache[scan8[4*i]], 2, 2, 8, 1, 1 );
  5144. }
  5145. }
  5146. } else {
  5147. for( i = 0; i < 4; i++ ) {
  5148. h->sub_mb_type[i] = decode_cabac_p_mb_sub_type( h );
  5149. sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  5150. h->sub_mb_type[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  5151. }
  5152. }
  5153. for( list = 0; list < h->list_count; list++ ) {
  5154. for( i = 0; i < 4; i++ ) {
  5155. if(IS_DIRECT(h->sub_mb_type[i])) continue;
  5156. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  5157. if( h->ref_count[list] > 1 )
  5158. ref[list][i] = decode_cabac_mb_ref( h, list, 4*i );
  5159. else
  5160. ref[list][i] = 0;
  5161. } else {
  5162. ref[list][i] = -1;
  5163. }
  5164. h->ref_cache[list][ scan8[4*i]+1 ]=
  5165. h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];
  5166. }
  5167. }
  5168. if(dct8x8_allowed)
  5169. dct8x8_allowed = get_dct8x8_allowed(h);
  5170. for(list=0; list<h->list_count; list++){
  5171. for(i=0; i<4; i++){
  5172. h->ref_cache[list][ scan8[4*i] ]=h->ref_cache[list][ scan8[4*i]+1 ];
  5173. if(IS_DIRECT(h->sub_mb_type[i])){
  5174. fill_rectangle(h->mvd_cache[list][scan8[4*i]], 2, 2, 8, 0, 4);
  5175. continue;
  5176. }
  5177. if(IS_DIR(h->sub_mb_type[i], 0, list) && !IS_DIRECT(h->sub_mb_type[i])){
  5178. const int sub_mb_type= h->sub_mb_type[i];
  5179. const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;
  5180. for(j=0; j<sub_partition_count[i]; j++){
  5181. int mpx, mpy;
  5182. int mx, my;
  5183. const int index= 4*i + block_width*j;
  5184. int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];
  5185. int16_t (* mvd_cache)[2]= &h->mvd_cache[list][ scan8[index] ];
  5186. pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mpx, &mpy);
  5187. mx = mpx + decode_cabac_mb_mvd( h, list, index, 0 );
  5188. my = mpy + decode_cabac_mb_mvd( h, list, index, 1 );
  5189. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5190. if(IS_SUB_8X8(sub_mb_type)){
  5191. mv_cache[ 1 ][0]=
  5192. mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;
  5193. mv_cache[ 1 ][1]=
  5194. mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;
  5195. mvd_cache[ 1 ][0]=
  5196. mvd_cache[ 8 ][0]= mvd_cache[ 9 ][0]= mx - mpx;
  5197. mvd_cache[ 1 ][1]=
  5198. mvd_cache[ 8 ][1]= mvd_cache[ 9 ][1]= my - mpy;
  5199. }else if(IS_SUB_8X4(sub_mb_type)){
  5200. mv_cache[ 1 ][0]= mx;
  5201. mv_cache[ 1 ][1]= my;
  5202. mvd_cache[ 1 ][0]= mx - mpx;
  5203. mvd_cache[ 1 ][1]= my - mpy;
  5204. }else if(IS_SUB_4X8(sub_mb_type)){
  5205. mv_cache[ 8 ][0]= mx;
  5206. mv_cache[ 8 ][1]= my;
  5207. mvd_cache[ 8 ][0]= mx - mpx;
  5208. mvd_cache[ 8 ][1]= my - mpy;
  5209. }
  5210. mv_cache[ 0 ][0]= mx;
  5211. mv_cache[ 0 ][1]= my;
  5212. mvd_cache[ 0 ][0]= mx - mpx;
  5213. mvd_cache[ 0 ][1]= my - mpy;
  5214. }
  5215. }else{
  5216. uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];
  5217. uint32_t *pd= (uint32_t *)&h->mvd_cache[list][ scan8[4*i] ][0];
  5218. p[0] = p[1] = p[8] = p[9] = 0;
  5219. pd[0]= pd[1]= pd[8]= pd[9]= 0;
  5220. }
  5221. }
  5222. }
  5223. } else if( IS_DIRECT(mb_type) ) {
  5224. pred_direct_motion(h, &mb_type);
  5225. fill_rectangle(h->mvd_cache[0][scan8[0]], 4, 4, 8, 0, 4);
  5226. fill_rectangle(h->mvd_cache[1][scan8[0]], 4, 4, 8, 0, 4);
  5227. dct8x8_allowed &= h->sps.direct_8x8_inference_flag;
  5228. } else {
  5229. int list, mx, my, i, mpx, mpy;
  5230. if(IS_16X16(mb_type)){
  5231. for(list=0; list<h->list_count; list++){
  5232. if(IS_DIR(mb_type, 0, list)){
  5233. const int ref = h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 0 ) : 0;
  5234. fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, ref, 1);
  5235. }else
  5236. fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, (uint8_t)LIST_NOT_USED, 1); //FIXME factorize and the other fill_rect below too
  5237. }
  5238. for(list=0; list<h->list_count; list++){
  5239. if(IS_DIR(mb_type, 0, list)){
  5240. pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mpx, &mpy);
  5241. mx = mpx + decode_cabac_mb_mvd( h, list, 0, 0 );
  5242. my = mpy + decode_cabac_mb_mvd( h, list, 0, 1 );
  5243. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5244. fill_rectangle(h->mvd_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx-mpx,my-mpy), 4);
  5245. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx,my), 4);
  5246. }else
  5247. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, 0, 4);
  5248. }
  5249. }
  5250. else if(IS_16X8(mb_type)){
  5251. for(list=0; list<h->list_count; list++){
  5252. for(i=0; i<2; i++){
  5253. if(IS_DIR(mb_type, i, list)){
  5254. const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 8*i ) : 0;
  5255. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, ref, 1);
  5256. }else
  5257. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, (LIST_NOT_USED&0xFF), 1);
  5258. }
  5259. }
  5260. for(list=0; list<h->list_count; list++){
  5261. for(i=0; i<2; i++){
  5262. if(IS_DIR(mb_type, i, list)){
  5263. pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mpx, &mpy);
  5264. mx = mpx + decode_cabac_mb_mvd( h, list, 8*i, 0 );
  5265. my = mpy + decode_cabac_mb_mvd( h, list, 8*i, 1 );
  5266. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5267. fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx-mpx,my-mpy), 4);
  5268. fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx,my), 4);
  5269. }else{
  5270. fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);
  5271. fill_rectangle(h-> mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);
  5272. }
  5273. }
  5274. }
  5275. }else{
  5276. assert(IS_8X16(mb_type));
  5277. for(list=0; list<h->list_count; list++){
  5278. for(i=0; i<2; i++){
  5279. if(IS_DIR(mb_type, i, list)){ //FIXME optimize
  5280. const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 4*i ) : 0;
  5281. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, ref, 1);
  5282. }else
  5283. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, (LIST_NOT_USED&0xFF), 1);
  5284. }
  5285. }
  5286. for(list=0; list<h->list_count; list++){
  5287. for(i=0; i<2; i++){
  5288. if(IS_DIR(mb_type, i, list)){
  5289. pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mpx, &mpy);
  5290. mx = mpx + decode_cabac_mb_mvd( h, list, 4*i, 0 );
  5291. my = mpy + decode_cabac_mb_mvd( h, list, 4*i, 1 );
  5292. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5293. fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx-mpx,my-mpy), 4);
  5294. fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx,my), 4);
  5295. }else{
  5296. fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);
  5297. fill_rectangle(h-> mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);
  5298. }
  5299. }
  5300. }
  5301. }
  5302. }
  5303. if( IS_INTER( mb_type ) ) {
  5304. h->chroma_pred_mode_table[mb_xy] = 0;
  5305. write_back_motion( h, mb_type );
  5306. }
  5307. if( !IS_INTRA16x16( mb_type ) ) {
  5308. cbp = decode_cabac_mb_cbp_luma( h );
  5309. cbp |= decode_cabac_mb_cbp_chroma( h ) << 4;
  5310. }
  5311. h->cbp_table[mb_xy] = h->cbp = cbp;
  5312. if( dct8x8_allowed && (cbp&15) && !IS_INTRA( mb_type ) ) {
  5313. if( decode_cabac_mb_transform_size( h ) )
  5314. mb_type |= MB_TYPE_8x8DCT;
  5315. }
  5316. s->current_picture.mb_type[mb_xy]= mb_type;
  5317. if( cbp || IS_INTRA16x16( mb_type ) ) {
  5318. const uint8_t *scan, *scan8x8, *dc_scan;
  5319. const uint32_t *qmul;
  5320. int dqp;
  5321. if(IS_INTERLACED(mb_type)){
  5322. scan8x8= s->qscale ? h->field_scan8x8 : h->field_scan8x8_q0;
  5323. scan= s->qscale ? h->field_scan : h->field_scan_q0;
  5324. dc_scan= luma_dc_field_scan;
  5325. }else{
  5326. scan8x8= s->qscale ? h->zigzag_scan8x8 : h->zigzag_scan8x8_q0;
  5327. scan= s->qscale ? h->zigzag_scan : h->zigzag_scan_q0;
  5328. dc_scan= luma_dc_zigzag_scan;
  5329. }
  5330. h->last_qscale_diff = dqp = decode_cabac_mb_dqp( h );
  5331. if( dqp == INT_MIN ){
  5332. av_log(h->s.avctx, AV_LOG_ERROR, "cabac decode of qscale diff failed at %d %d\n", s->mb_x, s->mb_y);
  5333. return -1;
  5334. }
  5335. s->qscale += dqp;
  5336. if(((unsigned)s->qscale) > 51){
  5337. if(s->qscale<0) s->qscale+= 52;
  5338. else s->qscale-= 52;
  5339. }
  5340. h->chroma_qp[0] = get_chroma_qp(h, 0, s->qscale);
  5341. h->chroma_qp[1] = get_chroma_qp(h, 1, s->qscale);
  5342. if( IS_INTRA16x16( mb_type ) ) {
  5343. int i;
  5344. //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 DC\n" );
  5345. decode_cabac_residual( h, h->mb, 0, 0, dc_scan, NULL, 16);
  5346. if( cbp&15 ) {
  5347. qmul = h->dequant4_coeff[0][s->qscale];
  5348. for( i = 0; i < 16; i++ ) {
  5349. //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 AC:%d\n", i );
  5350. decode_cabac_residual(h, h->mb + 16*i, 1, i, scan + 1, qmul, 15);
  5351. }
  5352. } else {
  5353. fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);
  5354. }
  5355. } else {
  5356. int i8x8, i4x4;
  5357. for( i8x8 = 0; i8x8 < 4; i8x8++ ) {
  5358. if( cbp & (1<<i8x8) ) {
  5359. if( IS_8x8DCT(mb_type) ) {
  5360. decode_cabac_residual(h, h->mb + 64*i8x8, 5, 4*i8x8,
  5361. scan8x8, h->dequant8_coeff[IS_INTRA( mb_type ) ? 0:1][s->qscale], 64);
  5362. } else {
  5363. qmul = h->dequant4_coeff[IS_INTRA( mb_type ) ? 0:3][s->qscale];
  5364. for( i4x4 = 0; i4x4 < 4; i4x4++ ) {
  5365. const int index = 4*i8x8 + i4x4;
  5366. //av_log( s->avctx, AV_LOG_ERROR, "Luma4x4: %d\n", index );
  5367. //START_TIMER
  5368. decode_cabac_residual(h, h->mb + 16*index, 2, index, scan, qmul, 16);
  5369. //STOP_TIMER("decode_residual")
  5370. }
  5371. }
  5372. } else {
  5373. uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  5374. nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;
  5375. }
  5376. }
  5377. }
  5378. if( cbp&0x30 ){
  5379. int c;
  5380. for( c = 0; c < 2; c++ ) {
  5381. //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-DC\n",c );
  5382. decode_cabac_residual(h, h->mb + 256 + 16*4*c, 3, c, chroma_dc_scan, NULL, 4);
  5383. }
  5384. }
  5385. if( cbp&0x20 ) {
  5386. int c, i;
  5387. for( c = 0; c < 2; c++ ) {
  5388. qmul = h->dequant4_coeff[c+1+(IS_INTRA( mb_type ) ? 0:3)][h->chroma_qp[c]];
  5389. for( i = 0; i < 4; i++ ) {
  5390. const int index = 16 + 4 * c + i;
  5391. //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-AC %d\n",c, index - 16 );
  5392. decode_cabac_residual(h, h->mb + 16*index, 4, index - 16, scan + 1, qmul, 15);
  5393. }
  5394. }
  5395. } else {
  5396. uint8_t * const nnz= &h->non_zero_count_cache[0];
  5397. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  5398. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  5399. }
  5400. } else {
  5401. uint8_t * const nnz= &h->non_zero_count_cache[0];
  5402. fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);
  5403. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  5404. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  5405. h->last_qscale_diff = 0;
  5406. }
  5407. s->current_picture.qscale_table[mb_xy]= s->qscale;
  5408. write_back_non_zero_count(h);
  5409. if(MB_MBAFF){
  5410. h->ref_count[0] >>= 1;
  5411. h->ref_count[1] >>= 1;
  5412. }
  5413. return 0;
  5414. }
  5415. static void filter_mb_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5416. int i, d;
  5417. const int index_a = qp + h->slice_alpha_c0_offset;
  5418. const int alpha = (alpha_table+52)[index_a];
  5419. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5420. if( bS[0] < 4 ) {
  5421. int8_t tc[4];
  5422. for(i=0; i<4; i++)
  5423. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] : -1;
  5424. h->s.dsp.h264_h_loop_filter_luma(pix, stride, alpha, beta, tc);
  5425. } else {
  5426. /* 16px edge length, because bS=4 is triggered by being at
  5427. * the edge of an intra MB, so all 4 bS are the same */
  5428. for( d = 0; d < 16; d++ ) {
  5429. const int p0 = pix[-1];
  5430. const int p1 = pix[-2];
  5431. const int p2 = pix[-3];
  5432. const int q0 = pix[0];
  5433. const int q1 = pix[1];
  5434. const int q2 = pix[2];
  5435. if( FFABS( p0 - q0 ) < alpha &&
  5436. FFABS( p1 - p0 ) < beta &&
  5437. FFABS( q1 - q0 ) < beta ) {
  5438. if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  5439. if( FFABS( p2 - p0 ) < beta)
  5440. {
  5441. const int p3 = pix[-4];
  5442. /* p0', p1', p2' */
  5443. pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  5444. pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  5445. pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  5446. } else {
  5447. /* p0' */
  5448. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5449. }
  5450. if( FFABS( q2 - q0 ) < beta)
  5451. {
  5452. const int q3 = pix[3];
  5453. /* q0', q1', q2' */
  5454. pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  5455. pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  5456. pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  5457. } else {
  5458. /* q0' */
  5459. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5460. }
  5461. }else{
  5462. /* p0', q0' */
  5463. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5464. pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5465. }
  5466. tprintf(h->s.avctx, "filter_mb_edgev i:%d d:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, d, p2, p1, p0, q0, q1, q2, pix[-2], pix[-1], pix[0], pix[1]);
  5467. }
  5468. pix += stride;
  5469. }
  5470. }
  5471. }
  5472. static void filter_mb_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5473. int i;
  5474. const int index_a = qp + h->slice_alpha_c0_offset;
  5475. const int alpha = (alpha_table+52)[index_a];
  5476. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5477. if( bS[0] < 4 ) {
  5478. int8_t tc[4];
  5479. for(i=0; i<4; i++)
  5480. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] + 1 : 0;
  5481. h->s.dsp.h264_h_loop_filter_chroma(pix, stride, alpha, beta, tc);
  5482. } else {
  5483. h->s.dsp.h264_h_loop_filter_chroma_intra(pix, stride, alpha, beta);
  5484. }
  5485. }
  5486. static void filter_mb_mbaff_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[8], int qp[2] ) {
  5487. int i;
  5488. for( i = 0; i < 16; i++, pix += stride) {
  5489. int index_a;
  5490. int alpha;
  5491. int beta;
  5492. int qp_index;
  5493. int bS_index = (i >> 1);
  5494. if (!MB_FIELD) {
  5495. bS_index &= ~1;
  5496. bS_index |= (i & 1);
  5497. }
  5498. if( bS[bS_index] == 0 ) {
  5499. continue;
  5500. }
  5501. qp_index = MB_FIELD ? (i >> 3) : (i & 1);
  5502. index_a = qp[qp_index] + h->slice_alpha_c0_offset;
  5503. alpha = (alpha_table+52)[index_a];
  5504. beta = (beta_table+52)[qp[qp_index] + h->slice_beta_offset];
  5505. if( bS[bS_index] < 4 ) {
  5506. const int tc0 = (tc0_table+52)[index_a][bS[bS_index] - 1];
  5507. const int p0 = pix[-1];
  5508. const int p1 = pix[-2];
  5509. const int p2 = pix[-3];
  5510. const int q0 = pix[0];
  5511. const int q1 = pix[1];
  5512. const int q2 = pix[2];
  5513. if( FFABS( p0 - q0 ) < alpha &&
  5514. FFABS( p1 - p0 ) < beta &&
  5515. FFABS( q1 - q0 ) < beta ) {
  5516. int tc = tc0;
  5517. int i_delta;
  5518. if( FFABS( p2 - p0 ) < beta ) {
  5519. pix[-2] = p1 + av_clip( ( p2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( p1 << 1 ) ) >> 1, -tc0, tc0 );
  5520. tc++;
  5521. }
  5522. if( FFABS( q2 - q0 ) < beta ) {
  5523. pix[1] = q1 + av_clip( ( q2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( q1 << 1 ) ) >> 1, -tc0, tc0 );
  5524. tc++;
  5525. }
  5526. i_delta = av_clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  5527. pix[-1] = av_clip_uint8( p0 + i_delta ); /* p0' */
  5528. pix[0] = av_clip_uint8( q0 - i_delta ); /* q0' */
  5529. tprintf(h->s.avctx, "filter_mb_mbaff_edgev i:%d, qp:%d, indexA:%d, alpha:%d, beta:%d, tc:%d\n# bS:%d -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, qp[qp_index], index_a, alpha, beta, tc, bS[bS_index], pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);
  5530. }
  5531. }else{
  5532. const int p0 = pix[-1];
  5533. const int p1 = pix[-2];
  5534. const int p2 = pix[-3];
  5535. const int q0 = pix[0];
  5536. const int q1 = pix[1];
  5537. const int q2 = pix[2];
  5538. if( FFABS( p0 - q0 ) < alpha &&
  5539. FFABS( p1 - p0 ) < beta &&
  5540. FFABS( q1 - q0 ) < beta ) {
  5541. if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  5542. if( FFABS( p2 - p0 ) < beta)
  5543. {
  5544. const int p3 = pix[-4];
  5545. /* p0', p1', p2' */
  5546. pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  5547. pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  5548. pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  5549. } else {
  5550. /* p0' */
  5551. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5552. }
  5553. if( FFABS( q2 - q0 ) < beta)
  5554. {
  5555. const int q3 = pix[3];
  5556. /* q0', q1', q2' */
  5557. pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  5558. pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  5559. pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  5560. } else {
  5561. /* q0' */
  5562. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5563. }
  5564. }else{
  5565. /* p0', q0' */
  5566. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5567. pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5568. }
  5569. tprintf(h->s.avctx, "filter_mb_mbaff_edgev i:%d, qp:%d, indexA:%d, alpha:%d, beta:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x, %02x, %02x]\n", i, qp[qp_index], index_a, alpha, beta, p2, p1, p0, q0, q1, q2, pix[-3], pix[-2], pix[-1], pix[0], pix[1], pix[2]);
  5570. }
  5571. }
  5572. }
  5573. }
  5574. static void filter_mb_mbaff_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[8], int qp[2] ) {
  5575. int i;
  5576. for( i = 0; i < 8; i++, pix += stride) {
  5577. int index_a;
  5578. int alpha;
  5579. int beta;
  5580. int qp_index;
  5581. int bS_index = i;
  5582. if( bS[bS_index] == 0 ) {
  5583. continue;
  5584. }
  5585. qp_index = MB_FIELD ? (i >> 2) : (i & 1);
  5586. index_a = qp[qp_index] + h->slice_alpha_c0_offset;
  5587. alpha = (alpha_table+52)[index_a];
  5588. beta = (beta_table+52)[qp[qp_index] + h->slice_beta_offset];
  5589. if( bS[bS_index] < 4 ) {
  5590. const int tc = (tc0_table+52)[index_a][bS[bS_index] - 1] + 1;
  5591. const int p0 = pix[-1];
  5592. const int p1 = pix[-2];
  5593. const int q0 = pix[0];
  5594. const int q1 = pix[1];
  5595. if( FFABS( p0 - q0 ) < alpha &&
  5596. FFABS( p1 - p0 ) < beta &&
  5597. FFABS( q1 - q0 ) < beta ) {
  5598. const int i_delta = av_clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  5599. pix[-1] = av_clip_uint8( p0 + i_delta ); /* p0' */
  5600. pix[0] = av_clip_uint8( q0 - i_delta ); /* q0' */
  5601. tprintf(h->s.avctx, "filter_mb_mbaff_edgecv i:%d, qp:%d, indexA:%d, alpha:%d, beta:%d, tc:%d\n# bS:%d -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, qp[qp_index], index_a, alpha, beta, tc, bS[bS_index], pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);
  5602. }
  5603. }else{
  5604. const int p0 = pix[-1];
  5605. const int p1 = pix[-2];
  5606. const int q0 = pix[0];
  5607. const int q1 = pix[1];
  5608. if( FFABS( p0 - q0 ) < alpha &&
  5609. FFABS( p1 - p0 ) < beta &&
  5610. FFABS( q1 - q0 ) < beta ) {
  5611. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2; /* p0' */
  5612. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2; /* q0' */
  5613. tprintf(h->s.avctx, "filter_mb_mbaff_edgecv i:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x, %02x, %02x]\n", i, pix[-3], p1, p0, q0, q1, pix[2], pix[-3], pix[-2], pix[-1], pix[0], pix[1], pix[2]);
  5614. }
  5615. }
  5616. }
  5617. }
  5618. static void filter_mb_edgeh( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5619. int i, d;
  5620. const int index_a = qp + h->slice_alpha_c0_offset;
  5621. const int alpha = (alpha_table+52)[index_a];
  5622. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5623. const int pix_next = stride;
  5624. if( bS[0] < 4 ) {
  5625. int8_t tc[4];
  5626. for(i=0; i<4; i++)
  5627. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] : -1;
  5628. h->s.dsp.h264_v_loop_filter_luma(pix, stride, alpha, beta, tc);
  5629. } else {
  5630. /* 16px edge length, see filter_mb_edgev */
  5631. for( d = 0; d < 16; d++ ) {
  5632. const int p0 = pix[-1*pix_next];
  5633. const int p1 = pix[-2*pix_next];
  5634. const int p2 = pix[-3*pix_next];
  5635. const int q0 = pix[0];
  5636. const int q1 = pix[1*pix_next];
  5637. const int q2 = pix[2*pix_next];
  5638. if( FFABS( p0 - q0 ) < alpha &&
  5639. FFABS( p1 - p0 ) < beta &&
  5640. FFABS( q1 - q0 ) < beta ) {
  5641. const int p3 = pix[-4*pix_next];
  5642. const int q3 = pix[ 3*pix_next];
  5643. if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  5644. if( FFABS( p2 - p0 ) < beta) {
  5645. /* p0', p1', p2' */
  5646. pix[-1*pix_next] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  5647. pix[-2*pix_next] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  5648. pix[-3*pix_next] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  5649. } else {
  5650. /* p0' */
  5651. pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5652. }
  5653. if( FFABS( q2 - q0 ) < beta) {
  5654. /* q0', q1', q2' */
  5655. pix[0*pix_next] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  5656. pix[1*pix_next] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  5657. pix[2*pix_next] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  5658. } else {
  5659. /* q0' */
  5660. pix[0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5661. }
  5662. }else{
  5663. /* p0', q0' */
  5664. pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5665. pix[ 0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5666. }
  5667. tprintf(h->s.avctx, "filter_mb_edgeh i:%d d:%d, qp:%d, indexA:%d, alpha:%d, beta:%d\n# bS:%d -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, d, qp, index_a, alpha, beta, bS[i], p2, p1, p0, q0, q1, q2, pix[-2*pix_next], pix[-pix_next], pix[0], pix[pix_next]);
  5668. }
  5669. pix++;
  5670. }
  5671. }
  5672. }
  5673. static void filter_mb_edgech( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5674. int i;
  5675. const int index_a = qp + h->slice_alpha_c0_offset;
  5676. const int alpha = (alpha_table+52)[index_a];
  5677. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5678. if( bS[0] < 4 ) {
  5679. int8_t tc[4];
  5680. for(i=0; i<4; i++)
  5681. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] + 1 : 0;
  5682. h->s.dsp.h264_v_loop_filter_chroma(pix, stride, alpha, beta, tc);
  5683. } else {
  5684. h->s.dsp.h264_v_loop_filter_chroma_intra(pix, stride, alpha, beta);
  5685. }
  5686. }
  5687. static void filter_mb_fast( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize) {
  5688. MpegEncContext * const s = &h->s;
  5689. int mb_y_firstrow = s->picture_structure == PICT_BOTTOM_FIELD;
  5690. int mb_xy, mb_type;
  5691. int qp, qp0, qp1, qpc, qpc0, qpc1, qp_thresh;
  5692. mb_xy = h->mb_xy;
  5693. if(mb_x==0 || mb_y==mb_y_firstrow || !s->dsp.h264_loop_filter_strength || h->pps.chroma_qp_diff ||
  5694. 1 ||
  5695. (h->deblocking_filter == 2 && (h->slice_table[mb_xy] != h->slice_table[h->top_mb_xy] ||
  5696. h->slice_table[mb_xy] != h->slice_table[mb_xy - 1]))) {
  5697. filter_mb(h, mb_x, mb_y, img_y, img_cb, img_cr, linesize, uvlinesize);
  5698. return;
  5699. }
  5700. assert(!FRAME_MBAFF);
  5701. mb_type = s->current_picture.mb_type[mb_xy];
  5702. qp = s->current_picture.qscale_table[mb_xy];
  5703. qp0 = s->current_picture.qscale_table[mb_xy-1];
  5704. qp1 = s->current_picture.qscale_table[h->top_mb_xy];
  5705. qpc = get_chroma_qp( h, 0, qp );
  5706. qpc0 = get_chroma_qp( h, 0, qp0 );
  5707. qpc1 = get_chroma_qp( h, 0, qp1 );
  5708. qp0 = (qp + qp0 + 1) >> 1;
  5709. qp1 = (qp + qp1 + 1) >> 1;
  5710. qpc0 = (qpc + qpc0 + 1) >> 1;
  5711. qpc1 = (qpc + qpc1 + 1) >> 1;
  5712. qp_thresh = 15 - h->slice_alpha_c0_offset;
  5713. if(qp <= qp_thresh && qp0 <= qp_thresh && qp1 <= qp_thresh &&
  5714. qpc <= qp_thresh && qpc0 <= qp_thresh && qpc1 <= qp_thresh)
  5715. return;
  5716. if( IS_INTRA(mb_type) ) {
  5717. int16_t bS4[4] = {4,4,4,4};
  5718. int16_t bS3[4] = {3,3,3,3};
  5719. int16_t *bSH = FIELD_PICTURE ? bS3 : bS4;
  5720. if( IS_8x8DCT(mb_type) ) {
  5721. filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );
  5722. filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );
  5723. filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bSH, qp1 );
  5724. filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );
  5725. } else {
  5726. filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );
  5727. filter_mb_edgev( h, &img_y[4*1], linesize, bS3, qp );
  5728. filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );
  5729. filter_mb_edgev( h, &img_y[4*3], linesize, bS3, qp );
  5730. filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bSH, qp1 );
  5731. filter_mb_edgeh( h, &img_y[4*1*linesize], linesize, bS3, qp );
  5732. filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );
  5733. filter_mb_edgeh( h, &img_y[4*3*linesize], linesize, bS3, qp );
  5734. }
  5735. filter_mb_edgecv( h, &img_cb[2*0], uvlinesize, bS4, qpc0 );
  5736. filter_mb_edgecv( h, &img_cb[2*2], uvlinesize, bS3, qpc );
  5737. filter_mb_edgecv( h, &img_cr[2*0], uvlinesize, bS4, qpc0 );
  5738. filter_mb_edgecv( h, &img_cr[2*2], uvlinesize, bS3, qpc );
  5739. filter_mb_edgech( h, &img_cb[2*0*uvlinesize], uvlinesize, bSH, qpc1 );
  5740. filter_mb_edgech( h, &img_cb[2*2*uvlinesize], uvlinesize, bS3, qpc );
  5741. filter_mb_edgech( h, &img_cr[2*0*uvlinesize], uvlinesize, bSH, qpc1 );
  5742. filter_mb_edgech( h, &img_cr[2*2*uvlinesize], uvlinesize, bS3, qpc );
  5743. return;
  5744. } else {
  5745. DECLARE_ALIGNED_8(int16_t, bS[2][4][4]);
  5746. uint64_t (*bSv)[4] = (uint64_t(*)[4])bS;
  5747. int edges;
  5748. if( IS_8x8DCT(mb_type) && (h->cbp&7) == 7 ) {
  5749. edges = 4;
  5750. bSv[0][0] = bSv[0][2] = bSv[1][0] = bSv[1][2] = 0x0002000200020002ULL;
  5751. } else {
  5752. int mask_edge1 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16)) ? 3 :
  5753. (mb_type & MB_TYPE_16x8) ? 1 : 0;
  5754. int mask_edge0 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16))
  5755. && (s->current_picture.mb_type[mb_xy-1] & (MB_TYPE_16x16 | MB_TYPE_8x16))
  5756. ? 3 : 0;
  5757. int step = IS_8x8DCT(mb_type) ? 2 : 1;
  5758. edges = (mb_type & MB_TYPE_16x16) && !(h->cbp & 15) ? 1 : 4;
  5759. s->dsp.h264_loop_filter_strength( bS, h->non_zero_count_cache, h->ref_cache, h->mv_cache,
  5760. (h->slice_type == FF_B_TYPE), edges, step, mask_edge0, mask_edge1, FIELD_PICTURE);
  5761. }
  5762. if( IS_INTRA(s->current_picture.mb_type[mb_xy-1]) )
  5763. bSv[0][0] = 0x0004000400040004ULL;
  5764. if( IS_INTRA(s->current_picture.mb_type[h->top_mb_xy]) )
  5765. bSv[1][0] = FIELD_PICTURE ? 0x0003000300030003ULL : 0x0004000400040004ULL;
  5766. #define FILTER(hv,dir,edge)\
  5767. if(bSv[dir][edge]) {\
  5768. filter_mb_edge##hv( h, &img_y[4*edge*(dir?linesize:1)], linesize, bS[dir][edge], edge ? qp : qp##dir );\
  5769. if(!(edge&1)) {\
  5770. filter_mb_edgec##hv( h, &img_cb[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\
  5771. filter_mb_edgec##hv( h, &img_cr[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\
  5772. }\
  5773. }
  5774. if( edges == 1 ) {
  5775. FILTER(v,0,0);
  5776. FILTER(h,1,0);
  5777. } else if( IS_8x8DCT(mb_type) ) {
  5778. FILTER(v,0,0);
  5779. FILTER(v,0,2);
  5780. FILTER(h,1,0);
  5781. FILTER(h,1,2);
  5782. } else {
  5783. FILTER(v,0,0);
  5784. FILTER(v,0,1);
  5785. FILTER(v,0,2);
  5786. FILTER(v,0,3);
  5787. FILTER(h,1,0);
  5788. FILTER(h,1,1);
  5789. FILTER(h,1,2);
  5790. FILTER(h,1,3);
  5791. }
  5792. #undef FILTER
  5793. }
  5794. }
  5795. static void filter_mb( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize) {
  5796. MpegEncContext * const s = &h->s;
  5797. const int mb_xy= mb_x + mb_y*s->mb_stride;
  5798. const int mb_type = s->current_picture.mb_type[mb_xy];
  5799. const int mvy_limit = IS_INTERLACED(mb_type) ? 2 : 4;
  5800. int first_vertical_edge_done = 0;
  5801. int dir;
  5802. //for sufficiently low qp, filtering wouldn't do anything
  5803. //this is a conservative estimate: could also check beta_offset and more accurate chroma_qp
  5804. if(!FRAME_MBAFF){
  5805. int qp_thresh = 15 - h->slice_alpha_c0_offset - FFMAX3(0, h->pps.chroma_qp_index_offset[0], h->pps.chroma_qp_index_offset[1]);
  5806. int qp = s->current_picture.qscale_table[mb_xy];
  5807. if(qp <= qp_thresh
  5808. && (mb_x == 0 || ((qp + s->current_picture.qscale_table[mb_xy-1] + 1)>>1) <= qp_thresh)
  5809. && (mb_y == 0 || ((qp + s->current_picture.qscale_table[h->top_mb_xy] + 1)>>1) <= qp_thresh)){
  5810. return;
  5811. }
  5812. }
  5813. if (FRAME_MBAFF
  5814. // left mb is in picture
  5815. && h->slice_table[mb_xy-1] != 255
  5816. // and current and left pair do not have the same interlaced type
  5817. && (IS_INTERLACED(mb_type) != IS_INTERLACED(s->current_picture.mb_type[mb_xy-1]))
  5818. // and left mb is in the same slice if deblocking_filter == 2
  5819. && (h->deblocking_filter!=2 || h->slice_table[mb_xy-1] == h->slice_table[mb_xy])) {
  5820. /* First vertical edge is different in MBAFF frames
  5821. * There are 8 different bS to compute and 2 different Qp
  5822. */
  5823. const int pair_xy = mb_x + (mb_y&~1)*s->mb_stride;
  5824. const int left_mb_xy[2] = { pair_xy-1, pair_xy-1+s->mb_stride };
  5825. int16_t bS[8];
  5826. int qp[2];
  5827. int bqp[2];
  5828. int rqp[2];
  5829. int mb_qp, mbn0_qp, mbn1_qp;
  5830. int i;
  5831. first_vertical_edge_done = 1;
  5832. if( IS_INTRA(mb_type) )
  5833. bS[0] = bS[1] = bS[2] = bS[3] = bS[4] = bS[5] = bS[6] = bS[7] = 4;
  5834. else {
  5835. for( i = 0; i < 8; i++ ) {
  5836. int mbn_xy = MB_FIELD ? left_mb_xy[i>>2] : left_mb_xy[i&1];
  5837. if( IS_INTRA( s->current_picture.mb_type[mbn_xy] ) )
  5838. bS[i] = 4;
  5839. else if( h->non_zero_count_cache[12+8*(i>>1)] != 0 ||
  5840. /* FIXME: with 8x8dct + cavlc, should check cbp instead of nnz */
  5841. h->non_zero_count[mbn_xy][MB_FIELD ? i&3 : (i>>2)+(mb_y&1)*2] )
  5842. bS[i] = 2;
  5843. else
  5844. bS[i] = 1;
  5845. }
  5846. }
  5847. mb_qp = s->current_picture.qscale_table[mb_xy];
  5848. mbn0_qp = s->current_picture.qscale_table[left_mb_xy[0]];
  5849. mbn1_qp = s->current_picture.qscale_table[left_mb_xy[1]];
  5850. qp[0] = ( mb_qp + mbn0_qp + 1 ) >> 1;
  5851. bqp[0] = ( get_chroma_qp( h, 0, mb_qp ) +
  5852. get_chroma_qp( h, 0, mbn0_qp ) + 1 ) >> 1;
  5853. rqp[0] = ( get_chroma_qp( h, 1, mb_qp ) +
  5854. get_chroma_qp( h, 1, mbn0_qp ) + 1 ) >> 1;
  5855. qp[1] = ( mb_qp + mbn1_qp + 1 ) >> 1;
  5856. bqp[1] = ( get_chroma_qp( h, 0, mb_qp ) +
  5857. get_chroma_qp( h, 0, mbn1_qp ) + 1 ) >> 1;
  5858. rqp[1] = ( get_chroma_qp( h, 1, mb_qp ) +
  5859. get_chroma_qp( h, 1, mbn1_qp ) + 1 ) >> 1;
  5860. /* Filter edge */
  5861. tprintf(s->avctx, "filter mb:%d/%d MBAFF, QPy:%d/%d, QPb:%d/%d QPr:%d/%d ls:%d uvls:%d", mb_x, mb_y, qp[0], qp[1], bqp[0], bqp[1], rqp[0], rqp[1], linesize, uvlinesize);
  5862. { int i; for (i = 0; i < 8; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }
  5863. filter_mb_mbaff_edgev ( h, &img_y [0], linesize, bS, qp );
  5864. filter_mb_mbaff_edgecv( h, &img_cb[0], uvlinesize, bS, bqp );
  5865. filter_mb_mbaff_edgecv( h, &img_cr[0], uvlinesize, bS, rqp );
  5866. }
  5867. /* dir : 0 -> vertical edge, 1 -> horizontal edge */
  5868. for( dir = 0; dir < 2; dir++ )
  5869. {
  5870. int edge;
  5871. const int mbm_xy = dir == 0 ? mb_xy -1 : h->top_mb_xy;
  5872. const int mbm_type = s->current_picture.mb_type[mbm_xy];
  5873. int start = h->slice_table[mbm_xy] == 255 ? 1 : 0;
  5874. const int edges = (mb_type & (MB_TYPE_16x16|MB_TYPE_SKIP))
  5875. == (MB_TYPE_16x16|MB_TYPE_SKIP) ? 1 : 4;
  5876. // how often to recheck mv-based bS when iterating between edges
  5877. const int mask_edge = (mb_type & (MB_TYPE_16x16 | (MB_TYPE_16x8 << dir))) ? 3 :
  5878. (mb_type & (MB_TYPE_8x16 >> dir)) ? 1 : 0;
  5879. // how often to recheck mv-based bS when iterating along each edge
  5880. const int mask_par0 = mb_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir));
  5881. if (first_vertical_edge_done) {
  5882. start = 1;
  5883. first_vertical_edge_done = 0;
  5884. }
  5885. if (h->deblocking_filter==2 && h->slice_table[mbm_xy] != h->slice_table[mb_xy])
  5886. start = 1;
  5887. if (FRAME_MBAFF && (dir == 1) && ((mb_y&1) == 0) && start == 0
  5888. && !IS_INTERLACED(mb_type)
  5889. && IS_INTERLACED(mbm_type)
  5890. ) {
  5891. // This is a special case in the norm where the filtering must
  5892. // be done twice (one each of the field) even if we are in a
  5893. // frame macroblock.
  5894. //
  5895. static const int nnz_idx[4] = {4,5,6,3};
  5896. unsigned int tmp_linesize = 2 * linesize;
  5897. unsigned int tmp_uvlinesize = 2 * uvlinesize;
  5898. int mbn_xy = mb_xy - 2 * s->mb_stride;
  5899. int qp;
  5900. int i, j;
  5901. int16_t bS[4];
  5902. for(j=0; j<2; j++, mbn_xy += s->mb_stride){
  5903. if( IS_INTRA(mb_type) ||
  5904. IS_INTRA(s->current_picture.mb_type[mbn_xy]) ) {
  5905. bS[0] = bS[1] = bS[2] = bS[3] = 3;
  5906. } else {
  5907. const uint8_t *mbn_nnz = h->non_zero_count[mbn_xy];
  5908. for( i = 0; i < 4; i++ ) {
  5909. if( h->non_zero_count_cache[scan8[0]+i] != 0 ||
  5910. mbn_nnz[nnz_idx[i]] != 0 )
  5911. bS[i] = 2;
  5912. else
  5913. bS[i] = 1;
  5914. }
  5915. }
  5916. // Do not use s->qscale as luma quantizer because it has not the same
  5917. // value in IPCM macroblocks.
  5918. qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;
  5919. tprintf(s->avctx, "filter mb:%d/%d dir:%d edge:%d, QPy:%d ls:%d uvls:%d", mb_x, mb_y, dir, edge, qp, tmp_linesize, tmp_uvlinesize);
  5920. { int i; for (i = 0; i < 4; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }
  5921. filter_mb_edgeh( h, &img_y[j*linesize], tmp_linesize, bS, qp );
  5922. filter_mb_edgech( h, &img_cb[j*uvlinesize], tmp_uvlinesize, bS,
  5923. ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  5924. filter_mb_edgech( h, &img_cr[j*uvlinesize], tmp_uvlinesize, bS,
  5925. ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  5926. }
  5927. start = 1;
  5928. }
  5929. /* Calculate bS */
  5930. for( edge = start; edge < edges; edge++ ) {
  5931. /* mbn_xy: neighbor macroblock */
  5932. const int mbn_xy = edge > 0 ? mb_xy : mbm_xy;
  5933. const int mbn_type = s->current_picture.mb_type[mbn_xy];
  5934. int16_t bS[4];
  5935. int qp;
  5936. if( (edge&1) && IS_8x8DCT(mb_type) )
  5937. continue;
  5938. if( IS_INTRA(mb_type) ||
  5939. IS_INTRA(mbn_type) ) {
  5940. int value;
  5941. if (edge == 0) {
  5942. if ( (!IS_INTERLACED(mb_type) && !IS_INTERLACED(mbm_type))
  5943. || ((FRAME_MBAFF || (s->picture_structure != PICT_FRAME)) && (dir == 0))
  5944. ) {
  5945. value = 4;
  5946. } else {
  5947. value = 3;
  5948. }
  5949. } else {
  5950. value = 3;
  5951. }
  5952. bS[0] = bS[1] = bS[2] = bS[3] = value;
  5953. } else {
  5954. int i, l;
  5955. int mv_done;
  5956. if( edge & mask_edge ) {
  5957. bS[0] = bS[1] = bS[2] = bS[3] = 0;
  5958. mv_done = 1;
  5959. }
  5960. else if( FRAME_MBAFF && IS_INTERLACED(mb_type ^ mbn_type)) {
  5961. bS[0] = bS[1] = bS[2] = bS[3] = 1;
  5962. mv_done = 1;
  5963. }
  5964. else if( mask_par0 && (edge || (mbn_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir)))) ) {
  5965. int b_idx= 8 + 4 + edge * (dir ? 8:1);
  5966. int bn_idx= b_idx - (dir ? 8:1);
  5967. int v = 0;
  5968. int xn= (h->ref_cache[0][ b_idx] ^ h->ref_cache[0][bn_idx]) < 0;
  5969. for( l = 0; !v && l < 1 + (h->slice_type == FF_B_TYPE); l++ ) {
  5970. int ln= l^xn;
  5971. v |= h->ref2frm[l][h->ref_cache[l][b_idx]+2] != h->ref2frm[ln][h->ref_cache[ln][bn_idx]+2] ||
  5972. FFABS( h->mv_cache[l][b_idx][0] - h->mv_cache[ln][bn_idx][0] ) >= 4 ||
  5973. FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[ln][bn_idx][1] ) >= mvy_limit;
  5974. }
  5975. bS[0] = bS[1] = bS[2] = bS[3] = v;
  5976. mv_done = 1;
  5977. }
  5978. else
  5979. mv_done = 0;
  5980. for( i = 0; i < 4; i++ ) {
  5981. int x = dir == 0 ? edge : i;
  5982. int y = dir == 0 ? i : edge;
  5983. int b_idx= 8 + 4 + x + 8*y;
  5984. int bn_idx= b_idx - (dir ? 8:1);
  5985. if( h->non_zero_count_cache[b_idx] != 0 ||
  5986. h->non_zero_count_cache[bn_idx] != 0 ) {
  5987. bS[i] = 2;
  5988. }
  5989. else if(!mv_done)
  5990. {
  5991. int xn= (h->ref_cache[0][ b_idx] ^ h->ref_cache[0][bn_idx]) < 0;
  5992. bS[i] = 0;
  5993. for( l = 0; l < 1 + (h->slice_type == FF_B_TYPE); l++ ) {
  5994. int ln= l^xn;
  5995. if( h->ref2frm[l][h->ref_cache[l][b_idx]+2] != h->ref2frm[ln][h->ref_cache[ln][bn_idx]+2] ||
  5996. FFABS( h->mv_cache[l][b_idx][0] - h->mv_cache[ln][bn_idx][0] ) >= 4 ||
  5997. FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[ln][bn_idx][1] ) >= mvy_limit ) {
  5998. bS[i] = 1;
  5999. break;
  6000. }
  6001. }
  6002. }
  6003. }
  6004. if(bS[0]+bS[1]+bS[2]+bS[3] == 0)
  6005. continue;
  6006. }
  6007. /* Filter edge */
  6008. // Do not use s->qscale as luma quantizer because it has not the same
  6009. // value in IPCM macroblocks.
  6010. qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;
  6011. //tprintf(s->avctx, "filter mb:%d/%d dir:%d edge:%d, QPy:%d, QPc:%d, QPcn:%d\n", mb_x, mb_y, dir, edge, qp, h->chroma_qp, s->current_picture.qscale_table[mbn_xy]);
  6012. tprintf(s->avctx, "filter mb:%d/%d dir:%d edge:%d, QPy:%d ls:%d uvls:%d", mb_x, mb_y, dir, edge, qp, linesize, uvlinesize);
  6013. { int i; for (i = 0; i < 4; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }
  6014. if( dir == 0 ) {
  6015. filter_mb_edgev( h, &img_y[4*edge], linesize, bS, qp );
  6016. if( (edge&1) == 0 ) {
  6017. filter_mb_edgecv( h, &img_cb[2*edge], uvlinesize, bS,
  6018. ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6019. filter_mb_edgecv( h, &img_cr[2*edge], uvlinesize, bS,
  6020. ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6021. }
  6022. } else {
  6023. filter_mb_edgeh( h, &img_y[4*edge*linesize], linesize, bS, qp );
  6024. if( (edge&1) == 0 ) {
  6025. filter_mb_edgech( h, &img_cb[2*edge*uvlinesize], uvlinesize, bS,
  6026. ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6027. filter_mb_edgech( h, &img_cr[2*edge*uvlinesize], uvlinesize, bS,
  6028. ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6029. }
  6030. }
  6031. }
  6032. }
  6033. }
  6034. static int decode_slice(struct AVCodecContext *avctx, H264Context *h){
  6035. MpegEncContext * const s = &h->s;
  6036. const int part_mask= s->partitioned_frame ? (AC_END|AC_ERROR) : 0x7F;
  6037. s->mb_skip_run= -1;
  6038. if( h->pps.cabac ) {
  6039. int i;
  6040. /* realign */
  6041. align_get_bits( &s->gb );
  6042. /* init cabac */
  6043. ff_init_cabac_states( &h->cabac);
  6044. ff_init_cabac_decoder( &h->cabac,
  6045. s->gb.buffer + get_bits_count(&s->gb)/8,
  6046. ( s->gb.size_in_bits - get_bits_count(&s->gb) + 7)/8);
  6047. /* calculate pre-state */
  6048. for( i= 0; i < 460; i++ ) {
  6049. int pre;
  6050. if( h->slice_type == FF_I_TYPE )
  6051. pre = av_clip( ((cabac_context_init_I[i][0] * s->qscale) >>4 ) + cabac_context_init_I[i][1], 1, 126 );
  6052. else
  6053. pre = av_clip( ((cabac_context_init_PB[h->cabac_init_idc][i][0] * s->qscale) >>4 ) + cabac_context_init_PB[h->cabac_init_idc][i][1], 1, 126 );
  6054. if( pre <= 63 )
  6055. h->cabac_state[i] = 2 * ( 63 - pre ) + 0;
  6056. else
  6057. h->cabac_state[i] = 2 * ( pre - 64 ) + 1;
  6058. }
  6059. for(;;){
  6060. //START_TIMER
  6061. int ret = decode_mb_cabac(h);
  6062. int eos;
  6063. //STOP_TIMER("decode_mb_cabac")
  6064. if(ret>=0) hl_decode_mb(h);
  6065. if( ret >= 0 && FRAME_MBAFF ) { //FIXME optimal? or let mb_decode decode 16x32 ?
  6066. s->mb_y++;
  6067. if(ret>=0) ret = decode_mb_cabac(h);
  6068. if(ret>=0) hl_decode_mb(h);
  6069. s->mb_y--;
  6070. }
  6071. eos = get_cabac_terminate( &h->cabac );
  6072. if( ret < 0 || h->cabac.bytestream > h->cabac.bytestream_end + 2) {
  6073. av_log(h->s.avctx, AV_LOG_ERROR, "error while decoding MB %d %d, bytestream (%td)\n", s->mb_x, s->mb_y, h->cabac.bytestream_end - h->cabac.bytestream);
  6074. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  6075. return -1;
  6076. }
  6077. if( ++s->mb_x >= s->mb_width ) {
  6078. s->mb_x = 0;
  6079. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  6080. ++s->mb_y;
  6081. if(FIELD_OR_MBAFF_PICTURE) {
  6082. ++s->mb_y;
  6083. }
  6084. }
  6085. if( eos || s->mb_y >= s->mb_height ) {
  6086. tprintf(s->avctx, "slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  6087. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  6088. return 0;
  6089. }
  6090. }
  6091. } else {
  6092. for(;;){
  6093. int ret = decode_mb_cavlc(h);
  6094. if(ret>=0) hl_decode_mb(h);
  6095. if(ret>=0 && FRAME_MBAFF){ //FIXME optimal? or let mb_decode decode 16x32 ?
  6096. s->mb_y++;
  6097. ret = decode_mb_cavlc(h);
  6098. if(ret>=0) hl_decode_mb(h);
  6099. s->mb_y--;
  6100. }
  6101. if(ret<0){
  6102. av_log(h->s.avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);
  6103. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  6104. return -1;
  6105. }
  6106. if(++s->mb_x >= s->mb_width){
  6107. s->mb_x=0;
  6108. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  6109. ++s->mb_y;
  6110. if(FIELD_OR_MBAFF_PICTURE) {
  6111. ++s->mb_y;
  6112. }
  6113. if(s->mb_y >= s->mb_height){
  6114. tprintf(s->avctx, "slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  6115. if(get_bits_count(&s->gb) == s->gb.size_in_bits ) {
  6116. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  6117. return 0;
  6118. }else{
  6119. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  6120. return -1;
  6121. }
  6122. }
  6123. }
  6124. if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->mb_skip_run<=0){
  6125. tprintf(s->avctx, "slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  6126. if(get_bits_count(&s->gb) == s->gb.size_in_bits ){
  6127. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  6128. return 0;
  6129. }else{
  6130. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  6131. return -1;
  6132. }
  6133. }
  6134. }
  6135. }
  6136. #if 0
  6137. for(;s->mb_y < s->mb_height; s->mb_y++){
  6138. for(;s->mb_x < s->mb_width; s->mb_x++){
  6139. int ret= decode_mb(h);
  6140. hl_decode_mb(h);
  6141. if(ret<0){
  6142. av_log(s->avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);
  6143. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  6144. return -1;
  6145. }
  6146. if(++s->mb_x >= s->mb_width){
  6147. s->mb_x=0;
  6148. if(++s->mb_y >= s->mb_height){
  6149. if(get_bits_count(s->gb) == s->gb.size_in_bits){
  6150. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  6151. return 0;
  6152. }else{
  6153. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  6154. return -1;
  6155. }
  6156. }
  6157. }
  6158. if(get_bits_count(s->?gb) >= s->gb?.size_in_bits){
  6159. if(get_bits_count(s->gb) == s->gb.size_in_bits){
  6160. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  6161. return 0;
  6162. }else{
  6163. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  6164. return -1;
  6165. }
  6166. }
  6167. }
  6168. s->mb_x=0;
  6169. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  6170. }
  6171. #endif
  6172. return -1; //not reached
  6173. }
  6174. static int decode_unregistered_user_data(H264Context *h, int size){
  6175. MpegEncContext * const s = &h->s;
  6176. uint8_t user_data[16+256];
  6177. int e, build, i;
  6178. if(size<16)
  6179. return -1;
  6180. for(i=0; i<sizeof(user_data)-1 && i<size; i++){
  6181. user_data[i]= get_bits(&s->gb, 8);
  6182. }
  6183. user_data[i]= 0;
  6184. e= sscanf(user_data+16, "x264 - core %d"/*%s - H.264/MPEG-4 AVC codec - Copyleft 2005 - http://www.videolan.org/x264.html*/, &build);
  6185. if(e==1 && build>=0)
  6186. h->x264_build= build;
  6187. if(s->avctx->debug & FF_DEBUG_BUGS)
  6188. av_log(s->avctx, AV_LOG_DEBUG, "user data:\"%s\"\n", user_data+16);
  6189. for(; i<size; i++)
  6190. skip_bits(&s->gb, 8);
  6191. return 0;
  6192. }
  6193. static int decode_sei(H264Context *h){
  6194. MpegEncContext * const s = &h->s;
  6195. while(get_bits_count(&s->gb) + 16 < s->gb.size_in_bits){
  6196. int size, type;
  6197. type=0;
  6198. do{
  6199. type+= show_bits(&s->gb, 8);
  6200. }while(get_bits(&s->gb, 8) == 255);
  6201. size=0;
  6202. do{
  6203. size+= show_bits(&s->gb, 8);
  6204. }while(get_bits(&s->gb, 8) == 255);
  6205. switch(type){
  6206. case 5:
  6207. if(decode_unregistered_user_data(h, size) < 0)
  6208. return -1;
  6209. break;
  6210. default:
  6211. skip_bits(&s->gb, 8*size);
  6212. }
  6213. //FIXME check bits here
  6214. align_get_bits(&s->gb);
  6215. }
  6216. return 0;
  6217. }
  6218. static inline void decode_hrd_parameters(H264Context *h, SPS *sps){
  6219. MpegEncContext * const s = &h->s;
  6220. int cpb_count, i;
  6221. cpb_count = get_ue_golomb(&s->gb) + 1;
  6222. get_bits(&s->gb, 4); /* bit_rate_scale */
  6223. get_bits(&s->gb, 4); /* cpb_size_scale */
  6224. for(i=0; i<cpb_count; i++){
  6225. get_ue_golomb(&s->gb); /* bit_rate_value_minus1 */
  6226. get_ue_golomb(&s->gb); /* cpb_size_value_minus1 */
  6227. get_bits1(&s->gb); /* cbr_flag */
  6228. }
  6229. get_bits(&s->gb, 5); /* initial_cpb_removal_delay_length_minus1 */
  6230. get_bits(&s->gb, 5); /* cpb_removal_delay_length_minus1 */
  6231. get_bits(&s->gb, 5); /* dpb_output_delay_length_minus1 */
  6232. get_bits(&s->gb, 5); /* time_offset_length */
  6233. }
  6234. static inline int decode_vui_parameters(H264Context *h, SPS *sps){
  6235. MpegEncContext * const s = &h->s;
  6236. int aspect_ratio_info_present_flag;
  6237. unsigned int aspect_ratio_idc;
  6238. int nal_hrd_parameters_present_flag, vcl_hrd_parameters_present_flag;
  6239. aspect_ratio_info_present_flag= get_bits1(&s->gb);
  6240. if( aspect_ratio_info_present_flag ) {
  6241. aspect_ratio_idc= get_bits(&s->gb, 8);
  6242. if( aspect_ratio_idc == EXTENDED_SAR ) {
  6243. sps->sar.num= get_bits(&s->gb, 16);
  6244. sps->sar.den= get_bits(&s->gb, 16);
  6245. }else if(aspect_ratio_idc < sizeof(pixel_aspect)/sizeof(*pixel_aspect)){
  6246. sps->sar= pixel_aspect[aspect_ratio_idc];
  6247. }else{
  6248. av_log(h->s.avctx, AV_LOG_ERROR, "illegal aspect ratio\n");
  6249. return -1;
  6250. }
  6251. }else{
  6252. sps->sar.num=
  6253. sps->sar.den= 0;
  6254. }
  6255. // s->avctx->aspect_ratio= sar_width*s->width / (float)(s->height*sar_height);
  6256. if(get_bits1(&s->gb)){ /* overscan_info_present_flag */
  6257. get_bits1(&s->gb); /* overscan_appropriate_flag */
  6258. }
  6259. if(get_bits1(&s->gb)){ /* video_signal_type_present_flag */
  6260. get_bits(&s->gb, 3); /* video_format */
  6261. get_bits1(&s->gb); /* video_full_range_flag */
  6262. if(get_bits1(&s->gb)){ /* colour_description_present_flag */
  6263. get_bits(&s->gb, 8); /* colour_primaries */
  6264. get_bits(&s->gb, 8); /* transfer_characteristics */
  6265. get_bits(&s->gb, 8); /* matrix_coefficients */
  6266. }
  6267. }
  6268. if(get_bits1(&s->gb)){ /* chroma_location_info_present_flag */
  6269. get_ue_golomb(&s->gb); /* chroma_sample_location_type_top_field */
  6270. get_ue_golomb(&s->gb); /* chroma_sample_location_type_bottom_field */
  6271. }
  6272. sps->timing_info_present_flag = get_bits1(&s->gb);
  6273. if(sps->timing_info_present_flag){
  6274. sps->num_units_in_tick = get_bits_long(&s->gb, 32);
  6275. sps->time_scale = get_bits_long(&s->gb, 32);
  6276. sps->fixed_frame_rate_flag = get_bits1(&s->gb);
  6277. }
  6278. nal_hrd_parameters_present_flag = get_bits1(&s->gb);
  6279. if(nal_hrd_parameters_present_flag)
  6280. decode_hrd_parameters(h, sps);
  6281. vcl_hrd_parameters_present_flag = get_bits1(&s->gb);
  6282. if(vcl_hrd_parameters_present_flag)
  6283. decode_hrd_parameters(h, sps);
  6284. if(nal_hrd_parameters_present_flag || vcl_hrd_parameters_present_flag)
  6285. get_bits1(&s->gb); /* low_delay_hrd_flag */
  6286. get_bits1(&s->gb); /* pic_struct_present_flag */
  6287. sps->bitstream_restriction_flag = get_bits1(&s->gb);
  6288. if(sps->bitstream_restriction_flag){
  6289. unsigned int num_reorder_frames;
  6290. get_bits1(&s->gb); /* motion_vectors_over_pic_boundaries_flag */
  6291. get_ue_golomb(&s->gb); /* max_bytes_per_pic_denom */
  6292. get_ue_golomb(&s->gb); /* max_bits_per_mb_denom */
  6293. get_ue_golomb(&s->gb); /* log2_max_mv_length_horizontal */
  6294. get_ue_golomb(&s->gb); /* log2_max_mv_length_vertical */
  6295. num_reorder_frames= get_ue_golomb(&s->gb);
  6296. get_ue_golomb(&s->gb); /*max_dec_frame_buffering*/
  6297. if(num_reorder_frames > 16 /*max_dec_frame_buffering || max_dec_frame_buffering > 16*/){
  6298. av_log(h->s.avctx, AV_LOG_ERROR, "illegal num_reorder_frames %d\n", num_reorder_frames);
  6299. return -1;
  6300. }
  6301. sps->num_reorder_frames= num_reorder_frames;
  6302. }
  6303. return 0;
  6304. }
  6305. static void decode_scaling_list(H264Context *h, uint8_t *factors, int size,
  6306. const uint8_t *jvt_list, const uint8_t *fallback_list){
  6307. MpegEncContext * const s = &h->s;
  6308. int i, last = 8, next = 8;
  6309. const uint8_t *scan = size == 16 ? zigzag_scan : zigzag_scan8x8;
  6310. if(!get_bits1(&s->gb)) /* matrix not written, we use the predicted one */
  6311. memcpy(factors, fallback_list, size*sizeof(uint8_t));
  6312. else
  6313. for(i=0;i<size;i++){
  6314. if(next)
  6315. next = (last + get_se_golomb(&s->gb)) & 0xff;
  6316. if(!i && !next){ /* matrix not written, we use the preset one */
  6317. memcpy(factors, jvt_list, size*sizeof(uint8_t));
  6318. break;
  6319. }
  6320. last = factors[scan[i]] = next ? next : last;
  6321. }
  6322. }
  6323. static void decode_scaling_matrices(H264Context *h, SPS *sps, PPS *pps, int is_sps,
  6324. uint8_t (*scaling_matrix4)[16], uint8_t (*scaling_matrix8)[64]){
  6325. MpegEncContext * const s = &h->s;
  6326. int fallback_sps = !is_sps && sps->scaling_matrix_present;
  6327. const uint8_t *fallback[4] = {
  6328. fallback_sps ? sps->scaling_matrix4[0] : default_scaling4[0],
  6329. fallback_sps ? sps->scaling_matrix4[3] : default_scaling4[1],
  6330. fallback_sps ? sps->scaling_matrix8[0] : default_scaling8[0],
  6331. fallback_sps ? sps->scaling_matrix8[1] : default_scaling8[1]
  6332. };
  6333. if(get_bits1(&s->gb)){
  6334. sps->scaling_matrix_present |= is_sps;
  6335. decode_scaling_list(h,scaling_matrix4[0],16,default_scaling4[0],fallback[0]); // Intra, Y
  6336. decode_scaling_list(h,scaling_matrix4[1],16,default_scaling4[0],scaling_matrix4[0]); // Intra, Cr
  6337. decode_scaling_list(h,scaling_matrix4[2],16,default_scaling4[0],scaling_matrix4[1]); // Intra, Cb
  6338. decode_scaling_list(h,scaling_matrix4[3],16,default_scaling4[1],fallback[1]); // Inter, Y
  6339. decode_scaling_list(h,scaling_matrix4[4],16,default_scaling4[1],scaling_matrix4[3]); // Inter, Cr
  6340. decode_scaling_list(h,scaling_matrix4[5],16,default_scaling4[1],scaling_matrix4[4]); // Inter, Cb
  6341. if(is_sps || pps->transform_8x8_mode){
  6342. decode_scaling_list(h,scaling_matrix8[0],64,default_scaling8[0],fallback[2]); // Intra, Y
  6343. decode_scaling_list(h,scaling_matrix8[1],64,default_scaling8[1],fallback[3]); // Inter, Y
  6344. }
  6345. } else if(fallback_sps) {
  6346. memcpy(scaling_matrix4, sps->scaling_matrix4, 6*16*sizeof(uint8_t));
  6347. memcpy(scaling_matrix8, sps->scaling_matrix8, 2*64*sizeof(uint8_t));
  6348. }
  6349. }
  6350. /**
  6351. * Returns and optionally allocates SPS / PPS structures in the supplied array 'vec'
  6352. */
  6353. static void *
  6354. alloc_parameter_set(H264Context *h, void **vec, const unsigned int id, const unsigned int max,
  6355. const size_t size, const char *name)
  6356. {
  6357. if(id>=max) {
  6358. av_log(h->s.avctx, AV_LOG_ERROR, "%s_id (%d) out of range\n", name, id);
  6359. return NULL;
  6360. }
  6361. if(!vec[id]) {
  6362. vec[id] = av_mallocz(size);
  6363. if(vec[id] == NULL)
  6364. av_log(h->s.avctx, AV_LOG_ERROR, "cannot allocate memory for %s\n", name);
  6365. }
  6366. return vec[id];
  6367. }
  6368. static inline int decode_seq_parameter_set(H264Context *h){
  6369. MpegEncContext * const s = &h->s;
  6370. int profile_idc, level_idc;
  6371. unsigned int sps_id, tmp, mb_width, mb_height;
  6372. int i;
  6373. SPS *sps;
  6374. profile_idc= get_bits(&s->gb, 8);
  6375. get_bits1(&s->gb); //constraint_set0_flag
  6376. get_bits1(&s->gb); //constraint_set1_flag
  6377. get_bits1(&s->gb); //constraint_set2_flag
  6378. get_bits1(&s->gb); //constraint_set3_flag
  6379. get_bits(&s->gb, 4); // reserved
  6380. level_idc= get_bits(&s->gb, 8);
  6381. sps_id= get_ue_golomb(&s->gb);
  6382. sps = alloc_parameter_set(h, (void **)h->sps_buffers, sps_id, MAX_SPS_COUNT, sizeof(SPS), "sps");
  6383. if(sps == NULL)
  6384. return -1;
  6385. sps->profile_idc= profile_idc;
  6386. sps->level_idc= level_idc;
  6387. if(sps->profile_idc >= 100){ //high profile
  6388. if(get_ue_golomb(&s->gb) == 3) //chroma_format_idc
  6389. get_bits1(&s->gb); //residual_color_transform_flag
  6390. get_ue_golomb(&s->gb); //bit_depth_luma_minus8
  6391. get_ue_golomb(&s->gb); //bit_depth_chroma_minus8
  6392. sps->transform_bypass = get_bits1(&s->gb);
  6393. decode_scaling_matrices(h, sps, NULL, 1, sps->scaling_matrix4, sps->scaling_matrix8);
  6394. }else
  6395. sps->scaling_matrix_present = 0;
  6396. sps->log2_max_frame_num= get_ue_golomb(&s->gb) + 4;
  6397. sps->poc_type= get_ue_golomb(&s->gb);
  6398. if(sps->poc_type == 0){ //FIXME #define
  6399. sps->log2_max_poc_lsb= get_ue_golomb(&s->gb) + 4;
  6400. } else if(sps->poc_type == 1){//FIXME #define
  6401. sps->delta_pic_order_always_zero_flag= get_bits1(&s->gb);
  6402. sps->offset_for_non_ref_pic= get_se_golomb(&s->gb);
  6403. sps->offset_for_top_to_bottom_field= get_se_golomb(&s->gb);
  6404. tmp= get_ue_golomb(&s->gb);
  6405. if(tmp >= sizeof(sps->offset_for_ref_frame) / sizeof(sps->offset_for_ref_frame[0])){
  6406. av_log(h->s.avctx, AV_LOG_ERROR, "poc_cycle_length overflow %u\n", tmp);
  6407. return -1;
  6408. }
  6409. sps->poc_cycle_length= tmp;
  6410. for(i=0; i<sps->poc_cycle_length; i++)
  6411. sps->offset_for_ref_frame[i]= get_se_golomb(&s->gb);
  6412. }else if(sps->poc_type != 2){
  6413. av_log(h->s.avctx, AV_LOG_ERROR, "illegal POC type %d\n", sps->poc_type);
  6414. return -1;
  6415. }
  6416. tmp= get_ue_golomb(&s->gb);
  6417. if(tmp > MAX_PICTURE_COUNT-2 || tmp >= 32){
  6418. av_log(h->s.avctx, AV_LOG_ERROR, "too many reference frames\n");
  6419. return -1;
  6420. }
  6421. sps->ref_frame_count= tmp;
  6422. sps->gaps_in_frame_num_allowed_flag= get_bits1(&s->gb);
  6423. mb_width= get_ue_golomb(&s->gb) + 1;
  6424. mb_height= get_ue_golomb(&s->gb) + 1;
  6425. if(mb_width >= INT_MAX/16 || mb_height >= INT_MAX/16 ||
  6426. avcodec_check_dimensions(NULL, 16*mb_width, 16*mb_height)){
  6427. av_log(h->s.avctx, AV_LOG_ERROR, "mb_width/height overflow\n");
  6428. return -1;
  6429. }
  6430. sps->mb_width = mb_width;
  6431. sps->mb_height= mb_height;
  6432. sps->frame_mbs_only_flag= get_bits1(&s->gb);
  6433. if(!sps->frame_mbs_only_flag)
  6434. sps->mb_aff= get_bits1(&s->gb);
  6435. else
  6436. sps->mb_aff= 0;
  6437. sps->direct_8x8_inference_flag= get_bits1(&s->gb);
  6438. #ifndef ALLOW_INTERLACE
  6439. if(sps->mb_aff)
  6440. av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF support not included; enable it at compile-time.\n");
  6441. #endif
  6442. if(!sps->direct_8x8_inference_flag && sps->mb_aff)
  6443. av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF + !direct_8x8_inference is not implemented\n");
  6444. sps->crop= get_bits1(&s->gb);
  6445. if(sps->crop){
  6446. sps->crop_left = get_ue_golomb(&s->gb);
  6447. sps->crop_right = get_ue_golomb(&s->gb);
  6448. sps->crop_top = get_ue_golomb(&s->gb);
  6449. sps->crop_bottom= get_ue_golomb(&s->gb);
  6450. if(sps->crop_left || sps->crop_top){
  6451. av_log(h->s.avctx, AV_LOG_ERROR, "insane cropping not completely supported, this could look slightly wrong ...\n");
  6452. }
  6453. if(sps->crop_right >= 8 || sps->crop_bottom >= (8>> !h->sps.frame_mbs_only_flag)){
  6454. av_log(h->s.avctx, AV_LOG_ERROR, "brainfart cropping not supported, this could look slightly wrong ...\n");
  6455. }
  6456. }else{
  6457. sps->crop_left =
  6458. sps->crop_right =
  6459. sps->crop_top =
  6460. sps->crop_bottom= 0;
  6461. }
  6462. sps->vui_parameters_present_flag= get_bits1(&s->gb);
  6463. if( sps->vui_parameters_present_flag )
  6464. decode_vui_parameters(h, sps);
  6465. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  6466. av_log(h->s.avctx, AV_LOG_DEBUG, "sps:%u profile:%d/%d poc:%d ref:%d %dx%d %s %s crop:%d/%d/%d/%d %s\n",
  6467. sps_id, sps->profile_idc, sps->level_idc,
  6468. sps->poc_type,
  6469. sps->ref_frame_count,
  6470. sps->mb_width, sps->mb_height,
  6471. sps->frame_mbs_only_flag ? "FRM" : (sps->mb_aff ? "MB-AFF" : "PIC-AFF"),
  6472. sps->direct_8x8_inference_flag ? "8B8" : "",
  6473. sps->crop_left, sps->crop_right,
  6474. sps->crop_top, sps->crop_bottom,
  6475. sps->vui_parameters_present_flag ? "VUI" : ""
  6476. );
  6477. }
  6478. return 0;
  6479. }
  6480. static void
  6481. build_qp_table(PPS *pps, int t, int index)
  6482. {
  6483. int i;
  6484. for(i = 0; i < 255; i++)
  6485. pps->chroma_qp_table[t][i & 0xff] = chroma_qp[av_clip(i + index, 0, 51)];
  6486. }
  6487. static inline int decode_picture_parameter_set(H264Context *h, int bit_length){
  6488. MpegEncContext * const s = &h->s;
  6489. unsigned int tmp, pps_id= get_ue_golomb(&s->gb);
  6490. PPS *pps;
  6491. pps = alloc_parameter_set(h, (void **)h->pps_buffers, pps_id, MAX_PPS_COUNT, sizeof(PPS), "pps");
  6492. if(pps == NULL)
  6493. return -1;
  6494. tmp= get_ue_golomb(&s->gb);
  6495. if(tmp>=MAX_SPS_COUNT || h->sps_buffers[tmp] == NULL){
  6496. av_log(h->s.avctx, AV_LOG_ERROR, "sps_id out of range\n");
  6497. return -1;
  6498. }
  6499. pps->sps_id= tmp;
  6500. pps->cabac= get_bits1(&s->gb);
  6501. pps->pic_order_present= get_bits1(&s->gb);
  6502. pps->slice_group_count= get_ue_golomb(&s->gb) + 1;
  6503. if(pps->slice_group_count > 1 ){
  6504. pps->mb_slice_group_map_type= get_ue_golomb(&s->gb);
  6505. av_log(h->s.avctx, AV_LOG_ERROR, "FMO not supported\n");
  6506. switch(pps->mb_slice_group_map_type){
  6507. case 0:
  6508. #if 0
  6509. | for( i = 0; i <= num_slice_groups_minus1; i++ ) | | |
  6510. | run_length[ i ] |1 |ue(v) |
  6511. #endif
  6512. break;
  6513. case 2:
  6514. #if 0
  6515. | for( i = 0; i < num_slice_groups_minus1; i++ ) | | |
  6516. |{ | | |
  6517. | top_left_mb[ i ] |1 |ue(v) |
  6518. | bottom_right_mb[ i ] |1 |ue(v) |
  6519. | } | | |
  6520. #endif
  6521. break;
  6522. case 3:
  6523. case 4:
  6524. case 5:
  6525. #if 0
  6526. | slice_group_change_direction_flag |1 |u(1) |
  6527. | slice_group_change_rate_minus1 |1 |ue(v) |
  6528. #endif
  6529. break;
  6530. case 6:
  6531. #if 0
  6532. | slice_group_id_cnt_minus1 |1 |ue(v) |
  6533. | for( i = 0; i <= slice_group_id_cnt_minus1; i++ | | |
  6534. |) | | |
  6535. | slice_group_id[ i ] |1 |u(v) |
  6536. #endif
  6537. break;
  6538. }
  6539. }
  6540. pps->ref_count[0]= get_ue_golomb(&s->gb) + 1;
  6541. pps->ref_count[1]= get_ue_golomb(&s->gb) + 1;
  6542. if(pps->ref_count[0]-1 > 32-1 || pps->ref_count[1]-1 > 32-1){
  6543. av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow (pps)\n");
  6544. pps->ref_count[0]= pps->ref_count[1]= 1;
  6545. return -1;
  6546. }
  6547. pps->weighted_pred= get_bits1(&s->gb);
  6548. pps->weighted_bipred_idc= get_bits(&s->gb, 2);
  6549. pps->init_qp= get_se_golomb(&s->gb) + 26;
  6550. pps->init_qs= get_se_golomb(&s->gb) + 26;
  6551. pps->chroma_qp_index_offset[0]= get_se_golomb(&s->gb);
  6552. pps->deblocking_filter_parameters_present= get_bits1(&s->gb);
  6553. pps->constrained_intra_pred= get_bits1(&s->gb);
  6554. pps->redundant_pic_cnt_present = get_bits1(&s->gb);
  6555. pps->transform_8x8_mode= 0;
  6556. h->dequant_coeff_pps= -1; //contents of sps/pps can change even if id doesn't, so reinit
  6557. memset(pps->scaling_matrix4, 16, 6*16*sizeof(uint8_t));
  6558. memset(pps->scaling_matrix8, 16, 2*64*sizeof(uint8_t));
  6559. if(get_bits_count(&s->gb) < bit_length){
  6560. pps->transform_8x8_mode= get_bits1(&s->gb);
  6561. decode_scaling_matrices(h, h->sps_buffers[pps->sps_id], pps, 0, pps->scaling_matrix4, pps->scaling_matrix8);
  6562. pps->chroma_qp_index_offset[1]= get_se_golomb(&s->gb); //second_chroma_qp_index_offset
  6563. } else {
  6564. pps->chroma_qp_index_offset[1]= pps->chroma_qp_index_offset[0];
  6565. }
  6566. build_qp_table(pps, 0, pps->chroma_qp_index_offset[0]);
  6567. if(pps->chroma_qp_index_offset[0] != pps->chroma_qp_index_offset[1]) {
  6568. build_qp_table(pps, 1, pps->chroma_qp_index_offset[1]);
  6569. h->pps.chroma_qp_diff= 1;
  6570. } else
  6571. memcpy(pps->chroma_qp_table[1], pps->chroma_qp_table[0], 256);
  6572. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  6573. av_log(h->s.avctx, AV_LOG_DEBUG, "pps:%u sps:%u %s slice_groups:%d ref:%d/%d %s qp:%d/%d/%d/%d %s %s %s %s\n",
  6574. pps_id, pps->sps_id,
  6575. pps->cabac ? "CABAC" : "CAVLC",
  6576. pps->slice_group_count,
  6577. pps->ref_count[0], pps->ref_count[1],
  6578. pps->weighted_pred ? "weighted" : "",
  6579. pps->init_qp, pps->init_qs, pps->chroma_qp_index_offset[0], pps->chroma_qp_index_offset[1],
  6580. pps->deblocking_filter_parameters_present ? "LPAR" : "",
  6581. pps->constrained_intra_pred ? "CONSTR" : "",
  6582. pps->redundant_pic_cnt_present ? "REDU" : "",
  6583. pps->transform_8x8_mode ? "8x8DCT" : ""
  6584. );
  6585. }
  6586. return 0;
  6587. }
  6588. /**
  6589. * Call decode_slice() for each context.
  6590. *
  6591. * @param h h264 master context
  6592. * @param context_count number of contexts to execute
  6593. */
  6594. static void execute_decode_slices(H264Context *h, int context_count){
  6595. MpegEncContext * const s = &h->s;
  6596. AVCodecContext * const avctx= s->avctx;
  6597. H264Context *hx;
  6598. int i;
  6599. if(context_count == 1) {
  6600. decode_slice(avctx, h);
  6601. } else {
  6602. for(i = 1; i < context_count; i++) {
  6603. hx = h->thread_context[i];
  6604. hx->s.error_resilience = avctx->error_resilience;
  6605. hx->s.error_count = 0;
  6606. }
  6607. avctx->execute(avctx, (void *)decode_slice,
  6608. (void **)h->thread_context, NULL, context_count);
  6609. /* pull back stuff from slices to master context */
  6610. hx = h->thread_context[context_count - 1];
  6611. s->mb_x = hx->s.mb_x;
  6612. s->mb_y = hx->s.mb_y;
  6613. s->dropable = hx->s.dropable;
  6614. s->picture_structure = hx->s.picture_structure;
  6615. for(i = 1; i < context_count; i++)
  6616. h->s.error_count += h->thread_context[i]->s.error_count;
  6617. }
  6618. }
  6619. static int decode_nal_units(H264Context *h, const uint8_t *buf, int buf_size){
  6620. MpegEncContext * const s = &h->s;
  6621. AVCodecContext * const avctx= s->avctx;
  6622. int buf_index=0;
  6623. H264Context *hx; ///< thread context
  6624. int context_count = 0;
  6625. h->max_contexts = avctx->thread_count;
  6626. #if 0
  6627. int i;
  6628. for(i=0; i<50; i++){
  6629. av_log(NULL, AV_LOG_ERROR,"%02X ", buf[i]);
  6630. }
  6631. #endif
  6632. if(!(s->flags2 & CODEC_FLAG2_CHUNKS)){
  6633. h->current_slice = 0;
  6634. if (!s->first_field)
  6635. s->current_picture_ptr= NULL;
  6636. }
  6637. for(;;){
  6638. int consumed;
  6639. int dst_length;
  6640. int bit_length;
  6641. const uint8_t *ptr;
  6642. int i, nalsize = 0;
  6643. int err;
  6644. if(h->is_avc) {
  6645. if(buf_index >= buf_size) break;
  6646. nalsize = 0;
  6647. for(i = 0; i < h->nal_length_size; i++)
  6648. nalsize = (nalsize << 8) | buf[buf_index++];
  6649. if(nalsize <= 1 || (nalsize+buf_index > buf_size)){
  6650. if(nalsize == 1){
  6651. buf_index++;
  6652. continue;
  6653. }else{
  6654. av_log(h->s.avctx, AV_LOG_ERROR, "AVC: nal size %d\n", nalsize);
  6655. break;
  6656. }
  6657. }
  6658. } else {
  6659. // start code prefix search
  6660. for(; buf_index + 3 < buf_size; buf_index++){
  6661. // This should always succeed in the first iteration.
  6662. if(buf[buf_index] == 0 && buf[buf_index+1] == 0 && buf[buf_index+2] == 1)
  6663. break;
  6664. }
  6665. if(buf_index+3 >= buf_size) break;
  6666. buf_index+=3;
  6667. }
  6668. hx = h->thread_context[context_count];
  6669. ptr= decode_nal(hx, buf + buf_index, &dst_length, &consumed, h->is_avc ? nalsize : buf_size - buf_index);
  6670. if (ptr==NULL || dst_length < 0){
  6671. return -1;
  6672. }
  6673. while(ptr[dst_length - 1] == 0 && dst_length > 0)
  6674. dst_length--;
  6675. bit_length= !dst_length ? 0 : (8*dst_length - decode_rbsp_trailing(h, ptr + dst_length - 1));
  6676. if(s->avctx->debug&FF_DEBUG_STARTCODE){
  6677. av_log(h->s.avctx, AV_LOG_DEBUG, "NAL %d at %d/%d length %d\n", hx->nal_unit_type, buf_index, buf_size, dst_length);
  6678. }
  6679. if (h->is_avc && (nalsize != consumed)){
  6680. av_log(h->s.avctx, AV_LOG_ERROR, "AVC: Consumed only %d bytes instead of %d\n", consumed, nalsize);
  6681. consumed= nalsize;
  6682. }
  6683. buf_index += consumed;
  6684. if( (s->hurry_up == 1 && h->nal_ref_idc == 0) //FIXME do not discard SEI id
  6685. ||(avctx->skip_frame >= AVDISCARD_NONREF && h->nal_ref_idc == 0))
  6686. continue;
  6687. again:
  6688. err = 0;
  6689. switch(hx->nal_unit_type){
  6690. case NAL_IDR_SLICE:
  6691. if (h->nal_unit_type != NAL_IDR_SLICE) {
  6692. av_log(h->s.avctx, AV_LOG_ERROR, "Invalid mix of idr and non-idr slices");
  6693. return -1;
  6694. }
  6695. idr(h); //FIXME ensure we don't loose some frames if there is reordering
  6696. case NAL_SLICE:
  6697. init_get_bits(&hx->s.gb, ptr, bit_length);
  6698. hx->intra_gb_ptr=
  6699. hx->inter_gb_ptr= &hx->s.gb;
  6700. hx->s.data_partitioning = 0;
  6701. if((err = decode_slice_header(hx, h)))
  6702. break;
  6703. s->current_picture_ptr->key_frame|= (hx->nal_unit_type == NAL_IDR_SLICE);
  6704. if(hx->redundant_pic_count==0 && hx->s.hurry_up < 5
  6705. && (avctx->skip_frame < AVDISCARD_NONREF || hx->nal_ref_idc)
  6706. && (avctx->skip_frame < AVDISCARD_BIDIR || hx->slice_type!=FF_B_TYPE)
  6707. && (avctx->skip_frame < AVDISCARD_NONKEY || hx->slice_type==FF_I_TYPE)
  6708. && avctx->skip_frame < AVDISCARD_ALL)
  6709. context_count++;
  6710. break;
  6711. case NAL_DPA:
  6712. init_get_bits(&hx->s.gb, ptr, bit_length);
  6713. hx->intra_gb_ptr=
  6714. hx->inter_gb_ptr= NULL;
  6715. hx->s.data_partitioning = 1;
  6716. err = decode_slice_header(hx, h);
  6717. break;
  6718. case NAL_DPB:
  6719. init_get_bits(&hx->intra_gb, ptr, bit_length);
  6720. hx->intra_gb_ptr= &hx->intra_gb;
  6721. break;
  6722. case NAL_DPC:
  6723. init_get_bits(&hx->inter_gb, ptr, bit_length);
  6724. hx->inter_gb_ptr= &hx->inter_gb;
  6725. if(hx->redundant_pic_count==0 && hx->intra_gb_ptr && hx->s.data_partitioning
  6726. && s->context_initialized
  6727. && s->hurry_up < 5
  6728. && (avctx->skip_frame < AVDISCARD_NONREF || hx->nal_ref_idc)
  6729. && (avctx->skip_frame < AVDISCARD_BIDIR || hx->slice_type!=FF_B_TYPE)
  6730. && (avctx->skip_frame < AVDISCARD_NONKEY || hx->slice_type==FF_I_TYPE)
  6731. && avctx->skip_frame < AVDISCARD_ALL)
  6732. context_count++;
  6733. break;
  6734. case NAL_SEI:
  6735. init_get_bits(&s->gb, ptr, bit_length);
  6736. decode_sei(h);
  6737. break;
  6738. case NAL_SPS:
  6739. init_get_bits(&s->gb, ptr, bit_length);
  6740. decode_seq_parameter_set(h);
  6741. if(s->flags& CODEC_FLAG_LOW_DELAY)
  6742. s->low_delay=1;
  6743. if(avctx->has_b_frames < 2)
  6744. avctx->has_b_frames= !s->low_delay;
  6745. break;
  6746. case NAL_PPS:
  6747. init_get_bits(&s->gb, ptr, bit_length);
  6748. decode_picture_parameter_set(h, bit_length);
  6749. break;
  6750. case NAL_AUD:
  6751. case NAL_END_SEQUENCE:
  6752. case NAL_END_STREAM:
  6753. case NAL_FILLER_DATA:
  6754. case NAL_SPS_EXT:
  6755. case NAL_AUXILIARY_SLICE:
  6756. break;
  6757. default:
  6758. av_log(avctx, AV_LOG_DEBUG, "Unknown NAL code: %d (%d bits)\n", h->nal_unit_type, bit_length);
  6759. }
  6760. if(context_count == h->max_contexts) {
  6761. execute_decode_slices(h, context_count);
  6762. context_count = 0;
  6763. }
  6764. if (err < 0)
  6765. av_log(h->s.avctx, AV_LOG_ERROR, "decode_slice_header error\n");
  6766. else if(err == 1) {
  6767. /* Slice could not be decoded in parallel mode, copy down
  6768. * NAL unit stuff to context 0 and restart. Note that
  6769. * rbsp_buffer is not transfered, but since we no longer
  6770. * run in parallel mode this should not be an issue. */
  6771. h->nal_unit_type = hx->nal_unit_type;
  6772. h->nal_ref_idc = hx->nal_ref_idc;
  6773. hx = h;
  6774. goto again;
  6775. }
  6776. }
  6777. if(context_count)
  6778. execute_decode_slices(h, context_count);
  6779. return buf_index;
  6780. }
  6781. /**
  6782. * returns the number of bytes consumed for building the current frame
  6783. */
  6784. static int get_consumed_bytes(MpegEncContext *s, int pos, int buf_size){
  6785. if(s->flags&CODEC_FLAG_TRUNCATED){
  6786. pos -= s->parse_context.last_index;
  6787. if(pos<0) pos=0; // FIXME remove (unneeded?)
  6788. return pos;
  6789. }else{
  6790. if(pos==0) pos=1; //avoid infinite loops (i doubt that is needed but ...)
  6791. if(pos+10>buf_size) pos=buf_size; // oops ;)
  6792. return pos;
  6793. }
  6794. }
  6795. static int decode_frame(AVCodecContext *avctx,
  6796. void *data, int *data_size,
  6797. const uint8_t *buf, int buf_size)
  6798. {
  6799. H264Context *h = avctx->priv_data;
  6800. MpegEncContext *s = &h->s;
  6801. AVFrame *pict = data;
  6802. int buf_index;
  6803. s->flags= avctx->flags;
  6804. s->flags2= avctx->flags2;
  6805. if(s->flags&CODEC_FLAG_TRUNCATED){
  6806. const int next= ff_h264_find_frame_end(h, buf, buf_size);
  6807. assert((buf_size > 0) || (next == END_NOT_FOUND));
  6808. if( ff_combine_frame(&s->parse_context, next, &buf, &buf_size) < 0 )
  6809. return buf_size;
  6810. //printf("next:%d buf_size:%d last_index:%d\n", next, buf_size, s->parse_context.last_index);
  6811. }
  6812. /* no supplementary picture */
  6813. if (buf_size == 0) {
  6814. Picture *out;
  6815. int i, out_idx;
  6816. //FIXME factorize this with the output code below
  6817. out = h->delayed_pic[0];
  6818. out_idx = 0;
  6819. for(i=1; h->delayed_pic[i] && !h->delayed_pic[i]->key_frame; i++)
  6820. if(h->delayed_pic[i]->poc < out->poc){
  6821. out = h->delayed_pic[i];
  6822. out_idx = i;
  6823. }
  6824. for(i=out_idx; h->delayed_pic[i]; i++)
  6825. h->delayed_pic[i] = h->delayed_pic[i+1];
  6826. if(out){
  6827. *data_size = sizeof(AVFrame);
  6828. *pict= *(AVFrame*)out;
  6829. }
  6830. return 0;
  6831. }
  6832. if(h->is_avc && !h->got_avcC) {
  6833. int i, cnt, nalsize;
  6834. unsigned char *p = avctx->extradata;
  6835. if(avctx->extradata_size < 7) {
  6836. av_log(avctx, AV_LOG_ERROR, "avcC too short\n");
  6837. return -1;
  6838. }
  6839. if(*p != 1) {
  6840. av_log(avctx, AV_LOG_ERROR, "Unknown avcC version %d\n", *p);
  6841. return -1;
  6842. }
  6843. /* sps and pps in the avcC always have length coded with 2 bytes,
  6844. so put a fake nal_length_size = 2 while parsing them */
  6845. h->nal_length_size = 2;
  6846. // Decode sps from avcC
  6847. cnt = *(p+5) & 0x1f; // Number of sps
  6848. p += 6;
  6849. for (i = 0; i < cnt; i++) {
  6850. nalsize = AV_RB16(p) + 2;
  6851. if(decode_nal_units(h, p, nalsize) < 0) {
  6852. av_log(avctx, AV_LOG_ERROR, "Decoding sps %d from avcC failed\n", i);
  6853. return -1;
  6854. }
  6855. p += nalsize;
  6856. }
  6857. // Decode pps from avcC
  6858. cnt = *(p++); // Number of pps
  6859. for (i = 0; i < cnt; i++) {
  6860. nalsize = AV_RB16(p) + 2;
  6861. if(decode_nal_units(h, p, nalsize) != nalsize) {
  6862. av_log(avctx, AV_LOG_ERROR, "Decoding pps %d from avcC failed\n", i);
  6863. return -1;
  6864. }
  6865. p += nalsize;
  6866. }
  6867. // Now store right nal length size, that will be use to parse all other nals
  6868. h->nal_length_size = ((*(((char*)(avctx->extradata))+4))&0x03)+1;
  6869. // Do not reparse avcC
  6870. h->got_avcC = 1;
  6871. }
  6872. if(avctx->frame_number==0 && !h->is_avc && s->avctx->extradata_size){
  6873. if(decode_nal_units(h, s->avctx->extradata, s->avctx->extradata_size) < 0)
  6874. return -1;
  6875. }
  6876. buf_index=decode_nal_units(h, buf, buf_size);
  6877. if(buf_index < 0)
  6878. return -1;
  6879. if(!(s->flags2 & CODEC_FLAG2_CHUNKS) && !s->current_picture_ptr){
  6880. if (avctx->skip_frame >= AVDISCARD_NONREF || s->hurry_up) return 0;
  6881. av_log(avctx, AV_LOG_ERROR, "no frame!\n");
  6882. return -1;
  6883. }
  6884. if(!(s->flags2 & CODEC_FLAG2_CHUNKS) || (s->mb_y >= s->mb_height && s->mb_height)){
  6885. Picture *out = s->current_picture_ptr;
  6886. Picture *cur = s->current_picture_ptr;
  6887. int i, pics, cross_idr, out_of_order, out_idx;
  6888. s->mb_y= 0;
  6889. s->current_picture_ptr->qscale_type= FF_QSCALE_TYPE_H264;
  6890. s->current_picture_ptr->pict_type= s->pict_type;
  6891. h->prev_frame_num_offset= h->frame_num_offset;
  6892. h->prev_frame_num= h->frame_num;
  6893. if(!s->dropable) {
  6894. h->prev_poc_msb= h->poc_msb;
  6895. h->prev_poc_lsb= h->poc_lsb;
  6896. execute_ref_pic_marking(h, h->mmco, h->mmco_index);
  6897. }
  6898. /*
  6899. * FIXME: Error handling code does not seem to support interlaced
  6900. * when slices span multiple rows
  6901. * The ff_er_add_slice calls don't work right for bottom
  6902. * fields; they cause massive erroneous error concealing
  6903. * Error marking covers both fields (top and bottom).
  6904. * This causes a mismatched s->error_count
  6905. * and a bad error table. Further, the error count goes to
  6906. * INT_MAX when called for bottom field, because mb_y is
  6907. * past end by one (callers fault) and resync_mb_y != 0
  6908. * causes problems for the first MB line, too.
  6909. */
  6910. if (!FIELD_PICTURE)
  6911. ff_er_frame_end(s);
  6912. MPV_frame_end(s);
  6913. if (s->first_field) {
  6914. /* Wait for second field. */
  6915. *data_size = 0;
  6916. } else {
  6917. cur->interlaced_frame = FIELD_OR_MBAFF_PICTURE;
  6918. /* Derive top_field_first from field pocs. */
  6919. cur->top_field_first = cur->field_poc[0] < cur->field_poc[1];
  6920. //FIXME do something with unavailable reference frames
  6921. /* Sort B-frames into display order */
  6922. if(h->sps.bitstream_restriction_flag
  6923. && s->avctx->has_b_frames < h->sps.num_reorder_frames){
  6924. s->avctx->has_b_frames = h->sps.num_reorder_frames;
  6925. s->low_delay = 0;
  6926. }
  6927. if( s->avctx->strict_std_compliance >= FF_COMPLIANCE_STRICT
  6928. && !h->sps.bitstream_restriction_flag){
  6929. s->avctx->has_b_frames= MAX_DELAYED_PIC_COUNT;
  6930. s->low_delay= 0;
  6931. }
  6932. pics = 0;
  6933. while(h->delayed_pic[pics]) pics++;
  6934. assert(pics <= MAX_DELAYED_PIC_COUNT);
  6935. h->delayed_pic[pics++] = cur;
  6936. if(cur->reference == 0)
  6937. cur->reference = DELAYED_PIC_REF;
  6938. cross_idr = 0;
  6939. for(i=0; h->delayed_pic[i]; i++)
  6940. if(h->delayed_pic[i]->key_frame || h->delayed_pic[i]->poc==0)
  6941. cross_idr = 1;
  6942. out = h->delayed_pic[0];
  6943. out_idx = 0;
  6944. for(i=1; h->delayed_pic[i] && !h->delayed_pic[i]->key_frame; i++)
  6945. if(h->delayed_pic[i]->poc < out->poc){
  6946. out = h->delayed_pic[i];
  6947. out_idx = i;
  6948. }
  6949. out_of_order = !cross_idr && out->poc < h->outputed_poc;
  6950. if(h->sps.bitstream_restriction_flag && s->avctx->has_b_frames >= h->sps.num_reorder_frames)
  6951. { }
  6952. else if((out_of_order && pics-1 == s->avctx->has_b_frames && s->avctx->has_b_frames < MAX_DELAYED_PIC_COUNT)
  6953. || (s->low_delay &&
  6954. ((!cross_idr && out->poc > h->outputed_poc + 2)
  6955. || cur->pict_type == FF_B_TYPE)))
  6956. {
  6957. s->low_delay = 0;
  6958. s->avctx->has_b_frames++;
  6959. }
  6960. if(out_of_order || pics > s->avctx->has_b_frames){
  6961. out->reference &= ~DELAYED_PIC_REF;
  6962. for(i=out_idx; h->delayed_pic[i]; i++)
  6963. h->delayed_pic[i] = h->delayed_pic[i+1];
  6964. }
  6965. if(!out_of_order && pics > s->avctx->has_b_frames){
  6966. *data_size = sizeof(AVFrame);
  6967. h->outputed_poc = out->poc;
  6968. *pict= *(AVFrame*)out;
  6969. }else{
  6970. av_log(avctx, AV_LOG_DEBUG, "no picture\n");
  6971. }
  6972. }
  6973. }
  6974. assert(pict->data[0] || !*data_size);
  6975. ff_print_debug_info(s, pict);
  6976. //printf("out %d\n", (int)pict->data[0]);
  6977. #if 0 //?
  6978. /* Return the Picture timestamp as the frame number */
  6979. /* we subtract 1 because it is added on utils.c */
  6980. avctx->frame_number = s->picture_number - 1;
  6981. #endif
  6982. return get_consumed_bytes(s, buf_index, buf_size);
  6983. }
  6984. #if 0
  6985. static inline void fill_mb_avail(H264Context *h){
  6986. MpegEncContext * const s = &h->s;
  6987. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  6988. if(s->mb_y){
  6989. h->mb_avail[0]= s->mb_x && h->slice_table[mb_xy - s->mb_stride - 1] == h->slice_num;
  6990. h->mb_avail[1]= h->slice_table[mb_xy - s->mb_stride ] == h->slice_num;
  6991. h->mb_avail[2]= s->mb_x+1 < s->mb_width && h->slice_table[mb_xy - s->mb_stride + 1] == h->slice_num;
  6992. }else{
  6993. h->mb_avail[0]=
  6994. h->mb_avail[1]=
  6995. h->mb_avail[2]= 0;
  6996. }
  6997. h->mb_avail[3]= s->mb_x && h->slice_table[mb_xy - 1] == h->slice_num;
  6998. h->mb_avail[4]= 1; //FIXME move out
  6999. h->mb_avail[5]= 0; //FIXME move out
  7000. }
  7001. #endif
  7002. #ifdef TEST
  7003. #undef printf
  7004. #undef random
  7005. #define COUNT 8000
  7006. #define SIZE (COUNT*40)
  7007. int main(void){
  7008. int i;
  7009. uint8_t temp[SIZE];
  7010. PutBitContext pb;
  7011. GetBitContext gb;
  7012. // int int_temp[10000];
  7013. DSPContext dsp;
  7014. AVCodecContext avctx;
  7015. dsputil_init(&dsp, &avctx);
  7016. init_put_bits(&pb, temp, SIZE);
  7017. printf("testing unsigned exp golomb\n");
  7018. for(i=0; i<COUNT; i++){
  7019. START_TIMER
  7020. set_ue_golomb(&pb, i);
  7021. STOP_TIMER("set_ue_golomb");
  7022. }
  7023. flush_put_bits(&pb);
  7024. init_get_bits(&gb, temp, 8*SIZE);
  7025. for(i=0; i<COUNT; i++){
  7026. int j, s;
  7027. s= show_bits(&gb, 24);
  7028. START_TIMER
  7029. j= get_ue_golomb(&gb);
  7030. if(j != i){
  7031. printf("mismatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);
  7032. // return -1;
  7033. }
  7034. STOP_TIMER("get_ue_golomb");
  7035. }
  7036. init_put_bits(&pb, temp, SIZE);
  7037. printf("testing signed exp golomb\n");
  7038. for(i=0; i<COUNT; i++){
  7039. START_TIMER
  7040. set_se_golomb(&pb, i - COUNT/2);
  7041. STOP_TIMER("set_se_golomb");
  7042. }
  7043. flush_put_bits(&pb);
  7044. init_get_bits(&gb, temp, 8*SIZE);
  7045. for(i=0; i<COUNT; i++){
  7046. int j, s;
  7047. s= show_bits(&gb, 24);
  7048. START_TIMER
  7049. j= get_se_golomb(&gb);
  7050. if(j != i - COUNT/2){
  7051. printf("mismatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);
  7052. // return -1;
  7053. }
  7054. STOP_TIMER("get_se_golomb");
  7055. }
  7056. #if 0
  7057. printf("testing 4x4 (I)DCT\n");
  7058. DCTELEM block[16];
  7059. uint8_t src[16], ref[16];
  7060. uint64_t error= 0, max_error=0;
  7061. for(i=0; i<COUNT; i++){
  7062. int j;
  7063. // printf("%d %d %d\n", r1, r2, (r2-r1)*16);
  7064. for(j=0; j<16; j++){
  7065. ref[j]= random()%255;
  7066. src[j]= random()%255;
  7067. }
  7068. h264_diff_dct_c(block, src, ref, 4);
  7069. //normalize
  7070. for(j=0; j<16; j++){
  7071. // printf("%d ", block[j]);
  7072. block[j]= block[j]*4;
  7073. if(j&1) block[j]= (block[j]*4 + 2)/5;
  7074. if(j&4) block[j]= (block[j]*4 + 2)/5;
  7075. }
  7076. // printf("\n");
  7077. s->dsp.h264_idct_add(ref, block, 4);
  7078. /* for(j=0; j<16; j++){
  7079. printf("%d ", ref[j]);
  7080. }
  7081. printf("\n");*/
  7082. for(j=0; j<16; j++){
  7083. int diff= FFABS(src[j] - ref[j]);
  7084. error+= diff*diff;
  7085. max_error= FFMAX(max_error, diff);
  7086. }
  7087. }
  7088. printf("error=%f max_error=%d\n", ((float)error)/COUNT/16, (int)max_error );
  7089. printf("testing quantizer\n");
  7090. for(qp=0; qp<52; qp++){
  7091. for(i=0; i<16; i++)
  7092. src1_block[i]= src2_block[i]= random()%255;
  7093. }
  7094. printf("Testing NAL layer\n");
  7095. uint8_t bitstream[COUNT];
  7096. uint8_t nal[COUNT*2];
  7097. H264Context h;
  7098. memset(&h, 0, sizeof(H264Context));
  7099. for(i=0; i<COUNT; i++){
  7100. int zeros= i;
  7101. int nal_length;
  7102. int consumed;
  7103. int out_length;
  7104. uint8_t *out;
  7105. int j;
  7106. for(j=0; j<COUNT; j++){
  7107. bitstream[j]= (random() % 255) + 1;
  7108. }
  7109. for(j=0; j<zeros; j++){
  7110. int pos= random() % COUNT;
  7111. while(bitstream[pos] == 0){
  7112. pos++;
  7113. pos %= COUNT;
  7114. }
  7115. bitstream[pos]=0;
  7116. }
  7117. START_TIMER
  7118. nal_length= encode_nal(&h, nal, bitstream, COUNT, COUNT*2);
  7119. if(nal_length<0){
  7120. printf("encoding failed\n");
  7121. return -1;
  7122. }
  7123. out= decode_nal(&h, nal, &out_length, &consumed, nal_length);
  7124. STOP_TIMER("NAL")
  7125. if(out_length != COUNT){
  7126. printf("incorrect length %d %d\n", out_length, COUNT);
  7127. return -1;
  7128. }
  7129. if(consumed != nal_length){
  7130. printf("incorrect consumed length %d %d\n", nal_length, consumed);
  7131. return -1;
  7132. }
  7133. if(memcmp(bitstream, out, COUNT)){
  7134. printf("mismatch\n");
  7135. return -1;
  7136. }
  7137. }
  7138. #endif
  7139. printf("Testing RBSP\n");
  7140. return 0;
  7141. }
  7142. #endif /* TEST */
  7143. static av_cold int decode_end(AVCodecContext *avctx)
  7144. {
  7145. H264Context *h = avctx->priv_data;
  7146. MpegEncContext *s = &h->s;
  7147. av_freep(&h->rbsp_buffer[0]);
  7148. av_freep(&h->rbsp_buffer[1]);
  7149. free_tables(h); //FIXME cleanup init stuff perhaps
  7150. MPV_common_end(s);
  7151. // memset(h, 0, sizeof(H264Context));
  7152. return 0;
  7153. }
  7154. AVCodec h264_decoder = {
  7155. "h264",
  7156. CODEC_TYPE_VIDEO,
  7157. CODEC_ID_H264,
  7158. sizeof(H264Context),
  7159. decode_init,
  7160. NULL,
  7161. decode_end,
  7162. decode_frame,
  7163. /*CODEC_CAP_DRAW_HORIZ_BAND |*/ CODEC_CAP_DR1 | CODEC_CAP_TRUNCATED | CODEC_CAP_DELAY,
  7164. .flush= flush_dpb,
  7165. .long_name = NULL_IF_CONFIG_SMALL("H.264 / AVC / MPEG-4 AVC / MPEG-4 part 10"),
  7166. };
  7167. #include "svq3.c"