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.

8139 lines
313KB

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