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.

8157 lines
315KB

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