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.

8306 lines
314KB

  1. /*
  2. * H.26L/H.264/AVC/JVT/14496-10/... encoder/decoder
  3. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file h264.c
  23. * H.264 / AVC / MPEG4 part10 codec.
  24. * @author Michael Niedermayer <michaelni@gmx.at>
  25. */
  26. #include "dsputil.h"
  27. #include "avcodec.h"
  28. #include "mpegvideo.h"
  29. #include "h264.h"
  30. #include "h264data.h"
  31. #include "h264_parser.h"
  32. #include "golomb.h"
  33. #include "cabac.h"
  34. //#undef NDEBUG
  35. #include <assert.h>
  36. static VLC coeff_token_vlc[4];
  37. static VLC chroma_dc_coeff_token_vlc;
  38. static VLC total_zeros_vlc[15];
  39. static VLC chroma_dc_total_zeros_vlc[3];
  40. static VLC run_vlc[6];
  41. static VLC run7_vlc;
  42. static void svq3_luma_dc_dequant_idct_c(DCTELEM *block, int qp);
  43. static void svq3_add_idct_c(uint8_t *dst, DCTELEM *block, int stride, int qp, int dc);
  44. 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);
  45. 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);
  46. static av_always_inline uint32_t pack16to32(int a, int b){
  47. #ifdef WORDS_BIGENDIAN
  48. return (b&0xFFFF) + (a<<16);
  49. #else
  50. return (a&0xFFFF) + (b<<16);
  51. #endif
  52. }
  53. const uint8_t ff_rem6[52]={
  54. 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,
  55. };
  56. const uint8_t ff_div6[52]={
  57. 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,
  58. };
  59. /**
  60. * fill a rectangle.
  61. * @param h height of the rectangle, should be a constant
  62. * @param w width of the rectangle, should be a constant
  63. * @param size the size of val (1 or 4), should be a constant
  64. */
  65. static av_always_inline void fill_rectangle(void *vp, int w, int h, int stride, uint32_t val, int size){
  66. uint8_t *p= (uint8_t*)vp;
  67. assert(size==1 || size==4);
  68. assert(w<=4);
  69. w *= size;
  70. stride *= size;
  71. assert((((long)vp)&(FFMIN(w, STRIDE_ALIGN)-1)) == 0);
  72. assert((stride&(w-1))==0);
  73. if(w==2){
  74. const uint16_t v= size==4 ? val : val*0x0101;
  75. *(uint16_t*)(p + 0*stride)= v;
  76. if(h==1) return;
  77. *(uint16_t*)(p + 1*stride)= v;
  78. if(h==2) return;
  79. *(uint16_t*)(p + 2*stride)=
  80. *(uint16_t*)(p + 3*stride)= v;
  81. }else if(w==4){
  82. const uint32_t v= size==4 ? val : val*0x01010101;
  83. *(uint32_t*)(p + 0*stride)= v;
  84. if(h==1) return;
  85. *(uint32_t*)(p + 1*stride)= v;
  86. if(h==2) return;
  87. *(uint32_t*)(p + 2*stride)=
  88. *(uint32_t*)(p + 3*stride)= v;
  89. }else if(w==8){
  90. //gcc can't optimize 64bit math on x86_32
  91. #if defined(ARCH_X86_64) || (defined(MP_WORDSIZE) && MP_WORDSIZE >= 64)
  92. const uint64_t v= val*0x0100000001ULL;
  93. *(uint64_t*)(p + 0*stride)= v;
  94. if(h==1) return;
  95. *(uint64_t*)(p + 1*stride)= v;
  96. if(h==2) return;
  97. *(uint64_t*)(p + 2*stride)=
  98. *(uint64_t*)(p + 3*stride)= v;
  99. }else if(w==16){
  100. const uint64_t v= val*0x0100000001ULL;
  101. *(uint64_t*)(p + 0+0*stride)=
  102. *(uint64_t*)(p + 8+0*stride)=
  103. *(uint64_t*)(p + 0+1*stride)=
  104. *(uint64_t*)(p + 8+1*stride)= v;
  105. if(h==2) return;
  106. *(uint64_t*)(p + 0+2*stride)=
  107. *(uint64_t*)(p + 8+2*stride)=
  108. *(uint64_t*)(p + 0+3*stride)=
  109. *(uint64_t*)(p + 8+3*stride)= v;
  110. #else
  111. *(uint32_t*)(p + 0+0*stride)=
  112. *(uint32_t*)(p + 4+0*stride)= val;
  113. if(h==1) return;
  114. *(uint32_t*)(p + 0+1*stride)=
  115. *(uint32_t*)(p + 4+1*stride)= val;
  116. if(h==2) return;
  117. *(uint32_t*)(p + 0+2*stride)=
  118. *(uint32_t*)(p + 4+2*stride)=
  119. *(uint32_t*)(p + 0+3*stride)=
  120. *(uint32_t*)(p + 4+3*stride)= val;
  121. }else if(w==16){
  122. *(uint32_t*)(p + 0+0*stride)=
  123. *(uint32_t*)(p + 4+0*stride)=
  124. *(uint32_t*)(p + 8+0*stride)=
  125. *(uint32_t*)(p +12+0*stride)=
  126. *(uint32_t*)(p + 0+1*stride)=
  127. *(uint32_t*)(p + 4+1*stride)=
  128. *(uint32_t*)(p + 8+1*stride)=
  129. *(uint32_t*)(p +12+1*stride)= val;
  130. if(h==2) return;
  131. *(uint32_t*)(p + 0+2*stride)=
  132. *(uint32_t*)(p + 4+2*stride)=
  133. *(uint32_t*)(p + 8+2*stride)=
  134. *(uint32_t*)(p +12+2*stride)=
  135. *(uint32_t*)(p + 0+3*stride)=
  136. *(uint32_t*)(p + 4+3*stride)=
  137. *(uint32_t*)(p + 8+3*stride)=
  138. *(uint32_t*)(p +12+3*stride)= val;
  139. #endif
  140. }else
  141. assert(0);
  142. assert(h==4);
  143. }
  144. static void fill_caches(H264Context *h, int mb_type, int for_deblock){
  145. MpegEncContext * const s = &h->s;
  146. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  147. int topleft_xy, top_xy, topright_xy, left_xy[2];
  148. int topleft_type, top_type, topright_type, left_type[2];
  149. int left_block[8];
  150. int i;
  151. //FIXME deblocking could skip the intra and nnz parts.
  152. if(for_deblock && (h->slice_num == 1 || h->slice_table[mb_xy] == h->slice_table[mb_xy-s->mb_stride]) && !FRAME_MBAFF)
  153. return;
  154. //wow what a mess, why didn't they simplify the interlacing&intra stuff, i can't imagine that these complex rules are worth it
  155. top_xy = mb_xy - s->mb_stride;
  156. topleft_xy = top_xy - 1;
  157. topright_xy= top_xy + 1;
  158. left_xy[1] = left_xy[0] = mb_xy-1;
  159. left_block[0]= 0;
  160. left_block[1]= 1;
  161. left_block[2]= 2;
  162. left_block[3]= 3;
  163. left_block[4]= 7;
  164. left_block[5]= 10;
  165. left_block[6]= 8;
  166. left_block[7]= 11;
  167. if(FRAME_MBAFF){
  168. const int pair_xy = s->mb_x + (s->mb_y & ~1)*s->mb_stride;
  169. const int top_pair_xy = pair_xy - s->mb_stride;
  170. const int topleft_pair_xy = top_pair_xy - 1;
  171. const int topright_pair_xy = top_pair_xy + 1;
  172. const int topleft_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[topleft_pair_xy]);
  173. const int top_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[top_pair_xy]);
  174. const int topright_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[topright_pair_xy]);
  175. const int left_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[pair_xy-1]);
  176. const int curr_mb_frame_flag = !IS_INTERLACED(mb_type);
  177. const int bottom = (s->mb_y & 1);
  178. 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);
  179. if (bottom
  180. ? !curr_mb_frame_flag // bottom macroblock
  181. : (!curr_mb_frame_flag && !top_mb_frame_flag) // top macroblock
  182. ) {
  183. top_xy -= s->mb_stride;
  184. }
  185. if (bottom
  186. ? !curr_mb_frame_flag // bottom macroblock
  187. : (!curr_mb_frame_flag && !topleft_mb_frame_flag) // top macroblock
  188. ) {
  189. topleft_xy -= s->mb_stride;
  190. }
  191. if (bottom
  192. ? !curr_mb_frame_flag // bottom macroblock
  193. : (!curr_mb_frame_flag && !topright_mb_frame_flag) // top macroblock
  194. ) {
  195. topright_xy -= s->mb_stride;
  196. }
  197. if (left_mb_frame_flag != curr_mb_frame_flag) {
  198. left_xy[1] = left_xy[0] = pair_xy - 1;
  199. if (curr_mb_frame_flag) {
  200. if (bottom) {
  201. left_block[0]= 2;
  202. left_block[1]= 2;
  203. left_block[2]= 3;
  204. left_block[3]= 3;
  205. left_block[4]= 8;
  206. left_block[5]= 11;
  207. left_block[6]= 8;
  208. left_block[7]= 11;
  209. } else {
  210. left_block[0]= 0;
  211. left_block[1]= 0;
  212. left_block[2]= 1;
  213. left_block[3]= 1;
  214. left_block[4]= 7;
  215. left_block[5]= 10;
  216. left_block[6]= 7;
  217. left_block[7]= 10;
  218. }
  219. } else {
  220. left_xy[1] += s->mb_stride;
  221. //left_block[0]= 0;
  222. left_block[1]= 2;
  223. left_block[2]= 0;
  224. left_block[3]= 2;
  225. //left_block[4]= 7;
  226. left_block[5]= 10;
  227. left_block[6]= 7;
  228. left_block[7]= 10;
  229. }
  230. }
  231. }
  232. h->top_mb_xy = top_xy;
  233. h->left_mb_xy[0] = left_xy[0];
  234. h->left_mb_xy[1] = left_xy[1];
  235. if(for_deblock){
  236. topleft_type = 0;
  237. topright_type = 0;
  238. top_type = h->slice_table[top_xy ] < 255 ? s->current_picture.mb_type[top_xy] : 0;
  239. left_type[0] = h->slice_table[left_xy[0] ] < 255 ? s->current_picture.mb_type[left_xy[0]] : 0;
  240. left_type[1] = h->slice_table[left_xy[1] ] < 255 ? s->current_picture.mb_type[left_xy[1]] : 0;
  241. if(FRAME_MBAFF && !IS_INTRA(mb_type)){
  242. int list;
  243. int v = *(uint16_t*)&h->non_zero_count[mb_xy][14];
  244. for(i=0; i<16; i++)
  245. h->non_zero_count_cache[scan8[i]] = (v>>i)&1;
  246. for(list=0; list<h->list_count; list++){
  247. if(USES_LIST(mb_type,list)){
  248. uint32_t *src = (uint32_t*)s->current_picture.motion_val[list][h->mb2b_xy[mb_xy]];
  249. uint32_t *dst = (uint32_t*)h->mv_cache[list][scan8[0]];
  250. int8_t *ref = &s->current_picture.ref_index[list][h->mb2b8_xy[mb_xy]];
  251. for(i=0; i<4; i++, dst+=8, src+=h->b_stride){
  252. dst[0] = src[0];
  253. dst[1] = src[1];
  254. dst[2] = src[2];
  255. dst[3] = src[3];
  256. }
  257. *(uint32_t*)&h->ref_cache[list][scan8[ 0]] =
  258. *(uint32_t*)&h->ref_cache[list][scan8[ 2]] = pack16to32(ref[0],ref[1])*0x0101;
  259. ref += h->b8_stride;
  260. *(uint32_t*)&h->ref_cache[list][scan8[ 8]] =
  261. *(uint32_t*)&h->ref_cache[list][scan8[10]] = pack16to32(ref[0],ref[1])*0x0101;
  262. }else{
  263. fill_rectangle(&h-> mv_cache[list][scan8[ 0]], 4, 4, 8, 0, 4);
  264. fill_rectangle(&h->ref_cache[list][scan8[ 0]], 4, 4, 8, (uint8_t)LIST_NOT_USED, 1);
  265. }
  266. }
  267. }
  268. }else{
  269. topleft_type = h->slice_table[topleft_xy ] == h->slice_num ? s->current_picture.mb_type[topleft_xy] : 0;
  270. top_type = h->slice_table[top_xy ] == h->slice_num ? s->current_picture.mb_type[top_xy] : 0;
  271. topright_type= h->slice_table[topright_xy] == h->slice_num ? s->current_picture.mb_type[topright_xy]: 0;
  272. left_type[0] = h->slice_table[left_xy[0] ] == h->slice_num ? s->current_picture.mb_type[left_xy[0]] : 0;
  273. left_type[1] = h->slice_table[left_xy[1] ] == h->slice_num ? s->current_picture.mb_type[left_xy[1]] : 0;
  274. }
  275. if(IS_INTRA(mb_type)){
  276. h->topleft_samples_available=
  277. h->top_samples_available=
  278. h->left_samples_available= 0xFFFF;
  279. h->topright_samples_available= 0xEEEA;
  280. if(!IS_INTRA(top_type) && (top_type==0 || h->pps.constrained_intra_pred)){
  281. h->topleft_samples_available= 0xB3FF;
  282. h->top_samples_available= 0x33FF;
  283. h->topright_samples_available= 0x26EA;
  284. }
  285. for(i=0; i<2; i++){
  286. if(!IS_INTRA(left_type[i]) && (left_type[i]==0 || h->pps.constrained_intra_pred)){
  287. h->topleft_samples_available&= 0xDF5F;
  288. h->left_samples_available&= 0x5F5F;
  289. }
  290. }
  291. if(!IS_INTRA(topleft_type) && (topleft_type==0 || h->pps.constrained_intra_pred))
  292. h->topleft_samples_available&= 0x7FFF;
  293. if(!IS_INTRA(topright_type) && (topright_type==0 || h->pps.constrained_intra_pred))
  294. h->topright_samples_available&= 0xFBFF;
  295. if(IS_INTRA4x4(mb_type)){
  296. if(IS_INTRA4x4(top_type)){
  297. h->intra4x4_pred_mode_cache[4+8*0]= h->intra4x4_pred_mode[top_xy][4];
  298. h->intra4x4_pred_mode_cache[5+8*0]= h->intra4x4_pred_mode[top_xy][5];
  299. h->intra4x4_pred_mode_cache[6+8*0]= h->intra4x4_pred_mode[top_xy][6];
  300. h->intra4x4_pred_mode_cache[7+8*0]= h->intra4x4_pred_mode[top_xy][3];
  301. }else{
  302. int pred;
  303. if(!top_type || (IS_INTER(top_type) && h->pps.constrained_intra_pred))
  304. pred= -1;
  305. else{
  306. pred= 2;
  307. }
  308. h->intra4x4_pred_mode_cache[4+8*0]=
  309. h->intra4x4_pred_mode_cache[5+8*0]=
  310. h->intra4x4_pred_mode_cache[6+8*0]=
  311. h->intra4x4_pred_mode_cache[7+8*0]= pred;
  312. }
  313. for(i=0; i<2; i++){
  314. if(IS_INTRA4x4(left_type[i])){
  315. h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[0+2*i]];
  316. h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[1+2*i]];
  317. }else{
  318. int pred;
  319. if(!left_type[i] || (IS_INTER(left_type[i]) && h->pps.constrained_intra_pred))
  320. pred= -1;
  321. else{
  322. pred= 2;
  323. }
  324. h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]=
  325. h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= pred;
  326. }
  327. }
  328. }
  329. }
  330. /*
  331. 0 . T T. T T T T
  332. 1 L . .L . . . .
  333. 2 L . .L . . . .
  334. 3 . T TL . . . .
  335. 4 L . .L . . . .
  336. 5 L . .. . . . .
  337. */
  338. //FIXME constraint_intra_pred & partitioning & nnz (lets hope this is just a typo in the spec)
  339. if(top_type){
  340. h->non_zero_count_cache[4+8*0]= h->non_zero_count[top_xy][4];
  341. h->non_zero_count_cache[5+8*0]= h->non_zero_count[top_xy][5];
  342. h->non_zero_count_cache[6+8*0]= h->non_zero_count[top_xy][6];
  343. h->non_zero_count_cache[7+8*0]= h->non_zero_count[top_xy][3];
  344. h->non_zero_count_cache[1+8*0]= h->non_zero_count[top_xy][9];
  345. h->non_zero_count_cache[2+8*0]= h->non_zero_count[top_xy][8];
  346. h->non_zero_count_cache[1+8*3]= h->non_zero_count[top_xy][12];
  347. h->non_zero_count_cache[2+8*3]= h->non_zero_count[top_xy][11];
  348. }else{
  349. h->non_zero_count_cache[4+8*0]=
  350. h->non_zero_count_cache[5+8*0]=
  351. h->non_zero_count_cache[6+8*0]=
  352. h->non_zero_count_cache[7+8*0]=
  353. h->non_zero_count_cache[1+8*0]=
  354. h->non_zero_count_cache[2+8*0]=
  355. h->non_zero_count_cache[1+8*3]=
  356. h->non_zero_count_cache[2+8*3]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;
  357. }
  358. for (i=0; i<2; i++) {
  359. if(left_type[i]){
  360. h->non_zero_count_cache[3+8*1 + 2*8*i]= h->non_zero_count[left_xy[i]][left_block[0+2*i]];
  361. h->non_zero_count_cache[3+8*2 + 2*8*i]= h->non_zero_count[left_xy[i]][left_block[1+2*i]];
  362. h->non_zero_count_cache[0+8*1 + 8*i]= h->non_zero_count[left_xy[i]][left_block[4+2*i]];
  363. h->non_zero_count_cache[0+8*4 + 8*i]= h->non_zero_count[left_xy[i]][left_block[5+2*i]];
  364. }else{
  365. h->non_zero_count_cache[3+8*1 + 2*8*i]=
  366. h->non_zero_count_cache[3+8*2 + 2*8*i]=
  367. h->non_zero_count_cache[0+8*1 + 8*i]=
  368. h->non_zero_count_cache[0+8*4 + 8*i]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;
  369. }
  370. }
  371. if( h->pps.cabac ) {
  372. // top_cbp
  373. if(top_type) {
  374. h->top_cbp = h->cbp_table[top_xy];
  375. } else if(IS_INTRA(mb_type)) {
  376. h->top_cbp = 0x1C0;
  377. } else {
  378. h->top_cbp = 0;
  379. }
  380. // left_cbp
  381. if (left_type[0]) {
  382. h->left_cbp = h->cbp_table[left_xy[0]] & 0x1f0;
  383. } else if(IS_INTRA(mb_type)) {
  384. h->left_cbp = 0x1C0;
  385. } else {
  386. h->left_cbp = 0;
  387. }
  388. if (left_type[0]) {
  389. h->left_cbp |= ((h->cbp_table[left_xy[0]]>>((left_block[0]&(~1))+1))&0x1) << 1;
  390. }
  391. if (left_type[1]) {
  392. h->left_cbp |= ((h->cbp_table[left_xy[1]]>>((left_block[2]&(~1))+1))&0x1) << 3;
  393. }
  394. }
  395. #if 1
  396. if(IS_INTER(mb_type) || IS_DIRECT(mb_type)){
  397. int list;
  398. for(list=0; list<h->list_count; list++){
  399. if(!USES_LIST(mb_type, list) && !IS_DIRECT(mb_type) && !h->deblocking_filter){
  400. /*if(!h->mv_cache_clean[list]){
  401. memset(h->mv_cache [list], 0, 8*5*2*sizeof(int16_t)); //FIXME clean only input? clean at all?
  402. memset(h->ref_cache[list], PART_NOT_AVAILABLE, 8*5*sizeof(int8_t));
  403. h->mv_cache_clean[list]= 1;
  404. }*/
  405. continue;
  406. }
  407. h->mv_cache_clean[list]= 0;
  408. if(USES_LIST(top_type, list)){
  409. const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;
  410. const int b8_xy= h->mb2b8_xy[top_xy] + h->b8_stride;
  411. *(uint32_t*)h->mv_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 0];
  412. *(uint32_t*)h->mv_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 1];
  413. *(uint32_t*)h->mv_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 2];
  414. *(uint32_t*)h->mv_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 3];
  415. h->ref_cache[list][scan8[0] + 0 - 1*8]=
  416. h->ref_cache[list][scan8[0] + 1 - 1*8]= s->current_picture.ref_index[list][b8_xy + 0];
  417. h->ref_cache[list][scan8[0] + 2 - 1*8]=
  418. h->ref_cache[list][scan8[0] + 3 - 1*8]= s->current_picture.ref_index[list][b8_xy + 1];
  419. }else{
  420. *(uint32_t*)h->mv_cache [list][scan8[0] + 0 - 1*8]=
  421. *(uint32_t*)h->mv_cache [list][scan8[0] + 1 - 1*8]=
  422. *(uint32_t*)h->mv_cache [list][scan8[0] + 2 - 1*8]=
  423. *(uint32_t*)h->mv_cache [list][scan8[0] + 3 - 1*8]= 0;
  424. *(uint32_t*)&h->ref_cache[list][scan8[0] + 0 - 1*8]= ((top_type ? LIST_NOT_USED : PART_NOT_AVAILABLE)&0xFF)*0x01010101;
  425. }
  426. for(i=0; i<2; i++){
  427. int cache_idx = scan8[0] - 1 + i*2*8;
  428. if(USES_LIST(left_type[i], list)){
  429. const int b_xy= h->mb2b_xy[left_xy[i]] + 3;
  430. const int b8_xy= h->mb2b8_xy[left_xy[i]] + 1;
  431. *(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]];
  432. *(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]];
  433. h->ref_cache[list][cache_idx ]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[0+i*2]>>1)];
  434. h->ref_cache[list][cache_idx+8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[1+i*2]>>1)];
  435. }else{
  436. *(uint32_t*)h->mv_cache [list][cache_idx ]=
  437. *(uint32_t*)h->mv_cache [list][cache_idx+8]= 0;
  438. h->ref_cache[list][cache_idx ]=
  439. h->ref_cache[list][cache_idx+8]= left_type[i] ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  440. }
  441. }
  442. if((for_deblock || (IS_DIRECT(mb_type) && !h->direct_spatial_mv_pred)) && !FRAME_MBAFF)
  443. continue;
  444. if(USES_LIST(topleft_type, list)){
  445. const int b_xy = h->mb2b_xy[topleft_xy] + 3 + 3*h->b_stride;
  446. const int b8_xy= h->mb2b8_xy[topleft_xy] + 1 + h->b8_stride;
  447. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];
  448. h->ref_cache[list][scan8[0] - 1 - 1*8]= s->current_picture.ref_index[list][b8_xy];
  449. }else{
  450. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= 0;
  451. h->ref_cache[list][scan8[0] - 1 - 1*8]= topleft_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  452. }
  453. if(USES_LIST(topright_type, list)){
  454. const int b_xy= h->mb2b_xy[topright_xy] + 3*h->b_stride;
  455. const int b8_xy= h->mb2b8_xy[topright_xy] + h->b8_stride;
  456. *(uint32_t*)h->mv_cache[list][scan8[0] + 4 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];
  457. h->ref_cache[list][scan8[0] + 4 - 1*8]= s->current_picture.ref_index[list][b8_xy];
  458. }else{
  459. *(uint32_t*)h->mv_cache [list][scan8[0] + 4 - 1*8]= 0;
  460. h->ref_cache[list][scan8[0] + 4 - 1*8]= topright_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  461. }
  462. if((IS_SKIP(mb_type) || IS_DIRECT(mb_type)) && !FRAME_MBAFF)
  463. continue;
  464. h->ref_cache[list][scan8[5 ]+1] =
  465. h->ref_cache[list][scan8[7 ]+1] =
  466. h->ref_cache[list][scan8[13]+1] = //FIXME remove past 3 (init somewhere else)
  467. h->ref_cache[list][scan8[4 ]] =
  468. h->ref_cache[list][scan8[12]] = PART_NOT_AVAILABLE;
  469. *(uint32_t*)h->mv_cache [list][scan8[5 ]+1]=
  470. *(uint32_t*)h->mv_cache [list][scan8[7 ]+1]=
  471. *(uint32_t*)h->mv_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewhere else)
  472. *(uint32_t*)h->mv_cache [list][scan8[4 ]]=
  473. *(uint32_t*)h->mv_cache [list][scan8[12]]= 0;
  474. if( h->pps.cabac ) {
  475. /* XXX beurk, Load mvd */
  476. if(USES_LIST(top_type, list)){
  477. const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;
  478. *(uint32_t*)h->mvd_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 0];
  479. *(uint32_t*)h->mvd_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 1];
  480. *(uint32_t*)h->mvd_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 2];
  481. *(uint32_t*)h->mvd_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 3];
  482. }else{
  483. *(uint32_t*)h->mvd_cache [list][scan8[0] + 0 - 1*8]=
  484. *(uint32_t*)h->mvd_cache [list][scan8[0] + 1 - 1*8]=
  485. *(uint32_t*)h->mvd_cache [list][scan8[0] + 2 - 1*8]=
  486. *(uint32_t*)h->mvd_cache [list][scan8[0] + 3 - 1*8]= 0;
  487. }
  488. if(USES_LIST(left_type[0], list)){
  489. const int b_xy= h->mb2b_xy[left_xy[0]] + 3;
  490. *(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]];
  491. *(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]];
  492. }else{
  493. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 0*8]=
  494. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 1*8]= 0;
  495. }
  496. if(USES_LIST(left_type[1], list)){
  497. const int b_xy= h->mb2b_xy[left_xy[1]] + 3;
  498. *(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]];
  499. *(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]];
  500. }else{
  501. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 2*8]=
  502. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 3*8]= 0;
  503. }
  504. *(uint32_t*)h->mvd_cache [list][scan8[5 ]+1]=
  505. *(uint32_t*)h->mvd_cache [list][scan8[7 ]+1]=
  506. *(uint32_t*)h->mvd_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewhere else)
  507. *(uint32_t*)h->mvd_cache [list][scan8[4 ]]=
  508. *(uint32_t*)h->mvd_cache [list][scan8[12]]= 0;
  509. if(h->slice_type == B_TYPE){
  510. fill_rectangle(&h->direct_cache[scan8[0]], 4, 4, 8, 0, 1);
  511. if(IS_DIRECT(top_type)){
  512. *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0x01010101;
  513. }else if(IS_8X8(top_type)){
  514. int b8_xy = h->mb2b8_xy[top_xy] + h->b8_stride;
  515. h->direct_cache[scan8[0] + 0 - 1*8]= h->direct_table[b8_xy];
  516. h->direct_cache[scan8[0] + 2 - 1*8]= h->direct_table[b8_xy + 1];
  517. }else{
  518. *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0;
  519. }
  520. if(IS_DIRECT(left_type[0]))
  521. h->direct_cache[scan8[0] - 1 + 0*8]= 1;
  522. else if(IS_8X8(left_type[0]))
  523. 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)];
  524. else
  525. h->direct_cache[scan8[0] - 1 + 0*8]= 0;
  526. if(IS_DIRECT(left_type[1]))
  527. h->direct_cache[scan8[0] - 1 + 2*8]= 1;
  528. else if(IS_8X8(left_type[1]))
  529. 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)];
  530. else
  531. h->direct_cache[scan8[0] - 1 + 2*8]= 0;
  532. }
  533. }
  534. if(FRAME_MBAFF){
  535. #define MAP_MVS\
  536. MAP_F2F(scan8[0] - 1 - 1*8, topleft_type)\
  537. MAP_F2F(scan8[0] + 0 - 1*8, top_type)\
  538. MAP_F2F(scan8[0] + 1 - 1*8, top_type)\
  539. MAP_F2F(scan8[0] + 2 - 1*8, top_type)\
  540. MAP_F2F(scan8[0] + 3 - 1*8, top_type)\
  541. MAP_F2F(scan8[0] + 4 - 1*8, topright_type)\
  542. MAP_F2F(scan8[0] - 1 + 0*8, left_type[0])\
  543. MAP_F2F(scan8[0] - 1 + 1*8, left_type[0])\
  544. MAP_F2F(scan8[0] - 1 + 2*8, left_type[1])\
  545. MAP_F2F(scan8[0] - 1 + 3*8, left_type[1])
  546. if(MB_FIELD){
  547. #define MAP_F2F(idx, mb_type)\
  548. if(!IS_INTERLACED(mb_type) && h->ref_cache[list][idx] >= 0){\
  549. h->ref_cache[list][idx] <<= 1;\
  550. h->mv_cache[list][idx][1] /= 2;\
  551. h->mvd_cache[list][idx][1] /= 2;\
  552. }
  553. MAP_MVS
  554. #undef MAP_F2F
  555. }else{
  556. #define MAP_F2F(idx, mb_type)\
  557. if(IS_INTERLACED(mb_type) && h->ref_cache[list][idx] >= 0){\
  558. h->ref_cache[list][idx] >>= 1;\
  559. h->mv_cache[list][idx][1] <<= 1;\
  560. h->mvd_cache[list][idx][1] <<= 1;\
  561. }
  562. MAP_MVS
  563. #undef MAP_F2F
  564. }
  565. }
  566. }
  567. }
  568. #endif
  569. h->neighbor_transform_size= !!IS_8x8DCT(top_type) + !!IS_8x8DCT(left_type[0]);
  570. }
  571. static inline void write_back_intra_pred_mode(H264Context *h){
  572. MpegEncContext * const s = &h->s;
  573. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  574. h->intra4x4_pred_mode[mb_xy][0]= h->intra4x4_pred_mode_cache[7+8*1];
  575. h->intra4x4_pred_mode[mb_xy][1]= h->intra4x4_pred_mode_cache[7+8*2];
  576. h->intra4x4_pred_mode[mb_xy][2]= h->intra4x4_pred_mode_cache[7+8*3];
  577. h->intra4x4_pred_mode[mb_xy][3]= h->intra4x4_pred_mode_cache[7+8*4];
  578. h->intra4x4_pred_mode[mb_xy][4]= h->intra4x4_pred_mode_cache[4+8*4];
  579. h->intra4x4_pred_mode[mb_xy][5]= h->intra4x4_pred_mode_cache[5+8*4];
  580. h->intra4x4_pred_mode[mb_xy][6]= h->intra4x4_pred_mode_cache[6+8*4];
  581. }
  582. /**
  583. * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.
  584. */
  585. static inline int check_intra4x4_pred_mode(H264Context *h){
  586. MpegEncContext * const s = &h->s;
  587. static const int8_t top [12]= {-1, 0,LEFT_DC_PRED,-1,-1,-1,-1,-1, 0};
  588. static const int8_t left[12]= { 0,-1, TOP_DC_PRED, 0,-1,-1,-1, 0,-1,DC_128_PRED};
  589. int i;
  590. if(!(h->top_samples_available&0x8000)){
  591. for(i=0; i<4; i++){
  592. int status= top[ h->intra4x4_pred_mode_cache[scan8[0] + i] ];
  593. if(status<0){
  594. 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);
  595. return -1;
  596. } else if(status){
  597. h->intra4x4_pred_mode_cache[scan8[0] + i]= status;
  598. }
  599. }
  600. }
  601. if(!(h->left_samples_available&0x8000)){
  602. for(i=0; i<4; i++){
  603. int status= left[ h->intra4x4_pred_mode_cache[scan8[0] + 8*i] ];
  604. if(status<0){
  605. 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);
  606. return -1;
  607. } else if(status){
  608. h->intra4x4_pred_mode_cache[scan8[0] + 8*i]= status;
  609. }
  610. }
  611. }
  612. return 0;
  613. } //FIXME cleanup like next
  614. /**
  615. * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.
  616. */
  617. static inline int check_intra_pred_mode(H264Context *h, int mode){
  618. MpegEncContext * const s = &h->s;
  619. static const int8_t top [7]= {LEFT_DC_PRED8x8, 1,-1,-1};
  620. static const int8_t left[7]= { TOP_DC_PRED8x8,-1, 2,-1,DC_128_PRED8x8};
  621. if(mode > 6U) {
  622. 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);
  623. return -1;
  624. }
  625. if(!(h->top_samples_available&0x8000)){
  626. mode= top[ mode ];
  627. if(mode<0){
  628. 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);
  629. return -1;
  630. }
  631. }
  632. if(!(h->left_samples_available&0x8000)){
  633. mode= left[ mode ];
  634. if(mode<0){
  635. 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);
  636. return -1;
  637. }
  638. }
  639. return mode;
  640. }
  641. /**
  642. * gets the predicted intra4x4 prediction mode.
  643. */
  644. static inline int pred_intra_mode(H264Context *h, int n){
  645. const int index8= scan8[n];
  646. const int left= h->intra4x4_pred_mode_cache[index8 - 1];
  647. const int top = h->intra4x4_pred_mode_cache[index8 - 8];
  648. const int min= FFMIN(left, top);
  649. tprintf(h->s.avctx, "mode:%d %d min:%d\n", left ,top, min);
  650. if(min<0) return DC_PRED;
  651. else return min;
  652. }
  653. static inline void write_back_non_zero_count(H264Context *h){
  654. MpegEncContext * const s = &h->s;
  655. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  656. h->non_zero_count[mb_xy][0]= h->non_zero_count_cache[7+8*1];
  657. h->non_zero_count[mb_xy][1]= h->non_zero_count_cache[7+8*2];
  658. h->non_zero_count[mb_xy][2]= h->non_zero_count_cache[7+8*3];
  659. h->non_zero_count[mb_xy][3]= h->non_zero_count_cache[7+8*4];
  660. h->non_zero_count[mb_xy][4]= h->non_zero_count_cache[4+8*4];
  661. h->non_zero_count[mb_xy][5]= h->non_zero_count_cache[5+8*4];
  662. h->non_zero_count[mb_xy][6]= h->non_zero_count_cache[6+8*4];
  663. h->non_zero_count[mb_xy][9]= h->non_zero_count_cache[1+8*2];
  664. h->non_zero_count[mb_xy][8]= h->non_zero_count_cache[2+8*2];
  665. h->non_zero_count[mb_xy][7]= h->non_zero_count_cache[2+8*1];
  666. h->non_zero_count[mb_xy][12]=h->non_zero_count_cache[1+8*5];
  667. h->non_zero_count[mb_xy][11]=h->non_zero_count_cache[2+8*5];
  668. h->non_zero_count[mb_xy][10]=h->non_zero_count_cache[2+8*4];
  669. if(FRAME_MBAFF){
  670. // store all luma nnzs, for deblocking
  671. int v = 0, i;
  672. for(i=0; i<16; i++)
  673. v += (!!h->non_zero_count_cache[scan8[i]]) << i;
  674. *(uint16_t*)&h->non_zero_count[mb_xy][14] = v;
  675. }
  676. }
  677. /**
  678. * gets the predicted number of non zero coefficients.
  679. * @param n block index
  680. */
  681. static inline int pred_non_zero_count(H264Context *h, int n){
  682. const int index8= scan8[n];
  683. const int left= h->non_zero_count_cache[index8 - 1];
  684. const int top = h->non_zero_count_cache[index8 - 8];
  685. int i= left + top;
  686. if(i<64) i= (i+1)>>1;
  687. tprintf(h->s.avctx, "pred_nnz L%X T%X n%d s%d P%X\n", left, top, n, scan8[n], i&31);
  688. return i&31;
  689. }
  690. static inline int fetch_diagonal_mv(H264Context *h, const int16_t **C, int i, int list, int part_width){
  691. const int topright_ref= h->ref_cache[list][ i - 8 + part_width ];
  692. MpegEncContext *s = &h->s;
  693. /* there is no consistent mapping of mvs to neighboring locations that will
  694. * make mbaff happy, so we can't move all this logic to fill_caches */
  695. if(FRAME_MBAFF){
  696. const uint32_t *mb_types = s->current_picture_ptr->mb_type;
  697. const int16_t *mv;
  698. *(uint32_t*)h->mv_cache[list][scan8[0]-2] = 0;
  699. *C = h->mv_cache[list][scan8[0]-2];
  700. if(!MB_FIELD
  701. && (s->mb_y&1) && i < scan8[0]+8 && topright_ref != PART_NOT_AVAILABLE){
  702. int topright_xy = s->mb_x + (s->mb_y-1)*s->mb_stride + (i == scan8[0]+3);
  703. if(IS_INTERLACED(mb_types[topright_xy])){
  704. #define SET_DIAG_MV(MV_OP, REF_OP, X4, Y4)\
  705. const int x4 = X4, y4 = Y4;\
  706. const int mb_type = mb_types[(x4>>2)+(y4>>2)*s->mb_stride];\
  707. if(!USES_LIST(mb_type,list) && !IS_8X8(mb_type))\
  708. return LIST_NOT_USED;\
  709. mv = s->current_picture_ptr->motion_val[list][x4 + y4*h->b_stride];\
  710. h->mv_cache[list][scan8[0]-2][0] = mv[0];\
  711. h->mv_cache[list][scan8[0]-2][1] = mv[1] MV_OP;\
  712. return s->current_picture_ptr->ref_index[list][(x4>>1) + (y4>>1)*h->b8_stride] REF_OP;
  713. SET_DIAG_MV(*2, >>1, s->mb_x*4+(i&7)-4+part_width, s->mb_y*4-1);
  714. }
  715. }
  716. if(topright_ref == PART_NOT_AVAILABLE
  717. && ((s->mb_y&1) || i >= scan8[0]+8) && (i&7)==4
  718. && h->ref_cache[list][scan8[0]-1] != PART_NOT_AVAILABLE){
  719. if(!MB_FIELD
  720. && IS_INTERLACED(mb_types[h->left_mb_xy[0]])){
  721. SET_DIAG_MV(*2, >>1, s->mb_x*4-1, (s->mb_y|1)*4+(s->mb_y&1)*2+(i>>4)-1);
  722. }
  723. if(MB_FIELD
  724. && !IS_INTERLACED(mb_types[h->left_mb_xy[0]])
  725. && i >= scan8[0]+8){
  726. // leftshift will turn LIST_NOT_USED into PART_NOT_AVAILABLE, but that's ok.
  727. SET_DIAG_MV(>>1, <<1, s->mb_x*4-1, (s->mb_y&~1)*4 - 1 + ((i-scan8[0])>>3)*2);
  728. }
  729. }
  730. #undef SET_DIAG_MV
  731. }
  732. if(topright_ref != PART_NOT_AVAILABLE){
  733. *C= h->mv_cache[list][ i - 8 + part_width ];
  734. return topright_ref;
  735. }else{
  736. tprintf(s->avctx, "topright MV not available\n");
  737. *C= h->mv_cache[list][ i - 8 - 1 ];
  738. return h->ref_cache[list][ i - 8 - 1 ];
  739. }
  740. }
  741. /**
  742. * gets the predicted MV.
  743. * @param n the block index
  744. * @param part_width the width of the partition (4, 8,16) -> (1, 2, 4)
  745. * @param mx the x component of the predicted motion vector
  746. * @param my the y component of the predicted motion vector
  747. */
  748. static inline void pred_motion(H264Context * const h, int n, int part_width, int list, int ref, int * const mx, int * const my){
  749. const int index8= scan8[n];
  750. const int top_ref= h->ref_cache[list][ index8 - 8 ];
  751. const int left_ref= h->ref_cache[list][ index8 - 1 ];
  752. const int16_t * const A= h->mv_cache[list][ index8 - 1 ];
  753. const int16_t * const B= h->mv_cache[list][ index8 - 8 ];
  754. const int16_t * C;
  755. int diagonal_ref, match_count;
  756. assert(part_width==1 || part_width==2 || part_width==4);
  757. /* mv_cache
  758. B . . A T T T T
  759. U . . L . . , .
  760. U . . L . . . .
  761. U . . L . . , .
  762. . . . L . . . .
  763. */
  764. diagonal_ref= fetch_diagonal_mv(h, &C, index8, list, part_width);
  765. match_count= (diagonal_ref==ref) + (top_ref==ref) + (left_ref==ref);
  766. tprintf(h->s.avctx, "pred_motion match_count=%d\n", match_count);
  767. if(match_count > 1){ //most common
  768. *mx= mid_pred(A[0], B[0], C[0]);
  769. *my= mid_pred(A[1], B[1], C[1]);
  770. }else if(match_count==1){
  771. if(left_ref==ref){
  772. *mx= A[0];
  773. *my= A[1];
  774. }else if(top_ref==ref){
  775. *mx= B[0];
  776. *my= B[1];
  777. }else{
  778. *mx= C[0];
  779. *my= C[1];
  780. }
  781. }else{
  782. if(top_ref == PART_NOT_AVAILABLE && diagonal_ref == PART_NOT_AVAILABLE && left_ref != PART_NOT_AVAILABLE){
  783. *mx= A[0];
  784. *my= A[1];
  785. }else{
  786. *mx= mid_pred(A[0], B[0], C[0]);
  787. *my= mid_pred(A[1], B[1], C[1]);
  788. }
  789. }
  790. 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);
  791. }
  792. /**
  793. * gets the directionally predicted 16x8 MV.
  794. * @param n the block index
  795. * @param mx the x component of the predicted motion vector
  796. * @param my the y component of the predicted motion vector
  797. */
  798. static inline void pred_16x8_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  799. if(n==0){
  800. const int top_ref= h->ref_cache[list][ scan8[0] - 8 ];
  801. const int16_t * const B= h->mv_cache[list][ scan8[0] - 8 ];
  802. 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);
  803. if(top_ref == ref){
  804. *mx= B[0];
  805. *my= B[1];
  806. return;
  807. }
  808. }else{
  809. const int left_ref= h->ref_cache[list][ scan8[8] - 1 ];
  810. const int16_t * const A= h->mv_cache[list][ scan8[8] - 1 ];
  811. 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);
  812. if(left_ref == ref){
  813. *mx= A[0];
  814. *my= A[1];
  815. return;
  816. }
  817. }
  818. //RARE
  819. pred_motion(h, n, 4, list, ref, mx, my);
  820. }
  821. /**
  822. * gets the directionally predicted 8x16 MV.
  823. * @param n the block index
  824. * @param mx the x component of the predicted motion vector
  825. * @param my the y component of the predicted motion vector
  826. */
  827. static inline void pred_8x16_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  828. if(n==0){
  829. const int left_ref= h->ref_cache[list][ scan8[0] - 1 ];
  830. const int16_t * const A= h->mv_cache[list][ scan8[0] - 1 ];
  831. 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);
  832. if(left_ref == ref){
  833. *mx= A[0];
  834. *my= A[1];
  835. return;
  836. }
  837. }else{
  838. const int16_t * C;
  839. int diagonal_ref;
  840. diagonal_ref= fetch_diagonal_mv(h, &C, scan8[4], list, 2);
  841. 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);
  842. if(diagonal_ref == ref){
  843. *mx= C[0];
  844. *my= C[1];
  845. return;
  846. }
  847. }
  848. //RARE
  849. pred_motion(h, n, 2, list, ref, mx, my);
  850. }
  851. static inline void pred_pskip_motion(H264Context * const h, int * const mx, int * const my){
  852. const int top_ref = h->ref_cache[0][ scan8[0] - 8 ];
  853. const int left_ref= h->ref_cache[0][ scan8[0] - 1 ];
  854. tprintf(h->s.avctx, "pred_pskip: (%d) (%d) at %2d %2d\n", top_ref, left_ref, h->s.mb_x, h->s.mb_y);
  855. if(top_ref == PART_NOT_AVAILABLE || left_ref == PART_NOT_AVAILABLE
  856. || (top_ref == 0 && *(uint32_t*)h->mv_cache[0][ scan8[0] - 8 ] == 0)
  857. || (left_ref == 0 && *(uint32_t*)h->mv_cache[0][ scan8[0] - 1 ] == 0)){
  858. *mx = *my = 0;
  859. return;
  860. }
  861. pred_motion(h, 0, 4, 0, 0, mx, my);
  862. return;
  863. }
  864. static inline void direct_dist_scale_factor(H264Context * const h){
  865. const int poc = h->s.current_picture_ptr->poc;
  866. const int poc1 = h->ref_list[1][0].poc;
  867. int i;
  868. for(i=0; i<h->ref_count[0]; i++){
  869. int poc0 = h->ref_list[0][i].poc;
  870. int td = av_clip(poc1 - poc0, -128, 127);
  871. if(td == 0 /* FIXME || pic0 is a long-term ref */){
  872. h->dist_scale_factor[i] = 256;
  873. }else{
  874. int tb = av_clip(poc - poc0, -128, 127);
  875. int tx = (16384 + (FFABS(td) >> 1)) / td;
  876. h->dist_scale_factor[i] = av_clip((tb*tx + 32) >> 6, -1024, 1023);
  877. }
  878. }
  879. if(FRAME_MBAFF){
  880. for(i=0; i<h->ref_count[0]; i++){
  881. h->dist_scale_factor_field[2*i] =
  882. h->dist_scale_factor_field[2*i+1] = h->dist_scale_factor[i];
  883. }
  884. }
  885. }
  886. static inline void direct_ref_list_init(H264Context * const h){
  887. MpegEncContext * const s = &h->s;
  888. Picture * const ref1 = &h->ref_list[1][0];
  889. Picture * const cur = s->current_picture_ptr;
  890. int list, i, j;
  891. if(cur->pict_type == I_TYPE)
  892. cur->ref_count[0] = 0;
  893. if(cur->pict_type != B_TYPE)
  894. cur->ref_count[1] = 0;
  895. for(list=0; list<2; list++){
  896. cur->ref_count[list] = h->ref_count[list];
  897. for(j=0; j<h->ref_count[list]; j++)
  898. cur->ref_poc[list][j] = h->ref_list[list][j].poc;
  899. }
  900. if(cur->pict_type != B_TYPE || h->direct_spatial_mv_pred)
  901. return;
  902. for(list=0; list<2; list++){
  903. for(i=0; i<ref1->ref_count[list]; i++){
  904. const int poc = ref1->ref_poc[list][i];
  905. h->map_col_to_list0[list][i] = 0; /* bogus; fills in for missing frames */
  906. for(j=0; j<h->ref_count[list]; j++)
  907. if(h->ref_list[list][j].poc == poc){
  908. h->map_col_to_list0[list][i] = j;
  909. break;
  910. }
  911. }
  912. }
  913. if(FRAME_MBAFF){
  914. for(list=0; list<2; list++){
  915. for(i=0; i<ref1->ref_count[list]; i++){
  916. j = h->map_col_to_list0[list][i];
  917. h->map_col_to_list0_field[list][2*i] = 2*j;
  918. h->map_col_to_list0_field[list][2*i+1] = 2*j+1;
  919. }
  920. }
  921. }
  922. }
  923. static inline void pred_direct_motion(H264Context * const h, int *mb_type){
  924. MpegEncContext * const s = &h->s;
  925. const int mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  926. const int b8_xy = 2*s->mb_x + 2*s->mb_y*h->b8_stride;
  927. const int b4_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;
  928. const int mb_type_col = h->ref_list[1][0].mb_type[mb_xy];
  929. const int16_t (*l1mv0)[2] = (const int16_t (*)[2]) &h->ref_list[1][0].motion_val[0][b4_xy];
  930. const int16_t (*l1mv1)[2] = (const int16_t (*)[2]) &h->ref_list[1][0].motion_val[1][b4_xy];
  931. const int8_t *l1ref0 = &h->ref_list[1][0].ref_index[0][b8_xy];
  932. const int8_t *l1ref1 = &h->ref_list[1][0].ref_index[1][b8_xy];
  933. const int is_b8x8 = IS_8X8(*mb_type);
  934. unsigned int sub_mb_type;
  935. int i8, i4;
  936. #define MB_TYPE_16x16_OR_INTRA (MB_TYPE_16x16|MB_TYPE_INTRA4x4|MB_TYPE_INTRA16x16|MB_TYPE_INTRA_PCM)
  937. if(IS_8X8(mb_type_col) && !h->sps.direct_8x8_inference_flag){
  938. /* FIXME save sub mb types from previous frames (or derive from MVs)
  939. * so we know exactly what block size to use */
  940. sub_mb_type = MB_TYPE_8x8|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_4x4 */
  941. *mb_type = MB_TYPE_8x8|MB_TYPE_L0L1;
  942. }else if(!is_b8x8 && (mb_type_col & MB_TYPE_16x16_OR_INTRA)){
  943. sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */
  944. *mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_16x16 */
  945. }else{
  946. sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */
  947. *mb_type = MB_TYPE_8x8|MB_TYPE_L0L1;
  948. }
  949. if(!is_b8x8)
  950. *mb_type |= MB_TYPE_DIRECT2;
  951. if(MB_FIELD)
  952. *mb_type |= MB_TYPE_INTERLACED;
  953. 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);
  954. if(h->direct_spatial_mv_pred){
  955. int ref[2];
  956. int mv[2][2];
  957. int list;
  958. /* FIXME interlacing + spatial direct uses wrong colocated block positions */
  959. /* ref = min(neighbors) */
  960. for(list=0; list<2; list++){
  961. int refa = h->ref_cache[list][scan8[0] - 1];
  962. int refb = h->ref_cache[list][scan8[0] - 8];
  963. int refc = h->ref_cache[list][scan8[0] - 8 + 4];
  964. if(refc == -2)
  965. refc = h->ref_cache[list][scan8[0] - 8 - 1];
  966. ref[list] = refa;
  967. if(ref[list] < 0 || (refb < ref[list] && refb >= 0))
  968. ref[list] = refb;
  969. if(ref[list] < 0 || (refc < ref[list] && refc >= 0))
  970. ref[list] = refc;
  971. if(ref[list] < 0)
  972. ref[list] = -1;
  973. }
  974. if(ref[0] < 0 && ref[1] < 0){
  975. ref[0] = ref[1] = 0;
  976. mv[0][0] = mv[0][1] =
  977. mv[1][0] = mv[1][1] = 0;
  978. }else{
  979. for(list=0; list<2; list++){
  980. if(ref[list] >= 0)
  981. pred_motion(h, 0, 4, list, ref[list], &mv[list][0], &mv[list][1]);
  982. else
  983. mv[list][0] = mv[list][1] = 0;
  984. }
  985. }
  986. if(ref[1] < 0){
  987. *mb_type &= ~MB_TYPE_P0L1;
  988. sub_mb_type &= ~MB_TYPE_P0L1;
  989. }else if(ref[0] < 0){
  990. *mb_type &= ~MB_TYPE_P0L0;
  991. sub_mb_type &= ~MB_TYPE_P0L0;
  992. }
  993. if(IS_16X16(*mb_type)){
  994. int a=0, b=0;
  995. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, (uint8_t)ref[0], 1);
  996. fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, (uint8_t)ref[1], 1);
  997. if(!IS_INTRA(mb_type_col)
  998. && ( (l1ref0[0] == 0 && FFABS(l1mv0[0][0]) <= 1 && FFABS(l1mv0[0][1]) <= 1)
  999. || (l1ref0[0] < 0 && l1ref1[0] == 0 && FFABS(l1mv1[0][0]) <= 1 && FFABS(l1mv1[0][1]) <= 1
  1000. && (h->x264_build>33 || !h->x264_build)))){
  1001. if(ref[0] > 0)
  1002. a= pack16to32(mv[0][0],mv[0][1]);
  1003. if(ref[1] > 0)
  1004. b= pack16to32(mv[1][0],mv[1][1]);
  1005. }else{
  1006. a= pack16to32(mv[0][0],mv[0][1]);
  1007. b= pack16to32(mv[1][0],mv[1][1]);
  1008. }
  1009. fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, a, 4);
  1010. fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, b, 4);
  1011. }else{
  1012. for(i8=0; i8<4; i8++){
  1013. const int x8 = i8&1;
  1014. const int y8 = i8>>1;
  1015. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  1016. continue;
  1017. h->sub_mb_type[i8] = sub_mb_type;
  1018. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mv[0][0],mv[0][1]), 4);
  1019. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mv[1][0],mv[1][1]), 4);
  1020. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[0], 1);
  1021. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[1], 1);
  1022. /* col_zero_flag */
  1023. if(!IS_INTRA(mb_type_col) && ( l1ref0[x8 + y8*h->b8_stride] == 0
  1024. || (l1ref0[x8 + y8*h->b8_stride] < 0 && l1ref1[x8 + y8*h->b8_stride] == 0
  1025. && (h->x264_build>33 || !h->x264_build)))){
  1026. const int16_t (*l1mv)[2]= l1ref0[x8 + y8*h->b8_stride] == 0 ? l1mv0 : l1mv1;
  1027. if(IS_SUB_8X8(sub_mb_type)){
  1028. const int16_t *mv_col = l1mv[x8*3 + y8*3*h->b_stride];
  1029. if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){
  1030. if(ref[0] == 0)
  1031. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);
  1032. if(ref[1] == 0)
  1033. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);
  1034. }
  1035. }else
  1036. for(i4=0; i4<4; i4++){
  1037. const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];
  1038. if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){
  1039. if(ref[0] == 0)
  1040. *(uint32_t*)h->mv_cache[0][scan8[i8*4+i4]] = 0;
  1041. if(ref[1] == 0)
  1042. *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] = 0;
  1043. }
  1044. }
  1045. }
  1046. }
  1047. }
  1048. }else{ /* direct temporal mv pred */
  1049. const int *map_col_to_list0[2] = {h->map_col_to_list0[0], h->map_col_to_list0[1]};
  1050. const int *dist_scale_factor = h->dist_scale_factor;
  1051. if(FRAME_MBAFF){
  1052. if(IS_INTERLACED(*mb_type)){
  1053. map_col_to_list0[0] = h->map_col_to_list0_field[0];
  1054. map_col_to_list0[1] = h->map_col_to_list0_field[1];
  1055. dist_scale_factor = h->dist_scale_factor_field;
  1056. }
  1057. if(IS_INTERLACED(*mb_type) != IS_INTERLACED(mb_type_col)){
  1058. /* FIXME assumes direct_8x8_inference == 1 */
  1059. const int pair_xy = s->mb_x + (s->mb_y&~1)*s->mb_stride;
  1060. int mb_types_col[2];
  1061. int y_shift;
  1062. *mb_type = MB_TYPE_8x8|MB_TYPE_L0L1
  1063. | (is_b8x8 ? 0 : MB_TYPE_DIRECT2)
  1064. | (*mb_type & MB_TYPE_INTERLACED);
  1065. sub_mb_type = MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2|MB_TYPE_16x16;
  1066. if(IS_INTERLACED(*mb_type)){
  1067. /* frame to field scaling */
  1068. mb_types_col[0] = h->ref_list[1][0].mb_type[pair_xy];
  1069. mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy+s->mb_stride];
  1070. if(s->mb_y&1){
  1071. l1ref0 -= 2*h->b8_stride;
  1072. l1ref1 -= 2*h->b8_stride;
  1073. l1mv0 -= 4*h->b_stride;
  1074. l1mv1 -= 4*h->b_stride;
  1075. }
  1076. y_shift = 0;
  1077. if( (mb_types_col[0] & MB_TYPE_16x16_OR_INTRA)
  1078. && (mb_types_col[1] & MB_TYPE_16x16_OR_INTRA)
  1079. && !is_b8x8)
  1080. *mb_type |= MB_TYPE_16x8;
  1081. else
  1082. *mb_type |= MB_TYPE_8x8;
  1083. }else{
  1084. /* field to frame scaling */
  1085. /* col_mb_y = (mb_y&~1) + (topAbsDiffPOC < bottomAbsDiffPOC ? 0 : 1)
  1086. * but in MBAFF, top and bottom POC are equal */
  1087. int dy = (s->mb_y&1) ? 1 : 2;
  1088. mb_types_col[0] =
  1089. mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy+s->mb_stride];
  1090. l1ref0 += dy*h->b8_stride;
  1091. l1ref1 += dy*h->b8_stride;
  1092. l1mv0 += 2*dy*h->b_stride;
  1093. l1mv1 += 2*dy*h->b_stride;
  1094. y_shift = 2;
  1095. if((mb_types_col[0] & (MB_TYPE_16x16_OR_INTRA|MB_TYPE_16x8))
  1096. && !is_b8x8)
  1097. *mb_type |= MB_TYPE_16x16;
  1098. else
  1099. *mb_type |= MB_TYPE_8x8;
  1100. }
  1101. for(i8=0; i8<4; i8++){
  1102. const int x8 = i8&1;
  1103. const int y8 = i8>>1;
  1104. int ref0, scale;
  1105. const int16_t (*l1mv)[2]= l1mv0;
  1106. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  1107. continue;
  1108. h->sub_mb_type[i8] = sub_mb_type;
  1109. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);
  1110. if(IS_INTRA(mb_types_col[y8])){
  1111. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);
  1112. fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);
  1113. fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);
  1114. continue;
  1115. }
  1116. ref0 = l1ref0[x8 + (y8*2>>y_shift)*h->b8_stride];
  1117. if(ref0 >= 0)
  1118. ref0 = map_col_to_list0[0][ref0*2>>y_shift];
  1119. else{
  1120. ref0 = map_col_to_list0[1][l1ref1[x8 + (y8*2>>y_shift)*h->b8_stride]*2>>y_shift];
  1121. l1mv= l1mv1;
  1122. }
  1123. scale = dist_scale_factor[ref0];
  1124. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);
  1125. {
  1126. const int16_t *mv_col = l1mv[x8*3 + (y8*6>>y_shift)*h->b_stride];
  1127. int my_col = (mv_col[1]<<y_shift)/2;
  1128. int mx = (scale * mv_col[0] + 128) >> 8;
  1129. int my = (scale * my_col + 128) >> 8;
  1130. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);
  1131. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-my_col), 4);
  1132. }
  1133. }
  1134. return;
  1135. }
  1136. }
  1137. /* one-to-one mv scaling */
  1138. if(IS_16X16(*mb_type)){
  1139. int ref, mv0, mv1;
  1140. fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, 0, 1);
  1141. if(IS_INTRA(mb_type_col)){
  1142. ref=mv0=mv1=0;
  1143. }else{
  1144. const int ref0 = l1ref0[0] >= 0 ? map_col_to_list0[0][l1ref0[0]]
  1145. : map_col_to_list0[1][l1ref1[0]];
  1146. const int scale = dist_scale_factor[ref0];
  1147. const int16_t *mv_col = l1ref0[0] >= 0 ? l1mv0[0] : l1mv1[0];
  1148. int mv_l0[2];
  1149. mv_l0[0] = (scale * mv_col[0] + 128) >> 8;
  1150. mv_l0[1] = (scale * mv_col[1] + 128) >> 8;
  1151. ref= ref0;
  1152. mv0= pack16to32(mv_l0[0],mv_l0[1]);
  1153. mv1= pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);
  1154. }
  1155. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref, 1);
  1156. fill_rectangle(&h-> mv_cache[0][scan8[0]], 4, 4, 8, mv0, 4);
  1157. fill_rectangle(&h-> mv_cache[1][scan8[0]], 4, 4, 8, mv1, 4);
  1158. }else{
  1159. for(i8=0; i8<4; i8++){
  1160. const int x8 = i8&1;
  1161. const int y8 = i8>>1;
  1162. int ref0, scale;
  1163. const int16_t (*l1mv)[2]= l1mv0;
  1164. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  1165. continue;
  1166. h->sub_mb_type[i8] = sub_mb_type;
  1167. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);
  1168. if(IS_INTRA(mb_type_col)){
  1169. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);
  1170. fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);
  1171. fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);
  1172. continue;
  1173. }
  1174. ref0 = l1ref0[x8 + y8*h->b8_stride];
  1175. if(ref0 >= 0)
  1176. ref0 = map_col_to_list0[0][ref0];
  1177. else{
  1178. ref0 = map_col_to_list0[1][l1ref1[x8 + y8*h->b8_stride]];
  1179. l1mv= l1mv1;
  1180. }
  1181. scale = dist_scale_factor[ref0];
  1182. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);
  1183. if(IS_SUB_8X8(sub_mb_type)){
  1184. const int16_t *mv_col = l1mv[x8*3 + y8*3*h->b_stride];
  1185. int mx = (scale * mv_col[0] + 128) >> 8;
  1186. int my = (scale * mv_col[1] + 128) >> 8;
  1187. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);
  1188. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-mv_col[1]), 4);
  1189. }else
  1190. for(i4=0; i4<4; i4++){
  1191. const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];
  1192. int16_t *mv_l0 = h->mv_cache[0][scan8[i8*4+i4]];
  1193. mv_l0[0] = (scale * mv_col[0] + 128) >> 8;
  1194. mv_l0[1] = (scale * mv_col[1] + 128) >> 8;
  1195. *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] =
  1196. pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);
  1197. }
  1198. }
  1199. }
  1200. }
  1201. }
  1202. static inline void write_back_motion(H264Context *h, int mb_type){
  1203. MpegEncContext * const s = &h->s;
  1204. const int b_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;
  1205. const int b8_xy= 2*s->mb_x + 2*s->mb_y*h->b8_stride;
  1206. int list;
  1207. if(!USES_LIST(mb_type, 0))
  1208. fill_rectangle(&s->current_picture.ref_index[0][b8_xy], 2, 2, h->b8_stride, (uint8_t)LIST_NOT_USED, 1);
  1209. for(list=0; list<h->list_count; list++){
  1210. int y;
  1211. if(!USES_LIST(mb_type, list))
  1212. continue;
  1213. for(y=0; y<4; y++){
  1214. *(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];
  1215. *(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];
  1216. }
  1217. if( h->pps.cabac ) {
  1218. if(IS_SKIP(mb_type))
  1219. fill_rectangle(h->mvd_table[list][b_xy], 4, 4, h->b_stride, 0, 4);
  1220. else
  1221. for(y=0; y<4; y++){
  1222. *(uint64_t*)h->mvd_table[list][b_xy + 0 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+0 + 8*y];
  1223. *(uint64_t*)h->mvd_table[list][b_xy + 2 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+2 + 8*y];
  1224. }
  1225. }
  1226. {
  1227. int8_t *ref_index = &s->current_picture.ref_index[list][b8_xy];
  1228. ref_index[0+0*h->b8_stride]= h->ref_cache[list][scan8[0]];
  1229. ref_index[1+0*h->b8_stride]= h->ref_cache[list][scan8[4]];
  1230. ref_index[0+1*h->b8_stride]= h->ref_cache[list][scan8[8]];
  1231. ref_index[1+1*h->b8_stride]= h->ref_cache[list][scan8[12]];
  1232. }
  1233. }
  1234. if(h->slice_type == B_TYPE && h->pps.cabac){
  1235. if(IS_8X8(mb_type)){
  1236. uint8_t *direct_table = &h->direct_table[b8_xy];
  1237. direct_table[1+0*h->b8_stride] = IS_DIRECT(h->sub_mb_type[1]) ? 1 : 0;
  1238. direct_table[0+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[2]) ? 1 : 0;
  1239. direct_table[1+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[3]) ? 1 : 0;
  1240. }
  1241. }
  1242. }
  1243. /**
  1244. * Decodes a network abstraction layer unit.
  1245. * @param consumed is the number of bytes used as input
  1246. * @param length is the length of the array
  1247. * @param dst_length is the number of decoded bytes FIXME here or a decode rbsp tailing?
  1248. * @returns decoded bytes, might be src+1 if no escapes
  1249. */
  1250. static uint8_t *decode_nal(H264Context *h, uint8_t *src, int *dst_length, int *consumed, int length){
  1251. int i, si, di;
  1252. uint8_t *dst;
  1253. int bufidx;
  1254. // src[0]&0x80; //forbidden bit
  1255. h->nal_ref_idc= src[0]>>5;
  1256. h->nal_unit_type= src[0]&0x1F;
  1257. src++; length--;
  1258. #if 0
  1259. for(i=0; i<length; i++)
  1260. printf("%2X ", src[i]);
  1261. #endif
  1262. for(i=0; i+1<length; i+=2){
  1263. if(src[i]) continue;
  1264. if(i>0 && src[i-1]==0) i--;
  1265. if(i+2<length && src[i+1]==0 && src[i+2]<=3){
  1266. if(src[i+2]!=3){
  1267. /* startcode, so we must be past the end */
  1268. length=i;
  1269. }
  1270. break;
  1271. }
  1272. }
  1273. if(i>=length-1){ //no escaped 0
  1274. *dst_length= length;
  1275. *consumed= length+1; //+1 for the header
  1276. return src;
  1277. }
  1278. bufidx = h->nal_unit_type == NAL_DPC ? 1 : 0; // use second escape buffer for inter data
  1279. h->rbsp_buffer[bufidx]= av_fast_realloc(h->rbsp_buffer[bufidx], &h->rbsp_buffer_size[bufidx], length);
  1280. dst= h->rbsp_buffer[bufidx];
  1281. if (dst == NULL){
  1282. return NULL;
  1283. }
  1284. //printf("decoding esc\n");
  1285. si=di=0;
  1286. while(si<length){
  1287. //remove escapes (very rare 1:2^22)
  1288. if(si+2<length && src[si]==0 && src[si+1]==0 && src[si+2]<=3){
  1289. if(src[si+2]==3){ //escape
  1290. dst[di++]= 0;
  1291. dst[di++]= 0;
  1292. si+=3;
  1293. continue;
  1294. }else //next start code
  1295. break;
  1296. }
  1297. dst[di++]= src[si++];
  1298. }
  1299. *dst_length= di;
  1300. *consumed= si + 1;//+1 for the header
  1301. //FIXME store exact number of bits in the getbitcontext (it is needed for decoding)
  1302. return dst;
  1303. }
  1304. /**
  1305. * identifies the exact end of the bitstream
  1306. * @return the length of the trailing, or 0 if damaged
  1307. */
  1308. static int decode_rbsp_trailing(H264Context *h, uint8_t *src){
  1309. int v= *src;
  1310. int r;
  1311. tprintf(h->s.avctx, "rbsp trailing %X\n", v);
  1312. for(r=1; r<9; r++){
  1313. if(v&1) return r;
  1314. v>>=1;
  1315. }
  1316. return 0;
  1317. }
  1318. /**
  1319. * idct tranforms the 16 dc values and dequantize them.
  1320. * @param qp quantization parameter
  1321. */
  1322. static void h264_luma_dc_dequant_idct_c(DCTELEM *block, int qp, int qmul){
  1323. #define stride 16
  1324. int i;
  1325. int temp[16]; //FIXME check if this is a good idea
  1326. static const int x_offset[4]={0, 1*stride, 4* stride, 5*stride};
  1327. static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};
  1328. //memset(block, 64, 2*256);
  1329. //return;
  1330. for(i=0; i<4; i++){
  1331. const int offset= y_offset[i];
  1332. const int z0= block[offset+stride*0] + block[offset+stride*4];
  1333. const int z1= block[offset+stride*0] - block[offset+stride*4];
  1334. const int z2= block[offset+stride*1] - block[offset+stride*5];
  1335. const int z3= block[offset+stride*1] + block[offset+stride*5];
  1336. temp[4*i+0]= z0+z3;
  1337. temp[4*i+1]= z1+z2;
  1338. temp[4*i+2]= z1-z2;
  1339. temp[4*i+3]= z0-z3;
  1340. }
  1341. for(i=0; i<4; i++){
  1342. const int offset= x_offset[i];
  1343. const int z0= temp[4*0+i] + temp[4*2+i];
  1344. const int z1= temp[4*0+i] - temp[4*2+i];
  1345. const int z2= temp[4*1+i] - temp[4*3+i];
  1346. const int z3= temp[4*1+i] + temp[4*3+i];
  1347. block[stride*0 +offset]= ((((z0 + z3)*qmul + 128 ) >> 8)); //FIXME think about merging this into decode_resdual
  1348. block[stride*2 +offset]= ((((z1 + z2)*qmul + 128 ) >> 8));
  1349. block[stride*8 +offset]= ((((z1 - z2)*qmul + 128 ) >> 8));
  1350. block[stride*10+offset]= ((((z0 - z3)*qmul + 128 ) >> 8));
  1351. }
  1352. }
  1353. #if 0
  1354. /**
  1355. * dct tranforms the 16 dc values.
  1356. * @param qp quantization parameter ??? FIXME
  1357. */
  1358. static void h264_luma_dc_dct_c(DCTELEM *block/*, int qp*/){
  1359. // const int qmul= dequant_coeff[qp][0];
  1360. int i;
  1361. int temp[16]; //FIXME check if this is a good idea
  1362. static const int x_offset[4]={0, 1*stride, 4* stride, 5*stride};
  1363. static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};
  1364. for(i=0; i<4; i++){
  1365. const int offset= y_offset[i];
  1366. const int z0= block[offset+stride*0] + block[offset+stride*4];
  1367. const int z1= block[offset+stride*0] - block[offset+stride*4];
  1368. const int z2= block[offset+stride*1] - block[offset+stride*5];
  1369. const int z3= block[offset+stride*1] + block[offset+stride*5];
  1370. temp[4*i+0]= z0+z3;
  1371. temp[4*i+1]= z1+z2;
  1372. temp[4*i+2]= z1-z2;
  1373. temp[4*i+3]= z0-z3;
  1374. }
  1375. for(i=0; i<4; i++){
  1376. const int offset= x_offset[i];
  1377. const int z0= temp[4*0+i] + temp[4*2+i];
  1378. const int z1= temp[4*0+i] - temp[4*2+i];
  1379. const int z2= temp[4*1+i] - temp[4*3+i];
  1380. const int z3= temp[4*1+i] + temp[4*3+i];
  1381. block[stride*0 +offset]= (z0 + z3)>>1;
  1382. block[stride*2 +offset]= (z1 + z2)>>1;
  1383. block[stride*8 +offset]= (z1 - z2)>>1;
  1384. block[stride*10+offset]= (z0 - z3)>>1;
  1385. }
  1386. }
  1387. #endif
  1388. #undef xStride
  1389. #undef stride
  1390. static void chroma_dc_dequant_idct_c(DCTELEM *block, int qp, int qmul){
  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)*qmul) >> 7;
  1403. block[stride*0 + xStride*1]= ((e+b)*qmul) >> 7;
  1404. block[stride*1 + xStride*0]= ((a-c)*qmul) >> 7;
  1405. block[stride*1 + xStride*1]= ((e-b)*qmul) >> 7;
  1406. }
  1407. #if 0
  1408. static void chroma_dc_dct_c(DCTELEM *block){
  1409. const int stride= 16*2;
  1410. const int xStride= 16;
  1411. int a,b,c,d,e;
  1412. a= block[stride*0 + xStride*0];
  1413. b= block[stride*0 + xStride*1];
  1414. c= block[stride*1 + xStride*0];
  1415. d= block[stride*1 + xStride*1];
  1416. e= a-b;
  1417. a= a+b;
  1418. b= c-d;
  1419. c= c+d;
  1420. block[stride*0 + xStride*0]= (a+c);
  1421. block[stride*0 + xStride*1]= (e+b);
  1422. block[stride*1 + xStride*0]= (a-c);
  1423. block[stride*1 + xStride*1]= (e-b);
  1424. }
  1425. #endif
  1426. /**
  1427. * gets the chroma qp.
  1428. */
  1429. static inline int get_chroma_qp(H264Context *h, int t, int qscale){
  1430. return h->pps.chroma_qp_table[t][qscale & 0xff];
  1431. }
  1432. //FIXME need to check that this does not overflow signed 32 bit for low qp, i am not sure, it's very close
  1433. //FIXME check that gcc inlines this (and optimizes intra & separate_dc stuff away)
  1434. static inline int quantize_c(DCTELEM *block, uint8_t *scantable, int qscale, int intra, int separate_dc){
  1435. int i;
  1436. const int * const quant_table= quant_coeff[qscale];
  1437. const int bias= intra ? (1<<QUANT_SHIFT)/3 : (1<<QUANT_SHIFT)/6;
  1438. const unsigned int threshold1= (1<<QUANT_SHIFT) - bias - 1;
  1439. const unsigned int threshold2= (threshold1<<1);
  1440. int last_non_zero;
  1441. if(separate_dc){
  1442. if(qscale<=18){
  1443. //avoid overflows
  1444. const int dc_bias= intra ? (1<<(QUANT_SHIFT-2))/3 : (1<<(QUANT_SHIFT-2))/6;
  1445. const unsigned int dc_threshold1= (1<<(QUANT_SHIFT-2)) - dc_bias - 1;
  1446. const unsigned int dc_threshold2= (dc_threshold1<<1);
  1447. int level= block[0]*quant_coeff[qscale+18][0];
  1448. if(((unsigned)(level+dc_threshold1))>dc_threshold2){
  1449. if(level>0){
  1450. level= (dc_bias + level)>>(QUANT_SHIFT-2);
  1451. block[0]= level;
  1452. }else{
  1453. level= (dc_bias - level)>>(QUANT_SHIFT-2);
  1454. block[0]= -level;
  1455. }
  1456. // last_non_zero = i;
  1457. }else{
  1458. block[0]=0;
  1459. }
  1460. }else{
  1461. const int dc_bias= intra ? (1<<(QUANT_SHIFT+1))/3 : (1<<(QUANT_SHIFT+1))/6;
  1462. const unsigned int dc_threshold1= (1<<(QUANT_SHIFT+1)) - dc_bias - 1;
  1463. const unsigned int dc_threshold2= (dc_threshold1<<1);
  1464. int level= block[0]*quant_table[0];
  1465. if(((unsigned)(level+dc_threshold1))>dc_threshold2){
  1466. if(level>0){
  1467. level= (dc_bias + level)>>(QUANT_SHIFT+1);
  1468. block[0]= level;
  1469. }else{
  1470. level= (dc_bias - level)>>(QUANT_SHIFT+1);
  1471. block[0]= -level;
  1472. }
  1473. // last_non_zero = i;
  1474. }else{
  1475. block[0]=0;
  1476. }
  1477. }
  1478. last_non_zero= 0;
  1479. i=1;
  1480. }else{
  1481. last_non_zero= -1;
  1482. i=0;
  1483. }
  1484. for(; i<16; i++){
  1485. const int j= scantable[i];
  1486. int level= block[j]*quant_table[j];
  1487. // if( bias+level >= (1<<(QMAT_SHIFT - 3))
  1488. // || bias-level >= (1<<(QMAT_SHIFT - 3))){
  1489. if(((unsigned)(level+threshold1))>threshold2){
  1490. if(level>0){
  1491. level= (bias + level)>>QUANT_SHIFT;
  1492. block[j]= level;
  1493. }else{
  1494. level= (bias - level)>>QUANT_SHIFT;
  1495. block[j]= -level;
  1496. }
  1497. last_non_zero = i;
  1498. }else{
  1499. block[j]=0;
  1500. }
  1501. }
  1502. return last_non_zero;
  1503. }
  1504. static void pred4x4_vertical_c(uint8_t *src, uint8_t *topright, int stride){
  1505. const uint32_t a= ((uint32_t*)(src-stride))[0];
  1506. ((uint32_t*)(src+0*stride))[0]= a;
  1507. ((uint32_t*)(src+1*stride))[0]= a;
  1508. ((uint32_t*)(src+2*stride))[0]= a;
  1509. ((uint32_t*)(src+3*stride))[0]= a;
  1510. }
  1511. static void pred4x4_horizontal_c(uint8_t *src, uint8_t *topright, int stride){
  1512. ((uint32_t*)(src+0*stride))[0]= src[-1+0*stride]*0x01010101;
  1513. ((uint32_t*)(src+1*stride))[0]= src[-1+1*stride]*0x01010101;
  1514. ((uint32_t*)(src+2*stride))[0]= src[-1+2*stride]*0x01010101;
  1515. ((uint32_t*)(src+3*stride))[0]= src[-1+3*stride]*0x01010101;
  1516. }
  1517. static void pred4x4_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1518. const int dc= ( src[-stride] + src[1-stride] + src[2-stride] + src[3-stride]
  1519. + src[-1+0*stride] + src[-1+1*stride] + src[-1+2*stride] + src[-1+3*stride] + 4) >>3;
  1520. ((uint32_t*)(src+0*stride))[0]=
  1521. ((uint32_t*)(src+1*stride))[0]=
  1522. ((uint32_t*)(src+2*stride))[0]=
  1523. ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;
  1524. }
  1525. static void pred4x4_left_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1526. const int dc= ( src[-1+0*stride] + src[-1+1*stride] + src[-1+2*stride] + src[-1+3*stride] + 2) >>2;
  1527. ((uint32_t*)(src+0*stride))[0]=
  1528. ((uint32_t*)(src+1*stride))[0]=
  1529. ((uint32_t*)(src+2*stride))[0]=
  1530. ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;
  1531. }
  1532. static void pred4x4_top_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1533. const int dc= ( src[-stride] + src[1-stride] + src[2-stride] + src[3-stride] + 2) >>2;
  1534. ((uint32_t*)(src+0*stride))[0]=
  1535. ((uint32_t*)(src+1*stride))[0]=
  1536. ((uint32_t*)(src+2*stride))[0]=
  1537. ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;
  1538. }
  1539. static void pred4x4_128_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1540. ((uint32_t*)(src+0*stride))[0]=
  1541. ((uint32_t*)(src+1*stride))[0]=
  1542. ((uint32_t*)(src+2*stride))[0]=
  1543. ((uint32_t*)(src+3*stride))[0]= 128U*0x01010101U;
  1544. }
  1545. #define LOAD_TOP_RIGHT_EDGE\
  1546. const int av_unused t4= topright[0];\
  1547. const int av_unused t5= topright[1];\
  1548. const int av_unused t6= topright[2];\
  1549. const int av_unused t7= topright[3];\
  1550. #define LOAD_LEFT_EDGE\
  1551. const int av_unused l0= src[-1+0*stride];\
  1552. const int av_unused l1= src[-1+1*stride];\
  1553. const int av_unused l2= src[-1+2*stride];\
  1554. const int av_unused l3= src[-1+3*stride];\
  1555. #define LOAD_TOP_EDGE\
  1556. const int av_unused t0= src[ 0-1*stride];\
  1557. const int av_unused t1= src[ 1-1*stride];\
  1558. const int av_unused t2= src[ 2-1*stride];\
  1559. const int av_unused t3= src[ 3-1*stride];\
  1560. static void pred4x4_down_right_c(uint8_t *src, uint8_t *topright, int stride){
  1561. const int lt= src[-1-1*stride];
  1562. LOAD_TOP_EDGE
  1563. LOAD_LEFT_EDGE
  1564. src[0+3*stride]=(l3 + 2*l2 + l1 + 2)>>2;
  1565. src[0+2*stride]=
  1566. src[1+3*stride]=(l2 + 2*l1 + l0 + 2)>>2;
  1567. src[0+1*stride]=
  1568. src[1+2*stride]=
  1569. src[2+3*stride]=(l1 + 2*l0 + lt + 2)>>2;
  1570. src[0+0*stride]=
  1571. src[1+1*stride]=
  1572. src[2+2*stride]=
  1573. src[3+3*stride]=(l0 + 2*lt + t0 + 2)>>2;
  1574. src[1+0*stride]=
  1575. src[2+1*stride]=
  1576. src[3+2*stride]=(lt + 2*t0 + t1 + 2)>>2;
  1577. src[2+0*stride]=
  1578. src[3+1*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1579. src[3+0*stride]=(t1 + 2*t2 + t3 + 2)>>2;
  1580. }
  1581. static void pred4x4_down_left_c(uint8_t *src, uint8_t *topright, int stride){
  1582. LOAD_TOP_EDGE
  1583. LOAD_TOP_RIGHT_EDGE
  1584. // LOAD_LEFT_EDGE
  1585. src[0+0*stride]=(t0 + t2 + 2*t1 + 2)>>2;
  1586. src[1+0*stride]=
  1587. src[0+1*stride]=(t1 + t3 + 2*t2 + 2)>>2;
  1588. src[2+0*stride]=
  1589. src[1+1*stride]=
  1590. src[0+2*stride]=(t2 + t4 + 2*t3 + 2)>>2;
  1591. src[3+0*stride]=
  1592. src[2+1*stride]=
  1593. src[1+2*stride]=
  1594. src[0+3*stride]=(t3 + t5 + 2*t4 + 2)>>2;
  1595. src[3+1*stride]=
  1596. src[2+2*stride]=
  1597. src[1+3*stride]=(t4 + t6 + 2*t5 + 2)>>2;
  1598. src[3+2*stride]=
  1599. src[2+3*stride]=(t5 + t7 + 2*t6 + 2)>>2;
  1600. src[3+3*stride]=(t6 + 3*t7 + 2)>>2;
  1601. }
  1602. static void pred4x4_vertical_right_c(uint8_t *src, uint8_t *topright, int stride){
  1603. const int lt= src[-1-1*stride];
  1604. LOAD_TOP_EDGE
  1605. LOAD_LEFT_EDGE
  1606. src[0+0*stride]=
  1607. src[1+2*stride]=(lt + t0 + 1)>>1;
  1608. src[1+0*stride]=
  1609. src[2+2*stride]=(t0 + t1 + 1)>>1;
  1610. src[2+0*stride]=
  1611. src[3+2*stride]=(t1 + t2 + 1)>>1;
  1612. src[3+0*stride]=(t2 + t3 + 1)>>1;
  1613. src[0+1*stride]=
  1614. src[1+3*stride]=(l0 + 2*lt + t0 + 2)>>2;
  1615. src[1+1*stride]=
  1616. src[2+3*stride]=(lt + 2*t0 + t1 + 2)>>2;
  1617. src[2+1*stride]=
  1618. src[3+3*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1619. src[3+1*stride]=(t1 + 2*t2 + t3 + 2)>>2;
  1620. src[0+2*stride]=(lt + 2*l0 + l1 + 2)>>2;
  1621. src[0+3*stride]=(l0 + 2*l1 + l2 + 2)>>2;
  1622. }
  1623. static void pred4x4_vertical_left_c(uint8_t *src, uint8_t *topright, int stride){
  1624. LOAD_TOP_EDGE
  1625. LOAD_TOP_RIGHT_EDGE
  1626. src[0+0*stride]=(t0 + t1 + 1)>>1;
  1627. src[1+0*stride]=
  1628. src[0+2*stride]=(t1 + t2 + 1)>>1;
  1629. src[2+0*stride]=
  1630. src[1+2*stride]=(t2 + t3 + 1)>>1;
  1631. src[3+0*stride]=
  1632. src[2+2*stride]=(t3 + t4+ 1)>>1;
  1633. src[3+2*stride]=(t4 + t5+ 1)>>1;
  1634. src[0+1*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1635. src[1+1*stride]=
  1636. src[0+3*stride]=(t1 + 2*t2 + t3 + 2)>>2;
  1637. src[2+1*stride]=
  1638. src[1+3*stride]=(t2 + 2*t3 + t4 + 2)>>2;
  1639. src[3+1*stride]=
  1640. src[2+3*stride]=(t3 + 2*t4 + t5 + 2)>>2;
  1641. src[3+3*stride]=(t4 + 2*t5 + t6 + 2)>>2;
  1642. }
  1643. static void pred4x4_horizontal_up_c(uint8_t *src, uint8_t *topright, int stride){
  1644. LOAD_LEFT_EDGE
  1645. src[0+0*stride]=(l0 + l1 + 1)>>1;
  1646. src[1+0*stride]=(l0 + 2*l1 + l2 + 2)>>2;
  1647. src[2+0*stride]=
  1648. src[0+1*stride]=(l1 + l2 + 1)>>1;
  1649. src[3+0*stride]=
  1650. src[1+1*stride]=(l1 + 2*l2 + l3 + 2)>>2;
  1651. src[2+1*stride]=
  1652. src[0+2*stride]=(l2 + l3 + 1)>>1;
  1653. src[3+1*stride]=
  1654. src[1+2*stride]=(l2 + 2*l3 + l3 + 2)>>2;
  1655. src[3+2*stride]=
  1656. src[1+3*stride]=
  1657. src[0+3*stride]=
  1658. src[2+2*stride]=
  1659. src[2+3*stride]=
  1660. src[3+3*stride]=l3;
  1661. }
  1662. static void pred4x4_horizontal_down_c(uint8_t *src, uint8_t *topright, int stride){
  1663. const int lt= src[-1-1*stride];
  1664. LOAD_TOP_EDGE
  1665. LOAD_LEFT_EDGE
  1666. src[0+0*stride]=
  1667. src[2+1*stride]=(lt + l0 + 1)>>1;
  1668. src[1+0*stride]=
  1669. src[3+1*stride]=(l0 + 2*lt + t0 + 2)>>2;
  1670. src[2+0*stride]=(lt + 2*t0 + t1 + 2)>>2;
  1671. src[3+0*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1672. src[0+1*stride]=
  1673. src[2+2*stride]=(l0 + l1 + 1)>>1;
  1674. src[1+1*stride]=
  1675. src[3+2*stride]=(lt + 2*l0 + l1 + 2)>>2;
  1676. src[0+2*stride]=
  1677. src[2+3*stride]=(l1 + l2+ 1)>>1;
  1678. src[1+2*stride]=
  1679. src[3+3*stride]=(l0 + 2*l1 + l2 + 2)>>2;
  1680. src[0+3*stride]=(l2 + l3 + 1)>>1;
  1681. src[1+3*stride]=(l1 + 2*l2 + l3 + 2)>>2;
  1682. }
  1683. void ff_pred16x16_vertical_c(uint8_t *src, int stride){
  1684. int i;
  1685. const uint32_t a= ((uint32_t*)(src-stride))[0];
  1686. const uint32_t b= ((uint32_t*)(src-stride))[1];
  1687. const uint32_t c= ((uint32_t*)(src-stride))[2];
  1688. const uint32_t d= ((uint32_t*)(src-stride))[3];
  1689. for(i=0; i<16; i++){
  1690. ((uint32_t*)(src+i*stride))[0]= a;
  1691. ((uint32_t*)(src+i*stride))[1]= b;
  1692. ((uint32_t*)(src+i*stride))[2]= c;
  1693. ((uint32_t*)(src+i*stride))[3]= d;
  1694. }
  1695. }
  1696. void ff_pred16x16_horizontal_c(uint8_t *src, int stride){
  1697. int i;
  1698. for(i=0; i<16; i++){
  1699. ((uint32_t*)(src+i*stride))[0]=
  1700. ((uint32_t*)(src+i*stride))[1]=
  1701. ((uint32_t*)(src+i*stride))[2]=
  1702. ((uint32_t*)(src+i*stride))[3]= src[-1+i*stride]*0x01010101;
  1703. }
  1704. }
  1705. void ff_pred16x16_dc_c(uint8_t *src, int stride){
  1706. int i, dc=0;
  1707. for(i=0;i<16; i++){
  1708. dc+= src[-1+i*stride];
  1709. }
  1710. for(i=0;i<16; i++){
  1711. dc+= src[i-stride];
  1712. }
  1713. dc= 0x01010101*((dc + 16)>>5);
  1714. for(i=0; i<16; i++){
  1715. ((uint32_t*)(src+i*stride))[0]=
  1716. ((uint32_t*)(src+i*stride))[1]=
  1717. ((uint32_t*)(src+i*stride))[2]=
  1718. ((uint32_t*)(src+i*stride))[3]= dc;
  1719. }
  1720. }
  1721. void ff_pred16x16_left_dc_c(uint8_t *src, int stride){
  1722. int i, dc=0;
  1723. for(i=0;i<16; i++){
  1724. dc+= src[-1+i*stride];
  1725. }
  1726. dc= 0x01010101*((dc + 8)>>4);
  1727. for(i=0; i<16; i++){
  1728. ((uint32_t*)(src+i*stride))[0]=
  1729. ((uint32_t*)(src+i*stride))[1]=
  1730. ((uint32_t*)(src+i*stride))[2]=
  1731. ((uint32_t*)(src+i*stride))[3]= dc;
  1732. }
  1733. }
  1734. void ff_pred16x16_top_dc_c(uint8_t *src, int stride){
  1735. int i, dc=0;
  1736. for(i=0;i<16; i++){
  1737. dc+= src[i-stride];
  1738. }
  1739. dc= 0x01010101*((dc + 8)>>4);
  1740. for(i=0; i<16; i++){
  1741. ((uint32_t*)(src+i*stride))[0]=
  1742. ((uint32_t*)(src+i*stride))[1]=
  1743. ((uint32_t*)(src+i*stride))[2]=
  1744. ((uint32_t*)(src+i*stride))[3]= dc;
  1745. }
  1746. }
  1747. void ff_pred16x16_128_dc_c(uint8_t *src, int stride){
  1748. int i;
  1749. for(i=0; i<16; i++){
  1750. ((uint32_t*)(src+i*stride))[0]=
  1751. ((uint32_t*)(src+i*stride))[1]=
  1752. ((uint32_t*)(src+i*stride))[2]=
  1753. ((uint32_t*)(src+i*stride))[3]= 0x01010101U*128U;
  1754. }
  1755. }
  1756. static inline void pred16x16_plane_compat_c(uint8_t *src, int stride, const int svq3){
  1757. int i, j, k;
  1758. int a;
  1759. uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
  1760. const uint8_t * const src0 = src+7-stride;
  1761. const uint8_t *src1 = src+8*stride-1;
  1762. const uint8_t *src2 = src1-2*stride; // == src+6*stride-1;
  1763. int H = src0[1] - src0[-1];
  1764. int V = src1[0] - src2[ 0];
  1765. for(k=2; k<=8; ++k) {
  1766. src1 += stride; src2 -= stride;
  1767. H += k*(src0[k] - src0[-k]);
  1768. V += k*(src1[0] - src2[ 0]);
  1769. }
  1770. if(svq3){
  1771. H = ( 5*(H/4) ) / 16;
  1772. V = ( 5*(V/4) ) / 16;
  1773. /* required for 100% accuracy */
  1774. i = H; H = V; V = i;
  1775. }else{
  1776. H = ( 5*H+32 ) >> 6;
  1777. V = ( 5*V+32 ) >> 6;
  1778. }
  1779. a = 16*(src1[0] + src2[16] + 1) - 7*(V+H);
  1780. for(j=16; j>0; --j) {
  1781. int b = a;
  1782. a += V;
  1783. for(i=-16; i<0; i+=4) {
  1784. src[16+i] = cm[ (b ) >> 5 ];
  1785. src[17+i] = cm[ (b+ H) >> 5 ];
  1786. src[18+i] = cm[ (b+2*H) >> 5 ];
  1787. src[19+i] = cm[ (b+3*H) >> 5 ];
  1788. b += 4*H;
  1789. }
  1790. src += stride;
  1791. }
  1792. }
  1793. void ff_pred16x16_plane_c(uint8_t *src, int stride){
  1794. pred16x16_plane_compat_c(src, stride, 0);
  1795. }
  1796. void ff_pred8x8_vertical_c(uint8_t *src, int stride){
  1797. int i;
  1798. const uint32_t a= ((uint32_t*)(src-stride))[0];
  1799. const uint32_t b= ((uint32_t*)(src-stride))[1];
  1800. for(i=0; i<8; i++){
  1801. ((uint32_t*)(src+i*stride))[0]= a;
  1802. ((uint32_t*)(src+i*stride))[1]= b;
  1803. }
  1804. }
  1805. void ff_pred8x8_horizontal_c(uint8_t *src, int stride){
  1806. int i;
  1807. for(i=0; i<8; i++){
  1808. ((uint32_t*)(src+i*stride))[0]=
  1809. ((uint32_t*)(src+i*stride))[1]= src[-1+i*stride]*0x01010101;
  1810. }
  1811. }
  1812. void ff_pred8x8_128_dc_c(uint8_t *src, int stride){
  1813. int i;
  1814. for(i=0; i<8; i++){
  1815. ((uint32_t*)(src+i*stride))[0]=
  1816. ((uint32_t*)(src+i*stride))[1]= 0x01010101U*128U;
  1817. }
  1818. }
  1819. void ff_pred8x8_left_dc_c(uint8_t *src, int stride){
  1820. int i;
  1821. int dc0, dc2;
  1822. dc0=dc2=0;
  1823. for(i=0;i<4; i++){
  1824. dc0+= src[-1+i*stride];
  1825. dc2+= src[-1+(i+4)*stride];
  1826. }
  1827. dc0= 0x01010101*((dc0 + 2)>>2);
  1828. dc2= 0x01010101*((dc2 + 2)>>2);
  1829. for(i=0; i<4; i++){
  1830. ((uint32_t*)(src+i*stride))[0]=
  1831. ((uint32_t*)(src+i*stride))[1]= dc0;
  1832. }
  1833. for(i=4; i<8; i++){
  1834. ((uint32_t*)(src+i*stride))[0]=
  1835. ((uint32_t*)(src+i*stride))[1]= dc2;
  1836. }
  1837. }
  1838. void ff_pred8x8_top_dc_c(uint8_t *src, int stride){
  1839. int i;
  1840. int dc0, dc1;
  1841. dc0=dc1=0;
  1842. for(i=0;i<4; i++){
  1843. dc0+= src[i-stride];
  1844. dc1+= src[4+i-stride];
  1845. }
  1846. dc0= 0x01010101*((dc0 + 2)>>2);
  1847. dc1= 0x01010101*((dc1 + 2)>>2);
  1848. for(i=0; i<4; i++){
  1849. ((uint32_t*)(src+i*stride))[0]= dc0;
  1850. ((uint32_t*)(src+i*stride))[1]= dc1;
  1851. }
  1852. for(i=4; i<8; i++){
  1853. ((uint32_t*)(src+i*stride))[0]= dc0;
  1854. ((uint32_t*)(src+i*stride))[1]= dc1;
  1855. }
  1856. }
  1857. void ff_pred8x8_dc_c(uint8_t *src, int stride){
  1858. int i;
  1859. int dc0, dc1, dc2, dc3;
  1860. dc0=dc1=dc2=0;
  1861. for(i=0;i<4; i++){
  1862. dc0+= src[-1+i*stride] + src[i-stride];
  1863. dc1+= src[4+i-stride];
  1864. dc2+= src[-1+(i+4)*stride];
  1865. }
  1866. dc3= 0x01010101*((dc1 + dc2 + 4)>>3);
  1867. dc0= 0x01010101*((dc0 + 4)>>3);
  1868. dc1= 0x01010101*((dc1 + 2)>>2);
  1869. dc2= 0x01010101*((dc2 + 2)>>2);
  1870. for(i=0; i<4; i++){
  1871. ((uint32_t*)(src+i*stride))[0]= dc0;
  1872. ((uint32_t*)(src+i*stride))[1]= dc1;
  1873. }
  1874. for(i=4; i<8; i++){
  1875. ((uint32_t*)(src+i*stride))[0]= dc2;
  1876. ((uint32_t*)(src+i*stride))[1]= dc3;
  1877. }
  1878. }
  1879. void ff_pred8x8_plane_c(uint8_t *src, int stride){
  1880. int j, k;
  1881. int a;
  1882. uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
  1883. const uint8_t * const src0 = src+3-stride;
  1884. const uint8_t *src1 = src+4*stride-1;
  1885. const uint8_t *src2 = src1-2*stride; // == src+2*stride-1;
  1886. int H = src0[1] - src0[-1];
  1887. int V = src1[0] - src2[ 0];
  1888. for(k=2; k<=4; ++k) {
  1889. src1 += stride; src2 -= stride;
  1890. H += k*(src0[k] - src0[-k]);
  1891. V += k*(src1[0] - src2[ 0]);
  1892. }
  1893. H = ( 17*H+16 ) >> 5;
  1894. V = ( 17*V+16 ) >> 5;
  1895. a = 16*(src1[0] + src2[8]+1) - 3*(V+H);
  1896. for(j=8; j>0; --j) {
  1897. int b = a;
  1898. a += V;
  1899. src[0] = cm[ (b ) >> 5 ];
  1900. src[1] = cm[ (b+ H) >> 5 ];
  1901. src[2] = cm[ (b+2*H) >> 5 ];
  1902. src[3] = cm[ (b+3*H) >> 5 ];
  1903. src[4] = cm[ (b+4*H) >> 5 ];
  1904. src[5] = cm[ (b+5*H) >> 5 ];
  1905. src[6] = cm[ (b+6*H) >> 5 ];
  1906. src[7] = cm[ (b+7*H) >> 5 ];
  1907. src += stride;
  1908. }
  1909. }
  1910. #define SRC(x,y) src[(x)+(y)*stride]
  1911. #define PL(y) \
  1912. const int l##y = (SRC(-1,y-1) + 2*SRC(-1,y) + SRC(-1,y+1) + 2) >> 2;
  1913. #define PREDICT_8x8_LOAD_LEFT \
  1914. const int l0 = ((has_topleft ? SRC(-1,-1) : SRC(-1,0)) \
  1915. + 2*SRC(-1,0) + SRC(-1,1) + 2) >> 2; \
  1916. PL(1) PL(2) PL(3) PL(4) PL(5) PL(6) \
  1917. const int l7 av_unused = (SRC(-1,6) + 3*SRC(-1,7) + 2) >> 2
  1918. #define PT(x) \
  1919. const int t##x = (SRC(x-1,-1) + 2*SRC(x,-1) + SRC(x+1,-1) + 2) >> 2;
  1920. #define PREDICT_8x8_LOAD_TOP \
  1921. const int t0 = ((has_topleft ? SRC(-1,-1) : SRC(0,-1)) \
  1922. + 2*SRC(0,-1) + SRC(1,-1) + 2) >> 2; \
  1923. PT(1) PT(2) PT(3) PT(4) PT(5) PT(6) \
  1924. const int t7 av_unused = ((has_topright ? SRC(8,-1) : SRC(7,-1)) \
  1925. + 2*SRC(7,-1) + SRC(6,-1) + 2) >> 2
  1926. #define PTR(x) \
  1927. t##x = (SRC(x-1,-1) + 2*SRC(x,-1) + SRC(x+1,-1) + 2) >> 2;
  1928. #define PREDICT_8x8_LOAD_TOPRIGHT \
  1929. int t8, t9, t10, t11, t12, t13, t14, t15; \
  1930. if(has_topright) { \
  1931. PTR(8) PTR(9) PTR(10) PTR(11) PTR(12) PTR(13) PTR(14) \
  1932. t15 = (SRC(14,-1) + 3*SRC(15,-1) + 2) >> 2; \
  1933. } else t8=t9=t10=t11=t12=t13=t14=t15= SRC(7,-1);
  1934. #define PREDICT_8x8_LOAD_TOPLEFT \
  1935. const int lt = (SRC(-1,0) + 2*SRC(-1,-1) + SRC(0,-1) + 2) >> 2
  1936. #define PREDICT_8x8_DC(v) \
  1937. int y; \
  1938. for( y = 0; y < 8; y++ ) { \
  1939. ((uint32_t*)src)[0] = \
  1940. ((uint32_t*)src)[1] = v; \
  1941. src += stride; \
  1942. }
  1943. static void pred8x8l_128_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  1944. {
  1945. PREDICT_8x8_DC(0x80808080);
  1946. }
  1947. static void pred8x8l_left_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  1948. {
  1949. PREDICT_8x8_LOAD_LEFT;
  1950. const uint32_t dc = ((l0+l1+l2+l3+l4+l5+l6+l7+4) >> 3) * 0x01010101;
  1951. PREDICT_8x8_DC(dc);
  1952. }
  1953. static void pred8x8l_top_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  1954. {
  1955. PREDICT_8x8_LOAD_TOP;
  1956. const uint32_t dc = ((t0+t1+t2+t3+t4+t5+t6+t7+4) >> 3) * 0x01010101;
  1957. PREDICT_8x8_DC(dc);
  1958. }
  1959. static void pred8x8l_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  1960. {
  1961. PREDICT_8x8_LOAD_LEFT;
  1962. PREDICT_8x8_LOAD_TOP;
  1963. const uint32_t dc = ((l0+l1+l2+l3+l4+l5+l6+l7
  1964. +t0+t1+t2+t3+t4+t5+t6+t7+8) >> 4) * 0x01010101;
  1965. PREDICT_8x8_DC(dc);
  1966. }
  1967. static void pred8x8l_horizontal_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  1968. {
  1969. PREDICT_8x8_LOAD_LEFT;
  1970. #define ROW(y) ((uint32_t*)(src+y*stride))[0] =\
  1971. ((uint32_t*)(src+y*stride))[1] = 0x01010101 * l##y
  1972. ROW(0); ROW(1); ROW(2); ROW(3); ROW(4); ROW(5); ROW(6); ROW(7);
  1973. #undef ROW
  1974. }
  1975. static void pred8x8l_vertical_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  1976. {
  1977. int y;
  1978. PREDICT_8x8_LOAD_TOP;
  1979. src[0] = t0;
  1980. src[1] = t1;
  1981. src[2] = t2;
  1982. src[3] = t3;
  1983. src[4] = t4;
  1984. src[5] = t5;
  1985. src[6] = t6;
  1986. src[7] = t7;
  1987. for( y = 1; y < 8; y++ )
  1988. *(uint64_t*)(src+y*stride) = *(uint64_t*)src;
  1989. }
  1990. static void pred8x8l_down_left_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  1991. {
  1992. PREDICT_8x8_LOAD_TOP;
  1993. PREDICT_8x8_LOAD_TOPRIGHT;
  1994. SRC(0,0)= (t0 + 2*t1 + t2 + 2) >> 2;
  1995. SRC(0,1)=SRC(1,0)= (t1 + 2*t2 + t3 + 2) >> 2;
  1996. SRC(0,2)=SRC(1,1)=SRC(2,0)= (t2 + 2*t3 + t4 + 2) >> 2;
  1997. SRC(0,3)=SRC(1,2)=SRC(2,1)=SRC(3,0)= (t3 + 2*t4 + t5 + 2) >> 2;
  1998. SRC(0,4)=SRC(1,3)=SRC(2,2)=SRC(3,1)=SRC(4,0)= (t4 + 2*t5 + t6 + 2) >> 2;
  1999. SRC(0,5)=SRC(1,4)=SRC(2,3)=SRC(3,2)=SRC(4,1)=SRC(5,0)= (t5 + 2*t6 + t7 + 2) >> 2;
  2000. SRC(0,6)=SRC(1,5)=SRC(2,4)=SRC(3,3)=SRC(4,2)=SRC(5,1)=SRC(6,0)= (t6 + 2*t7 + t8 + 2) >> 2;
  2001. SRC(0,7)=SRC(1,6)=SRC(2,5)=SRC(3,4)=SRC(4,3)=SRC(5,2)=SRC(6,1)=SRC(7,0)= (t7 + 2*t8 + t9 + 2) >> 2;
  2002. SRC(1,7)=SRC(2,6)=SRC(3,5)=SRC(4,4)=SRC(5,3)=SRC(6,2)=SRC(7,1)= (t8 + 2*t9 + t10 + 2) >> 2;
  2003. SRC(2,7)=SRC(3,6)=SRC(4,5)=SRC(5,4)=SRC(6,3)=SRC(7,2)= (t9 + 2*t10 + t11 + 2) >> 2;
  2004. SRC(3,7)=SRC(4,6)=SRC(5,5)=SRC(6,4)=SRC(7,3)= (t10 + 2*t11 + t12 + 2) >> 2;
  2005. SRC(4,7)=SRC(5,6)=SRC(6,5)=SRC(7,4)= (t11 + 2*t12 + t13 + 2) >> 2;
  2006. SRC(5,7)=SRC(6,6)=SRC(7,5)= (t12 + 2*t13 + t14 + 2) >> 2;
  2007. SRC(6,7)=SRC(7,6)= (t13 + 2*t14 + t15 + 2) >> 2;
  2008. SRC(7,7)= (t14 + 3*t15 + 2) >> 2;
  2009. }
  2010. static void pred8x8l_down_right_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  2011. {
  2012. PREDICT_8x8_LOAD_TOP;
  2013. PREDICT_8x8_LOAD_LEFT;
  2014. PREDICT_8x8_LOAD_TOPLEFT;
  2015. SRC(0,7)= (l7 + 2*l6 + l5 + 2) >> 2;
  2016. SRC(0,6)=SRC(1,7)= (l6 + 2*l5 + l4 + 2) >> 2;
  2017. SRC(0,5)=SRC(1,6)=SRC(2,7)= (l5 + 2*l4 + l3 + 2) >> 2;
  2018. SRC(0,4)=SRC(1,5)=SRC(2,6)=SRC(3,7)= (l4 + 2*l3 + l2 + 2) >> 2;
  2019. SRC(0,3)=SRC(1,4)=SRC(2,5)=SRC(3,6)=SRC(4,7)= (l3 + 2*l2 + l1 + 2) >> 2;
  2020. SRC(0,2)=SRC(1,3)=SRC(2,4)=SRC(3,5)=SRC(4,6)=SRC(5,7)= (l2 + 2*l1 + l0 + 2) >> 2;
  2021. SRC(0,1)=SRC(1,2)=SRC(2,3)=SRC(3,4)=SRC(4,5)=SRC(5,6)=SRC(6,7)= (l1 + 2*l0 + lt + 2) >> 2;
  2022. SRC(0,0)=SRC(1,1)=SRC(2,2)=SRC(3,3)=SRC(4,4)=SRC(5,5)=SRC(6,6)=SRC(7,7)= (l0 + 2*lt + t0 + 2) >> 2;
  2023. SRC(1,0)=SRC(2,1)=SRC(3,2)=SRC(4,3)=SRC(5,4)=SRC(6,5)=SRC(7,6)= (lt + 2*t0 + t1 + 2) >> 2;
  2024. SRC(2,0)=SRC(3,1)=SRC(4,2)=SRC(5,3)=SRC(6,4)=SRC(7,5)= (t0 + 2*t1 + t2 + 2) >> 2;
  2025. SRC(3,0)=SRC(4,1)=SRC(5,2)=SRC(6,3)=SRC(7,4)= (t1 + 2*t2 + t3 + 2) >> 2;
  2026. SRC(4,0)=SRC(5,1)=SRC(6,2)=SRC(7,3)= (t2 + 2*t3 + t4 + 2) >> 2;
  2027. SRC(5,0)=SRC(6,1)=SRC(7,2)= (t3 + 2*t4 + t5 + 2) >> 2;
  2028. SRC(6,0)=SRC(7,1)= (t4 + 2*t5 + t6 + 2) >> 2;
  2029. SRC(7,0)= (t5 + 2*t6 + t7 + 2) >> 2;
  2030. }
  2031. static void pred8x8l_vertical_right_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  2032. {
  2033. PREDICT_8x8_LOAD_TOP;
  2034. PREDICT_8x8_LOAD_LEFT;
  2035. PREDICT_8x8_LOAD_TOPLEFT;
  2036. SRC(0,6)= (l5 + 2*l4 + l3 + 2) >> 2;
  2037. SRC(0,7)= (l6 + 2*l5 + l4 + 2) >> 2;
  2038. SRC(0,4)=SRC(1,6)= (l3 + 2*l2 + l1 + 2) >> 2;
  2039. SRC(0,5)=SRC(1,7)= (l4 + 2*l3 + l2 + 2) >> 2;
  2040. SRC(0,2)=SRC(1,4)=SRC(2,6)= (l1 + 2*l0 + lt + 2) >> 2;
  2041. SRC(0,3)=SRC(1,5)=SRC(2,7)= (l2 + 2*l1 + l0 + 2) >> 2;
  2042. SRC(0,1)=SRC(1,3)=SRC(2,5)=SRC(3,7)= (l0 + 2*lt + t0 + 2) >> 2;
  2043. SRC(0,0)=SRC(1,2)=SRC(2,4)=SRC(3,6)= (lt + t0 + 1) >> 1;
  2044. SRC(1,1)=SRC(2,3)=SRC(3,5)=SRC(4,7)= (lt + 2*t0 + t1 + 2) >> 2;
  2045. SRC(1,0)=SRC(2,2)=SRC(3,4)=SRC(4,6)= (t0 + t1 + 1) >> 1;
  2046. SRC(2,1)=SRC(3,3)=SRC(4,5)=SRC(5,7)= (t0 + 2*t1 + t2 + 2) >> 2;
  2047. SRC(2,0)=SRC(3,2)=SRC(4,4)=SRC(5,6)= (t1 + t2 + 1) >> 1;
  2048. SRC(3,1)=SRC(4,3)=SRC(5,5)=SRC(6,7)= (t1 + 2*t2 + t3 + 2) >> 2;
  2049. SRC(3,0)=SRC(4,2)=SRC(5,4)=SRC(6,6)= (t2 + t3 + 1) >> 1;
  2050. SRC(4,1)=SRC(5,3)=SRC(6,5)=SRC(7,7)= (t2 + 2*t3 + t4 + 2) >> 2;
  2051. SRC(4,0)=SRC(5,2)=SRC(6,4)=SRC(7,6)= (t3 + t4 + 1) >> 1;
  2052. SRC(5,1)=SRC(6,3)=SRC(7,5)= (t3 + 2*t4 + t5 + 2) >> 2;
  2053. SRC(5,0)=SRC(6,2)=SRC(7,4)= (t4 + t5 + 1) >> 1;
  2054. SRC(6,1)=SRC(7,3)= (t4 + 2*t5 + t6 + 2) >> 2;
  2055. SRC(6,0)=SRC(7,2)= (t5 + t6 + 1) >> 1;
  2056. SRC(7,1)= (t5 + 2*t6 + t7 + 2) >> 2;
  2057. SRC(7,0)= (t6 + t7 + 1) >> 1;
  2058. }
  2059. static void pred8x8l_horizontal_down_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  2060. {
  2061. PREDICT_8x8_LOAD_TOP;
  2062. PREDICT_8x8_LOAD_LEFT;
  2063. PREDICT_8x8_LOAD_TOPLEFT;
  2064. SRC(0,7)= (l6 + l7 + 1) >> 1;
  2065. SRC(1,7)= (l5 + 2*l6 + l7 + 2) >> 2;
  2066. SRC(0,6)=SRC(2,7)= (l5 + l6 + 1) >> 1;
  2067. SRC(1,6)=SRC(3,7)= (l4 + 2*l5 + l6 + 2) >> 2;
  2068. SRC(0,5)=SRC(2,6)=SRC(4,7)= (l4 + l5 + 1) >> 1;
  2069. SRC(1,5)=SRC(3,6)=SRC(5,7)= (l3 + 2*l4 + l5 + 2) >> 2;
  2070. SRC(0,4)=SRC(2,5)=SRC(4,6)=SRC(6,7)= (l3 + l4 + 1) >> 1;
  2071. SRC(1,4)=SRC(3,5)=SRC(5,6)=SRC(7,7)= (l2 + 2*l3 + l4 + 2) >> 2;
  2072. SRC(0,3)=SRC(2,4)=SRC(4,5)=SRC(6,6)= (l2 + l3 + 1) >> 1;
  2073. SRC(1,3)=SRC(3,4)=SRC(5,5)=SRC(7,6)= (l1 + 2*l2 + l3 + 2) >> 2;
  2074. SRC(0,2)=SRC(2,3)=SRC(4,4)=SRC(6,5)= (l1 + l2 + 1) >> 1;
  2075. SRC(1,2)=SRC(3,3)=SRC(5,4)=SRC(7,5)= (l0 + 2*l1 + l2 + 2) >> 2;
  2076. SRC(0,1)=SRC(2,2)=SRC(4,3)=SRC(6,4)= (l0 + l1 + 1) >> 1;
  2077. SRC(1,1)=SRC(3,2)=SRC(5,3)=SRC(7,4)= (lt + 2*l0 + l1 + 2) >> 2;
  2078. SRC(0,0)=SRC(2,1)=SRC(4,2)=SRC(6,3)= (lt + l0 + 1) >> 1;
  2079. SRC(1,0)=SRC(3,1)=SRC(5,2)=SRC(7,3)= (l0 + 2*lt + t0 + 2) >> 2;
  2080. SRC(2,0)=SRC(4,1)=SRC(6,2)= (t1 + 2*t0 + lt + 2) >> 2;
  2081. SRC(3,0)=SRC(5,1)=SRC(7,2)= (t2 + 2*t1 + t0 + 2) >> 2;
  2082. SRC(4,0)=SRC(6,1)= (t3 + 2*t2 + t1 + 2) >> 2;
  2083. SRC(5,0)=SRC(7,1)= (t4 + 2*t3 + t2 + 2) >> 2;
  2084. SRC(6,0)= (t5 + 2*t4 + t3 + 2) >> 2;
  2085. SRC(7,0)= (t6 + 2*t5 + t4 + 2) >> 2;
  2086. }
  2087. static void pred8x8l_vertical_left_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  2088. {
  2089. PREDICT_8x8_LOAD_TOP;
  2090. PREDICT_8x8_LOAD_TOPRIGHT;
  2091. SRC(0,0)= (t0 + t1 + 1) >> 1;
  2092. SRC(0,1)= (t0 + 2*t1 + t2 + 2) >> 2;
  2093. SRC(0,2)=SRC(1,0)= (t1 + t2 + 1) >> 1;
  2094. SRC(0,3)=SRC(1,1)= (t1 + 2*t2 + t3 + 2) >> 2;
  2095. SRC(0,4)=SRC(1,2)=SRC(2,0)= (t2 + t3 + 1) >> 1;
  2096. SRC(0,5)=SRC(1,3)=SRC(2,1)= (t2 + 2*t3 + t4 + 2) >> 2;
  2097. SRC(0,6)=SRC(1,4)=SRC(2,2)=SRC(3,0)= (t3 + t4 + 1) >> 1;
  2098. SRC(0,7)=SRC(1,5)=SRC(2,3)=SRC(3,1)= (t3 + 2*t4 + t5 + 2) >> 2;
  2099. SRC(1,6)=SRC(2,4)=SRC(3,2)=SRC(4,0)= (t4 + t5 + 1) >> 1;
  2100. SRC(1,7)=SRC(2,5)=SRC(3,3)=SRC(4,1)= (t4 + 2*t5 + t6 + 2) >> 2;
  2101. SRC(2,6)=SRC(3,4)=SRC(4,2)=SRC(5,0)= (t5 + t6 + 1) >> 1;
  2102. SRC(2,7)=SRC(3,5)=SRC(4,3)=SRC(5,1)= (t5 + 2*t6 + t7 + 2) >> 2;
  2103. SRC(3,6)=SRC(4,4)=SRC(5,2)=SRC(6,0)= (t6 + t7 + 1) >> 1;
  2104. SRC(3,7)=SRC(4,5)=SRC(5,3)=SRC(6,1)= (t6 + 2*t7 + t8 + 2) >> 2;
  2105. SRC(4,6)=SRC(5,4)=SRC(6,2)=SRC(7,0)= (t7 + t8 + 1) >> 1;
  2106. SRC(4,7)=SRC(5,5)=SRC(6,3)=SRC(7,1)= (t7 + 2*t8 + t9 + 2) >> 2;
  2107. SRC(5,6)=SRC(6,4)=SRC(7,2)= (t8 + t9 + 1) >> 1;
  2108. SRC(5,7)=SRC(6,5)=SRC(7,3)= (t8 + 2*t9 + t10 + 2) >> 2;
  2109. SRC(6,6)=SRC(7,4)= (t9 + t10 + 1) >> 1;
  2110. SRC(6,7)=SRC(7,5)= (t9 + 2*t10 + t11 + 2) >> 2;
  2111. SRC(7,6)= (t10 + t11 + 1) >> 1;
  2112. SRC(7,7)= (t10 + 2*t11 + t12 + 2) >> 2;
  2113. }
  2114. static void pred8x8l_horizontal_up_c(uint8_t *src, int has_topleft, int has_topright, int stride)
  2115. {
  2116. PREDICT_8x8_LOAD_LEFT;
  2117. SRC(0,0)= (l0 + l1 + 1) >> 1;
  2118. SRC(1,0)= (l0 + 2*l1 + l2 + 2) >> 2;
  2119. SRC(0,1)=SRC(2,0)= (l1 + l2 + 1) >> 1;
  2120. SRC(1,1)=SRC(3,0)= (l1 + 2*l2 + l3 + 2) >> 2;
  2121. SRC(0,2)=SRC(2,1)=SRC(4,0)= (l2 + l3 + 1) >> 1;
  2122. SRC(1,2)=SRC(3,1)=SRC(5,0)= (l2 + 2*l3 + l4 + 2) >> 2;
  2123. SRC(0,3)=SRC(2,2)=SRC(4,1)=SRC(6,0)= (l3 + l4 + 1) >> 1;
  2124. SRC(1,3)=SRC(3,2)=SRC(5,1)=SRC(7,0)= (l3 + 2*l4 + l5 + 2) >> 2;
  2125. SRC(0,4)=SRC(2,3)=SRC(4,2)=SRC(6,1)= (l4 + l5 + 1) >> 1;
  2126. SRC(1,4)=SRC(3,3)=SRC(5,2)=SRC(7,1)= (l4 + 2*l5 + l6 + 2) >> 2;
  2127. SRC(0,5)=SRC(2,4)=SRC(4,3)=SRC(6,2)= (l5 + l6 + 1) >> 1;
  2128. SRC(1,5)=SRC(3,4)=SRC(5,3)=SRC(7,2)= (l5 + 2*l6 + l7 + 2) >> 2;
  2129. SRC(0,6)=SRC(2,5)=SRC(4,4)=SRC(6,3)= (l6 + l7 + 1) >> 1;
  2130. SRC(1,6)=SRC(3,5)=SRC(5,4)=SRC(7,3)= (l6 + 3*l7 + 2) >> 2;
  2131. SRC(0,7)=SRC(1,7)=SRC(2,6)=SRC(2,7)=SRC(3,6)=
  2132. SRC(3,7)=SRC(4,5)=SRC(4,6)=SRC(4,7)=SRC(5,5)=
  2133. SRC(5,6)=SRC(5,7)=SRC(6,4)=SRC(6,5)=SRC(6,6)=
  2134. SRC(6,7)=SRC(7,4)=SRC(7,5)=SRC(7,6)=SRC(7,7)= l7;
  2135. }
  2136. #undef PREDICT_8x8_LOAD_LEFT
  2137. #undef PREDICT_8x8_LOAD_TOP
  2138. #undef PREDICT_8x8_LOAD_TOPLEFT
  2139. #undef PREDICT_8x8_LOAD_TOPRIGHT
  2140. #undef PREDICT_8x8_DC
  2141. #undef PTR
  2142. #undef PT
  2143. #undef PL
  2144. #undef SRC
  2145. static inline void mc_dir_part(H264Context *h, Picture *pic, int n, int square, int chroma_height, int delta, int list,
  2146. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  2147. int src_x_offset, int src_y_offset,
  2148. qpel_mc_func *qpix_op, h264_chroma_mc_func chroma_op){
  2149. MpegEncContext * const s = &h->s;
  2150. const int mx= h->mv_cache[list][ scan8[n] ][0] + src_x_offset*8;
  2151. int my= h->mv_cache[list][ scan8[n] ][1] + src_y_offset*8;
  2152. const int luma_xy= (mx&3) + ((my&3)<<2);
  2153. uint8_t * src_y = pic->data[0] + (mx>>2) + (my>>2)*h->mb_linesize;
  2154. uint8_t * src_cb, * src_cr;
  2155. int extra_width= h->emu_edge_width;
  2156. int extra_height= h->emu_edge_height;
  2157. int emu=0;
  2158. const int full_mx= mx>>2;
  2159. const int full_my= my>>2;
  2160. const int pic_width = 16*s->mb_width;
  2161. const int pic_height = 16*s->mb_height >> MB_MBAFF;
  2162. if(!pic->data[0]) //FIXME this is unacceptable, some senseable error concealment must be done for missing reference frames
  2163. return;
  2164. if(mx&7) extra_width -= 3;
  2165. if(my&7) extra_height -= 3;
  2166. if( full_mx < 0-extra_width
  2167. || full_my < 0-extra_height
  2168. || full_mx + 16/*FIXME*/ > pic_width + extra_width
  2169. || full_my + 16/*FIXME*/ > pic_height + extra_height){
  2170. 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);
  2171. src_y= s->edge_emu_buffer + 2 + 2*h->mb_linesize;
  2172. emu=1;
  2173. }
  2174. qpix_op[luma_xy](dest_y, src_y, h->mb_linesize); //FIXME try variable height perhaps?
  2175. if(!square){
  2176. qpix_op[luma_xy](dest_y + delta, src_y + delta, h->mb_linesize);
  2177. }
  2178. if(s->flags&CODEC_FLAG_GRAY) return;
  2179. if(MB_MBAFF){
  2180. // chroma offset when predicting from a field of opposite parity
  2181. my += 2 * ((s->mb_y & 1) - (h->ref_cache[list][scan8[n]] & 1));
  2182. emu |= (my>>3) < 0 || (my>>3) + 8 >= (pic_height>>1);
  2183. }
  2184. src_cb= pic->data[1] + (mx>>3) + (my>>3)*h->mb_uvlinesize;
  2185. src_cr= pic->data[2] + (mx>>3) + (my>>3)*h->mb_uvlinesize;
  2186. if(emu){
  2187. 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);
  2188. src_cb= s->edge_emu_buffer;
  2189. }
  2190. chroma_op(dest_cb, src_cb, h->mb_uvlinesize, chroma_height, mx&7, my&7);
  2191. if(emu){
  2192. 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);
  2193. src_cr= s->edge_emu_buffer;
  2194. }
  2195. chroma_op(dest_cr, src_cr, h->mb_uvlinesize, chroma_height, mx&7, my&7);
  2196. }
  2197. static inline void mc_part_std(H264Context *h, int n, int square, int chroma_height, int delta,
  2198. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  2199. int x_offset, int y_offset,
  2200. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  2201. qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,
  2202. int list0, int list1){
  2203. MpegEncContext * const s = &h->s;
  2204. qpel_mc_func *qpix_op= qpix_put;
  2205. h264_chroma_mc_func chroma_op= chroma_put;
  2206. dest_y += 2*x_offset + 2*y_offset*h-> mb_linesize;
  2207. dest_cb += x_offset + y_offset*h->mb_uvlinesize;
  2208. dest_cr += x_offset + y_offset*h->mb_uvlinesize;
  2209. x_offset += 8*s->mb_x;
  2210. y_offset += 8*(s->mb_y >> MB_MBAFF);
  2211. if(list0){
  2212. Picture *ref= &h->ref_list[0][ h->ref_cache[0][ scan8[n] ] ];
  2213. mc_dir_part(h, ref, n, square, chroma_height, delta, 0,
  2214. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2215. qpix_op, chroma_op);
  2216. qpix_op= qpix_avg;
  2217. chroma_op= chroma_avg;
  2218. }
  2219. if(list1){
  2220. Picture *ref= &h->ref_list[1][ h->ref_cache[1][ scan8[n] ] ];
  2221. mc_dir_part(h, ref, n, square, chroma_height, delta, 1,
  2222. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2223. qpix_op, chroma_op);
  2224. }
  2225. }
  2226. static inline void mc_part_weighted(H264Context *h, int n, int square, int chroma_height, int delta,
  2227. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  2228. int x_offset, int y_offset,
  2229. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  2230. h264_weight_func luma_weight_op, h264_weight_func chroma_weight_op,
  2231. h264_biweight_func luma_weight_avg, h264_biweight_func chroma_weight_avg,
  2232. int list0, int list1){
  2233. MpegEncContext * const s = &h->s;
  2234. dest_y += 2*x_offset + 2*y_offset*h-> mb_linesize;
  2235. dest_cb += x_offset + y_offset*h->mb_uvlinesize;
  2236. dest_cr += x_offset + y_offset*h->mb_uvlinesize;
  2237. x_offset += 8*s->mb_x;
  2238. y_offset += 8*(s->mb_y >> MB_MBAFF);
  2239. if(list0 && list1){
  2240. /* don't optimize for luma-only case, since B-frames usually
  2241. * use implicit weights => chroma too. */
  2242. uint8_t *tmp_cb = s->obmc_scratchpad;
  2243. uint8_t *tmp_cr = s->obmc_scratchpad + 8;
  2244. uint8_t *tmp_y = s->obmc_scratchpad + 8*h->mb_uvlinesize;
  2245. int refn0 = h->ref_cache[0][ scan8[n] ];
  2246. int refn1 = h->ref_cache[1][ scan8[n] ];
  2247. mc_dir_part(h, &h->ref_list[0][refn0], n, square, chroma_height, delta, 0,
  2248. dest_y, dest_cb, dest_cr,
  2249. x_offset, y_offset, qpix_put, chroma_put);
  2250. mc_dir_part(h, &h->ref_list[1][refn1], n, square, chroma_height, delta, 1,
  2251. tmp_y, tmp_cb, tmp_cr,
  2252. x_offset, y_offset, qpix_put, chroma_put);
  2253. if(h->use_weight == 2){
  2254. int weight0 = h->implicit_weight[refn0][refn1];
  2255. int weight1 = 64 - weight0;
  2256. luma_weight_avg( dest_y, tmp_y, h-> mb_linesize, 5, weight0, weight1, 0);
  2257. chroma_weight_avg(dest_cb, tmp_cb, h->mb_uvlinesize, 5, weight0, weight1, 0);
  2258. chroma_weight_avg(dest_cr, tmp_cr, h->mb_uvlinesize, 5, weight0, weight1, 0);
  2259. }else{
  2260. luma_weight_avg(dest_y, tmp_y, h->mb_linesize, h->luma_log2_weight_denom,
  2261. h->luma_weight[0][refn0], h->luma_weight[1][refn1],
  2262. h->luma_offset[0][refn0] + h->luma_offset[1][refn1]);
  2263. chroma_weight_avg(dest_cb, tmp_cb, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  2264. h->chroma_weight[0][refn0][0], h->chroma_weight[1][refn1][0],
  2265. h->chroma_offset[0][refn0][0] + h->chroma_offset[1][refn1][0]);
  2266. chroma_weight_avg(dest_cr, tmp_cr, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  2267. h->chroma_weight[0][refn0][1], h->chroma_weight[1][refn1][1],
  2268. h->chroma_offset[0][refn0][1] + h->chroma_offset[1][refn1][1]);
  2269. }
  2270. }else{
  2271. int list = list1 ? 1 : 0;
  2272. int refn = h->ref_cache[list][ scan8[n] ];
  2273. Picture *ref= &h->ref_list[list][refn];
  2274. mc_dir_part(h, ref, n, square, chroma_height, delta, list,
  2275. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2276. qpix_put, chroma_put);
  2277. luma_weight_op(dest_y, h->mb_linesize, h->luma_log2_weight_denom,
  2278. h->luma_weight[list][refn], h->luma_offset[list][refn]);
  2279. if(h->use_weight_chroma){
  2280. chroma_weight_op(dest_cb, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  2281. h->chroma_weight[list][refn][0], h->chroma_offset[list][refn][0]);
  2282. chroma_weight_op(dest_cr, h->mb_uvlinesize, h->chroma_log2_weight_denom,
  2283. h->chroma_weight[list][refn][1], h->chroma_offset[list][refn][1]);
  2284. }
  2285. }
  2286. }
  2287. static inline void mc_part(H264Context *h, int n, int square, int chroma_height, int delta,
  2288. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  2289. int x_offset, int y_offset,
  2290. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  2291. qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,
  2292. h264_weight_func *weight_op, h264_biweight_func *weight_avg,
  2293. int list0, int list1){
  2294. if((h->use_weight==2 && list0 && list1
  2295. && (h->implicit_weight[ h->ref_cache[0][scan8[n]] ][ h->ref_cache[1][scan8[n]] ] != 32))
  2296. || h->use_weight==1)
  2297. mc_part_weighted(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,
  2298. x_offset, y_offset, qpix_put, chroma_put,
  2299. weight_op[0], weight_op[3], weight_avg[0], weight_avg[3], list0, list1);
  2300. else
  2301. mc_part_std(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,
  2302. x_offset, y_offset, qpix_put, chroma_put, qpix_avg, chroma_avg, list0, list1);
  2303. }
  2304. static inline void prefetch_motion(H264Context *h, int list){
  2305. /* fetch pixels for estimated mv 4 macroblocks ahead
  2306. * optimized for 64byte cache lines */
  2307. MpegEncContext * const s = &h->s;
  2308. const int refn = h->ref_cache[list][scan8[0]];
  2309. if(refn >= 0){
  2310. const int mx= (h->mv_cache[list][scan8[0]][0]>>2) + 16*s->mb_x + 8;
  2311. const int my= (h->mv_cache[list][scan8[0]][1]>>2) + 16*s->mb_y;
  2312. uint8_t **src= h->ref_list[list][refn].data;
  2313. int off= mx + (my + (s->mb_x&3)*4)*h->mb_linesize + 64;
  2314. s->dsp.prefetch(src[0]+off, s->linesize, 4);
  2315. off= (mx>>1) + ((my>>1) + (s->mb_x&7))*s->uvlinesize + 64;
  2316. s->dsp.prefetch(src[1]+off, src[2]-src[1], 2);
  2317. }
  2318. }
  2319. static void hl_motion(H264Context *h, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  2320. qpel_mc_func (*qpix_put)[16], h264_chroma_mc_func (*chroma_put),
  2321. qpel_mc_func (*qpix_avg)[16], h264_chroma_mc_func (*chroma_avg),
  2322. h264_weight_func *weight_op, h264_biweight_func *weight_avg){
  2323. MpegEncContext * const s = &h->s;
  2324. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  2325. const int mb_type= s->current_picture.mb_type[mb_xy];
  2326. assert(IS_INTER(mb_type));
  2327. prefetch_motion(h, 0);
  2328. if(IS_16X16(mb_type)){
  2329. mc_part(h, 0, 1, 8, 0, dest_y, dest_cb, dest_cr, 0, 0,
  2330. qpix_put[0], chroma_put[0], qpix_avg[0], chroma_avg[0],
  2331. &weight_op[0], &weight_avg[0],
  2332. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  2333. }else if(IS_16X8(mb_type)){
  2334. mc_part(h, 0, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 0,
  2335. qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],
  2336. &weight_op[1], &weight_avg[1],
  2337. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  2338. mc_part(h, 8, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 4,
  2339. qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],
  2340. &weight_op[1], &weight_avg[1],
  2341. IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));
  2342. }else if(IS_8X16(mb_type)){
  2343. mc_part(h, 0, 0, 8, 8*h->mb_linesize, dest_y, dest_cb, dest_cr, 0, 0,
  2344. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  2345. &weight_op[2], &weight_avg[2],
  2346. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  2347. mc_part(h, 4, 0, 8, 8*h->mb_linesize, dest_y, dest_cb, dest_cr, 4, 0,
  2348. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  2349. &weight_op[2], &weight_avg[2],
  2350. IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));
  2351. }else{
  2352. int i;
  2353. assert(IS_8X8(mb_type));
  2354. for(i=0; i<4; i++){
  2355. const int sub_mb_type= h->sub_mb_type[i];
  2356. const int n= 4*i;
  2357. int x_offset= (i&1)<<2;
  2358. int y_offset= (i&2)<<1;
  2359. if(IS_SUB_8X8(sub_mb_type)){
  2360. mc_part(h, n, 1, 4, 0, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2361. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  2362. &weight_op[3], &weight_avg[3],
  2363. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2364. }else if(IS_SUB_8X4(sub_mb_type)){
  2365. mc_part(h, n , 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2366. qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],
  2367. &weight_op[4], &weight_avg[4],
  2368. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2369. mc_part(h, n+2, 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset+2,
  2370. qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],
  2371. &weight_op[4], &weight_avg[4],
  2372. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2373. }else if(IS_SUB_4X8(sub_mb_type)){
  2374. mc_part(h, n , 0, 4, 4*h->mb_linesize, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2375. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  2376. &weight_op[5], &weight_avg[5],
  2377. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2378. mc_part(h, n+1, 0, 4, 4*h->mb_linesize, dest_y, dest_cb, dest_cr, x_offset+2, y_offset,
  2379. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  2380. &weight_op[5], &weight_avg[5],
  2381. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2382. }else{
  2383. int j;
  2384. assert(IS_SUB_4X4(sub_mb_type));
  2385. for(j=0; j<4; j++){
  2386. int sub_x_offset= x_offset + 2*(j&1);
  2387. int sub_y_offset= y_offset + (j&2);
  2388. mc_part(h, n+j, 1, 2, 0, dest_y, dest_cb, dest_cr, sub_x_offset, sub_y_offset,
  2389. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  2390. &weight_op[6], &weight_avg[6],
  2391. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2392. }
  2393. }
  2394. }
  2395. }
  2396. prefetch_motion(h, 1);
  2397. }
  2398. static void decode_init_vlc(void){
  2399. static int done = 0;
  2400. if (!done) {
  2401. int i;
  2402. done = 1;
  2403. init_vlc(&chroma_dc_coeff_token_vlc, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 4*5,
  2404. &chroma_dc_coeff_token_len [0], 1, 1,
  2405. &chroma_dc_coeff_token_bits[0], 1, 1, 1);
  2406. for(i=0; i<4; i++){
  2407. init_vlc(&coeff_token_vlc[i], COEFF_TOKEN_VLC_BITS, 4*17,
  2408. &coeff_token_len [i][0], 1, 1,
  2409. &coeff_token_bits[i][0], 1, 1, 1);
  2410. }
  2411. for(i=0; i<3; i++){
  2412. init_vlc(&chroma_dc_total_zeros_vlc[i], CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 4,
  2413. &chroma_dc_total_zeros_len [i][0], 1, 1,
  2414. &chroma_dc_total_zeros_bits[i][0], 1, 1, 1);
  2415. }
  2416. for(i=0; i<15; i++){
  2417. init_vlc(&total_zeros_vlc[i], TOTAL_ZEROS_VLC_BITS, 16,
  2418. &total_zeros_len [i][0], 1, 1,
  2419. &total_zeros_bits[i][0], 1, 1, 1);
  2420. }
  2421. for(i=0; i<6; i++){
  2422. init_vlc(&run_vlc[i], RUN_VLC_BITS, 7,
  2423. &run_len [i][0], 1, 1,
  2424. &run_bits[i][0], 1, 1, 1);
  2425. }
  2426. init_vlc(&run7_vlc, RUN7_VLC_BITS, 16,
  2427. &run_len [6][0], 1, 1,
  2428. &run_bits[6][0], 1, 1, 1);
  2429. }
  2430. }
  2431. /**
  2432. * Sets the intra prediction function pointers.
  2433. */
  2434. static void init_pred_ptrs(H264Context *h){
  2435. // MpegEncContext * const s = &h->s;
  2436. h->pred4x4[VERT_PRED ]= pred4x4_vertical_c;
  2437. h->pred4x4[HOR_PRED ]= pred4x4_horizontal_c;
  2438. h->pred4x4[DC_PRED ]= pred4x4_dc_c;
  2439. h->pred4x4[DIAG_DOWN_LEFT_PRED ]= pred4x4_down_left_c;
  2440. h->pred4x4[DIAG_DOWN_RIGHT_PRED]= pred4x4_down_right_c;
  2441. h->pred4x4[VERT_RIGHT_PRED ]= pred4x4_vertical_right_c;
  2442. h->pred4x4[HOR_DOWN_PRED ]= pred4x4_horizontal_down_c;
  2443. h->pred4x4[VERT_LEFT_PRED ]= pred4x4_vertical_left_c;
  2444. h->pred4x4[HOR_UP_PRED ]= pred4x4_horizontal_up_c;
  2445. h->pred4x4[LEFT_DC_PRED ]= pred4x4_left_dc_c;
  2446. h->pred4x4[TOP_DC_PRED ]= pred4x4_top_dc_c;
  2447. h->pred4x4[DC_128_PRED ]= pred4x4_128_dc_c;
  2448. h->pred8x8l[VERT_PRED ]= pred8x8l_vertical_c;
  2449. h->pred8x8l[HOR_PRED ]= pred8x8l_horizontal_c;
  2450. h->pred8x8l[DC_PRED ]= pred8x8l_dc_c;
  2451. h->pred8x8l[DIAG_DOWN_LEFT_PRED ]= pred8x8l_down_left_c;
  2452. h->pred8x8l[DIAG_DOWN_RIGHT_PRED]= pred8x8l_down_right_c;
  2453. h->pred8x8l[VERT_RIGHT_PRED ]= pred8x8l_vertical_right_c;
  2454. h->pred8x8l[HOR_DOWN_PRED ]= pred8x8l_horizontal_down_c;
  2455. h->pred8x8l[VERT_LEFT_PRED ]= pred8x8l_vertical_left_c;
  2456. h->pred8x8l[HOR_UP_PRED ]= pred8x8l_horizontal_up_c;
  2457. h->pred8x8l[LEFT_DC_PRED ]= pred8x8l_left_dc_c;
  2458. h->pred8x8l[TOP_DC_PRED ]= pred8x8l_top_dc_c;
  2459. h->pred8x8l[DC_128_PRED ]= pred8x8l_128_dc_c;
  2460. h->pred8x8[DC_PRED8x8 ]= ff_pred8x8_dc_c;
  2461. h->pred8x8[VERT_PRED8x8 ]= ff_pred8x8_vertical_c;
  2462. h->pred8x8[HOR_PRED8x8 ]= ff_pred8x8_horizontal_c;
  2463. h->pred8x8[PLANE_PRED8x8 ]= ff_pred8x8_plane_c;
  2464. h->pred8x8[LEFT_DC_PRED8x8]= ff_pred8x8_left_dc_c;
  2465. h->pred8x8[TOP_DC_PRED8x8 ]= ff_pred8x8_top_dc_c;
  2466. h->pred8x8[DC_128_PRED8x8 ]= ff_pred8x8_128_dc_c;
  2467. h->pred16x16[DC_PRED8x8 ]= ff_pred16x16_dc_c;
  2468. h->pred16x16[VERT_PRED8x8 ]= ff_pred16x16_vertical_c;
  2469. h->pred16x16[HOR_PRED8x8 ]= ff_pred16x16_horizontal_c;
  2470. h->pred16x16[PLANE_PRED8x8 ]= ff_pred16x16_plane_c;
  2471. h->pred16x16[LEFT_DC_PRED8x8]= ff_pred16x16_left_dc_c;
  2472. h->pred16x16[TOP_DC_PRED8x8 ]= ff_pred16x16_top_dc_c;
  2473. h->pred16x16[DC_128_PRED8x8 ]= ff_pred16x16_128_dc_c;
  2474. }
  2475. static void free_tables(H264Context *h){
  2476. int i;
  2477. av_freep(&h->intra4x4_pred_mode);
  2478. av_freep(&h->chroma_pred_mode_table);
  2479. av_freep(&h->cbp_table);
  2480. av_freep(&h->mvd_table[0]);
  2481. av_freep(&h->mvd_table[1]);
  2482. av_freep(&h->direct_table);
  2483. av_freep(&h->non_zero_count);
  2484. av_freep(&h->slice_table_base);
  2485. av_freep(&h->top_borders[1]);
  2486. av_freep(&h->top_borders[0]);
  2487. h->slice_table= NULL;
  2488. av_freep(&h->mb2b_xy);
  2489. av_freep(&h->mb2b8_xy);
  2490. av_freep(&h->s.obmc_scratchpad);
  2491. for(i = 0; i < MAX_SPS_COUNT; i++)
  2492. av_freep(h->sps_buffers + i);
  2493. for(i = 0; i < MAX_PPS_COUNT; i++)
  2494. av_freep(h->pps_buffers + i);
  2495. }
  2496. static void init_dequant8_coeff_table(H264Context *h){
  2497. int i,q,x;
  2498. const int transpose = (h->s.dsp.h264_idct8_add != ff_h264_idct8_add_c); //FIXME ugly
  2499. h->dequant8_coeff[0] = h->dequant8_buffer[0];
  2500. h->dequant8_coeff[1] = h->dequant8_buffer[1];
  2501. for(i=0; i<2; i++ ){
  2502. if(i && !memcmp(h->pps.scaling_matrix8[0], h->pps.scaling_matrix8[1], 64*sizeof(uint8_t))){
  2503. h->dequant8_coeff[1] = h->dequant8_buffer[0];
  2504. break;
  2505. }
  2506. for(q=0; q<52; q++){
  2507. int shift = ff_div6[q];
  2508. int idx = ff_rem6[q];
  2509. for(x=0; x<64; x++)
  2510. h->dequant8_coeff[i][q][transpose ? (x>>3)|((x&7)<<3) : x] =
  2511. ((uint32_t)dequant8_coeff_init[idx][ dequant8_coeff_init_scan[((x>>1)&12) | (x&3)] ] *
  2512. h->pps.scaling_matrix8[i][x]) << shift;
  2513. }
  2514. }
  2515. }
  2516. static void init_dequant4_coeff_table(H264Context *h){
  2517. int i,j,q,x;
  2518. const int transpose = (h->s.dsp.h264_idct_add != ff_h264_idct_add_c); //FIXME ugly
  2519. for(i=0; i<6; i++ ){
  2520. h->dequant4_coeff[i] = h->dequant4_buffer[i];
  2521. for(j=0; j<i; j++){
  2522. if(!memcmp(h->pps.scaling_matrix4[j], h->pps.scaling_matrix4[i], 16*sizeof(uint8_t))){
  2523. h->dequant4_coeff[i] = h->dequant4_buffer[j];
  2524. break;
  2525. }
  2526. }
  2527. if(j<i)
  2528. continue;
  2529. for(q=0; q<52; q++){
  2530. int shift = ff_div6[q] + 2;
  2531. int idx = ff_rem6[q];
  2532. for(x=0; x<16; x++)
  2533. h->dequant4_coeff[i][q][transpose ? (x>>2)|((x<<2)&0xF) : x] =
  2534. ((uint32_t)dequant4_coeff_init[idx][(x&1) + ((x>>2)&1)] *
  2535. h->pps.scaling_matrix4[i][x]) << shift;
  2536. }
  2537. }
  2538. }
  2539. static void init_dequant_tables(H264Context *h){
  2540. int i,x;
  2541. init_dequant4_coeff_table(h);
  2542. if(h->pps.transform_8x8_mode)
  2543. init_dequant8_coeff_table(h);
  2544. if(h->sps.transform_bypass){
  2545. for(i=0; i<6; i++)
  2546. for(x=0; x<16; x++)
  2547. h->dequant4_coeff[i][0][x] = 1<<6;
  2548. if(h->pps.transform_8x8_mode)
  2549. for(i=0; i<2; i++)
  2550. for(x=0; x<64; x++)
  2551. h->dequant8_coeff[i][0][x] = 1<<6;
  2552. }
  2553. }
  2554. /**
  2555. * allocates tables.
  2556. * needs width/height
  2557. */
  2558. static int alloc_tables(H264Context *h){
  2559. MpegEncContext * const s = &h->s;
  2560. const int big_mb_num= s->mb_stride * (s->mb_height+1);
  2561. int x,y;
  2562. CHECKED_ALLOCZ(h->intra4x4_pred_mode, big_mb_num * 8 * sizeof(uint8_t))
  2563. CHECKED_ALLOCZ(h->non_zero_count , big_mb_num * 16 * sizeof(uint8_t))
  2564. CHECKED_ALLOCZ(h->slice_table_base , (big_mb_num+s->mb_stride) * sizeof(uint8_t))
  2565. CHECKED_ALLOCZ(h->top_borders[0] , s->mb_width * (16+8+8) * sizeof(uint8_t))
  2566. CHECKED_ALLOCZ(h->top_borders[1] , s->mb_width * (16+8+8) * sizeof(uint8_t))
  2567. CHECKED_ALLOCZ(h->cbp_table, big_mb_num * sizeof(uint16_t))
  2568. if( h->pps.cabac ) {
  2569. CHECKED_ALLOCZ(h->chroma_pred_mode_table, big_mb_num * sizeof(uint8_t))
  2570. CHECKED_ALLOCZ(h->mvd_table[0], 32*big_mb_num * sizeof(uint16_t));
  2571. CHECKED_ALLOCZ(h->mvd_table[1], 32*big_mb_num * sizeof(uint16_t));
  2572. CHECKED_ALLOCZ(h->direct_table, 32*big_mb_num * sizeof(uint8_t));
  2573. }
  2574. memset(h->slice_table_base, -1, (big_mb_num+s->mb_stride) * sizeof(uint8_t));
  2575. h->slice_table= h->slice_table_base + s->mb_stride*2 + 1;
  2576. CHECKED_ALLOCZ(h->mb2b_xy , big_mb_num * sizeof(uint32_t));
  2577. CHECKED_ALLOCZ(h->mb2b8_xy , big_mb_num * sizeof(uint32_t));
  2578. for(y=0; y<s->mb_height; y++){
  2579. for(x=0; x<s->mb_width; x++){
  2580. const int mb_xy= x + y*s->mb_stride;
  2581. const int b_xy = 4*x + 4*y*h->b_stride;
  2582. const int b8_xy= 2*x + 2*y*h->b8_stride;
  2583. h->mb2b_xy [mb_xy]= b_xy;
  2584. h->mb2b8_xy[mb_xy]= b8_xy;
  2585. }
  2586. }
  2587. s->obmc_scratchpad = NULL;
  2588. if(!h->dequant4_coeff[0])
  2589. init_dequant_tables(h);
  2590. return 0;
  2591. fail:
  2592. free_tables(h);
  2593. return -1;
  2594. }
  2595. static void common_init(H264Context *h){
  2596. MpegEncContext * const s = &h->s;
  2597. s->width = s->avctx->width;
  2598. s->height = s->avctx->height;
  2599. s->codec_id= s->avctx->codec->id;
  2600. init_pred_ptrs(h);
  2601. h->dequant_coeff_pps= -1;
  2602. s->unrestricted_mv=1;
  2603. s->decode=1; //FIXME
  2604. memset(h->pps.scaling_matrix4, 16, 6*16*sizeof(uint8_t));
  2605. memset(h->pps.scaling_matrix8, 16, 2*64*sizeof(uint8_t));
  2606. }
  2607. static int decode_init(AVCodecContext *avctx){
  2608. H264Context *h= avctx->priv_data;
  2609. MpegEncContext * const s = &h->s;
  2610. MPV_decode_defaults(s);
  2611. s->avctx = avctx;
  2612. common_init(h);
  2613. s->out_format = FMT_H264;
  2614. s->workaround_bugs= avctx->workaround_bugs;
  2615. // set defaults
  2616. // s->decode_mb= ff_h263_decode_mb;
  2617. s->low_delay= 1;
  2618. avctx->pix_fmt= PIX_FMT_YUV420P;
  2619. decode_init_vlc();
  2620. if(avctx->extradata_size > 0 && avctx->extradata &&
  2621. *(char *)avctx->extradata == 1){
  2622. h->is_avc = 1;
  2623. h->got_avcC = 0;
  2624. } else {
  2625. h->is_avc = 0;
  2626. }
  2627. return 0;
  2628. }
  2629. static int frame_start(H264Context *h){
  2630. MpegEncContext * const s = &h->s;
  2631. int i;
  2632. if(MPV_frame_start(s, s->avctx) < 0)
  2633. return -1;
  2634. ff_er_frame_start(s);
  2635. assert(s->linesize && s->uvlinesize);
  2636. for(i=0; i<16; i++){
  2637. h->block_offset[i]= 4*((scan8[i] - scan8[0])&7) + 4*s->linesize*((scan8[i] - scan8[0])>>3);
  2638. h->block_offset[24+i]= 4*((scan8[i] - scan8[0])&7) + 8*s->linesize*((scan8[i] - scan8[0])>>3);
  2639. }
  2640. for(i=0; i<4; i++){
  2641. h->block_offset[16+i]=
  2642. h->block_offset[20+i]= 4*((scan8[i] - scan8[0])&7) + 4*s->uvlinesize*((scan8[i] - scan8[0])>>3);
  2643. h->block_offset[24+16+i]=
  2644. h->block_offset[24+20+i]= 4*((scan8[i] - scan8[0])&7) + 8*s->uvlinesize*((scan8[i] - scan8[0])>>3);
  2645. }
  2646. /* can't be in alloc_tables because linesize isn't known there.
  2647. * FIXME: redo bipred weight to not require extra buffer? */
  2648. if(!s->obmc_scratchpad)
  2649. s->obmc_scratchpad = av_malloc(16*2*s->linesize + 8*2*s->uvlinesize);
  2650. /* some macroblocks will be accessed before they're available */
  2651. if(FRAME_MBAFF)
  2652. memset(h->slice_table, -1, (s->mb_height*s->mb_stride-1) * sizeof(uint8_t));
  2653. // s->decode= (s->flags&CODEC_FLAG_PSNR) || !s->encoding || s->current_picture.reference /*|| h->contains_intra*/ || 1;
  2654. return 0;
  2655. }
  2656. 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){
  2657. MpegEncContext * const s = &h->s;
  2658. int i;
  2659. src_y -= linesize;
  2660. src_cb -= uvlinesize;
  2661. src_cr -= uvlinesize;
  2662. // There are two lines saved, the line above the the top macroblock of a pair,
  2663. // and the line above the bottom macroblock
  2664. h->left_border[0]= h->top_borders[0][s->mb_x][15];
  2665. for(i=1; i<17; i++){
  2666. h->left_border[i]= src_y[15+i* linesize];
  2667. }
  2668. *(uint64_t*)(h->top_borders[0][s->mb_x]+0)= *(uint64_t*)(src_y + 16*linesize);
  2669. *(uint64_t*)(h->top_borders[0][s->mb_x]+8)= *(uint64_t*)(src_y +8+16*linesize);
  2670. if(simple || !(s->flags&CODEC_FLAG_GRAY)){
  2671. h->left_border[17 ]= h->top_borders[0][s->mb_x][16+7];
  2672. h->left_border[17+9]= h->top_borders[0][s->mb_x][24+7];
  2673. for(i=1; i<9; i++){
  2674. h->left_border[i+17 ]= src_cb[7+i*uvlinesize];
  2675. h->left_border[i+17+9]= src_cr[7+i*uvlinesize];
  2676. }
  2677. *(uint64_t*)(h->top_borders[0][s->mb_x]+16)= *(uint64_t*)(src_cb+8*uvlinesize);
  2678. *(uint64_t*)(h->top_borders[0][s->mb_x]+24)= *(uint64_t*)(src_cr+8*uvlinesize);
  2679. }
  2680. }
  2681. 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){
  2682. MpegEncContext * const s = &h->s;
  2683. int temp8, i;
  2684. uint64_t temp64;
  2685. int deblock_left;
  2686. int deblock_top;
  2687. int mb_xy;
  2688. if(h->deblocking_filter == 2) {
  2689. mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  2690. deblock_left = h->slice_table[mb_xy] == h->slice_table[mb_xy - 1];
  2691. deblock_top = h->slice_table[mb_xy] == h->slice_table[h->top_mb_xy];
  2692. } else {
  2693. deblock_left = (s->mb_x > 0);
  2694. deblock_top = (s->mb_y > 0);
  2695. }
  2696. src_y -= linesize + 1;
  2697. src_cb -= uvlinesize + 1;
  2698. src_cr -= uvlinesize + 1;
  2699. #define XCHG(a,b,t,xchg)\
  2700. t= a;\
  2701. if(xchg)\
  2702. a= b;\
  2703. b= t;
  2704. if(deblock_left){
  2705. for(i = !deblock_top; i<17; i++){
  2706. XCHG(h->left_border[i ], src_y [i* linesize], temp8, xchg);
  2707. }
  2708. }
  2709. if(deblock_top){
  2710. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+0), *(uint64_t*)(src_y +1), temp64, xchg);
  2711. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+8), *(uint64_t*)(src_y +9), temp64, 1);
  2712. if(s->mb_x+1 < s->mb_width){
  2713. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x+1]), *(uint64_t*)(src_y +17), temp64, 1);
  2714. }
  2715. }
  2716. if(simple || !(s->flags&CODEC_FLAG_GRAY)){
  2717. if(deblock_left){
  2718. for(i = !deblock_top; i<9; i++){
  2719. XCHG(h->left_border[i+17 ], src_cb[i*uvlinesize], temp8, xchg);
  2720. XCHG(h->left_border[i+17+9], src_cr[i*uvlinesize], temp8, xchg);
  2721. }
  2722. }
  2723. if(deblock_top){
  2724. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+16), *(uint64_t*)(src_cb+1), temp64, 1);
  2725. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+24), *(uint64_t*)(src_cr+1), temp64, 1);
  2726. }
  2727. }
  2728. }
  2729. static inline void backup_pair_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize){
  2730. MpegEncContext * const s = &h->s;
  2731. int i;
  2732. src_y -= 2 * linesize;
  2733. src_cb -= 2 * uvlinesize;
  2734. src_cr -= 2 * uvlinesize;
  2735. // There are two lines saved, the line above the the top macroblock of a pair,
  2736. // and the line above the bottom macroblock
  2737. h->left_border[0]= h->top_borders[0][s->mb_x][15];
  2738. h->left_border[1]= h->top_borders[1][s->mb_x][15];
  2739. for(i=2; i<34; i++){
  2740. h->left_border[i]= src_y[15+i* linesize];
  2741. }
  2742. *(uint64_t*)(h->top_borders[0][s->mb_x]+0)= *(uint64_t*)(src_y + 32*linesize);
  2743. *(uint64_t*)(h->top_borders[0][s->mb_x]+8)= *(uint64_t*)(src_y +8+32*linesize);
  2744. *(uint64_t*)(h->top_borders[1][s->mb_x]+0)= *(uint64_t*)(src_y + 33*linesize);
  2745. *(uint64_t*)(h->top_borders[1][s->mb_x]+8)= *(uint64_t*)(src_y +8+33*linesize);
  2746. if(!(s->flags&CODEC_FLAG_GRAY)){
  2747. h->left_border[34 ]= h->top_borders[0][s->mb_x][16+7];
  2748. h->left_border[34+ 1]= h->top_borders[1][s->mb_x][16+7];
  2749. h->left_border[34+18 ]= h->top_borders[0][s->mb_x][24+7];
  2750. h->left_border[34+18+1]= h->top_borders[1][s->mb_x][24+7];
  2751. for(i=2; i<18; i++){
  2752. h->left_border[i+34 ]= src_cb[7+i*uvlinesize];
  2753. h->left_border[i+34+18]= src_cr[7+i*uvlinesize];
  2754. }
  2755. *(uint64_t*)(h->top_borders[0][s->mb_x]+16)= *(uint64_t*)(src_cb+16*uvlinesize);
  2756. *(uint64_t*)(h->top_borders[0][s->mb_x]+24)= *(uint64_t*)(src_cr+16*uvlinesize);
  2757. *(uint64_t*)(h->top_borders[1][s->mb_x]+16)= *(uint64_t*)(src_cb+17*uvlinesize);
  2758. *(uint64_t*)(h->top_borders[1][s->mb_x]+24)= *(uint64_t*)(src_cr+17*uvlinesize);
  2759. }
  2760. }
  2761. 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){
  2762. MpegEncContext * const s = &h->s;
  2763. int temp8, i;
  2764. uint64_t temp64;
  2765. int deblock_left = (s->mb_x > 0);
  2766. int deblock_top = (s->mb_y > 1);
  2767. 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);
  2768. src_y -= 2 * linesize + 1;
  2769. src_cb -= 2 * uvlinesize + 1;
  2770. src_cr -= 2 * uvlinesize + 1;
  2771. #define XCHG(a,b,t,xchg)\
  2772. t= a;\
  2773. if(xchg)\
  2774. a= b;\
  2775. b= t;
  2776. if(deblock_left){
  2777. for(i = (!deblock_top)<<1; i<34; i++){
  2778. XCHG(h->left_border[i ], src_y [i* linesize], temp8, xchg);
  2779. }
  2780. }
  2781. if(deblock_top){
  2782. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+0), *(uint64_t*)(src_y +1), temp64, xchg);
  2783. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+8), *(uint64_t*)(src_y +9), temp64, 1);
  2784. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+0), *(uint64_t*)(src_y +1 +linesize), temp64, xchg);
  2785. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+8), *(uint64_t*)(src_y +9 +linesize), temp64, 1);
  2786. if(s->mb_x+1 < s->mb_width){
  2787. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x+1]), *(uint64_t*)(src_y +17), temp64, 1);
  2788. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x+1]), *(uint64_t*)(src_y +17 +linesize), temp64, 1);
  2789. }
  2790. }
  2791. if(!(s->flags&CODEC_FLAG_GRAY)){
  2792. if(deblock_left){
  2793. for(i = (!deblock_top) << 1; i<18; i++){
  2794. XCHG(h->left_border[i+34 ], src_cb[i*uvlinesize], temp8, xchg);
  2795. XCHG(h->left_border[i+34+18], src_cr[i*uvlinesize], temp8, xchg);
  2796. }
  2797. }
  2798. if(deblock_top){
  2799. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+16), *(uint64_t*)(src_cb+1), temp64, 1);
  2800. XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+24), *(uint64_t*)(src_cr+1), temp64, 1);
  2801. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+16), *(uint64_t*)(src_cb+1 +uvlinesize), temp64, 1);
  2802. XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+24), *(uint64_t*)(src_cr+1 +uvlinesize), temp64, 1);
  2803. }
  2804. }
  2805. }
  2806. static av_always_inline void hl_decode_mb_internal(H264Context *h, int simple){
  2807. MpegEncContext * const s = &h->s;
  2808. const int mb_x= s->mb_x;
  2809. const int mb_y= s->mb_y;
  2810. const int mb_xy= mb_x + mb_y*s->mb_stride;
  2811. const int mb_type= s->current_picture.mb_type[mb_xy];
  2812. uint8_t *dest_y, *dest_cb, *dest_cr;
  2813. int linesize, uvlinesize /*dct_offset*/;
  2814. int i;
  2815. int *block_offset = &h->block_offset[0];
  2816. const unsigned int bottom = mb_y & 1;
  2817. const int transform_bypass = (s->qscale == 0 && h->sps.transform_bypass), is_h264 = (simple || s->codec_id == CODEC_ID_H264);
  2818. void (*idct_add)(uint8_t *dst, DCTELEM *block, int stride);
  2819. void (*idct_dc_add)(uint8_t *dst, DCTELEM *block, int stride);
  2820. dest_y = s->current_picture.data[0] + (mb_y * 16* s->linesize ) + mb_x * 16;
  2821. dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2822. dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2823. s->dsp.prefetch(dest_y + (s->mb_x&3)*4*s->linesize + 64, s->linesize, 4);
  2824. s->dsp.prefetch(dest_cb + (s->mb_x&7)*s->uvlinesize + 64, dest_cr - dest_cb, 2);
  2825. if (!simple && MB_FIELD) {
  2826. linesize = h->mb_linesize = s->linesize * 2;
  2827. uvlinesize = h->mb_uvlinesize = s->uvlinesize * 2;
  2828. block_offset = &h->block_offset[24];
  2829. if(mb_y&1){ //FIXME move out of this func?
  2830. dest_y -= s->linesize*15;
  2831. dest_cb-= s->uvlinesize*7;
  2832. dest_cr-= s->uvlinesize*7;
  2833. }
  2834. if(FRAME_MBAFF) {
  2835. int list;
  2836. for(list=0; list<h->list_count; list++){
  2837. if(!USES_LIST(mb_type, list))
  2838. continue;
  2839. if(IS_16X16(mb_type)){
  2840. int8_t *ref = &h->ref_cache[list][scan8[0]];
  2841. fill_rectangle(ref, 4, 4, 8, 16+*ref^(s->mb_y&1), 1);
  2842. }else{
  2843. for(i=0; i<16; i+=4){
  2844. //FIXME can refs be smaller than 8x8 when !direct_8x8_inference ?
  2845. int ref = h->ref_cache[list][scan8[i]];
  2846. if(ref >= 0)
  2847. fill_rectangle(&h->ref_cache[list][scan8[i]], 2, 2, 8, 16+ref^(s->mb_y&1), 1);
  2848. }
  2849. }
  2850. }
  2851. }
  2852. } else {
  2853. linesize = h->mb_linesize = s->linesize;
  2854. uvlinesize = h->mb_uvlinesize = s->uvlinesize;
  2855. // dct_offset = s->linesize * 16;
  2856. }
  2857. if(transform_bypass){
  2858. idct_dc_add =
  2859. idct_add = IS_8x8DCT(mb_type) ? s->dsp.add_pixels8 : s->dsp.add_pixels4;
  2860. }else if(IS_8x8DCT(mb_type)){
  2861. idct_dc_add = s->dsp.h264_idct8_dc_add;
  2862. idct_add = s->dsp.h264_idct8_add;
  2863. }else{
  2864. idct_dc_add = s->dsp.h264_idct_dc_add;
  2865. idct_add = s->dsp.h264_idct_add;
  2866. }
  2867. if(!simple && FRAME_MBAFF && h->deblocking_filter && IS_INTRA(mb_type)
  2868. && (!bottom || !IS_INTRA(s->current_picture.mb_type[mb_xy-s->mb_stride]))){
  2869. int mbt_y = mb_y&~1;
  2870. uint8_t *top_y = s->current_picture.data[0] + (mbt_y * 16* s->linesize ) + mb_x * 16;
  2871. uint8_t *top_cb = s->current_picture.data[1] + (mbt_y * 8 * s->uvlinesize) + mb_x * 8;
  2872. uint8_t *top_cr = s->current_picture.data[2] + (mbt_y * 8 * s->uvlinesize) + mb_x * 8;
  2873. xchg_pair_border(h, top_y, top_cb, top_cr, s->linesize, s->uvlinesize, 1);
  2874. }
  2875. if (!simple && IS_INTRA_PCM(mb_type)) {
  2876. unsigned int x, y;
  2877. // The pixels are stored in h->mb array in the same order as levels,
  2878. // copy them in output in the correct order.
  2879. for(i=0; i<16; i++) {
  2880. for (y=0; y<4; y++) {
  2881. for (x=0; x<4; x++) {
  2882. *(dest_y + block_offset[i] + y*linesize + x) = h->mb[i*16+y*4+x];
  2883. }
  2884. }
  2885. }
  2886. for(i=16; i<16+4; i++) {
  2887. for (y=0; y<4; y++) {
  2888. for (x=0; x<4; x++) {
  2889. *(dest_cb + block_offset[i] + y*uvlinesize + x) = h->mb[i*16+y*4+x];
  2890. }
  2891. }
  2892. }
  2893. for(i=20; i<20+4; i++) {
  2894. for (y=0; y<4; y++) {
  2895. for (x=0; x<4; x++) {
  2896. *(dest_cr + block_offset[i] + y*uvlinesize + x) = h->mb[i*16+y*4+x];
  2897. }
  2898. }
  2899. }
  2900. } else {
  2901. if(IS_INTRA(mb_type)){
  2902. if(h->deblocking_filter && (simple || !FRAME_MBAFF))
  2903. xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 1, simple);
  2904. if(simple || !(s->flags&CODEC_FLAG_GRAY)){
  2905. h->pred8x8[ h->chroma_pred_mode ](dest_cb, uvlinesize);
  2906. h->pred8x8[ h->chroma_pred_mode ](dest_cr, uvlinesize);
  2907. }
  2908. if(IS_INTRA4x4(mb_type)){
  2909. if(simple || !s->encoding){
  2910. if(IS_8x8DCT(mb_type)){
  2911. for(i=0; i<16; i+=4){
  2912. uint8_t * const ptr= dest_y + block_offset[i];
  2913. const int dir= h->intra4x4_pred_mode_cache[ scan8[i] ];
  2914. const int nnz = h->non_zero_count_cache[ scan8[i] ];
  2915. h->pred8x8l[ dir ](ptr, (h->topleft_samples_available<<i)&0x8000,
  2916. (h->topright_samples_available<<i)&0x4000, linesize);
  2917. if(nnz){
  2918. if(nnz == 1 && h->mb[i*16])
  2919. idct_dc_add(ptr, h->mb + i*16, linesize);
  2920. else
  2921. idct_add(ptr, h->mb + i*16, linesize);
  2922. }
  2923. }
  2924. }else
  2925. for(i=0; i<16; i++){
  2926. uint8_t * const ptr= dest_y + block_offset[i];
  2927. uint8_t *topright;
  2928. const int dir= h->intra4x4_pred_mode_cache[ scan8[i] ];
  2929. int nnz, tr;
  2930. if(dir == DIAG_DOWN_LEFT_PRED || dir == VERT_LEFT_PRED){
  2931. const int topright_avail= (h->topright_samples_available<<i)&0x8000;
  2932. assert(mb_y || linesize <= block_offset[i]);
  2933. if(!topright_avail){
  2934. tr= ptr[3 - linesize]*0x01010101;
  2935. topright= (uint8_t*) &tr;
  2936. }else
  2937. topright= ptr + 4 - linesize;
  2938. }else
  2939. topright= NULL;
  2940. h->pred4x4[ dir ](ptr, topright, linesize);
  2941. nnz = h->non_zero_count_cache[ scan8[i] ];
  2942. if(nnz){
  2943. if(is_h264){
  2944. if(nnz == 1 && h->mb[i*16])
  2945. idct_dc_add(ptr, h->mb + i*16, linesize);
  2946. else
  2947. idct_add(ptr, h->mb + i*16, linesize);
  2948. }else
  2949. svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, 0);
  2950. }
  2951. }
  2952. }
  2953. }else{
  2954. h->pred16x16[ h->intra16x16_pred_mode ](dest_y , linesize);
  2955. if(is_h264){
  2956. if(!transform_bypass)
  2957. h264_luma_dc_dequant_idct_c(h->mb, s->qscale, h->dequant4_coeff[IS_INTRA(mb_type) ? 0:3][s->qscale][0]);
  2958. }else
  2959. svq3_luma_dc_dequant_idct_c(h->mb, s->qscale);
  2960. }
  2961. if(h->deblocking_filter && (simple || !FRAME_MBAFF))
  2962. xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 0, simple);
  2963. }else if(is_h264){
  2964. hl_motion(h, dest_y, dest_cb, dest_cr,
  2965. s->me.qpel_put, s->dsp.put_h264_chroma_pixels_tab,
  2966. s->me.qpel_avg, s->dsp.avg_h264_chroma_pixels_tab,
  2967. s->dsp.weight_h264_pixels_tab, s->dsp.biweight_h264_pixels_tab);
  2968. }
  2969. if(!IS_INTRA4x4(mb_type)){
  2970. if(is_h264){
  2971. if(IS_INTRA16x16(mb_type)){
  2972. for(i=0; i<16; i++){
  2973. if(h->non_zero_count_cache[ scan8[i] ])
  2974. idct_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2975. else if(h->mb[i*16])
  2976. idct_dc_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2977. }
  2978. }else{
  2979. const int di = IS_8x8DCT(mb_type) ? 4 : 1;
  2980. for(i=0; i<16; i+=di){
  2981. int nnz = h->non_zero_count_cache[ scan8[i] ];
  2982. if(nnz){
  2983. if(nnz==1 && h->mb[i*16])
  2984. idct_dc_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2985. else
  2986. idct_add(dest_y + block_offset[i], h->mb + i*16, linesize);
  2987. }
  2988. }
  2989. }
  2990. }else{
  2991. for(i=0; i<16; i++){
  2992. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){ //FIXME benchmark weird rule, & below
  2993. uint8_t * const ptr= dest_y + block_offset[i];
  2994. svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, IS_INTRA(mb_type) ? 1 : 0);
  2995. }
  2996. }
  2997. }
  2998. }
  2999. if(simple || !(s->flags&CODEC_FLAG_GRAY)){
  3000. uint8_t *dest[2] = {dest_cb, dest_cr};
  3001. if(transform_bypass){
  3002. idct_add = idct_dc_add = s->dsp.add_pixels4;
  3003. }else{
  3004. idct_add = s->dsp.h264_idct_add;
  3005. idct_dc_add = s->dsp.h264_idct_dc_add;
  3006. 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]);
  3007. 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]);
  3008. }
  3009. if(is_h264){
  3010. for(i=16; i<16+8; i++){
  3011. if(h->non_zero_count_cache[ scan8[i] ])
  3012. idct_add(dest[(i&4)>>2] + block_offset[i], h->mb + i*16, uvlinesize);
  3013. else if(h->mb[i*16])
  3014. idct_dc_add(dest[(i&4)>>2] + block_offset[i], h->mb + i*16, uvlinesize);
  3015. }
  3016. }else{
  3017. for(i=16; i<16+8; i++){
  3018. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){
  3019. uint8_t * const ptr= dest[(i&4)>>2] + block_offset[i];
  3020. svq3_add_idct_c(ptr, h->mb + i*16, uvlinesize, chroma_qp[s->qscale + 12] - 12, 2);
  3021. }
  3022. }
  3023. }
  3024. }
  3025. }
  3026. if(h->deblocking_filter) {
  3027. if (!simple && FRAME_MBAFF) {
  3028. //FIXME try deblocking one mb at a time?
  3029. // the reduction in load/storing mvs and such might outweigh the extra backup/xchg_border
  3030. const int mb_y = s->mb_y - 1;
  3031. uint8_t *pair_dest_y, *pair_dest_cb, *pair_dest_cr;
  3032. const int mb_xy= mb_x + mb_y*s->mb_stride;
  3033. const int mb_type_top = s->current_picture.mb_type[mb_xy];
  3034. const int mb_type_bottom= s->current_picture.mb_type[mb_xy+s->mb_stride];
  3035. if (!bottom) return;
  3036. pair_dest_y = s->current_picture.data[0] + (mb_y * 16* s->linesize ) + mb_x * 16;
  3037. pair_dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  3038. pair_dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  3039. if(IS_INTRA(mb_type_top | mb_type_bottom))
  3040. xchg_pair_border(h, pair_dest_y, pair_dest_cb, pair_dest_cr, s->linesize, s->uvlinesize, 0);
  3041. backup_pair_border(h, pair_dest_y, pair_dest_cb, pair_dest_cr, s->linesize, s->uvlinesize);
  3042. // deblock a pair
  3043. // top
  3044. s->mb_y--;
  3045. 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);
  3046. fill_caches(h, mb_type_top, 1); //FIXME don't fill stuff which isn't used by filter_mb
  3047. h->chroma_qp[0] = get_chroma_qp(h, 0, s->current_picture.qscale_table[mb_xy]);
  3048. h->chroma_qp[1] = get_chroma_qp(h, 1, s->current_picture.qscale_table[mb_xy]);
  3049. filter_mb(h, mb_x, mb_y, pair_dest_y, pair_dest_cb, pair_dest_cr, linesize, uvlinesize);
  3050. // bottom
  3051. s->mb_y++;
  3052. tprintf(h->s.avctx, "call mbaff filter_mb\n");
  3053. fill_caches(h, mb_type_bottom, 1); //FIXME don't fill stuff which isn't used by filter_mb
  3054. h->chroma_qp[0] = get_chroma_qp(h, 0, s->current_picture.qscale_table[mb_xy+s->mb_stride]);
  3055. h->chroma_qp[1] = get_chroma_qp(h, 1, s->current_picture.qscale_table[mb_xy+s->mb_stride]);
  3056. filter_mb(h, mb_x, mb_y+1, dest_y, dest_cb, dest_cr, linesize, uvlinesize);
  3057. } else {
  3058. tprintf(h->s.avctx, "call filter_mb\n");
  3059. backup_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, simple);
  3060. fill_caches(h, mb_type, 1); //FIXME don't fill stuff which isn't used by filter_mb
  3061. filter_mb_fast(h, mb_x, mb_y, dest_y, dest_cb, dest_cr, linesize, uvlinesize);
  3062. }
  3063. }
  3064. }
  3065. /**
  3066. * Process a macroblock; this case avoids checks for expensive uncommon cases.
  3067. */
  3068. static void hl_decode_mb_simple(H264Context *h){
  3069. hl_decode_mb_internal(h, 1);
  3070. }
  3071. /**
  3072. * Process a macroblock; this handles edge cases, such as interlacing.
  3073. */
  3074. static void av_noinline hl_decode_mb_complex(H264Context *h){
  3075. hl_decode_mb_internal(h, 0);
  3076. }
  3077. static void hl_decode_mb(H264Context *h){
  3078. MpegEncContext * const s = &h->s;
  3079. const int mb_x= s->mb_x;
  3080. const int mb_y= s->mb_y;
  3081. const int mb_xy= mb_x + mb_y*s->mb_stride;
  3082. const int mb_type= s->current_picture.mb_type[mb_xy];
  3083. int is_complex = FRAME_MBAFF || MB_FIELD || IS_INTRA_PCM(mb_type) || s->codec_id != CODEC_ID_H264 || (s->flags&CODEC_FLAG_GRAY) || s->encoding;
  3084. if(!s->decode)
  3085. return;
  3086. if (is_complex)
  3087. hl_decode_mb_complex(h);
  3088. else hl_decode_mb_simple(h);
  3089. }
  3090. /**
  3091. * fills the default_ref_list.
  3092. */
  3093. static int fill_default_ref_list(H264Context *h){
  3094. MpegEncContext * const s = &h->s;
  3095. int i;
  3096. int smallest_poc_greater_than_current = -1;
  3097. Picture sorted_short_ref[32];
  3098. if(h->slice_type==B_TYPE){
  3099. int out_i;
  3100. int limit= INT_MIN;
  3101. /* sort frame according to poc in B slice */
  3102. for(out_i=0; out_i<h->short_ref_count; out_i++){
  3103. int best_i=INT_MIN;
  3104. int best_poc=INT_MAX;
  3105. for(i=0; i<h->short_ref_count; i++){
  3106. const int poc= h->short_ref[i]->poc;
  3107. if(poc > limit && poc < best_poc){
  3108. best_poc= poc;
  3109. best_i= i;
  3110. }
  3111. }
  3112. assert(best_i != INT_MIN);
  3113. limit= best_poc;
  3114. sorted_short_ref[out_i]= *h->short_ref[best_i];
  3115. 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);
  3116. if (-1 == smallest_poc_greater_than_current) {
  3117. if (h->short_ref[best_i]->poc >= s->current_picture_ptr->poc) {
  3118. smallest_poc_greater_than_current = out_i;
  3119. }
  3120. }
  3121. }
  3122. }
  3123. if(s->picture_structure == PICT_FRAME){
  3124. if(h->slice_type==B_TYPE){
  3125. int list;
  3126. tprintf(h->s.avctx, "current poc: %d, smallest_poc_greater_than_current: %d\n", s->current_picture_ptr->poc, smallest_poc_greater_than_current);
  3127. // find the largest poc
  3128. for(list=0; list<2; list++){
  3129. int index = 0;
  3130. int j= -99;
  3131. int step= list ? -1 : 1;
  3132. for(i=0; i<h->short_ref_count && index < h->ref_count[list]; i++, j+=step) {
  3133. while(j<0 || j>= h->short_ref_count){
  3134. if(j != -99 && step == (list ? -1 : 1))
  3135. return -1;
  3136. step = -step;
  3137. j= smallest_poc_greater_than_current + (step>>1);
  3138. }
  3139. if(sorted_short_ref[j].reference != 3) continue;
  3140. h->default_ref_list[list][index ]= sorted_short_ref[j];
  3141. h->default_ref_list[list][index++].pic_id= sorted_short_ref[j].frame_num;
  3142. }
  3143. for(i = 0; i < 16 && index < h->ref_count[ list ]; i++){
  3144. if(h->long_ref[i] == NULL) continue;
  3145. if(h->long_ref[i]->reference != 3) continue;
  3146. h->default_ref_list[ list ][index ]= *h->long_ref[i];
  3147. h->default_ref_list[ list ][index++].pic_id= i;;
  3148. }
  3149. if(list && (smallest_poc_greater_than_current<=0 || smallest_poc_greater_than_current>=h->short_ref_count) && (1 < index)){
  3150. // swap the two first elements of L1 when
  3151. // L0 and L1 are identical
  3152. Picture temp= h->default_ref_list[1][0];
  3153. h->default_ref_list[1][0] = h->default_ref_list[1][1];
  3154. h->default_ref_list[1][1] = temp;
  3155. }
  3156. if(index < h->ref_count[ list ])
  3157. memset(&h->default_ref_list[list][index], 0, sizeof(Picture)*(h->ref_count[ list ] - index));
  3158. }
  3159. }else{
  3160. int index=0;
  3161. for(i=0; i<h->short_ref_count; i++){
  3162. if(h->short_ref[i]->reference != 3) continue; //FIXME refernce field shit
  3163. h->default_ref_list[0][index ]= *h->short_ref[i];
  3164. h->default_ref_list[0][index++].pic_id= h->short_ref[i]->frame_num;
  3165. }
  3166. for(i = 0; i < 16; i++){
  3167. if(h->long_ref[i] == NULL) continue;
  3168. if(h->long_ref[i]->reference != 3) continue;
  3169. h->default_ref_list[0][index ]= *h->long_ref[i];
  3170. h->default_ref_list[0][index++].pic_id= i;;
  3171. }
  3172. if(index < h->ref_count[0])
  3173. memset(&h->default_ref_list[0][index], 0, sizeof(Picture)*(h->ref_count[0] - index));
  3174. }
  3175. }else{ //FIELD
  3176. if(h->slice_type==B_TYPE){
  3177. }else{
  3178. //FIXME second field balh
  3179. }
  3180. }
  3181. #ifdef TRACE
  3182. for (i=0; i<h->ref_count[0]; i++) {
  3183. 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]);
  3184. }
  3185. if(h->slice_type==B_TYPE){
  3186. for (i=0; i<h->ref_count[1]; i++) {
  3187. 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[0][i].data[0]);
  3188. }
  3189. }
  3190. #endif
  3191. return 0;
  3192. }
  3193. static void print_short_term(H264Context *h);
  3194. static void print_long_term(H264Context *h);
  3195. static int decode_ref_pic_list_reordering(H264Context *h){
  3196. MpegEncContext * const s = &h->s;
  3197. int list, index;
  3198. print_short_term(h);
  3199. print_long_term(h);
  3200. if(h->slice_type==I_TYPE || h->slice_type==SI_TYPE) return 0; //FIXME move before func
  3201. for(list=0; list<h->list_count; list++){
  3202. memcpy(h->ref_list[list], h->default_ref_list[list], sizeof(Picture)*h->ref_count[list]);
  3203. if(get_bits1(&s->gb)){
  3204. int pred= h->curr_pic_num;
  3205. for(index=0; ; index++){
  3206. unsigned int reordering_of_pic_nums_idc= get_ue_golomb(&s->gb);
  3207. unsigned int pic_id;
  3208. int i;
  3209. Picture *ref = NULL;
  3210. if(reordering_of_pic_nums_idc==3)
  3211. break;
  3212. if(index >= h->ref_count[list]){
  3213. av_log(h->s.avctx, AV_LOG_ERROR, "reference count overflow\n");
  3214. return -1;
  3215. }
  3216. if(reordering_of_pic_nums_idc<3){
  3217. if(reordering_of_pic_nums_idc<2){
  3218. const unsigned int abs_diff_pic_num= get_ue_golomb(&s->gb) + 1;
  3219. if(abs_diff_pic_num >= h->max_pic_num){
  3220. av_log(h->s.avctx, AV_LOG_ERROR, "abs_diff_pic_num overflow\n");
  3221. return -1;
  3222. }
  3223. if(reordering_of_pic_nums_idc == 0) pred-= abs_diff_pic_num;
  3224. else pred+= abs_diff_pic_num;
  3225. pred &= h->max_pic_num - 1;
  3226. for(i= h->short_ref_count-1; i>=0; i--){
  3227. ref = h->short_ref[i];
  3228. assert(ref->reference == 3);
  3229. assert(!ref->long_ref);
  3230. if(ref->data[0] != NULL && ref->frame_num == pred && ref->long_ref == 0) // ignore non existing pictures by testing data[0] pointer
  3231. break;
  3232. }
  3233. if(i>=0)
  3234. ref->pic_id= ref->frame_num;
  3235. }else{
  3236. pic_id= get_ue_golomb(&s->gb); //long_term_pic_idx
  3237. if(pic_id>31){
  3238. av_log(h->s.avctx, AV_LOG_ERROR, "long_term_pic_idx overflow\n");
  3239. return -1;
  3240. }
  3241. ref = h->long_ref[pic_id];
  3242. if(ref){
  3243. ref->pic_id= pic_id;
  3244. assert(ref->reference == 3);
  3245. assert(ref->long_ref);
  3246. i=0;
  3247. }else{
  3248. i=-1;
  3249. }
  3250. }
  3251. if (i < 0) {
  3252. av_log(h->s.avctx, AV_LOG_ERROR, "reference picture missing during reorder\n");
  3253. memset(&h->ref_list[list][index], 0, sizeof(Picture)); //FIXME
  3254. } else {
  3255. for(i=index; i+1<h->ref_count[list]; i++){
  3256. if(ref->long_ref == h->ref_list[list][i].long_ref && ref->pic_id == h->ref_list[list][i].pic_id)
  3257. break;
  3258. }
  3259. for(; i > index; i--){
  3260. h->ref_list[list][i]= h->ref_list[list][i-1];
  3261. }
  3262. h->ref_list[list][index]= *ref;
  3263. }
  3264. }else{
  3265. av_log(h->s.avctx, AV_LOG_ERROR, "illegal reordering_of_pic_nums_idc\n");
  3266. return -1;
  3267. }
  3268. }
  3269. }
  3270. }
  3271. for(list=0; list<h->list_count; list++){
  3272. for(index= 0; index < h->ref_count[list]; index++){
  3273. if(!h->ref_list[list][index].data[0])
  3274. h->ref_list[list][index]= s->current_picture;
  3275. }
  3276. }
  3277. if(h->slice_type==B_TYPE && !h->direct_spatial_mv_pred)
  3278. direct_dist_scale_factor(h);
  3279. direct_ref_list_init(h);
  3280. return 0;
  3281. }
  3282. static void fill_mbaff_ref_list(H264Context *h){
  3283. int list, i, j;
  3284. for(list=0; list<2; list++){ //FIXME try list_count
  3285. for(i=0; i<h->ref_count[list]; i++){
  3286. Picture *frame = &h->ref_list[list][i];
  3287. Picture *field = &h->ref_list[list][16+2*i];
  3288. field[0] = *frame;
  3289. for(j=0; j<3; j++)
  3290. field[0].linesize[j] <<= 1;
  3291. field[1] = field[0];
  3292. for(j=0; j<3; j++)
  3293. field[1].data[j] += frame->linesize[j];
  3294. h->luma_weight[list][16+2*i] = h->luma_weight[list][16+2*i+1] = h->luma_weight[list][i];
  3295. h->luma_offset[list][16+2*i] = h->luma_offset[list][16+2*i+1] = h->luma_offset[list][i];
  3296. for(j=0; j<2; j++){
  3297. h->chroma_weight[list][16+2*i][j] = h->chroma_weight[list][16+2*i+1][j] = h->chroma_weight[list][i][j];
  3298. h->chroma_offset[list][16+2*i][j] = h->chroma_offset[list][16+2*i+1][j] = h->chroma_offset[list][i][j];
  3299. }
  3300. }
  3301. }
  3302. for(j=0; j<h->ref_count[1]; j++){
  3303. for(i=0; i<h->ref_count[0]; i++)
  3304. h->implicit_weight[j][16+2*i] = h->implicit_weight[j][16+2*i+1] = h->implicit_weight[j][i];
  3305. memcpy(h->implicit_weight[16+2*j], h->implicit_weight[j], sizeof(*h->implicit_weight));
  3306. memcpy(h->implicit_weight[16+2*j+1], h->implicit_weight[j], sizeof(*h->implicit_weight));
  3307. }
  3308. }
  3309. static int pred_weight_table(H264Context *h){
  3310. MpegEncContext * const s = &h->s;
  3311. int list, i;
  3312. int luma_def, chroma_def;
  3313. h->use_weight= 0;
  3314. h->use_weight_chroma= 0;
  3315. h->luma_log2_weight_denom= get_ue_golomb(&s->gb);
  3316. h->chroma_log2_weight_denom= get_ue_golomb(&s->gb);
  3317. luma_def = 1<<h->luma_log2_weight_denom;
  3318. chroma_def = 1<<h->chroma_log2_weight_denom;
  3319. for(list=0; list<2; list++){
  3320. for(i=0; i<h->ref_count[list]; i++){
  3321. int luma_weight_flag, chroma_weight_flag;
  3322. luma_weight_flag= get_bits1(&s->gb);
  3323. if(luma_weight_flag){
  3324. h->luma_weight[list][i]= get_se_golomb(&s->gb);
  3325. h->luma_offset[list][i]= get_se_golomb(&s->gb);
  3326. if( h->luma_weight[list][i] != luma_def
  3327. || h->luma_offset[list][i] != 0)
  3328. h->use_weight= 1;
  3329. }else{
  3330. h->luma_weight[list][i]= luma_def;
  3331. h->luma_offset[list][i]= 0;
  3332. }
  3333. chroma_weight_flag= get_bits1(&s->gb);
  3334. if(chroma_weight_flag){
  3335. int j;
  3336. for(j=0; j<2; j++){
  3337. h->chroma_weight[list][i][j]= get_se_golomb(&s->gb);
  3338. h->chroma_offset[list][i][j]= get_se_golomb(&s->gb);
  3339. if( h->chroma_weight[list][i][j] != chroma_def
  3340. || h->chroma_offset[list][i][j] != 0)
  3341. h->use_weight_chroma= 1;
  3342. }
  3343. }else{
  3344. int j;
  3345. for(j=0; j<2; j++){
  3346. h->chroma_weight[list][i][j]= chroma_def;
  3347. h->chroma_offset[list][i][j]= 0;
  3348. }
  3349. }
  3350. }
  3351. if(h->slice_type != B_TYPE) break;
  3352. }
  3353. h->use_weight= h->use_weight || h->use_weight_chroma;
  3354. return 0;
  3355. }
  3356. static void implicit_weight_table(H264Context *h){
  3357. MpegEncContext * const s = &h->s;
  3358. int ref0, ref1;
  3359. int cur_poc = s->current_picture_ptr->poc;
  3360. if( h->ref_count[0] == 1 && h->ref_count[1] == 1
  3361. && h->ref_list[0][0].poc + h->ref_list[1][0].poc == 2*cur_poc){
  3362. h->use_weight= 0;
  3363. h->use_weight_chroma= 0;
  3364. return;
  3365. }
  3366. h->use_weight= 2;
  3367. h->use_weight_chroma= 2;
  3368. h->luma_log2_weight_denom= 5;
  3369. h->chroma_log2_weight_denom= 5;
  3370. for(ref0=0; ref0 < h->ref_count[0]; ref0++){
  3371. int poc0 = h->ref_list[0][ref0].poc;
  3372. for(ref1=0; ref1 < h->ref_count[1]; ref1++){
  3373. int poc1 = h->ref_list[1][ref1].poc;
  3374. int td = av_clip(poc1 - poc0, -128, 127);
  3375. if(td){
  3376. int tb = av_clip(cur_poc - poc0, -128, 127);
  3377. int tx = (16384 + (FFABS(td) >> 1)) / td;
  3378. int dist_scale_factor = av_clip((tb*tx + 32) >> 6, -1024, 1023) >> 2;
  3379. if(dist_scale_factor < -64 || dist_scale_factor > 128)
  3380. h->implicit_weight[ref0][ref1] = 32;
  3381. else
  3382. h->implicit_weight[ref0][ref1] = 64 - dist_scale_factor;
  3383. }else
  3384. h->implicit_weight[ref0][ref1] = 32;
  3385. }
  3386. }
  3387. }
  3388. static inline void unreference_pic(H264Context *h, Picture *pic){
  3389. int i;
  3390. pic->reference=0;
  3391. if(pic == h->delayed_output_pic)
  3392. pic->reference=1;
  3393. else{
  3394. for(i = 0; h->delayed_pic[i]; i++)
  3395. if(pic == h->delayed_pic[i]){
  3396. pic->reference=1;
  3397. break;
  3398. }
  3399. }
  3400. }
  3401. /**
  3402. * instantaneous decoder refresh.
  3403. */
  3404. static void idr(H264Context *h){
  3405. int i;
  3406. for(i=0; i<16; i++){
  3407. if (h->long_ref[i] != NULL) {
  3408. unreference_pic(h, h->long_ref[i]);
  3409. h->long_ref[i]= NULL;
  3410. }
  3411. }
  3412. h->long_ref_count=0;
  3413. for(i=0; i<h->short_ref_count; i++){
  3414. unreference_pic(h, h->short_ref[i]);
  3415. h->short_ref[i]= NULL;
  3416. }
  3417. h->short_ref_count=0;
  3418. }
  3419. /* forget old pics after a seek */
  3420. static void flush_dpb(AVCodecContext *avctx){
  3421. H264Context *h= avctx->priv_data;
  3422. int i;
  3423. for(i=0; i<16; i++) {
  3424. if(h->delayed_pic[i])
  3425. h->delayed_pic[i]->reference= 0;
  3426. h->delayed_pic[i]= NULL;
  3427. }
  3428. if(h->delayed_output_pic)
  3429. h->delayed_output_pic->reference= 0;
  3430. h->delayed_output_pic= NULL;
  3431. idr(h);
  3432. if(h->s.current_picture_ptr)
  3433. h->s.current_picture_ptr->reference= 0;
  3434. }
  3435. /**
  3436. *
  3437. * @return the removed picture or NULL if an error occurs
  3438. */
  3439. static Picture * remove_short(H264Context *h, int frame_num){
  3440. MpegEncContext * const s = &h->s;
  3441. int i;
  3442. if(s->avctx->debug&FF_DEBUG_MMCO)
  3443. av_log(h->s.avctx, AV_LOG_DEBUG, "remove short %d count %d\n", frame_num, h->short_ref_count);
  3444. for(i=0; i<h->short_ref_count; i++){
  3445. Picture *pic= h->short_ref[i];
  3446. if(s->avctx->debug&FF_DEBUG_MMCO)
  3447. av_log(h->s.avctx, AV_LOG_DEBUG, "%d %d %p\n", i, pic->frame_num, pic);
  3448. if(pic->frame_num == frame_num){
  3449. h->short_ref[i]= NULL;
  3450. memmove(&h->short_ref[i], &h->short_ref[i+1], (h->short_ref_count - i - 1)*sizeof(Picture*));
  3451. h->short_ref_count--;
  3452. return pic;
  3453. }
  3454. }
  3455. return NULL;
  3456. }
  3457. /**
  3458. *
  3459. * @return the removed picture or NULL if an error occurs
  3460. */
  3461. static Picture * remove_long(H264Context *h, int i){
  3462. Picture *pic;
  3463. pic= h->long_ref[i];
  3464. h->long_ref[i]= NULL;
  3465. if(pic) h->long_ref_count--;
  3466. return pic;
  3467. }
  3468. /**
  3469. * print short term list
  3470. */
  3471. static void print_short_term(H264Context *h) {
  3472. uint32_t i;
  3473. if(h->s.avctx->debug&FF_DEBUG_MMCO) {
  3474. av_log(h->s.avctx, AV_LOG_DEBUG, "short term list:\n");
  3475. for(i=0; i<h->short_ref_count; i++){
  3476. Picture *pic= h->short_ref[i];
  3477. av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);
  3478. }
  3479. }
  3480. }
  3481. /**
  3482. * print long term list
  3483. */
  3484. static void print_long_term(H264Context *h) {
  3485. uint32_t i;
  3486. if(h->s.avctx->debug&FF_DEBUG_MMCO) {
  3487. av_log(h->s.avctx, AV_LOG_DEBUG, "long term list:\n");
  3488. for(i = 0; i < 16; i++){
  3489. Picture *pic= h->long_ref[i];
  3490. if (pic) {
  3491. av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);
  3492. }
  3493. }
  3494. }
  3495. }
  3496. /**
  3497. * Executes the reference picture marking (memory management control operations).
  3498. */
  3499. static int execute_ref_pic_marking(H264Context *h, MMCO *mmco, int mmco_count){
  3500. MpegEncContext * const s = &h->s;
  3501. int i, j;
  3502. int current_is_long=0;
  3503. Picture *pic;
  3504. if((s->avctx->debug&FF_DEBUG_MMCO) && mmco_count==0)
  3505. av_log(h->s.avctx, AV_LOG_DEBUG, "no mmco here\n");
  3506. for(i=0; i<mmco_count; i++){
  3507. if(s->avctx->debug&FF_DEBUG_MMCO)
  3508. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco:%d %d %d\n", h->mmco[i].opcode, h->mmco[i].short_frame_num, h->mmco[i].long_index);
  3509. switch(mmco[i].opcode){
  3510. case MMCO_SHORT2UNUSED:
  3511. pic= remove_short(h, mmco[i].short_frame_num);
  3512. if(pic)
  3513. unreference_pic(h, pic);
  3514. else if(s->avctx->debug&FF_DEBUG_MMCO)
  3515. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: remove_short() failure\n");
  3516. break;
  3517. case MMCO_SHORT2LONG:
  3518. pic= remove_long(h, mmco[i].long_index);
  3519. if(pic) unreference_pic(h, pic);
  3520. h->long_ref[ mmco[i].long_index ]= remove_short(h, mmco[i].short_frame_num);
  3521. if (h->long_ref[ mmco[i].long_index ]){
  3522. h->long_ref[ mmco[i].long_index ]->long_ref=1;
  3523. h->long_ref_count++;
  3524. }
  3525. break;
  3526. case MMCO_LONG2UNUSED:
  3527. pic= remove_long(h, mmco[i].long_index);
  3528. if(pic)
  3529. unreference_pic(h, pic);
  3530. else if(s->avctx->debug&FF_DEBUG_MMCO)
  3531. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: remove_long() failure\n");
  3532. break;
  3533. case MMCO_LONG:
  3534. pic= remove_long(h, mmco[i].long_index);
  3535. if(pic) unreference_pic(h, pic);
  3536. h->long_ref[ mmco[i].long_index ]= s->current_picture_ptr;
  3537. h->long_ref[ mmco[i].long_index ]->long_ref=1;
  3538. h->long_ref_count++;
  3539. current_is_long=1;
  3540. break;
  3541. case MMCO_SET_MAX_LONG:
  3542. assert(mmco[i].long_index <= 16);
  3543. // just remove the long term which index is greater than new max
  3544. for(j = mmco[i].long_index; j<16; j++){
  3545. pic = remove_long(h, j);
  3546. if (pic) unreference_pic(h, pic);
  3547. }
  3548. break;
  3549. case MMCO_RESET:
  3550. while(h->short_ref_count){
  3551. pic= remove_short(h, h->short_ref[0]->frame_num);
  3552. if(pic) unreference_pic(h, pic);
  3553. }
  3554. for(j = 0; j < 16; j++) {
  3555. pic= remove_long(h, j);
  3556. if(pic) unreference_pic(h, pic);
  3557. }
  3558. break;
  3559. default: assert(0);
  3560. }
  3561. }
  3562. if(!current_is_long){
  3563. pic= remove_short(h, s->current_picture_ptr->frame_num);
  3564. if(pic){
  3565. unreference_pic(h, pic);
  3566. av_log(h->s.avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");
  3567. }
  3568. if(h->short_ref_count)
  3569. memmove(&h->short_ref[1], &h->short_ref[0], h->short_ref_count*sizeof(Picture*));
  3570. h->short_ref[0]= s->current_picture_ptr;
  3571. h->short_ref[0]->long_ref=0;
  3572. h->short_ref_count++;
  3573. }
  3574. print_short_term(h);
  3575. print_long_term(h);
  3576. return 0;
  3577. }
  3578. static int decode_ref_pic_marking(H264Context *h, GetBitContext *gb){
  3579. MpegEncContext * const s = &h->s;
  3580. int i;
  3581. if(h->nal_unit_type == NAL_IDR_SLICE){ //FIXME fields
  3582. s->broken_link= get_bits1(gb) -1;
  3583. h->mmco[0].long_index= get_bits1(gb) - 1; // current_long_term_idx
  3584. if(h->mmco[0].long_index == -1)
  3585. h->mmco_index= 0;
  3586. else{
  3587. h->mmco[0].opcode= MMCO_LONG;
  3588. h->mmco_index= 1;
  3589. }
  3590. }else{
  3591. if(get_bits1(gb)){ // adaptive_ref_pic_marking_mode_flag
  3592. for(i= 0; i<MAX_MMCO_COUNT; i++) {
  3593. MMCOOpcode opcode= get_ue_golomb(gb);
  3594. h->mmco[i].opcode= opcode;
  3595. if(opcode==MMCO_SHORT2UNUSED || opcode==MMCO_SHORT2LONG){
  3596. h->mmco[i].short_frame_num= (h->frame_num - get_ue_golomb(gb) - 1) & ((1<<h->sps.log2_max_frame_num)-1); //FIXME fields
  3597. /* if(h->mmco[i].short_frame_num >= h->short_ref_count || h->short_ref[ h->mmco[i].short_frame_num ] == NULL){
  3598. av_log(s->avctx, AV_LOG_ERROR, "illegal short ref in memory management control operation %d\n", mmco);
  3599. return -1;
  3600. }*/
  3601. }
  3602. if(opcode==MMCO_SHORT2LONG || opcode==MMCO_LONG2UNUSED || opcode==MMCO_LONG || opcode==MMCO_SET_MAX_LONG){
  3603. unsigned int long_index= get_ue_golomb(gb);
  3604. if(/*h->mmco[i].long_index >= h->long_ref_count || h->long_ref[ h->mmco[i].long_index ] == NULL*/ long_index >= 16){
  3605. av_log(h->s.avctx, AV_LOG_ERROR, "illegal long ref in memory management control operation %d\n", opcode);
  3606. return -1;
  3607. }
  3608. h->mmco[i].long_index= long_index;
  3609. }
  3610. if(opcode > (unsigned)MMCO_LONG){
  3611. av_log(h->s.avctx, AV_LOG_ERROR, "illegal memory management control operation %d\n", opcode);
  3612. return -1;
  3613. }
  3614. if(opcode == MMCO_END)
  3615. break;
  3616. }
  3617. h->mmco_index= i;
  3618. }else{
  3619. assert(h->long_ref_count + h->short_ref_count <= h->sps.ref_frame_count);
  3620. if(h->long_ref_count + h->short_ref_count == h->sps.ref_frame_count){ //FIXME fields
  3621. h->mmco[0].opcode= MMCO_SHORT2UNUSED;
  3622. h->mmco[0].short_frame_num= h->short_ref[ h->short_ref_count - 1 ]->frame_num;
  3623. h->mmco_index= 1;
  3624. }else
  3625. h->mmco_index= 0;
  3626. }
  3627. }
  3628. return 0;
  3629. }
  3630. static int init_poc(H264Context *h){
  3631. MpegEncContext * const s = &h->s;
  3632. const int max_frame_num= 1<<h->sps.log2_max_frame_num;
  3633. int field_poc[2];
  3634. if(h->nal_unit_type == NAL_IDR_SLICE){
  3635. h->frame_num_offset= 0;
  3636. }else{
  3637. if(h->frame_num < h->prev_frame_num)
  3638. h->frame_num_offset= h->prev_frame_num_offset + max_frame_num;
  3639. else
  3640. h->frame_num_offset= h->prev_frame_num_offset;
  3641. }
  3642. if(h->sps.poc_type==0){
  3643. const int max_poc_lsb= 1<<h->sps.log2_max_poc_lsb;
  3644. if(h->nal_unit_type == NAL_IDR_SLICE){
  3645. h->prev_poc_msb=
  3646. h->prev_poc_lsb= 0;
  3647. }
  3648. if (h->poc_lsb < h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb >= max_poc_lsb/2)
  3649. h->poc_msb = h->prev_poc_msb + max_poc_lsb;
  3650. else if(h->poc_lsb > h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb < -max_poc_lsb/2)
  3651. h->poc_msb = h->prev_poc_msb - max_poc_lsb;
  3652. else
  3653. h->poc_msb = h->prev_poc_msb;
  3654. //printf("poc: %d %d\n", h->poc_msb, h->poc_lsb);
  3655. field_poc[0] =
  3656. field_poc[1] = h->poc_msb + h->poc_lsb;
  3657. if(s->picture_structure == PICT_FRAME)
  3658. field_poc[1] += h->delta_poc_bottom;
  3659. }else if(h->sps.poc_type==1){
  3660. int abs_frame_num, expected_delta_per_poc_cycle, expectedpoc;
  3661. int i;
  3662. if(h->sps.poc_cycle_length != 0)
  3663. abs_frame_num = h->frame_num_offset + h->frame_num;
  3664. else
  3665. abs_frame_num = 0;
  3666. if(h->nal_ref_idc==0 && abs_frame_num > 0)
  3667. abs_frame_num--;
  3668. expected_delta_per_poc_cycle = 0;
  3669. for(i=0; i < h->sps.poc_cycle_length; i++)
  3670. expected_delta_per_poc_cycle += h->sps.offset_for_ref_frame[ i ]; //FIXME integrate during sps parse
  3671. if(abs_frame_num > 0){
  3672. int poc_cycle_cnt = (abs_frame_num - 1) / h->sps.poc_cycle_length;
  3673. int frame_num_in_poc_cycle = (abs_frame_num - 1) % h->sps.poc_cycle_length;
  3674. expectedpoc = poc_cycle_cnt * expected_delta_per_poc_cycle;
  3675. for(i = 0; i <= frame_num_in_poc_cycle; i++)
  3676. expectedpoc = expectedpoc + h->sps.offset_for_ref_frame[ i ];
  3677. } else
  3678. expectedpoc = 0;
  3679. if(h->nal_ref_idc == 0)
  3680. expectedpoc = expectedpoc + h->sps.offset_for_non_ref_pic;
  3681. field_poc[0] = expectedpoc + h->delta_poc[0];
  3682. field_poc[1] = field_poc[0] + h->sps.offset_for_top_to_bottom_field;
  3683. if(s->picture_structure == PICT_FRAME)
  3684. field_poc[1] += h->delta_poc[1];
  3685. }else{
  3686. int poc;
  3687. if(h->nal_unit_type == NAL_IDR_SLICE){
  3688. poc= 0;
  3689. }else{
  3690. if(h->nal_ref_idc) poc= 2*(h->frame_num_offset + h->frame_num);
  3691. else poc= 2*(h->frame_num_offset + h->frame_num) - 1;
  3692. }
  3693. field_poc[0]= poc;
  3694. field_poc[1]= poc;
  3695. }
  3696. if(s->picture_structure != PICT_BOTTOM_FIELD)
  3697. s->current_picture_ptr->field_poc[0]= field_poc[0];
  3698. if(s->picture_structure != PICT_TOP_FIELD)
  3699. s->current_picture_ptr->field_poc[1]= field_poc[1];
  3700. if(s->picture_structure == PICT_FRAME) // FIXME field pix?
  3701. s->current_picture_ptr->poc= FFMIN(field_poc[0], field_poc[1]);
  3702. return 0;
  3703. }
  3704. /**
  3705. * initialize scan tables
  3706. */
  3707. static void init_scan_tables(H264Context *h){
  3708. MpegEncContext * const s = &h->s;
  3709. int i;
  3710. if(s->dsp.h264_idct_add == ff_h264_idct_add_c){ //FIXME little ugly
  3711. memcpy(h->zigzag_scan, zigzag_scan, 16*sizeof(uint8_t));
  3712. memcpy(h-> field_scan, field_scan, 16*sizeof(uint8_t));
  3713. }else{
  3714. for(i=0; i<16; i++){
  3715. #define T(x) (x>>2) | ((x<<2) & 0xF)
  3716. h->zigzag_scan[i] = T(zigzag_scan[i]);
  3717. h-> field_scan[i] = T( field_scan[i]);
  3718. #undef T
  3719. }
  3720. }
  3721. if(s->dsp.h264_idct8_add == ff_h264_idct8_add_c){
  3722. memcpy(h->zigzag_scan8x8, zigzag_scan8x8, 64*sizeof(uint8_t));
  3723. memcpy(h->zigzag_scan8x8_cavlc, zigzag_scan8x8_cavlc, 64*sizeof(uint8_t));
  3724. memcpy(h->field_scan8x8, field_scan8x8, 64*sizeof(uint8_t));
  3725. memcpy(h->field_scan8x8_cavlc, field_scan8x8_cavlc, 64*sizeof(uint8_t));
  3726. }else{
  3727. for(i=0; i<64; i++){
  3728. #define T(x) (x>>3) | ((x&7)<<3)
  3729. h->zigzag_scan8x8[i] = T(zigzag_scan8x8[i]);
  3730. h->zigzag_scan8x8_cavlc[i] = T(zigzag_scan8x8_cavlc[i]);
  3731. h->field_scan8x8[i] = T(field_scan8x8[i]);
  3732. h->field_scan8x8_cavlc[i] = T(field_scan8x8_cavlc[i]);
  3733. #undef T
  3734. }
  3735. }
  3736. if(h->sps.transform_bypass){ //FIXME same ugly
  3737. h->zigzag_scan_q0 = zigzag_scan;
  3738. h->zigzag_scan8x8_q0 = zigzag_scan8x8;
  3739. h->zigzag_scan8x8_cavlc_q0 = zigzag_scan8x8_cavlc;
  3740. h->field_scan_q0 = field_scan;
  3741. h->field_scan8x8_q0 = field_scan8x8;
  3742. h->field_scan8x8_cavlc_q0 = field_scan8x8_cavlc;
  3743. }else{
  3744. h->zigzag_scan_q0 = h->zigzag_scan;
  3745. h->zigzag_scan8x8_q0 = h->zigzag_scan8x8;
  3746. h->zigzag_scan8x8_cavlc_q0 = h->zigzag_scan8x8_cavlc;
  3747. h->field_scan_q0 = h->field_scan;
  3748. h->field_scan8x8_q0 = h->field_scan8x8;
  3749. h->field_scan8x8_cavlc_q0 = h->field_scan8x8_cavlc;
  3750. }
  3751. }
  3752. /**
  3753. * decodes a slice header.
  3754. * this will allso call MPV_common_init() and frame_start() as needed
  3755. */
  3756. static int decode_slice_header(H264Context *h){
  3757. MpegEncContext * const s = &h->s;
  3758. unsigned int first_mb_in_slice;
  3759. unsigned int pps_id;
  3760. int num_ref_idx_active_override_flag;
  3761. static const uint8_t slice_type_map[5]= {P_TYPE, B_TYPE, I_TYPE, SP_TYPE, SI_TYPE};
  3762. unsigned int slice_type, tmp;
  3763. int default_ref_list_done = 0;
  3764. s->current_picture.reference= h->nal_ref_idc != 0;
  3765. s->dropable= h->nal_ref_idc == 0;
  3766. first_mb_in_slice= get_ue_golomb(&s->gb);
  3767. if((s->flags2 & CODEC_FLAG2_CHUNKS) && first_mb_in_slice == 0){
  3768. h->slice_num = 0;
  3769. s->current_picture_ptr= NULL;
  3770. }
  3771. slice_type= get_ue_golomb(&s->gb);
  3772. if(slice_type > 9){
  3773. 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);
  3774. return -1;
  3775. }
  3776. if(slice_type > 4){
  3777. slice_type -= 5;
  3778. h->slice_type_fixed=1;
  3779. }else
  3780. h->slice_type_fixed=0;
  3781. slice_type= slice_type_map[ slice_type ];
  3782. if (slice_type == I_TYPE
  3783. || (h->slice_num != 0 && slice_type == h->slice_type) ) {
  3784. default_ref_list_done = 1;
  3785. }
  3786. h->slice_type= slice_type;
  3787. s->pict_type= h->slice_type; // to make a few old func happy, it's wrong though
  3788. pps_id= get_ue_golomb(&s->gb);
  3789. if(pps_id>=MAX_PPS_COUNT){
  3790. av_log(h->s.avctx, AV_LOG_ERROR, "pps_id out of range\n");
  3791. return -1;
  3792. }
  3793. if(!h->pps_buffers[pps_id]) {
  3794. av_log(h->s.avctx, AV_LOG_ERROR, "non existing PPS referenced\n");
  3795. return -1;
  3796. }
  3797. h->pps= *h->pps_buffers[pps_id];
  3798. if(!h->sps_buffers[h->pps.sps_id]) {
  3799. av_log(h->s.avctx, AV_LOG_ERROR, "non existing SPS referenced\n");
  3800. return -1;
  3801. }
  3802. h->sps = *h->sps_buffers[h->pps.sps_id];
  3803. if(h->dequant_coeff_pps != pps_id){
  3804. h->dequant_coeff_pps = pps_id;
  3805. init_dequant_tables(h);
  3806. }
  3807. s->mb_width= h->sps.mb_width;
  3808. s->mb_height= h->sps.mb_height * (2 - h->sps.frame_mbs_only_flag);
  3809. h->b_stride= s->mb_width*4;
  3810. h->b8_stride= s->mb_width*2;
  3811. s->width = 16*s->mb_width - 2*(h->sps.crop_left + h->sps.crop_right );
  3812. if(h->sps.frame_mbs_only_flag)
  3813. s->height= 16*s->mb_height - 2*(h->sps.crop_top + h->sps.crop_bottom);
  3814. else
  3815. s->height= 16*s->mb_height - 4*(h->sps.crop_top + h->sps.crop_bottom); //FIXME recheck
  3816. if (s->context_initialized
  3817. && ( s->width != s->avctx->width || s->height != s->avctx->height)) {
  3818. free_tables(h);
  3819. MPV_common_end(s);
  3820. }
  3821. if (!s->context_initialized) {
  3822. if (MPV_common_init(s) < 0)
  3823. return -1;
  3824. init_scan_tables(h);
  3825. alloc_tables(h);
  3826. s->avctx->width = s->width;
  3827. s->avctx->height = s->height;
  3828. s->avctx->sample_aspect_ratio= h->sps.sar;
  3829. if(!s->avctx->sample_aspect_ratio.den)
  3830. s->avctx->sample_aspect_ratio.den = 1;
  3831. if(h->sps.timing_info_present_flag){
  3832. s->avctx->time_base= (AVRational){h->sps.num_units_in_tick * 2, h->sps.time_scale};
  3833. if(h->x264_build > 0 && h->x264_build < 44)
  3834. s->avctx->time_base.den *= 2;
  3835. av_reduce(&s->avctx->time_base.num, &s->avctx->time_base.den,
  3836. s->avctx->time_base.num, s->avctx->time_base.den, 1<<30);
  3837. }
  3838. }
  3839. if(h->slice_num == 0){
  3840. if(frame_start(h) < 0)
  3841. return -1;
  3842. }
  3843. s->current_picture_ptr->frame_num= //FIXME frame_num cleanup
  3844. h->frame_num= get_bits(&s->gb, h->sps.log2_max_frame_num);
  3845. h->mb_mbaff = 0;
  3846. h->mb_aff_frame = 0;
  3847. if(h->sps.frame_mbs_only_flag){
  3848. s->picture_structure= PICT_FRAME;
  3849. }else{
  3850. if(get_bits1(&s->gb)) { //field_pic_flag
  3851. s->picture_structure= PICT_TOP_FIELD + get_bits1(&s->gb); //bottom_field_flag
  3852. av_log(h->s.avctx, AV_LOG_ERROR, "PAFF interlacing is not implemented\n");
  3853. } else {
  3854. s->picture_structure= PICT_FRAME;
  3855. h->mb_aff_frame = h->sps.mb_aff;
  3856. }
  3857. }
  3858. assert(s->mb_num == s->mb_width * s->mb_height);
  3859. if(first_mb_in_slice << h->mb_aff_frame >= s->mb_num ||
  3860. first_mb_in_slice >= s->mb_num){
  3861. av_log(h->s.avctx, AV_LOG_ERROR, "first_mb_in_slice overflow\n");
  3862. return -1;
  3863. }
  3864. s->resync_mb_x = s->mb_x = first_mb_in_slice % s->mb_width;
  3865. s->resync_mb_y = s->mb_y = (first_mb_in_slice / s->mb_width) << h->mb_aff_frame;
  3866. assert(s->mb_y < s->mb_height);
  3867. if(s->picture_structure==PICT_FRAME){
  3868. h->curr_pic_num= h->frame_num;
  3869. h->max_pic_num= 1<< h->sps.log2_max_frame_num;
  3870. }else{
  3871. h->curr_pic_num= 2*h->frame_num;
  3872. h->max_pic_num= 1<<(h->sps.log2_max_frame_num + 1);
  3873. }
  3874. if(h->nal_unit_type == NAL_IDR_SLICE){
  3875. get_ue_golomb(&s->gb); /* idr_pic_id */
  3876. }
  3877. if(h->sps.poc_type==0){
  3878. h->poc_lsb= get_bits(&s->gb, h->sps.log2_max_poc_lsb);
  3879. if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME){
  3880. h->delta_poc_bottom= get_se_golomb(&s->gb);
  3881. }
  3882. }
  3883. if(h->sps.poc_type==1 && !h->sps.delta_pic_order_always_zero_flag){
  3884. h->delta_poc[0]= get_se_golomb(&s->gb);
  3885. if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME)
  3886. h->delta_poc[1]= get_se_golomb(&s->gb);
  3887. }
  3888. init_poc(h);
  3889. if(h->pps.redundant_pic_cnt_present){
  3890. h->redundant_pic_count= get_ue_golomb(&s->gb);
  3891. }
  3892. //set defaults, might be overriden a few line later
  3893. h->ref_count[0]= h->pps.ref_count[0];
  3894. h->ref_count[1]= h->pps.ref_count[1];
  3895. if(h->slice_type == P_TYPE || h->slice_type == SP_TYPE || h->slice_type == B_TYPE){
  3896. if(h->slice_type == B_TYPE){
  3897. h->direct_spatial_mv_pred= get_bits1(&s->gb);
  3898. if(h->sps.mb_aff && h->direct_spatial_mv_pred)
  3899. av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF + spatial direct mode is not implemented\n");
  3900. }
  3901. num_ref_idx_active_override_flag= get_bits1(&s->gb);
  3902. if(num_ref_idx_active_override_flag){
  3903. h->ref_count[0]= get_ue_golomb(&s->gb) + 1;
  3904. if(h->slice_type==B_TYPE)
  3905. h->ref_count[1]= get_ue_golomb(&s->gb) + 1;
  3906. if(h->ref_count[0]-1 > 32-1 || h->ref_count[1]-1 > 32-1){
  3907. av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow\n");
  3908. h->ref_count[0]= h->ref_count[1]= 1;
  3909. return -1;
  3910. }
  3911. }
  3912. if(h->slice_type == B_TYPE)
  3913. h->list_count= 2;
  3914. else
  3915. h->list_count= 1;
  3916. }else
  3917. h->list_count= 0;
  3918. if(!default_ref_list_done){
  3919. fill_default_ref_list(h);
  3920. }
  3921. if(decode_ref_pic_list_reordering(h) < 0)
  3922. return -1;
  3923. if( (h->pps.weighted_pred && (h->slice_type == P_TYPE || h->slice_type == SP_TYPE ))
  3924. || (h->pps.weighted_bipred_idc==1 && h->slice_type==B_TYPE ) )
  3925. pred_weight_table(h);
  3926. else if(h->pps.weighted_bipred_idc==2 && h->slice_type==B_TYPE)
  3927. implicit_weight_table(h);
  3928. else
  3929. h->use_weight = 0;
  3930. if(s->current_picture.reference)
  3931. decode_ref_pic_marking(h, &s->gb);
  3932. if(FRAME_MBAFF)
  3933. fill_mbaff_ref_list(h);
  3934. if( h->slice_type != I_TYPE && h->slice_type != SI_TYPE && h->pps.cabac ){
  3935. tmp = get_ue_golomb(&s->gb);
  3936. if(tmp > 2){
  3937. av_log(s->avctx, AV_LOG_ERROR, "cabac_init_idc overflow\n");
  3938. return -1;
  3939. }
  3940. h->cabac_init_idc= tmp;
  3941. }
  3942. h->last_qscale_diff = 0;
  3943. tmp = h->pps.init_qp + get_se_golomb(&s->gb);
  3944. if(tmp>51){
  3945. av_log(s->avctx, AV_LOG_ERROR, "QP %u out of range\n", tmp);
  3946. return -1;
  3947. }
  3948. s->qscale= tmp;
  3949. h->chroma_qp[0] = get_chroma_qp(h, 0, s->qscale);
  3950. h->chroma_qp[1] = get_chroma_qp(h, 1, s->qscale);
  3951. //FIXME qscale / qp ... stuff
  3952. if(h->slice_type == SP_TYPE){
  3953. get_bits1(&s->gb); /* sp_for_switch_flag */
  3954. }
  3955. if(h->slice_type==SP_TYPE || h->slice_type == SI_TYPE){
  3956. get_se_golomb(&s->gb); /* slice_qs_delta */
  3957. }
  3958. h->deblocking_filter = 1;
  3959. h->slice_alpha_c0_offset = 0;
  3960. h->slice_beta_offset = 0;
  3961. if( h->pps.deblocking_filter_parameters_present ) {
  3962. tmp= get_ue_golomb(&s->gb);
  3963. if(tmp > 2){
  3964. av_log(s->avctx, AV_LOG_ERROR, "deblocking_filter_idc %u out of range\n", tmp);
  3965. return -1;
  3966. }
  3967. h->deblocking_filter= tmp;
  3968. if(h->deblocking_filter < 2)
  3969. h->deblocking_filter^= 1; // 1<->0
  3970. if( h->deblocking_filter ) {
  3971. h->slice_alpha_c0_offset = get_se_golomb(&s->gb) << 1;
  3972. h->slice_beta_offset = get_se_golomb(&s->gb) << 1;
  3973. }
  3974. }
  3975. if( s->avctx->skip_loop_filter >= AVDISCARD_ALL
  3976. ||(s->avctx->skip_loop_filter >= AVDISCARD_NONKEY && h->slice_type != I_TYPE)
  3977. ||(s->avctx->skip_loop_filter >= AVDISCARD_BIDIR && h->slice_type == B_TYPE)
  3978. ||(s->avctx->skip_loop_filter >= AVDISCARD_NONREF && h->nal_ref_idc == 0))
  3979. h->deblocking_filter= 0;
  3980. #if 0 //FMO
  3981. if( h->pps.num_slice_groups > 1 && h->pps.mb_slice_group_map_type >= 3 && h->pps.mb_slice_group_map_type <= 5)
  3982. slice_group_change_cycle= get_bits(&s->gb, ?);
  3983. #endif
  3984. h->slice_num++;
  3985. h->emu_edge_width= (s->flags&CODEC_FLAG_EMU_EDGE) ? 0 : 16;
  3986. h->emu_edge_height= FRAME_MBAFF ? 0 : h->emu_edge_width;
  3987. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  3988. 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\n",
  3989. h->slice_num,
  3990. (s->picture_structure==PICT_FRAME ? "F" : s->picture_structure==PICT_TOP_FIELD ? "T" : "B"),
  3991. first_mb_in_slice,
  3992. av_get_pict_type_char(h->slice_type),
  3993. pps_id, h->frame_num,
  3994. s->current_picture_ptr->field_poc[0], s->current_picture_ptr->field_poc[1],
  3995. h->ref_count[0], h->ref_count[1],
  3996. s->qscale,
  3997. h->deblocking_filter, h->slice_alpha_c0_offset/2, h->slice_beta_offset/2,
  3998. h->use_weight,
  3999. h->use_weight==1 && h->use_weight_chroma ? "c" : ""
  4000. );
  4001. }
  4002. if((s->avctx->flags2 & CODEC_FLAG2_FAST) && !s->current_picture.reference){
  4003. s->me.qpel_put= s->dsp.put_2tap_qpel_pixels_tab;
  4004. s->me.qpel_avg= s->dsp.avg_2tap_qpel_pixels_tab;
  4005. }else{
  4006. s->me.qpel_put= s->dsp.put_h264_qpel_pixels_tab;
  4007. s->me.qpel_avg= s->dsp.avg_h264_qpel_pixels_tab;
  4008. }
  4009. return 0;
  4010. }
  4011. /**
  4012. *
  4013. */
  4014. static inline int get_level_prefix(GetBitContext *gb){
  4015. unsigned int buf;
  4016. int log;
  4017. OPEN_READER(re, gb);
  4018. UPDATE_CACHE(re, gb);
  4019. buf=GET_CACHE(re, gb);
  4020. log= 32 - av_log2(buf);
  4021. #ifdef TRACE
  4022. print_bin(buf>>(32-log), log);
  4023. 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__);
  4024. #endif
  4025. LAST_SKIP_BITS(re, gb, log);
  4026. CLOSE_READER(re, gb);
  4027. return log-1;
  4028. }
  4029. static inline int get_dct8x8_allowed(H264Context *h){
  4030. int i;
  4031. for(i=0; i<4; i++){
  4032. if(!IS_SUB_8X8(h->sub_mb_type[i])
  4033. || (!h->sps.direct_8x8_inference_flag && IS_DIRECT(h->sub_mb_type[i])))
  4034. return 0;
  4035. }
  4036. return 1;
  4037. }
  4038. /**
  4039. * decodes a residual block.
  4040. * @param n block index
  4041. * @param scantable scantable
  4042. * @param max_coeff number of coefficients in the block
  4043. * @return <0 if an error occured
  4044. */
  4045. static int decode_residual(H264Context *h, GetBitContext *gb, DCTELEM *block, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff){
  4046. MpegEncContext * const s = &h->s;
  4047. 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};
  4048. int level[16];
  4049. int zeros_left, coeff_num, coeff_token, total_coeff, i, j, trailing_ones, run_before;
  4050. //FIXME put trailing_onex into the context
  4051. if(n == CHROMA_DC_BLOCK_INDEX){
  4052. coeff_token= get_vlc2(gb, chroma_dc_coeff_token_vlc.table, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 1);
  4053. total_coeff= coeff_token>>2;
  4054. }else{
  4055. if(n == LUMA_DC_BLOCK_INDEX){
  4056. total_coeff= pred_non_zero_count(h, 0);
  4057. coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);
  4058. total_coeff= coeff_token>>2;
  4059. }else{
  4060. total_coeff= pred_non_zero_count(h, n);
  4061. coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);
  4062. total_coeff= coeff_token>>2;
  4063. h->non_zero_count_cache[ scan8[n] ]= total_coeff;
  4064. }
  4065. }
  4066. //FIXME set last_non_zero?
  4067. if(total_coeff==0)
  4068. return 0;
  4069. if(total_coeff > (unsigned)max_coeff) {
  4070. av_log(h->s.avctx, AV_LOG_ERROR, "corrupted macroblock %d %d (total_coeff=%d)\n", s->mb_x, s->mb_y, total_coeff);
  4071. return -1;
  4072. }
  4073. trailing_ones= coeff_token&3;
  4074. tprintf(h->s.avctx, "trailing:%d, total:%d\n", trailing_ones, total_coeff);
  4075. assert(total_coeff<=16);
  4076. for(i=0; i<trailing_ones; i++){
  4077. level[i]= 1 - 2*get_bits1(gb);
  4078. }
  4079. if(i<total_coeff) {
  4080. int level_code, mask;
  4081. int suffix_length = total_coeff > 10 && trailing_ones < 3;
  4082. int prefix= get_level_prefix(gb);
  4083. //first coefficient has suffix_length equal to 0 or 1
  4084. if(prefix<14){ //FIXME try to build a large unified VLC table for all this
  4085. if(suffix_length)
  4086. level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part
  4087. else
  4088. level_code= (prefix<<suffix_length); //part
  4089. }else if(prefix==14){
  4090. if(suffix_length)
  4091. level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part
  4092. else
  4093. level_code= prefix + get_bits(gb, 4); //part
  4094. }else if(prefix==15){
  4095. level_code= (prefix<<suffix_length) + get_bits(gb, 12); //part
  4096. if(suffix_length==0) level_code+=15; //FIXME doesn't make (much)sense
  4097. }else{
  4098. av_log(h->s.avctx, AV_LOG_ERROR, "prefix too large at %d %d\n", s->mb_x, s->mb_y);
  4099. return -1;
  4100. }
  4101. if(trailing_ones < 3) level_code += 2;
  4102. suffix_length = 1;
  4103. if(level_code > 5)
  4104. suffix_length++;
  4105. mask= -(level_code&1);
  4106. level[i]= (((2+level_code)>>1) ^ mask) - mask;
  4107. i++;
  4108. //remaining coefficients have suffix_length > 0
  4109. for(;i<total_coeff;i++) {
  4110. static const int suffix_limit[7] = {0,5,11,23,47,95,INT_MAX };
  4111. prefix = get_level_prefix(gb);
  4112. if(prefix<15){
  4113. level_code = (prefix<<suffix_length) + get_bits(gb, suffix_length);
  4114. }else if(prefix==15){
  4115. level_code = (prefix<<suffix_length) + get_bits(gb, 12);
  4116. }else{
  4117. av_log(h->s.avctx, AV_LOG_ERROR, "prefix too large at %d %d\n", s->mb_x, s->mb_y);
  4118. return -1;
  4119. }
  4120. mask= -(level_code&1);
  4121. level[i]= (((2+level_code)>>1) ^ mask) - mask;
  4122. if(level_code > suffix_limit[suffix_length])
  4123. suffix_length++;
  4124. }
  4125. }
  4126. if(total_coeff == max_coeff)
  4127. zeros_left=0;
  4128. else{
  4129. if(n == CHROMA_DC_BLOCK_INDEX)
  4130. zeros_left= get_vlc2(gb, chroma_dc_total_zeros_vlc[ total_coeff-1 ].table, CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 1);
  4131. else
  4132. zeros_left= get_vlc2(gb, total_zeros_vlc[ total_coeff-1 ].table, TOTAL_ZEROS_VLC_BITS, 1);
  4133. }
  4134. coeff_num = zeros_left + total_coeff - 1;
  4135. j = scantable[coeff_num];
  4136. if(n > 24){
  4137. block[j] = level[0];
  4138. for(i=1;i<total_coeff;i++) {
  4139. if(zeros_left <= 0)
  4140. run_before = 0;
  4141. else if(zeros_left < 7){
  4142. run_before= get_vlc2(gb, run_vlc[zeros_left-1].table, RUN_VLC_BITS, 1);
  4143. }else{
  4144. run_before= get_vlc2(gb, run7_vlc.table, RUN7_VLC_BITS, 2);
  4145. }
  4146. zeros_left -= run_before;
  4147. coeff_num -= 1 + run_before;
  4148. j= scantable[ coeff_num ];
  4149. block[j]= level[i];
  4150. }
  4151. }else{
  4152. block[j] = (level[0] * qmul[j] + 32)>>6;
  4153. for(i=1;i<total_coeff;i++) {
  4154. if(zeros_left <= 0)
  4155. run_before = 0;
  4156. else if(zeros_left < 7){
  4157. run_before= get_vlc2(gb, run_vlc[zeros_left-1].table, RUN_VLC_BITS, 1);
  4158. }else{
  4159. run_before= get_vlc2(gb, run7_vlc.table, RUN7_VLC_BITS, 2);
  4160. }
  4161. zeros_left -= run_before;
  4162. coeff_num -= 1 + run_before;
  4163. j= scantable[ coeff_num ];
  4164. block[j]= (level[i] * qmul[j] + 32)>>6;
  4165. }
  4166. }
  4167. if(zeros_left<0){
  4168. av_log(h->s.avctx, AV_LOG_ERROR, "negative number of zero coeffs at %d %d\n", s->mb_x, s->mb_y);
  4169. return -1;
  4170. }
  4171. return 0;
  4172. }
  4173. static void predict_field_decoding_flag(H264Context *h){
  4174. MpegEncContext * const s = &h->s;
  4175. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  4176. int mb_type = (h->slice_table[mb_xy-1] == h->slice_num)
  4177. ? s->current_picture.mb_type[mb_xy-1]
  4178. : (h->slice_table[mb_xy-s->mb_stride] == h->slice_num)
  4179. ? s->current_picture.mb_type[mb_xy-s->mb_stride]
  4180. : 0;
  4181. h->mb_mbaff = h->mb_field_decoding_flag = IS_INTERLACED(mb_type) ? 1 : 0;
  4182. }
  4183. /**
  4184. * decodes a P_SKIP or B_SKIP macroblock
  4185. */
  4186. static void decode_mb_skip(H264Context *h){
  4187. MpegEncContext * const s = &h->s;
  4188. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  4189. int mb_type=0;
  4190. memset(h->non_zero_count[mb_xy], 0, 16);
  4191. memset(h->non_zero_count_cache + 8, 0, 8*5); //FIXME ugly, remove pfui
  4192. if(MB_FIELD)
  4193. mb_type|= MB_TYPE_INTERLACED;
  4194. if( h->slice_type == B_TYPE )
  4195. {
  4196. // just for fill_caches. pred_direct_motion will set the real mb_type
  4197. mb_type|= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2|MB_TYPE_SKIP;
  4198. fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...
  4199. pred_direct_motion(h, &mb_type);
  4200. mb_type|= MB_TYPE_SKIP;
  4201. }
  4202. else
  4203. {
  4204. int mx, my;
  4205. mb_type|= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P1L0|MB_TYPE_SKIP;
  4206. fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...
  4207. pred_pskip_motion(h, &mx, &my);
  4208. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, 0, 1);
  4209. fill_rectangle( h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mx,my), 4);
  4210. }
  4211. write_back_motion(h, mb_type);
  4212. s->current_picture.mb_type[mb_xy]= mb_type;
  4213. s->current_picture.qscale_table[mb_xy]= s->qscale;
  4214. h->slice_table[ mb_xy ]= h->slice_num;
  4215. h->prev_mb_skipped= 1;
  4216. }
  4217. /**
  4218. * decodes a macroblock
  4219. * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed
  4220. */
  4221. static int decode_mb_cavlc(H264Context *h){
  4222. MpegEncContext * const s = &h->s;
  4223. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  4224. int partition_count;
  4225. unsigned int mb_type, cbp;
  4226. int dct8x8_allowed= h->pps.transform_8x8_mode;
  4227. s->dsp.clear_blocks(h->mb); //FIXME avoid if already clear (move after skip handlong?
  4228. tprintf(s->avctx, "pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);
  4229. cbp = 0; /* avoid warning. FIXME: find a solution without slowing
  4230. down the code */
  4231. if(h->slice_type != I_TYPE && h->slice_type != SI_TYPE){
  4232. if(s->mb_skip_run==-1)
  4233. s->mb_skip_run= get_ue_golomb(&s->gb);
  4234. if (s->mb_skip_run--) {
  4235. if(FRAME_MBAFF && (s->mb_y&1) == 0){
  4236. if(s->mb_skip_run==0)
  4237. h->mb_mbaff = h->mb_field_decoding_flag = get_bits1(&s->gb);
  4238. else
  4239. predict_field_decoding_flag(h);
  4240. }
  4241. decode_mb_skip(h);
  4242. return 0;
  4243. }
  4244. }
  4245. if(FRAME_MBAFF){
  4246. if( (s->mb_y&1) == 0 )
  4247. h->mb_mbaff = h->mb_field_decoding_flag = get_bits1(&s->gb);
  4248. }else
  4249. h->mb_field_decoding_flag= (s->picture_structure!=PICT_FRAME);
  4250. h->prev_mb_skipped= 0;
  4251. mb_type= get_ue_golomb(&s->gb);
  4252. if(h->slice_type == B_TYPE){
  4253. if(mb_type < 23){
  4254. partition_count= b_mb_type_info[mb_type].partition_count;
  4255. mb_type= b_mb_type_info[mb_type].type;
  4256. }else{
  4257. mb_type -= 23;
  4258. goto decode_intra_mb;
  4259. }
  4260. }else if(h->slice_type == P_TYPE /*|| h->slice_type == SP_TYPE */){
  4261. if(mb_type < 5){
  4262. partition_count= p_mb_type_info[mb_type].partition_count;
  4263. mb_type= p_mb_type_info[mb_type].type;
  4264. }else{
  4265. mb_type -= 5;
  4266. goto decode_intra_mb;
  4267. }
  4268. }else{
  4269. assert(h->slice_type == I_TYPE);
  4270. decode_intra_mb:
  4271. if(mb_type > 25){
  4272. 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);
  4273. return -1;
  4274. }
  4275. partition_count=0;
  4276. cbp= i_mb_type_info[mb_type].cbp;
  4277. h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;
  4278. mb_type= i_mb_type_info[mb_type].type;
  4279. }
  4280. if(MB_FIELD)
  4281. mb_type |= MB_TYPE_INTERLACED;
  4282. h->slice_table[ mb_xy ]= h->slice_num;
  4283. if(IS_INTRA_PCM(mb_type)){
  4284. unsigned int x, y;
  4285. // We assume these blocks are very rare so we do not optimize it.
  4286. align_get_bits(&s->gb);
  4287. // The pixels are stored in the same order as levels in h->mb array.
  4288. for(y=0; y<16; y++){
  4289. const int index= 4*(y&3) + 32*((y>>2)&1) + 128*(y>>3);
  4290. for(x=0; x<16; x++){
  4291. tprintf(s->avctx, "LUMA ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));
  4292. h->mb[index + (x&3) + 16*((x>>2)&1) + 64*(x>>3)]= get_bits(&s->gb, 8);
  4293. }
  4294. }
  4295. for(y=0; y<8; y++){
  4296. const int index= 256 + 4*(y&3) + 32*(y>>2);
  4297. for(x=0; x<8; x++){
  4298. tprintf(s->avctx, "CHROMA U ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));
  4299. h->mb[index + (x&3) + 16*(x>>2)]= get_bits(&s->gb, 8);
  4300. }
  4301. }
  4302. for(y=0; y<8; y++){
  4303. const int index= 256 + 64 + 4*(y&3) + 32*(y>>2);
  4304. for(x=0; x<8; x++){
  4305. tprintf(s->avctx, "CHROMA V ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));
  4306. h->mb[index + (x&3) + 16*(x>>2)]= get_bits(&s->gb, 8);
  4307. }
  4308. }
  4309. // In deblocking, the quantizer is 0
  4310. s->current_picture.qscale_table[mb_xy]= 0;
  4311. h->chroma_qp[0] = get_chroma_qp(h, 0, 0);
  4312. h->chroma_qp[1] = get_chroma_qp(h, 1, 0);
  4313. // All coeffs are present
  4314. memset(h->non_zero_count[mb_xy], 16, 16);
  4315. s->current_picture.mb_type[mb_xy]= mb_type;
  4316. return 0;
  4317. }
  4318. if(MB_MBAFF){
  4319. h->ref_count[0] <<= 1;
  4320. h->ref_count[1] <<= 1;
  4321. }
  4322. fill_caches(h, mb_type, 0);
  4323. //mb_pred
  4324. if(IS_INTRA(mb_type)){
  4325. int pred_mode;
  4326. // init_top_left_availability(h);
  4327. if(IS_INTRA4x4(mb_type)){
  4328. int i;
  4329. int di = 1;
  4330. if(dct8x8_allowed && get_bits1(&s->gb)){
  4331. mb_type |= MB_TYPE_8x8DCT;
  4332. di = 4;
  4333. }
  4334. // fill_intra4x4_pred_table(h);
  4335. for(i=0; i<16; i+=di){
  4336. int mode= pred_intra_mode(h, i);
  4337. if(!get_bits1(&s->gb)){
  4338. const int rem_mode= get_bits(&s->gb, 3);
  4339. mode = rem_mode + (rem_mode >= mode);
  4340. }
  4341. if(di==4)
  4342. fill_rectangle( &h->intra4x4_pred_mode_cache[ scan8[i] ], 2, 2, 8, mode, 1 );
  4343. else
  4344. h->intra4x4_pred_mode_cache[ scan8[i] ] = mode;
  4345. }
  4346. write_back_intra_pred_mode(h);
  4347. if( check_intra4x4_pred_mode(h) < 0)
  4348. return -1;
  4349. }else{
  4350. h->intra16x16_pred_mode= check_intra_pred_mode(h, h->intra16x16_pred_mode);
  4351. if(h->intra16x16_pred_mode < 0)
  4352. return -1;
  4353. }
  4354. pred_mode= check_intra_pred_mode(h, get_ue_golomb(&s->gb));
  4355. if(pred_mode < 0)
  4356. return -1;
  4357. h->chroma_pred_mode= pred_mode;
  4358. }else if(partition_count==4){
  4359. int i, j, sub_partition_count[4], list, ref[2][4];
  4360. if(h->slice_type == B_TYPE){
  4361. for(i=0; i<4; i++){
  4362. h->sub_mb_type[i]= get_ue_golomb(&s->gb);
  4363. if(h->sub_mb_type[i] >=13){
  4364. 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);
  4365. return -1;
  4366. }
  4367. sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  4368. h->sub_mb_type[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  4369. }
  4370. if( IS_DIRECT(h->sub_mb_type[0]) || IS_DIRECT(h->sub_mb_type[1])
  4371. || IS_DIRECT(h->sub_mb_type[2]) || IS_DIRECT(h->sub_mb_type[3])) {
  4372. pred_direct_motion(h, &mb_type);
  4373. h->ref_cache[0][scan8[4]] =
  4374. h->ref_cache[1][scan8[4]] =
  4375. h->ref_cache[0][scan8[12]] =
  4376. h->ref_cache[1][scan8[12]] = PART_NOT_AVAILABLE;
  4377. }
  4378. }else{
  4379. assert(h->slice_type == P_TYPE || h->slice_type == SP_TYPE); //FIXME SP correct ?
  4380. for(i=0; i<4; i++){
  4381. h->sub_mb_type[i]= get_ue_golomb(&s->gb);
  4382. if(h->sub_mb_type[i] >=4){
  4383. 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);
  4384. return -1;
  4385. }
  4386. sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  4387. h->sub_mb_type[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  4388. }
  4389. }
  4390. for(list=0; list<h->list_count; list++){
  4391. int ref_count= IS_REF0(mb_type) ? 1 : h->ref_count[list];
  4392. for(i=0; i<4; i++){
  4393. if(IS_DIRECT(h->sub_mb_type[i])) continue;
  4394. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  4395. unsigned int tmp = get_te0_golomb(&s->gb, ref_count); //FIXME init to 0 before and skip?
  4396. if(tmp>=ref_count){
  4397. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", tmp);
  4398. return -1;
  4399. }
  4400. ref[list][i]= tmp;
  4401. }else{
  4402. //FIXME
  4403. ref[list][i] = -1;
  4404. }
  4405. }
  4406. }
  4407. if(dct8x8_allowed)
  4408. dct8x8_allowed = get_dct8x8_allowed(h);
  4409. for(list=0; list<h->list_count; list++){
  4410. for(i=0; i<4; i++){
  4411. if(IS_DIRECT(h->sub_mb_type[i])) {
  4412. h->ref_cache[list][ scan8[4*i] ] = h->ref_cache[list][ scan8[4*i]+1 ];
  4413. continue;
  4414. }
  4415. h->ref_cache[list][ scan8[4*i] ]=h->ref_cache[list][ scan8[4*i]+1 ]=
  4416. h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];
  4417. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  4418. const int sub_mb_type= h->sub_mb_type[i];
  4419. const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;
  4420. for(j=0; j<sub_partition_count[i]; j++){
  4421. int mx, my;
  4422. const int index= 4*i + block_width*j;
  4423. int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];
  4424. pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mx, &my);
  4425. mx += get_se_golomb(&s->gb);
  4426. my += get_se_golomb(&s->gb);
  4427. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4428. if(IS_SUB_8X8(sub_mb_type)){
  4429. mv_cache[ 1 ][0]=
  4430. mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;
  4431. mv_cache[ 1 ][1]=
  4432. mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;
  4433. }else if(IS_SUB_8X4(sub_mb_type)){
  4434. mv_cache[ 1 ][0]= mx;
  4435. mv_cache[ 1 ][1]= my;
  4436. }else if(IS_SUB_4X8(sub_mb_type)){
  4437. mv_cache[ 8 ][0]= mx;
  4438. mv_cache[ 8 ][1]= my;
  4439. }
  4440. mv_cache[ 0 ][0]= mx;
  4441. mv_cache[ 0 ][1]= my;
  4442. }
  4443. }else{
  4444. uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];
  4445. p[0] = p[1]=
  4446. p[8] = p[9]= 0;
  4447. }
  4448. }
  4449. }
  4450. }else if(IS_DIRECT(mb_type)){
  4451. pred_direct_motion(h, &mb_type);
  4452. dct8x8_allowed &= h->sps.direct_8x8_inference_flag;
  4453. }else{
  4454. int list, mx, my, i;
  4455. //FIXME we should set ref_idx_l? to 0 if we use that later ...
  4456. if(IS_16X16(mb_type)){
  4457. for(list=0; list<h->list_count; list++){
  4458. unsigned int val;
  4459. if(IS_DIR(mb_type, 0, list)){
  4460. val= get_te0_golomb(&s->gb, h->ref_count[list]);
  4461. if(val >= h->ref_count[list]){
  4462. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", val);
  4463. return -1;
  4464. }
  4465. }else
  4466. val= LIST_NOT_USED&0xFF;
  4467. fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, val, 1);
  4468. }
  4469. for(list=0; list<h->list_count; list++){
  4470. unsigned int val;
  4471. if(IS_DIR(mb_type, 0, list)){
  4472. pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mx, &my);
  4473. mx += get_se_golomb(&s->gb);
  4474. my += get_se_golomb(&s->gb);
  4475. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4476. val= pack16to32(mx,my);
  4477. }else
  4478. val=0;
  4479. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, val, 4);
  4480. }
  4481. }
  4482. else if(IS_16X8(mb_type)){
  4483. for(list=0; list<h->list_count; list++){
  4484. for(i=0; i<2; i++){
  4485. unsigned int val;
  4486. if(IS_DIR(mb_type, i, list)){
  4487. val= get_te0_golomb(&s->gb, h->ref_count[list]);
  4488. if(val >= h->ref_count[list]){
  4489. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", val);
  4490. return -1;
  4491. }
  4492. }else
  4493. val= LIST_NOT_USED&0xFF;
  4494. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, val, 1);
  4495. }
  4496. }
  4497. for(list=0; list<h->list_count; list++){
  4498. for(i=0; i<2; i++){
  4499. unsigned int val;
  4500. if(IS_DIR(mb_type, i, list)){
  4501. pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mx, &my);
  4502. mx += get_se_golomb(&s->gb);
  4503. my += get_se_golomb(&s->gb);
  4504. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4505. val= pack16to32(mx,my);
  4506. }else
  4507. val=0;
  4508. fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, val, 4);
  4509. }
  4510. }
  4511. }else{
  4512. assert(IS_8X16(mb_type));
  4513. for(list=0; list<h->list_count; list++){
  4514. for(i=0; i<2; i++){
  4515. unsigned int val;
  4516. if(IS_DIR(mb_type, i, list)){ //FIXME optimize
  4517. val= get_te0_golomb(&s->gb, h->ref_count[list]);
  4518. if(val >= h->ref_count[list]){
  4519. av_log(h->s.avctx, AV_LOG_ERROR, "ref %u overflow\n", val);
  4520. return -1;
  4521. }
  4522. }else
  4523. val= LIST_NOT_USED&0xFF;
  4524. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, val, 1);
  4525. }
  4526. }
  4527. for(list=0; list<h->list_count; list++){
  4528. for(i=0; i<2; i++){
  4529. unsigned int val;
  4530. if(IS_DIR(mb_type, i, list)){
  4531. pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mx, &my);
  4532. mx += get_se_golomb(&s->gb);
  4533. my += get_se_golomb(&s->gb);
  4534. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  4535. val= pack16to32(mx,my);
  4536. }else
  4537. val=0;
  4538. fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, val, 4);
  4539. }
  4540. }
  4541. }
  4542. }
  4543. if(IS_INTER(mb_type))
  4544. write_back_motion(h, mb_type);
  4545. if(!IS_INTRA16x16(mb_type)){
  4546. cbp= get_ue_golomb(&s->gb);
  4547. if(cbp > 47){
  4548. av_log(h->s.avctx, AV_LOG_ERROR, "cbp too large (%u) at %d %d\n", cbp, s->mb_x, s->mb_y);
  4549. return -1;
  4550. }
  4551. if(IS_INTRA4x4(mb_type))
  4552. cbp= golomb_to_intra4x4_cbp[cbp];
  4553. else
  4554. cbp= golomb_to_inter_cbp[cbp];
  4555. }
  4556. h->cbp = cbp;
  4557. if(dct8x8_allowed && (cbp&15) && !IS_INTRA(mb_type)){
  4558. if(get_bits1(&s->gb))
  4559. mb_type |= MB_TYPE_8x8DCT;
  4560. }
  4561. s->current_picture.mb_type[mb_xy]= mb_type;
  4562. if(cbp || IS_INTRA16x16(mb_type)){
  4563. int i8x8, i4x4, chroma_idx;
  4564. int dquant;
  4565. GetBitContext *gb= IS_INTRA(mb_type) ? h->intra_gb_ptr : h->inter_gb_ptr;
  4566. const uint8_t *scan, *scan8x8, *dc_scan;
  4567. // fill_non_zero_count_cache(h);
  4568. if(IS_INTERLACED(mb_type)){
  4569. scan8x8= s->qscale ? h->field_scan8x8_cavlc : h->field_scan8x8_cavlc_q0;
  4570. scan= s->qscale ? h->field_scan : h->field_scan_q0;
  4571. dc_scan= luma_dc_field_scan;
  4572. }else{
  4573. scan8x8= s->qscale ? h->zigzag_scan8x8_cavlc : h->zigzag_scan8x8_cavlc_q0;
  4574. scan= s->qscale ? h->zigzag_scan : h->zigzag_scan_q0;
  4575. dc_scan= luma_dc_zigzag_scan;
  4576. }
  4577. dquant= get_se_golomb(&s->gb);
  4578. if( dquant > 25 || dquant < -26 ){
  4579. av_log(h->s.avctx, AV_LOG_ERROR, "dquant out of range (%d) at %d %d\n", dquant, s->mb_x, s->mb_y);
  4580. return -1;
  4581. }
  4582. s->qscale += dquant;
  4583. if(((unsigned)s->qscale) > 51){
  4584. if(s->qscale<0) s->qscale+= 52;
  4585. else s->qscale-= 52;
  4586. }
  4587. h->chroma_qp[0]= get_chroma_qp(h, 0, s->qscale);
  4588. h->chroma_qp[1]= get_chroma_qp(h, 1, s->qscale);
  4589. if(IS_INTRA16x16(mb_type)){
  4590. if( decode_residual(h, h->intra_gb_ptr, h->mb, LUMA_DC_BLOCK_INDEX, dc_scan, h->dequant4_coeff[0][s->qscale], 16) < 0){
  4591. return -1; //FIXME continue if partitioned and other return -1 too
  4592. }
  4593. assert((cbp&15) == 0 || (cbp&15) == 15);
  4594. if(cbp&15){
  4595. for(i8x8=0; i8x8<4; i8x8++){
  4596. for(i4x4=0; i4x4<4; i4x4++){
  4597. const int index= i4x4 + 4*i8x8;
  4598. if( decode_residual(h, h->intra_gb_ptr, h->mb + 16*index, index, scan + 1, h->dequant4_coeff[0][s->qscale], 15) < 0 ){
  4599. return -1;
  4600. }
  4601. }
  4602. }
  4603. }else{
  4604. fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);
  4605. }
  4606. }else{
  4607. for(i8x8=0; i8x8<4; i8x8++){
  4608. if(cbp & (1<<i8x8)){
  4609. if(IS_8x8DCT(mb_type)){
  4610. DCTELEM *buf = &h->mb[64*i8x8];
  4611. uint8_t *nnz;
  4612. for(i4x4=0; i4x4<4; i4x4++){
  4613. if( decode_residual(h, gb, buf, i4x4+4*i8x8, scan8x8+16*i4x4,
  4614. h->dequant8_coeff[IS_INTRA( mb_type ) ? 0:1][s->qscale], 16) <0 )
  4615. return -1;
  4616. }
  4617. nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  4618. nnz[0] += nnz[1] + nnz[8] + nnz[9];
  4619. }else{
  4620. for(i4x4=0; i4x4<4; i4x4++){
  4621. const int index= i4x4 + 4*i8x8;
  4622. if( decode_residual(h, gb, h->mb + 16*index, index, scan, h->dequant4_coeff[IS_INTRA( mb_type ) ? 0:3][s->qscale], 16) <0 ){
  4623. return -1;
  4624. }
  4625. }
  4626. }
  4627. }else{
  4628. uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  4629. nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;
  4630. }
  4631. }
  4632. }
  4633. if(cbp&0x30){
  4634. for(chroma_idx=0; chroma_idx<2; chroma_idx++)
  4635. if( decode_residual(h, gb, h->mb + 256 + 16*4*chroma_idx, CHROMA_DC_BLOCK_INDEX, chroma_dc_scan, NULL, 4) < 0){
  4636. return -1;
  4637. }
  4638. }
  4639. if(cbp&0x20){
  4640. for(chroma_idx=0; chroma_idx<2; chroma_idx++){
  4641. const uint32_t *qmul = h->dequant4_coeff[chroma_idx+1+(IS_INTRA( mb_type ) ? 0:3)][h->chroma_qp[chroma_idx]];
  4642. for(i4x4=0; i4x4<4; i4x4++){
  4643. const int index= 16 + 4*chroma_idx + i4x4;
  4644. if( decode_residual(h, gb, h->mb + 16*index, index, scan + 1, qmul, 15) < 0){
  4645. return -1;
  4646. }
  4647. }
  4648. }
  4649. }else{
  4650. uint8_t * const nnz= &h->non_zero_count_cache[0];
  4651. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  4652. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  4653. }
  4654. }else{
  4655. uint8_t * const nnz= &h->non_zero_count_cache[0];
  4656. fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);
  4657. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  4658. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  4659. }
  4660. s->current_picture.qscale_table[mb_xy]= s->qscale;
  4661. write_back_non_zero_count(h);
  4662. if(MB_MBAFF){
  4663. h->ref_count[0] >>= 1;
  4664. h->ref_count[1] >>= 1;
  4665. }
  4666. return 0;
  4667. }
  4668. static int decode_cabac_field_decoding_flag(H264Context *h) {
  4669. MpegEncContext * const s = &h->s;
  4670. const int mb_x = s->mb_x;
  4671. const int mb_y = s->mb_y & ~1;
  4672. const int mba_xy = mb_x - 1 + mb_y *s->mb_stride;
  4673. const int mbb_xy = mb_x + (mb_y-2)*s->mb_stride;
  4674. unsigned int ctx = 0;
  4675. if( h->slice_table[mba_xy] == h->slice_num && IS_INTERLACED( s->current_picture.mb_type[mba_xy] ) ) {
  4676. ctx += 1;
  4677. }
  4678. if( h->slice_table[mbb_xy] == h->slice_num && IS_INTERLACED( s->current_picture.mb_type[mbb_xy] ) ) {
  4679. ctx += 1;
  4680. }
  4681. return get_cabac_noinline( &h->cabac, &h->cabac_state[70 + ctx] );
  4682. }
  4683. static int decode_cabac_intra_mb_type(H264Context *h, int ctx_base, int intra_slice) {
  4684. uint8_t *state= &h->cabac_state[ctx_base];
  4685. int mb_type;
  4686. if(intra_slice){
  4687. MpegEncContext * const s = &h->s;
  4688. const int mba_xy = h->left_mb_xy[0];
  4689. const int mbb_xy = h->top_mb_xy;
  4690. int ctx=0;
  4691. if( h->slice_table[mba_xy] == h->slice_num && !IS_INTRA4x4( s->current_picture.mb_type[mba_xy] ) )
  4692. ctx++;
  4693. if( h->slice_table[mbb_xy] == h->slice_num && !IS_INTRA4x4( s->current_picture.mb_type[mbb_xy] ) )
  4694. ctx++;
  4695. if( get_cabac_noinline( &h->cabac, &state[ctx] ) == 0 )
  4696. return 0; /* I4x4 */
  4697. state += 2;
  4698. }else{
  4699. if( get_cabac_noinline( &h->cabac, &state[0] ) == 0 )
  4700. return 0; /* I4x4 */
  4701. }
  4702. if( get_cabac_terminate( &h->cabac ) )
  4703. return 25; /* PCM */
  4704. mb_type = 1; /* I16x16 */
  4705. mb_type += 12 * get_cabac_noinline( &h->cabac, &state[1] ); /* cbp_luma != 0 */
  4706. if( get_cabac_noinline( &h->cabac, &state[2] ) ) /* cbp_chroma */
  4707. mb_type += 4 + 4 * get_cabac_noinline( &h->cabac, &state[2+intra_slice] );
  4708. mb_type += 2 * get_cabac_noinline( &h->cabac, &state[3+intra_slice] );
  4709. mb_type += 1 * get_cabac_noinline( &h->cabac, &state[3+2*intra_slice] );
  4710. return mb_type;
  4711. }
  4712. static int decode_cabac_mb_type( H264Context *h ) {
  4713. MpegEncContext * const s = &h->s;
  4714. if( h->slice_type == I_TYPE ) {
  4715. return decode_cabac_intra_mb_type(h, 3, 1);
  4716. } else if( h->slice_type == P_TYPE ) {
  4717. if( get_cabac_noinline( &h->cabac, &h->cabac_state[14] ) == 0 ) {
  4718. /* P-type */
  4719. if( get_cabac_noinline( &h->cabac, &h->cabac_state[15] ) == 0 ) {
  4720. /* P_L0_D16x16, P_8x8 */
  4721. return 3 * get_cabac_noinline( &h->cabac, &h->cabac_state[16] );
  4722. } else {
  4723. /* P_L0_D8x16, P_L0_D16x8 */
  4724. return 2 - get_cabac_noinline( &h->cabac, &h->cabac_state[17] );
  4725. }
  4726. } else {
  4727. return decode_cabac_intra_mb_type(h, 17, 0) + 5;
  4728. }
  4729. } else if( h->slice_type == B_TYPE ) {
  4730. const int mba_xy = h->left_mb_xy[0];
  4731. const int mbb_xy = h->top_mb_xy;
  4732. int ctx = 0;
  4733. int bits;
  4734. if( h->slice_table[mba_xy] == h->slice_num && !IS_DIRECT( s->current_picture.mb_type[mba_xy] ) )
  4735. ctx++;
  4736. if( h->slice_table[mbb_xy] == h->slice_num && !IS_DIRECT( s->current_picture.mb_type[mbb_xy] ) )
  4737. ctx++;
  4738. if( !get_cabac_noinline( &h->cabac, &h->cabac_state[27+ctx] ) )
  4739. return 0; /* B_Direct_16x16 */
  4740. if( !get_cabac_noinline( &h->cabac, &h->cabac_state[27+3] ) ) {
  4741. return 1 + get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ); /* B_L[01]_16x16 */
  4742. }
  4743. bits = get_cabac_noinline( &h->cabac, &h->cabac_state[27+4] ) << 3;
  4744. bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ) << 2;
  4745. bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ) << 1;
  4746. bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] );
  4747. if( bits < 8 )
  4748. return bits + 3; /* B_Bi_16x16 through B_L1_L0_16x8 */
  4749. else if( bits == 13 ) {
  4750. return decode_cabac_intra_mb_type(h, 32, 0) + 23;
  4751. } else if( bits == 14 )
  4752. return 11; /* B_L1_L0_8x16 */
  4753. else if( bits == 15 )
  4754. return 22; /* B_8x8 */
  4755. bits= ( bits<<1 ) | get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] );
  4756. return bits - 4; /* B_L0_Bi_* through B_Bi_Bi_* */
  4757. } else {
  4758. /* TODO SI/SP frames? */
  4759. return -1;
  4760. }
  4761. }
  4762. static int decode_cabac_mb_skip( H264Context *h, int mb_x, int mb_y ) {
  4763. MpegEncContext * const s = &h->s;
  4764. int mba_xy, mbb_xy;
  4765. int ctx = 0;
  4766. if(FRAME_MBAFF){ //FIXME merge with the stuff in fill_caches?
  4767. int mb_xy = mb_x + (mb_y&~1)*s->mb_stride;
  4768. mba_xy = mb_xy - 1;
  4769. if( (mb_y&1)
  4770. && h->slice_table[mba_xy] == h->slice_num
  4771. && MB_FIELD == !!IS_INTERLACED( s->current_picture.mb_type[mba_xy] ) )
  4772. mba_xy += s->mb_stride;
  4773. if( MB_FIELD ){
  4774. mbb_xy = mb_xy - s->mb_stride;
  4775. if( !(mb_y&1)
  4776. && h->slice_table[mbb_xy] == h->slice_num
  4777. && IS_INTERLACED( s->current_picture.mb_type[mbb_xy] ) )
  4778. mbb_xy -= s->mb_stride;
  4779. }else
  4780. mbb_xy = mb_x + (mb_y-1)*s->mb_stride;
  4781. }else{
  4782. int mb_xy = mb_x + mb_y*s->mb_stride;
  4783. mba_xy = mb_xy - 1;
  4784. mbb_xy = mb_xy - s->mb_stride;
  4785. }
  4786. if( h->slice_table[mba_xy] == h->slice_num && !IS_SKIP( s->current_picture.mb_type[mba_xy] ))
  4787. ctx++;
  4788. if( h->slice_table[mbb_xy] == h->slice_num && !IS_SKIP( s->current_picture.mb_type[mbb_xy] ))
  4789. ctx++;
  4790. if( h->slice_type == B_TYPE )
  4791. ctx += 13;
  4792. return get_cabac_noinline( &h->cabac, &h->cabac_state[11+ctx] );
  4793. }
  4794. static int decode_cabac_mb_intra4x4_pred_mode( H264Context *h, int pred_mode ) {
  4795. int mode = 0;
  4796. if( get_cabac( &h->cabac, &h->cabac_state[68] ) )
  4797. return pred_mode;
  4798. mode += 1 * get_cabac( &h->cabac, &h->cabac_state[69] );
  4799. mode += 2 * get_cabac( &h->cabac, &h->cabac_state[69] );
  4800. mode += 4 * get_cabac( &h->cabac, &h->cabac_state[69] );
  4801. if( mode >= pred_mode )
  4802. return mode + 1;
  4803. else
  4804. return mode;
  4805. }
  4806. static int decode_cabac_mb_chroma_pre_mode( H264Context *h) {
  4807. const int mba_xy = h->left_mb_xy[0];
  4808. const int mbb_xy = h->top_mb_xy;
  4809. int ctx = 0;
  4810. /* No need to test for IS_INTRA4x4 and IS_INTRA16x16, as we set chroma_pred_mode_table to 0 */
  4811. if( h->slice_table[mba_xy] == h->slice_num && h->chroma_pred_mode_table[mba_xy] != 0 )
  4812. ctx++;
  4813. if( h->slice_table[mbb_xy] == h->slice_num && h->chroma_pred_mode_table[mbb_xy] != 0 )
  4814. ctx++;
  4815. if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+ctx] ) == 0 )
  4816. return 0;
  4817. if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+3] ) == 0 )
  4818. return 1;
  4819. if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+3] ) == 0 )
  4820. return 2;
  4821. else
  4822. return 3;
  4823. }
  4824. static const uint8_t block_idx_x[16] = {
  4825. 0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3
  4826. };
  4827. static const uint8_t block_idx_y[16] = {
  4828. 0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3
  4829. };
  4830. static const uint8_t block_idx_xy[4][4] = {
  4831. { 0, 2, 8, 10},
  4832. { 1, 3, 9, 11},
  4833. { 4, 6, 12, 14},
  4834. { 5, 7, 13, 15}
  4835. };
  4836. static int decode_cabac_mb_cbp_luma( H264Context *h) {
  4837. int cbp = 0;
  4838. int cbp_b = -1;
  4839. int i8x8;
  4840. if( h->slice_table[h->top_mb_xy] == h->slice_num ) {
  4841. cbp_b = h->top_cbp;
  4842. tprintf(h->s.avctx, "cbp_b = top_cbp = %x\n", cbp_b);
  4843. }
  4844. for( i8x8 = 0; i8x8 < 4; i8x8++ ) {
  4845. int cbp_a = -1;
  4846. int x, y;
  4847. int ctx = 0;
  4848. x = block_idx_x[4*i8x8];
  4849. y = block_idx_y[4*i8x8];
  4850. if( x > 0 )
  4851. cbp_a = cbp;
  4852. else if( h->slice_table[h->left_mb_xy[0]] == h->slice_num ) {
  4853. cbp_a = h->left_cbp;
  4854. tprintf(h->s.avctx, "cbp_a = left_cbp = %x\n", cbp_a);
  4855. }
  4856. if( y > 0 )
  4857. cbp_b = cbp;
  4858. /* No need to test for skip as we put 0 for skip block */
  4859. /* No need to test for IPCM as we put 1 for IPCM block */
  4860. if( cbp_a >= 0 ) {
  4861. int i8x8a = block_idx_xy[(x-1)&0x03][y]/4;
  4862. if( ((cbp_a >> i8x8a)&0x01) == 0 )
  4863. ctx++;
  4864. }
  4865. if( cbp_b >= 0 ) {
  4866. int i8x8b = block_idx_xy[x][(y-1)&0x03]/4;
  4867. if( ((cbp_b >> i8x8b)&0x01) == 0 )
  4868. ctx += 2;
  4869. }
  4870. if( get_cabac( &h->cabac, &h->cabac_state[73 + ctx] ) ) {
  4871. cbp |= 1 << i8x8;
  4872. }
  4873. }
  4874. return cbp;
  4875. }
  4876. static int decode_cabac_mb_cbp_chroma( H264Context *h) {
  4877. int ctx;
  4878. int cbp_a, cbp_b;
  4879. cbp_a = (h->left_cbp>>4)&0x03;
  4880. cbp_b = (h-> top_cbp>>4)&0x03;
  4881. ctx = 0;
  4882. if( cbp_a > 0 ) ctx++;
  4883. if( cbp_b > 0 ) ctx += 2;
  4884. if( get_cabac_noinline( &h->cabac, &h->cabac_state[77 + ctx] ) == 0 )
  4885. return 0;
  4886. ctx = 4;
  4887. if( cbp_a == 2 ) ctx++;
  4888. if( cbp_b == 2 ) ctx += 2;
  4889. return 1 + get_cabac_noinline( &h->cabac, &h->cabac_state[77 + ctx] );
  4890. }
  4891. static int decode_cabac_mb_dqp( H264Context *h) {
  4892. MpegEncContext * const s = &h->s;
  4893. int mbn_xy;
  4894. int ctx = 0;
  4895. int val = 0;
  4896. if( s->mb_x > 0 )
  4897. mbn_xy = s->mb_x + s->mb_y*s->mb_stride - 1;
  4898. else
  4899. mbn_xy = s->mb_width - 1 + (s->mb_y-1)*s->mb_stride;
  4900. if( h->last_qscale_diff != 0 )
  4901. ctx++;
  4902. while( get_cabac_noinline( &h->cabac, &h->cabac_state[60 + ctx] ) ) {
  4903. if( ctx < 2 )
  4904. ctx = 2;
  4905. else
  4906. ctx = 3;
  4907. val++;
  4908. if(val > 102) //prevent infinite loop
  4909. return INT_MIN;
  4910. }
  4911. if( val&0x01 )
  4912. return (val + 1)/2;
  4913. else
  4914. return -(val + 1)/2;
  4915. }
  4916. static int decode_cabac_p_mb_sub_type( H264Context *h ) {
  4917. if( get_cabac( &h->cabac, &h->cabac_state[21] ) )
  4918. return 0; /* 8x8 */
  4919. if( !get_cabac( &h->cabac, &h->cabac_state[22] ) )
  4920. return 1; /* 8x4 */
  4921. if( get_cabac( &h->cabac, &h->cabac_state[23] ) )
  4922. return 2; /* 4x8 */
  4923. return 3; /* 4x4 */
  4924. }
  4925. static int decode_cabac_b_mb_sub_type( H264Context *h ) {
  4926. int type;
  4927. if( !get_cabac( &h->cabac, &h->cabac_state[36] ) )
  4928. return 0; /* B_Direct_8x8 */
  4929. if( !get_cabac( &h->cabac, &h->cabac_state[37] ) )
  4930. return 1 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L0_8x8, B_L1_8x8 */
  4931. type = 3;
  4932. if( get_cabac( &h->cabac, &h->cabac_state[38] ) ) {
  4933. if( get_cabac( &h->cabac, &h->cabac_state[39] ) )
  4934. return 11 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L1_4x4, B_Bi_4x4 */
  4935. type += 4;
  4936. }
  4937. type += 2*get_cabac( &h->cabac, &h->cabac_state[39] );
  4938. type += get_cabac( &h->cabac, &h->cabac_state[39] );
  4939. return type;
  4940. }
  4941. static inline int decode_cabac_mb_transform_size( H264Context *h ) {
  4942. return get_cabac_noinline( &h->cabac, &h->cabac_state[399 + h->neighbor_transform_size] );
  4943. }
  4944. static int decode_cabac_mb_ref( H264Context *h, int list, int n ) {
  4945. int refa = h->ref_cache[list][scan8[n] - 1];
  4946. int refb = h->ref_cache[list][scan8[n] - 8];
  4947. int ref = 0;
  4948. int ctx = 0;
  4949. if( h->slice_type == B_TYPE) {
  4950. if( refa > 0 && !h->direct_cache[scan8[n] - 1] )
  4951. ctx++;
  4952. if( refb > 0 && !h->direct_cache[scan8[n] - 8] )
  4953. ctx += 2;
  4954. } else {
  4955. if( refa > 0 )
  4956. ctx++;
  4957. if( refb > 0 )
  4958. ctx += 2;
  4959. }
  4960. while( get_cabac( &h->cabac, &h->cabac_state[54+ctx] ) ) {
  4961. ref++;
  4962. if( ctx < 4 )
  4963. ctx = 4;
  4964. else
  4965. ctx = 5;
  4966. if(ref >= 32 /*h->ref_list[list]*/){
  4967. av_log(h->s.avctx, AV_LOG_ERROR, "overflow in decode_cabac_mb_ref\n");
  4968. return 0; //FIXME we should return -1 and check the return everywhere
  4969. }
  4970. }
  4971. return ref;
  4972. }
  4973. static int decode_cabac_mb_mvd( H264Context *h, int list, int n, int l ) {
  4974. int amvd = abs( h->mvd_cache[list][scan8[n] - 1][l] ) +
  4975. abs( h->mvd_cache[list][scan8[n] - 8][l] );
  4976. int ctxbase = (l == 0) ? 40 : 47;
  4977. int ctx, mvd;
  4978. if( amvd < 3 )
  4979. ctx = 0;
  4980. else if( amvd > 32 )
  4981. ctx = 2;
  4982. else
  4983. ctx = 1;
  4984. if(!get_cabac(&h->cabac, &h->cabac_state[ctxbase+ctx]))
  4985. return 0;
  4986. mvd= 1;
  4987. ctx= 3;
  4988. while( mvd < 9 && get_cabac( &h->cabac, &h->cabac_state[ctxbase+ctx] ) ) {
  4989. mvd++;
  4990. if( ctx < 6 )
  4991. ctx++;
  4992. }
  4993. if( mvd >= 9 ) {
  4994. int k = 3;
  4995. while( get_cabac_bypass( &h->cabac ) ) {
  4996. mvd += 1 << k;
  4997. k++;
  4998. if(k>24){
  4999. av_log(h->s.avctx, AV_LOG_ERROR, "overflow in decode_cabac_mb_mvd\n");
  5000. return INT_MIN;
  5001. }
  5002. }
  5003. while( k-- ) {
  5004. if( get_cabac_bypass( &h->cabac ) )
  5005. mvd += 1 << k;
  5006. }
  5007. }
  5008. return get_cabac_bypass_sign( &h->cabac, -mvd );
  5009. }
  5010. static inline int get_cabac_cbf_ctx( H264Context *h, int cat, int idx ) {
  5011. int nza, nzb;
  5012. int ctx = 0;
  5013. if( cat == 0 ) {
  5014. nza = h->left_cbp&0x100;
  5015. nzb = h-> top_cbp&0x100;
  5016. } else if( cat == 1 || cat == 2 ) {
  5017. nza = h->non_zero_count_cache[scan8[idx] - 1];
  5018. nzb = h->non_zero_count_cache[scan8[idx] - 8];
  5019. } else if( cat == 3 ) {
  5020. nza = (h->left_cbp>>(6+idx))&0x01;
  5021. nzb = (h-> top_cbp>>(6+idx))&0x01;
  5022. } else {
  5023. assert(cat == 4);
  5024. nza = h->non_zero_count_cache[scan8[16+idx] - 1];
  5025. nzb = h->non_zero_count_cache[scan8[16+idx] - 8];
  5026. }
  5027. if( nza > 0 )
  5028. ctx++;
  5029. if( nzb > 0 )
  5030. ctx += 2;
  5031. return ctx + 4 * cat;
  5032. }
  5033. static const attribute_used uint8_t last_coeff_flag_offset_8x8[63] = {
  5034. 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  5035. 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
  5036. 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,
  5037. 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8
  5038. };
  5039. static int decode_cabac_residual( H264Context *h, DCTELEM *block, int cat, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff) {
  5040. const int mb_xy = h->s.mb_x + h->s.mb_y*h->s.mb_stride;
  5041. static const int significant_coeff_flag_offset[2][6] = {
  5042. { 105+0, 105+15, 105+29, 105+44, 105+47, 402 },
  5043. { 277+0, 277+15, 277+29, 277+44, 277+47, 436 }
  5044. };
  5045. static const int last_coeff_flag_offset[2][6] = {
  5046. { 166+0, 166+15, 166+29, 166+44, 166+47, 417 },
  5047. { 338+0, 338+15, 338+29, 338+44, 338+47, 451 }
  5048. };
  5049. static const int coeff_abs_level_m1_offset[6] = {
  5050. 227+0, 227+10, 227+20, 227+30, 227+39, 426
  5051. };
  5052. static const uint8_t significant_coeff_flag_offset_8x8[2][63] = {
  5053. { 0, 1, 2, 3, 4, 5, 5, 4, 4, 3, 3, 4, 4, 4, 5, 5,
  5054. 4, 4, 4, 4, 3, 3, 6, 7, 7, 7, 8, 9,10, 9, 8, 7,
  5055. 7, 6,11,12,13,11, 6, 7, 8, 9,14,10, 9, 8, 6,11,
  5056. 12,13,11, 6, 9,14,10, 9,11,12,13,11,14,10,12 },
  5057. { 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 7, 7, 8, 4, 5,
  5058. 6, 9,10,10, 8,11,12,11, 9, 9,10,10, 8,11,12,11,
  5059. 9, 9,10,10, 8,11,12,11, 9, 9,10,10, 8,13,13, 9,
  5060. 9,10,10, 8,13,13, 9, 9,10,10,14,14,14,14,14 }
  5061. };
  5062. int index[64];
  5063. int av_unused last;
  5064. int coeff_count = 0;
  5065. int abslevel1 = 1;
  5066. int abslevelgt1 = 0;
  5067. uint8_t *significant_coeff_ctx_base;
  5068. uint8_t *last_coeff_ctx_base;
  5069. uint8_t *abs_level_m1_ctx_base;
  5070. #ifndef ARCH_X86
  5071. #define CABAC_ON_STACK
  5072. #endif
  5073. #ifdef CABAC_ON_STACK
  5074. #define CC &cc
  5075. CABACContext cc;
  5076. cc.range = h->cabac.range;
  5077. cc.low = h->cabac.low;
  5078. cc.bytestream= h->cabac.bytestream;
  5079. #else
  5080. #define CC &h->cabac
  5081. #endif
  5082. /* cat: 0-> DC 16x16 n = 0
  5083. * 1-> AC 16x16 n = luma4x4idx
  5084. * 2-> Luma4x4 n = luma4x4idx
  5085. * 3-> DC Chroma n = iCbCr
  5086. * 4-> AC Chroma n = 4 * iCbCr + chroma4x4idx
  5087. * 5-> Luma8x8 n = 4 * luma8x8idx
  5088. */
  5089. /* read coded block flag */
  5090. if( cat != 5 ) {
  5091. if( get_cabac( CC, &h->cabac_state[85 + get_cabac_cbf_ctx( h, cat, n ) ] ) == 0 ) {
  5092. if( cat == 1 || cat == 2 )
  5093. h->non_zero_count_cache[scan8[n]] = 0;
  5094. else if( cat == 4 )
  5095. h->non_zero_count_cache[scan8[16+n]] = 0;
  5096. #ifdef CABAC_ON_STACK
  5097. h->cabac.range = cc.range ;
  5098. h->cabac.low = cc.low ;
  5099. h->cabac.bytestream= cc.bytestream;
  5100. #endif
  5101. return 0;
  5102. }
  5103. }
  5104. significant_coeff_ctx_base = h->cabac_state
  5105. + significant_coeff_flag_offset[MB_FIELD][cat];
  5106. last_coeff_ctx_base = h->cabac_state
  5107. + last_coeff_flag_offset[MB_FIELD][cat];
  5108. abs_level_m1_ctx_base = h->cabac_state
  5109. + coeff_abs_level_m1_offset[cat];
  5110. if( cat == 5 ) {
  5111. #define DECODE_SIGNIFICANCE( coefs, sig_off, last_off ) \
  5112. for(last= 0; last < coefs; last++) { \
  5113. uint8_t *sig_ctx = significant_coeff_ctx_base + sig_off; \
  5114. if( get_cabac( CC, sig_ctx )) { \
  5115. uint8_t *last_ctx = last_coeff_ctx_base + last_off; \
  5116. index[coeff_count++] = last; \
  5117. if( get_cabac( CC, last_ctx ) ) { \
  5118. last= max_coeff; \
  5119. break; \
  5120. } \
  5121. } \
  5122. }\
  5123. if( last == max_coeff -1 ) {\
  5124. index[coeff_count++] = last;\
  5125. }
  5126. const uint8_t *sig_off = significant_coeff_flag_offset_8x8[MB_FIELD];
  5127. #if defined(ARCH_X86) && defined(CONFIG_7REGS) && defined(HAVE_EBX_AVAILABLE) && !defined(BROKEN_RELOCATIONS)
  5128. coeff_count= decode_significance_8x8_x86(CC, significant_coeff_ctx_base, index, sig_off);
  5129. } else {
  5130. coeff_count= decode_significance_x86(CC, max_coeff, significant_coeff_ctx_base, index);
  5131. #else
  5132. DECODE_SIGNIFICANCE( 63, sig_off[last], last_coeff_flag_offset_8x8[last] );
  5133. } else {
  5134. DECODE_SIGNIFICANCE( max_coeff - 1, last, last );
  5135. #endif
  5136. }
  5137. assert(coeff_count > 0);
  5138. if( cat == 0 )
  5139. h->cbp_table[mb_xy] |= 0x100;
  5140. else if( cat == 1 || cat == 2 )
  5141. h->non_zero_count_cache[scan8[n]] = coeff_count;
  5142. else if( cat == 3 )
  5143. h->cbp_table[mb_xy] |= 0x40 << n;
  5144. else if( cat == 4 )
  5145. h->non_zero_count_cache[scan8[16+n]] = coeff_count;
  5146. else {
  5147. assert( cat == 5 );
  5148. fill_rectangle(&h->non_zero_count_cache[scan8[n]], 2, 2, 8, coeff_count, 1);
  5149. }
  5150. for( coeff_count--; coeff_count >= 0; coeff_count-- ) {
  5151. uint8_t *ctx = (abslevelgt1 != 0 ? 0 : FFMIN( 4, abslevel1 )) + abs_level_m1_ctx_base;
  5152. int j= scantable[index[coeff_count]];
  5153. if( get_cabac( CC, ctx ) == 0 ) {
  5154. if( !qmul ) {
  5155. block[j] = get_cabac_bypass_sign( CC, -1);
  5156. }else{
  5157. block[j] = (get_cabac_bypass_sign( CC, -qmul[j]) + 32) >> 6;;
  5158. }
  5159. abslevel1++;
  5160. } else {
  5161. int coeff_abs = 2;
  5162. ctx = 5 + FFMIN( 4, abslevelgt1 ) + abs_level_m1_ctx_base;
  5163. while( coeff_abs < 15 && get_cabac( CC, ctx ) ) {
  5164. coeff_abs++;
  5165. }
  5166. if( coeff_abs >= 15 ) {
  5167. int j = 0;
  5168. while( get_cabac_bypass( CC ) ) {
  5169. j++;
  5170. }
  5171. coeff_abs=1;
  5172. while( j-- ) {
  5173. coeff_abs += coeff_abs + get_cabac_bypass( CC );
  5174. }
  5175. coeff_abs+= 14;
  5176. }
  5177. if( !qmul ) {
  5178. if( get_cabac_bypass( CC ) ) block[j] = -coeff_abs;
  5179. else block[j] = coeff_abs;
  5180. }else{
  5181. if( get_cabac_bypass( CC ) ) block[j] = (-coeff_abs * qmul[j] + 32) >> 6;
  5182. else block[j] = ( coeff_abs * qmul[j] + 32) >> 6;
  5183. }
  5184. abslevelgt1++;
  5185. }
  5186. }
  5187. #ifdef CABAC_ON_STACK
  5188. h->cabac.range = cc.range ;
  5189. h->cabac.low = cc.low ;
  5190. h->cabac.bytestream= cc.bytestream;
  5191. #endif
  5192. return 0;
  5193. }
  5194. static inline void compute_mb_neighbors(H264Context *h)
  5195. {
  5196. MpegEncContext * const s = &h->s;
  5197. const int mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  5198. h->top_mb_xy = mb_xy - s->mb_stride;
  5199. h->left_mb_xy[0] = mb_xy - 1;
  5200. if(FRAME_MBAFF){
  5201. const int pair_xy = s->mb_x + (s->mb_y & ~1)*s->mb_stride;
  5202. const int top_pair_xy = pair_xy - s->mb_stride;
  5203. const int top_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[top_pair_xy]);
  5204. const int left_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[pair_xy-1]);
  5205. const int curr_mb_frame_flag = !MB_FIELD;
  5206. const int bottom = (s->mb_y & 1);
  5207. if (bottom
  5208. ? !curr_mb_frame_flag // bottom macroblock
  5209. : (!curr_mb_frame_flag && !top_mb_frame_flag) // top macroblock
  5210. ) {
  5211. h->top_mb_xy -= s->mb_stride;
  5212. }
  5213. if (left_mb_frame_flag != curr_mb_frame_flag) {
  5214. h->left_mb_xy[0] = pair_xy - 1;
  5215. }
  5216. }
  5217. return;
  5218. }
  5219. /**
  5220. * decodes a macroblock
  5221. * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed
  5222. */
  5223. static int decode_mb_cabac(H264Context *h) {
  5224. MpegEncContext * const s = &h->s;
  5225. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  5226. int mb_type, partition_count, cbp = 0;
  5227. int dct8x8_allowed= h->pps.transform_8x8_mode;
  5228. s->dsp.clear_blocks(h->mb); //FIXME avoid if already clear (move after skip handlong?)
  5229. tprintf(s->avctx, "pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);
  5230. if( h->slice_type != I_TYPE && h->slice_type != SI_TYPE ) {
  5231. int skip;
  5232. /* a skipped mb needs the aff flag from the following mb */
  5233. if( FRAME_MBAFF && s->mb_x==0 && (s->mb_y&1)==0 )
  5234. predict_field_decoding_flag(h);
  5235. if( FRAME_MBAFF && (s->mb_y&1)==1 && h->prev_mb_skipped )
  5236. skip = h->next_mb_skipped;
  5237. else
  5238. skip = decode_cabac_mb_skip( h, s->mb_x, s->mb_y );
  5239. /* read skip flags */
  5240. if( skip ) {
  5241. if( FRAME_MBAFF && (s->mb_y&1)==0 ){
  5242. s->current_picture.mb_type[mb_xy] = MB_TYPE_SKIP;
  5243. h->next_mb_skipped = decode_cabac_mb_skip( h, s->mb_x, s->mb_y+1 );
  5244. if(h->next_mb_skipped)
  5245. predict_field_decoding_flag(h);
  5246. else
  5247. h->mb_mbaff = h->mb_field_decoding_flag = decode_cabac_field_decoding_flag(h);
  5248. }
  5249. decode_mb_skip(h);
  5250. h->cbp_table[mb_xy] = 0;
  5251. h->chroma_pred_mode_table[mb_xy] = 0;
  5252. h->last_qscale_diff = 0;
  5253. return 0;
  5254. }
  5255. }
  5256. if(FRAME_MBAFF){
  5257. if( (s->mb_y&1) == 0 )
  5258. h->mb_mbaff =
  5259. h->mb_field_decoding_flag = decode_cabac_field_decoding_flag(h);
  5260. }else
  5261. h->mb_field_decoding_flag= (s->picture_structure!=PICT_FRAME);
  5262. h->prev_mb_skipped = 0;
  5263. compute_mb_neighbors(h);
  5264. if( ( mb_type = decode_cabac_mb_type( h ) ) < 0 ) {
  5265. av_log( h->s.avctx, AV_LOG_ERROR, "decode_cabac_mb_type failed\n" );
  5266. return -1;
  5267. }
  5268. if( h->slice_type == B_TYPE ) {
  5269. if( mb_type < 23 ){
  5270. partition_count= b_mb_type_info[mb_type].partition_count;
  5271. mb_type= b_mb_type_info[mb_type].type;
  5272. }else{
  5273. mb_type -= 23;
  5274. goto decode_intra_mb;
  5275. }
  5276. } else if( h->slice_type == P_TYPE ) {
  5277. if( mb_type < 5) {
  5278. partition_count= p_mb_type_info[mb_type].partition_count;
  5279. mb_type= p_mb_type_info[mb_type].type;
  5280. } else {
  5281. mb_type -= 5;
  5282. goto decode_intra_mb;
  5283. }
  5284. } else {
  5285. assert(h->slice_type == I_TYPE);
  5286. decode_intra_mb:
  5287. partition_count = 0;
  5288. cbp= i_mb_type_info[mb_type].cbp;
  5289. h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;
  5290. mb_type= i_mb_type_info[mb_type].type;
  5291. }
  5292. if(MB_FIELD)
  5293. mb_type |= MB_TYPE_INTERLACED;
  5294. h->slice_table[ mb_xy ]= h->slice_num;
  5295. if(IS_INTRA_PCM(mb_type)) {
  5296. const uint8_t *ptr;
  5297. unsigned int x, y;
  5298. // We assume these blocks are very rare so we do not optimize it.
  5299. // FIXME The two following lines get the bitstream position in the cabac
  5300. // decode, I think it should be done by a function in cabac.h (or cabac.c).
  5301. ptr= h->cabac.bytestream;
  5302. if(h->cabac.low&0x1) ptr--;
  5303. if(CABAC_BITS==16){
  5304. if(h->cabac.low&0x1FF) ptr--;
  5305. }
  5306. // The pixels are stored in the same order as levels in h->mb array.
  5307. for(y=0; y<16; y++){
  5308. const int index= 4*(y&3) + 32*((y>>2)&1) + 128*(y>>3);
  5309. for(x=0; x<16; x++){
  5310. tprintf(s->avctx, "LUMA ICPM LEVEL (%3d)\n", *ptr);
  5311. h->mb[index + (x&3) + 16*((x>>2)&1) + 64*(x>>3)]= *ptr++;
  5312. }
  5313. }
  5314. for(y=0; y<8; y++){
  5315. const int index= 256 + 4*(y&3) + 32*(y>>2);
  5316. for(x=0; x<8; x++){
  5317. tprintf(s->avctx, "CHROMA U ICPM LEVEL (%3d)\n", *ptr);
  5318. h->mb[index + (x&3) + 16*(x>>2)]= *ptr++;
  5319. }
  5320. }
  5321. for(y=0; y<8; y++){
  5322. const int index= 256 + 64 + 4*(y&3) + 32*(y>>2);
  5323. for(x=0; x<8; x++){
  5324. tprintf(s->avctx, "CHROMA V ICPM LEVEL (%3d)\n", *ptr);
  5325. h->mb[index + (x&3) + 16*(x>>2)]= *ptr++;
  5326. }
  5327. }
  5328. ff_init_cabac_decoder(&h->cabac, ptr, h->cabac.bytestream_end - ptr);
  5329. // All blocks are present
  5330. h->cbp_table[mb_xy] = 0x1ef;
  5331. h->chroma_pred_mode_table[mb_xy] = 0;
  5332. // In deblocking, the quantizer is 0
  5333. s->current_picture.qscale_table[mb_xy]= 0;
  5334. h->chroma_qp[0] = get_chroma_qp(h, 0, 0);
  5335. h->chroma_qp[1] = get_chroma_qp(h, 1, 0);
  5336. // All coeffs are present
  5337. memset(h->non_zero_count[mb_xy], 16, 16);
  5338. s->current_picture.mb_type[mb_xy]= mb_type;
  5339. return 0;
  5340. }
  5341. if(MB_MBAFF){
  5342. h->ref_count[0] <<= 1;
  5343. h->ref_count[1] <<= 1;
  5344. }
  5345. fill_caches(h, mb_type, 0);
  5346. if( IS_INTRA( mb_type ) ) {
  5347. int i, pred_mode;
  5348. if( IS_INTRA4x4( mb_type ) ) {
  5349. if( dct8x8_allowed && decode_cabac_mb_transform_size( h ) ) {
  5350. mb_type |= MB_TYPE_8x8DCT;
  5351. for( i = 0; i < 16; i+=4 ) {
  5352. int pred = pred_intra_mode( h, i );
  5353. int mode = decode_cabac_mb_intra4x4_pred_mode( h, pred );
  5354. fill_rectangle( &h->intra4x4_pred_mode_cache[ scan8[i] ], 2, 2, 8, mode, 1 );
  5355. }
  5356. } else {
  5357. for( i = 0; i < 16; i++ ) {
  5358. int pred = pred_intra_mode( h, i );
  5359. h->intra4x4_pred_mode_cache[ scan8[i] ] = decode_cabac_mb_intra4x4_pred_mode( h, pred );
  5360. //av_log( s->avctx, AV_LOG_ERROR, "i4x4 pred=%d mode=%d\n", pred, h->intra4x4_pred_mode_cache[ scan8[i] ] );
  5361. }
  5362. }
  5363. write_back_intra_pred_mode(h);
  5364. if( check_intra4x4_pred_mode(h) < 0 ) return -1;
  5365. } else {
  5366. h->intra16x16_pred_mode= check_intra_pred_mode( h, h->intra16x16_pred_mode );
  5367. if( h->intra16x16_pred_mode < 0 ) return -1;
  5368. }
  5369. h->chroma_pred_mode_table[mb_xy] =
  5370. pred_mode = decode_cabac_mb_chroma_pre_mode( h );
  5371. pred_mode= check_intra_pred_mode( h, pred_mode );
  5372. if( pred_mode < 0 ) return -1;
  5373. h->chroma_pred_mode= pred_mode;
  5374. } else if( partition_count == 4 ) {
  5375. int i, j, sub_partition_count[4], list, ref[2][4];
  5376. if( h->slice_type == B_TYPE ) {
  5377. for( i = 0; i < 4; i++ ) {
  5378. h->sub_mb_type[i] = decode_cabac_b_mb_sub_type( h );
  5379. sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  5380. h->sub_mb_type[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  5381. }
  5382. if( IS_DIRECT(h->sub_mb_type[0] | h->sub_mb_type[1] |
  5383. h->sub_mb_type[2] | h->sub_mb_type[3]) ) {
  5384. pred_direct_motion(h, &mb_type);
  5385. if( h->ref_count[0] > 1 || h->ref_count[1] > 1 ) {
  5386. for( i = 0; i < 4; i++ )
  5387. if( IS_DIRECT(h->sub_mb_type[i]) )
  5388. fill_rectangle( &h->direct_cache[scan8[4*i]], 2, 2, 8, 1, 1 );
  5389. }
  5390. }
  5391. } else {
  5392. for( i = 0; i < 4; i++ ) {
  5393. h->sub_mb_type[i] = decode_cabac_p_mb_sub_type( h );
  5394. sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  5395. h->sub_mb_type[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  5396. }
  5397. }
  5398. for( list = 0; list < h->list_count; list++ ) {
  5399. for( i = 0; i < 4; i++ ) {
  5400. if(IS_DIRECT(h->sub_mb_type[i])) continue;
  5401. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  5402. if( h->ref_count[list] > 1 )
  5403. ref[list][i] = decode_cabac_mb_ref( h, list, 4*i );
  5404. else
  5405. ref[list][i] = 0;
  5406. } else {
  5407. ref[list][i] = -1;
  5408. }
  5409. h->ref_cache[list][ scan8[4*i]+1 ]=
  5410. h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];
  5411. }
  5412. }
  5413. if(dct8x8_allowed)
  5414. dct8x8_allowed = get_dct8x8_allowed(h);
  5415. for(list=0; list<h->list_count; list++){
  5416. for(i=0; i<4; i++){
  5417. if(IS_DIRECT(h->sub_mb_type[i])){
  5418. fill_rectangle(h->mvd_cache[list][scan8[4*i]], 2, 2, 8, 0, 4);
  5419. continue;
  5420. }
  5421. h->ref_cache[list][ scan8[4*i] ]=h->ref_cache[list][ scan8[4*i]+1 ];
  5422. if(IS_DIR(h->sub_mb_type[i], 0, list) && !IS_DIRECT(h->sub_mb_type[i])){
  5423. const int sub_mb_type= h->sub_mb_type[i];
  5424. const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;
  5425. for(j=0; j<sub_partition_count[i]; j++){
  5426. int mpx, mpy;
  5427. int mx, my;
  5428. const int index= 4*i + block_width*j;
  5429. int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];
  5430. int16_t (* mvd_cache)[2]= &h->mvd_cache[list][ scan8[index] ];
  5431. pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mpx, &mpy);
  5432. mx = mpx + decode_cabac_mb_mvd( h, list, index, 0 );
  5433. my = mpy + decode_cabac_mb_mvd( h, list, index, 1 );
  5434. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5435. if(IS_SUB_8X8(sub_mb_type)){
  5436. mv_cache[ 1 ][0]=
  5437. mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;
  5438. mv_cache[ 1 ][1]=
  5439. mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;
  5440. mvd_cache[ 1 ][0]=
  5441. mvd_cache[ 8 ][0]= mvd_cache[ 9 ][0]= mx - mpx;
  5442. mvd_cache[ 1 ][1]=
  5443. mvd_cache[ 8 ][1]= mvd_cache[ 9 ][1]= my - mpy;
  5444. }else if(IS_SUB_8X4(sub_mb_type)){
  5445. mv_cache[ 1 ][0]= mx;
  5446. mv_cache[ 1 ][1]= my;
  5447. mvd_cache[ 1 ][0]= mx - mpx;
  5448. mvd_cache[ 1 ][1]= my - mpy;
  5449. }else if(IS_SUB_4X8(sub_mb_type)){
  5450. mv_cache[ 8 ][0]= mx;
  5451. mv_cache[ 8 ][1]= my;
  5452. mvd_cache[ 8 ][0]= mx - mpx;
  5453. mvd_cache[ 8 ][1]= my - mpy;
  5454. }
  5455. mv_cache[ 0 ][0]= mx;
  5456. mv_cache[ 0 ][1]= my;
  5457. mvd_cache[ 0 ][0]= mx - mpx;
  5458. mvd_cache[ 0 ][1]= my - mpy;
  5459. }
  5460. }else{
  5461. uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];
  5462. uint32_t *pd= (uint32_t *)&h->mvd_cache[list][ scan8[4*i] ][0];
  5463. p[0] = p[1] = p[8] = p[9] = 0;
  5464. pd[0]= pd[1]= pd[8]= pd[9]= 0;
  5465. }
  5466. }
  5467. }
  5468. } else if( IS_DIRECT(mb_type) ) {
  5469. pred_direct_motion(h, &mb_type);
  5470. fill_rectangle(h->mvd_cache[0][scan8[0]], 4, 4, 8, 0, 4);
  5471. fill_rectangle(h->mvd_cache[1][scan8[0]], 4, 4, 8, 0, 4);
  5472. dct8x8_allowed &= h->sps.direct_8x8_inference_flag;
  5473. } else {
  5474. int list, mx, my, i, mpx, mpy;
  5475. if(IS_16X16(mb_type)){
  5476. for(list=0; list<h->list_count; list++){
  5477. if(IS_DIR(mb_type, 0, list)){
  5478. const int ref = h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 0 ) : 0;
  5479. fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, ref, 1);
  5480. }else
  5481. 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
  5482. }
  5483. for(list=0; list<h->list_count; list++){
  5484. if(IS_DIR(mb_type, 0, list)){
  5485. pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mpx, &mpy);
  5486. mx = mpx + decode_cabac_mb_mvd( h, list, 0, 0 );
  5487. my = mpy + decode_cabac_mb_mvd( h, list, 0, 1 );
  5488. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5489. fill_rectangle(h->mvd_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx-mpx,my-mpy), 4);
  5490. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx,my), 4);
  5491. }else
  5492. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, 0, 4);
  5493. }
  5494. }
  5495. else if(IS_16X8(mb_type)){
  5496. for(list=0; list<h->list_count; list++){
  5497. for(i=0; i<2; i++){
  5498. if(IS_DIR(mb_type, i, list)){
  5499. const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 8*i ) : 0;
  5500. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, ref, 1);
  5501. }else
  5502. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, (LIST_NOT_USED&0xFF), 1);
  5503. }
  5504. }
  5505. for(list=0; list<h->list_count; list++){
  5506. for(i=0; i<2; i++){
  5507. if(IS_DIR(mb_type, i, list)){
  5508. pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mpx, &mpy);
  5509. mx = mpx + decode_cabac_mb_mvd( h, list, 8*i, 0 );
  5510. my = mpy + decode_cabac_mb_mvd( h, list, 8*i, 1 );
  5511. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5512. fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx-mpx,my-mpy), 4);
  5513. fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx,my), 4);
  5514. }else{
  5515. fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);
  5516. fill_rectangle(h-> mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);
  5517. }
  5518. }
  5519. }
  5520. }else{
  5521. assert(IS_8X16(mb_type));
  5522. for(list=0; list<h->list_count; list++){
  5523. for(i=0; i<2; i++){
  5524. if(IS_DIR(mb_type, i, list)){ //FIXME optimize
  5525. const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 4*i ) : 0;
  5526. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, ref, 1);
  5527. }else
  5528. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, (LIST_NOT_USED&0xFF), 1);
  5529. }
  5530. }
  5531. for(list=0; list<h->list_count; list++){
  5532. for(i=0; i<2; i++){
  5533. if(IS_DIR(mb_type, i, list)){
  5534. pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mpx, &mpy);
  5535. mx = mpx + decode_cabac_mb_mvd( h, list, 4*i, 0 );
  5536. my = mpy + decode_cabac_mb_mvd( h, list, 4*i, 1 );
  5537. tprintf(s->avctx, "final mv:%d %d\n", mx, my);
  5538. fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx-mpx,my-mpy), 4);
  5539. fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx,my), 4);
  5540. }else{
  5541. fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);
  5542. fill_rectangle(h-> mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);
  5543. }
  5544. }
  5545. }
  5546. }
  5547. }
  5548. if( IS_INTER( mb_type ) ) {
  5549. h->chroma_pred_mode_table[mb_xy] = 0;
  5550. write_back_motion( h, mb_type );
  5551. }
  5552. if( !IS_INTRA16x16( mb_type ) ) {
  5553. cbp = decode_cabac_mb_cbp_luma( h );
  5554. cbp |= decode_cabac_mb_cbp_chroma( h ) << 4;
  5555. }
  5556. h->cbp_table[mb_xy] = h->cbp = cbp;
  5557. if( dct8x8_allowed && (cbp&15) && !IS_INTRA( mb_type ) ) {
  5558. if( decode_cabac_mb_transform_size( h ) )
  5559. mb_type |= MB_TYPE_8x8DCT;
  5560. }
  5561. s->current_picture.mb_type[mb_xy]= mb_type;
  5562. if( cbp || IS_INTRA16x16( mb_type ) ) {
  5563. const uint8_t *scan, *scan8x8, *dc_scan;
  5564. int dqp;
  5565. if(IS_INTERLACED(mb_type)){
  5566. scan8x8= s->qscale ? h->field_scan8x8 : h->field_scan8x8_q0;
  5567. scan= s->qscale ? h->field_scan : h->field_scan_q0;
  5568. dc_scan= luma_dc_field_scan;
  5569. }else{
  5570. scan8x8= s->qscale ? h->zigzag_scan8x8 : h->zigzag_scan8x8_q0;
  5571. scan= s->qscale ? h->zigzag_scan : h->zigzag_scan_q0;
  5572. dc_scan= luma_dc_zigzag_scan;
  5573. }
  5574. h->last_qscale_diff = dqp = decode_cabac_mb_dqp( h );
  5575. if( dqp == INT_MIN ){
  5576. av_log(h->s.avctx, AV_LOG_ERROR, "cabac decode of qscale diff failed at %d %d\n", s->mb_x, s->mb_y);
  5577. return -1;
  5578. }
  5579. s->qscale += dqp;
  5580. if(((unsigned)s->qscale) > 51){
  5581. if(s->qscale<0) s->qscale+= 52;
  5582. else s->qscale-= 52;
  5583. }
  5584. h->chroma_qp[0] = get_chroma_qp(h, 0, s->qscale);
  5585. h->chroma_qp[1] = get_chroma_qp(h, 1, s->qscale);
  5586. if( IS_INTRA16x16( mb_type ) ) {
  5587. int i;
  5588. //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 DC\n" );
  5589. if( decode_cabac_residual( h, h->mb, 0, 0, dc_scan, NULL, 16) < 0)
  5590. return -1;
  5591. if( cbp&15 ) {
  5592. for( i = 0; i < 16; i++ ) {
  5593. //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 AC:%d\n", i );
  5594. if( decode_cabac_residual(h, h->mb + 16*i, 1, i, scan + 1, h->dequant4_coeff[0][s->qscale], 15) < 0 )
  5595. return -1;
  5596. }
  5597. } else {
  5598. fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);
  5599. }
  5600. } else {
  5601. int i8x8, i4x4;
  5602. for( i8x8 = 0; i8x8 < 4; i8x8++ ) {
  5603. if( cbp & (1<<i8x8) ) {
  5604. if( IS_8x8DCT(mb_type) ) {
  5605. if( decode_cabac_residual(h, h->mb + 64*i8x8, 5, 4*i8x8,
  5606. scan8x8, h->dequant8_coeff[IS_INTRA( mb_type ) ? 0:1][s->qscale], 64) < 0 )
  5607. return -1;
  5608. } else
  5609. for( i4x4 = 0; i4x4 < 4; i4x4++ ) {
  5610. const int index = 4*i8x8 + i4x4;
  5611. //av_log( s->avctx, AV_LOG_ERROR, "Luma4x4: %d\n", index );
  5612. //START_TIMER
  5613. if( decode_cabac_residual(h, h->mb + 16*index, 2, index, scan, h->dequant4_coeff[IS_INTRA( mb_type ) ? 0:3][s->qscale], 16) < 0 )
  5614. return -1;
  5615. //STOP_TIMER("decode_residual")
  5616. }
  5617. } else {
  5618. uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  5619. nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;
  5620. }
  5621. }
  5622. }
  5623. if( cbp&0x30 ){
  5624. int c;
  5625. for( c = 0; c < 2; c++ ) {
  5626. //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-DC\n",c );
  5627. if( decode_cabac_residual(h, h->mb + 256 + 16*4*c, 3, c, chroma_dc_scan, NULL, 4) < 0)
  5628. return -1;
  5629. }
  5630. }
  5631. if( cbp&0x20 ) {
  5632. int c, i;
  5633. for( c = 0; c < 2; c++ ) {
  5634. const uint32_t *qmul = h->dequant4_coeff[c+1+(IS_INTRA( mb_type ) ? 0:3)][h->chroma_qp[c]];
  5635. for( i = 0; i < 4; i++ ) {
  5636. const int index = 16 + 4 * c + i;
  5637. //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-AC %d\n",c, index - 16 );
  5638. if( decode_cabac_residual(h, h->mb + 16*index, 4, index - 16, scan + 1, qmul, 15) < 0)
  5639. return -1;
  5640. }
  5641. }
  5642. } else {
  5643. uint8_t * const nnz= &h->non_zero_count_cache[0];
  5644. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  5645. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  5646. }
  5647. } else {
  5648. uint8_t * const nnz= &h->non_zero_count_cache[0];
  5649. fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);
  5650. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  5651. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  5652. h->last_qscale_diff = 0;
  5653. }
  5654. s->current_picture.qscale_table[mb_xy]= s->qscale;
  5655. write_back_non_zero_count(h);
  5656. if(MB_MBAFF){
  5657. h->ref_count[0] >>= 1;
  5658. h->ref_count[1] >>= 1;
  5659. }
  5660. return 0;
  5661. }
  5662. static void filter_mb_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5663. int i, d;
  5664. const int index_a = qp + h->slice_alpha_c0_offset;
  5665. const int alpha = (alpha_table+52)[index_a];
  5666. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5667. if( bS[0] < 4 ) {
  5668. int8_t tc[4];
  5669. for(i=0; i<4; i++)
  5670. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] : -1;
  5671. h->s.dsp.h264_h_loop_filter_luma(pix, stride, alpha, beta, tc);
  5672. } else {
  5673. /* 16px edge length, because bS=4 is triggered by being at
  5674. * the edge of an intra MB, so all 4 bS are the same */
  5675. for( d = 0; d < 16; d++ ) {
  5676. const int p0 = pix[-1];
  5677. const int p1 = pix[-2];
  5678. const int p2 = pix[-3];
  5679. const int q0 = pix[0];
  5680. const int q1 = pix[1];
  5681. const int q2 = pix[2];
  5682. if( FFABS( p0 - q0 ) < alpha &&
  5683. FFABS( p1 - p0 ) < beta &&
  5684. FFABS( q1 - q0 ) < beta ) {
  5685. if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  5686. if( FFABS( p2 - p0 ) < beta)
  5687. {
  5688. const int p3 = pix[-4];
  5689. /* p0', p1', p2' */
  5690. pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  5691. pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  5692. pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  5693. } else {
  5694. /* p0' */
  5695. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5696. }
  5697. if( FFABS( q2 - q0 ) < beta)
  5698. {
  5699. const int q3 = pix[3];
  5700. /* q0', q1', q2' */
  5701. pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  5702. pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  5703. pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  5704. } else {
  5705. /* q0' */
  5706. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5707. }
  5708. }else{
  5709. /* p0', q0' */
  5710. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5711. pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5712. }
  5713. 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]);
  5714. }
  5715. pix += stride;
  5716. }
  5717. }
  5718. }
  5719. static void filter_mb_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5720. int i;
  5721. const int index_a = qp + h->slice_alpha_c0_offset;
  5722. const int alpha = (alpha_table+52)[index_a];
  5723. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5724. if( bS[0] < 4 ) {
  5725. int8_t tc[4];
  5726. for(i=0; i<4; i++)
  5727. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] + 1 : 0;
  5728. h->s.dsp.h264_h_loop_filter_chroma(pix, stride, alpha, beta, tc);
  5729. } else {
  5730. h->s.dsp.h264_h_loop_filter_chroma_intra(pix, stride, alpha, beta);
  5731. }
  5732. }
  5733. static void filter_mb_mbaff_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[8], int qp[2] ) {
  5734. int i;
  5735. for( i = 0; i < 16; i++, pix += stride) {
  5736. int index_a;
  5737. int alpha;
  5738. int beta;
  5739. int qp_index;
  5740. int bS_index = (i >> 1);
  5741. if (!MB_FIELD) {
  5742. bS_index &= ~1;
  5743. bS_index |= (i & 1);
  5744. }
  5745. if( bS[bS_index] == 0 ) {
  5746. continue;
  5747. }
  5748. qp_index = MB_FIELD ? (i >> 3) : (i & 1);
  5749. index_a = qp[qp_index] + h->slice_alpha_c0_offset;
  5750. alpha = (alpha_table+52)[index_a];
  5751. beta = (beta_table+52)[qp[qp_index] + h->slice_beta_offset];
  5752. if( bS[bS_index] < 4 ) {
  5753. const int tc0 = (tc0_table+52)[index_a][bS[bS_index] - 1];
  5754. const int p0 = pix[-1];
  5755. const int p1 = pix[-2];
  5756. const int p2 = pix[-3];
  5757. const int q0 = pix[0];
  5758. const int q1 = pix[1];
  5759. const int q2 = pix[2];
  5760. if( FFABS( p0 - q0 ) < alpha &&
  5761. FFABS( p1 - p0 ) < beta &&
  5762. FFABS( q1 - q0 ) < beta ) {
  5763. int tc = tc0;
  5764. int i_delta;
  5765. if( FFABS( p2 - p0 ) < beta ) {
  5766. pix[-2] = p1 + av_clip( ( p2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( p1 << 1 ) ) >> 1, -tc0, tc0 );
  5767. tc++;
  5768. }
  5769. if( FFABS( q2 - q0 ) < beta ) {
  5770. pix[1] = q1 + av_clip( ( q2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( q1 << 1 ) ) >> 1, -tc0, tc0 );
  5771. tc++;
  5772. }
  5773. i_delta = av_clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  5774. pix[-1] = av_clip_uint8( p0 + i_delta ); /* p0' */
  5775. pix[0] = av_clip_uint8( q0 - i_delta ); /* q0' */
  5776. 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);
  5777. }
  5778. }else{
  5779. const int p0 = pix[-1];
  5780. const int p1 = pix[-2];
  5781. const int p2 = pix[-3];
  5782. const int q0 = pix[0];
  5783. const int q1 = pix[1];
  5784. const int q2 = pix[2];
  5785. if( FFABS( p0 - q0 ) < alpha &&
  5786. FFABS( p1 - p0 ) < beta &&
  5787. FFABS( q1 - q0 ) < beta ) {
  5788. if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  5789. if( FFABS( p2 - p0 ) < beta)
  5790. {
  5791. const int p3 = pix[-4];
  5792. /* p0', p1', p2' */
  5793. pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  5794. pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  5795. pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  5796. } else {
  5797. /* p0' */
  5798. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5799. }
  5800. if( FFABS( q2 - q0 ) < beta)
  5801. {
  5802. const int q3 = pix[3];
  5803. /* q0', q1', q2' */
  5804. pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  5805. pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  5806. pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  5807. } else {
  5808. /* q0' */
  5809. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5810. }
  5811. }else{
  5812. /* p0', q0' */
  5813. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5814. pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5815. }
  5816. 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]);
  5817. }
  5818. }
  5819. }
  5820. }
  5821. static void filter_mb_mbaff_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[8], int qp[2] ) {
  5822. int i;
  5823. for( i = 0; i < 8; i++, pix += stride) {
  5824. int index_a;
  5825. int alpha;
  5826. int beta;
  5827. int qp_index;
  5828. int bS_index = i;
  5829. if( bS[bS_index] == 0 ) {
  5830. continue;
  5831. }
  5832. qp_index = MB_FIELD ? (i >> 2) : (i & 1);
  5833. index_a = qp[qp_index] + h->slice_alpha_c0_offset;
  5834. alpha = (alpha_table+52)[index_a];
  5835. beta = (beta_table+52)[qp[qp_index] + h->slice_beta_offset];
  5836. if( bS[bS_index] < 4 ) {
  5837. const int tc = (tc0_table+52)[index_a][bS[bS_index] - 1] + 1;
  5838. const int p0 = pix[-1];
  5839. const int p1 = pix[-2];
  5840. const int q0 = pix[0];
  5841. const int q1 = pix[1];
  5842. if( FFABS( p0 - q0 ) < alpha &&
  5843. FFABS( p1 - p0 ) < beta &&
  5844. FFABS( q1 - q0 ) < beta ) {
  5845. const int i_delta = av_clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  5846. pix[-1] = av_clip_uint8( p0 + i_delta ); /* p0' */
  5847. pix[0] = av_clip_uint8( q0 - i_delta ); /* q0' */
  5848. 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);
  5849. }
  5850. }else{
  5851. const int p0 = pix[-1];
  5852. const int p1 = pix[-2];
  5853. const int q0 = pix[0];
  5854. const int q1 = pix[1];
  5855. if( FFABS( p0 - q0 ) < alpha &&
  5856. FFABS( p1 - p0 ) < beta &&
  5857. FFABS( q1 - q0 ) < beta ) {
  5858. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2; /* p0' */
  5859. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2; /* q0' */
  5860. 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]);
  5861. }
  5862. }
  5863. }
  5864. }
  5865. static void filter_mb_edgeh( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5866. int i, d;
  5867. const int index_a = qp + h->slice_alpha_c0_offset;
  5868. const int alpha = (alpha_table+52)[index_a];
  5869. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5870. const int pix_next = stride;
  5871. if( bS[0] < 4 ) {
  5872. int8_t tc[4];
  5873. for(i=0; i<4; i++)
  5874. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] : -1;
  5875. h->s.dsp.h264_v_loop_filter_luma(pix, stride, alpha, beta, tc);
  5876. } else {
  5877. /* 16px edge length, see filter_mb_edgev */
  5878. for( d = 0; d < 16; d++ ) {
  5879. const int p0 = pix[-1*pix_next];
  5880. const int p1 = pix[-2*pix_next];
  5881. const int p2 = pix[-3*pix_next];
  5882. const int q0 = pix[0];
  5883. const int q1 = pix[1*pix_next];
  5884. const int q2 = pix[2*pix_next];
  5885. if( FFABS( p0 - q0 ) < alpha &&
  5886. FFABS( p1 - p0 ) < beta &&
  5887. FFABS( q1 - q0 ) < beta ) {
  5888. const int p3 = pix[-4*pix_next];
  5889. const int q3 = pix[ 3*pix_next];
  5890. if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  5891. if( FFABS( p2 - p0 ) < beta) {
  5892. /* p0', p1', p2' */
  5893. pix[-1*pix_next] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  5894. pix[-2*pix_next] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  5895. pix[-3*pix_next] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  5896. } else {
  5897. /* p0' */
  5898. pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5899. }
  5900. if( FFABS( q2 - q0 ) < beta) {
  5901. /* q0', q1', q2' */
  5902. pix[0*pix_next] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  5903. pix[1*pix_next] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  5904. pix[2*pix_next] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  5905. } else {
  5906. /* q0' */
  5907. pix[0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5908. }
  5909. }else{
  5910. /* p0', q0' */
  5911. pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  5912. pix[ 0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  5913. }
  5914. 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]);
  5915. }
  5916. pix++;
  5917. }
  5918. }
  5919. }
  5920. static void filter_mb_edgech( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {
  5921. int i;
  5922. const int index_a = qp + h->slice_alpha_c0_offset;
  5923. const int alpha = (alpha_table+52)[index_a];
  5924. const int beta = (beta_table+52)[qp + h->slice_beta_offset];
  5925. if( bS[0] < 4 ) {
  5926. int8_t tc[4];
  5927. for(i=0; i<4; i++)
  5928. tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] + 1 : 0;
  5929. h->s.dsp.h264_v_loop_filter_chroma(pix, stride, alpha, beta, tc);
  5930. } else {
  5931. h->s.dsp.h264_v_loop_filter_chroma_intra(pix, stride, alpha, beta);
  5932. }
  5933. }
  5934. 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) {
  5935. MpegEncContext * const s = &h->s;
  5936. int mb_xy, mb_type;
  5937. int qp, qp0, qp1, qpc, qpc0, qpc1, qp_thresh;
  5938. mb_xy = mb_x + mb_y*s->mb_stride;
  5939. if(mb_x==0 || mb_y==0 || !s->dsp.h264_loop_filter_strength || h->pps.chroma_qp_diff ||
  5940. (h->deblocking_filter == 2 && (h->slice_table[mb_xy] != h->slice_table[h->top_mb_xy] ||
  5941. h->slice_table[mb_xy] != h->slice_table[mb_xy - 1]))) {
  5942. filter_mb(h, mb_x, mb_y, img_y, img_cb, img_cr, linesize, uvlinesize);
  5943. return;
  5944. }
  5945. assert(!FRAME_MBAFF);
  5946. mb_type = s->current_picture.mb_type[mb_xy];
  5947. qp = s->current_picture.qscale_table[mb_xy];
  5948. qp0 = s->current_picture.qscale_table[mb_xy-1];
  5949. qp1 = s->current_picture.qscale_table[h->top_mb_xy];
  5950. qpc = get_chroma_qp( h, 0, qp );
  5951. qpc0 = get_chroma_qp( h, 0, qp0 );
  5952. qpc1 = get_chroma_qp( h, 0, qp1 );
  5953. qp0 = (qp + qp0 + 1) >> 1;
  5954. qp1 = (qp + qp1 + 1) >> 1;
  5955. qpc0 = (qpc + qpc0 + 1) >> 1;
  5956. qpc1 = (qpc + qpc1 + 1) >> 1;
  5957. qp_thresh = 15 - h->slice_alpha_c0_offset;
  5958. if(qp <= qp_thresh && qp0 <= qp_thresh && qp1 <= qp_thresh &&
  5959. qpc <= qp_thresh && qpc0 <= qp_thresh && qpc1 <= qp_thresh)
  5960. return;
  5961. if( IS_INTRA(mb_type) ) {
  5962. int16_t bS4[4] = {4,4,4,4};
  5963. int16_t bS3[4] = {3,3,3,3};
  5964. if( IS_8x8DCT(mb_type) ) {
  5965. filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );
  5966. filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );
  5967. filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bS4, qp1 );
  5968. filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );
  5969. } else {
  5970. filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );
  5971. filter_mb_edgev( h, &img_y[4*1], linesize, bS3, qp );
  5972. filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );
  5973. filter_mb_edgev( h, &img_y[4*3], linesize, bS3, qp );
  5974. filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bS4, qp1 );
  5975. filter_mb_edgeh( h, &img_y[4*1*linesize], linesize, bS3, qp );
  5976. filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );
  5977. filter_mb_edgeh( h, &img_y[4*3*linesize], linesize, bS3, qp );
  5978. }
  5979. filter_mb_edgecv( h, &img_cb[2*0], uvlinesize, bS4, qpc0 );
  5980. filter_mb_edgecv( h, &img_cb[2*2], uvlinesize, bS3, qpc );
  5981. filter_mb_edgecv( h, &img_cr[2*0], uvlinesize, bS4, qpc0 );
  5982. filter_mb_edgecv( h, &img_cr[2*2], uvlinesize, bS3, qpc );
  5983. filter_mb_edgech( h, &img_cb[2*0*uvlinesize], uvlinesize, bS4, qpc1 );
  5984. filter_mb_edgech( h, &img_cb[2*2*uvlinesize], uvlinesize, bS3, qpc );
  5985. filter_mb_edgech( h, &img_cr[2*0*uvlinesize], uvlinesize, bS4, qpc1 );
  5986. filter_mb_edgech( h, &img_cr[2*2*uvlinesize], uvlinesize, bS3, qpc );
  5987. return;
  5988. } else {
  5989. DECLARE_ALIGNED_8(int16_t, bS[2][4][4]);
  5990. uint64_t (*bSv)[4] = (uint64_t(*)[4])bS;
  5991. int edges;
  5992. if( IS_8x8DCT(mb_type) && (h->cbp&7) == 7 ) {
  5993. edges = 4;
  5994. bSv[0][0] = bSv[0][2] = bSv[1][0] = bSv[1][2] = 0x0002000200020002ULL;
  5995. } else {
  5996. int mask_edge1 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16)) ? 3 :
  5997. (mb_type & MB_TYPE_16x8) ? 1 : 0;
  5998. int mask_edge0 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16))
  5999. && (s->current_picture.mb_type[mb_xy-1] & (MB_TYPE_16x16 | MB_TYPE_8x16))
  6000. ? 3 : 0;
  6001. int step = IS_8x8DCT(mb_type) ? 2 : 1;
  6002. edges = (mb_type & MB_TYPE_16x16) && !(h->cbp & 15) ? 1 : 4;
  6003. s->dsp.h264_loop_filter_strength( bS, h->non_zero_count_cache, h->ref_cache, h->mv_cache,
  6004. (h->slice_type == B_TYPE), edges, step, mask_edge0, mask_edge1 );
  6005. }
  6006. if( IS_INTRA(s->current_picture.mb_type[mb_xy-1]) )
  6007. bSv[0][0] = 0x0004000400040004ULL;
  6008. if( IS_INTRA(s->current_picture.mb_type[h->top_mb_xy]) )
  6009. bSv[1][0] = 0x0004000400040004ULL;
  6010. #define FILTER(hv,dir,edge)\
  6011. if(bSv[dir][edge]) {\
  6012. filter_mb_edge##hv( h, &img_y[4*edge*(dir?linesize:1)], linesize, bS[dir][edge], edge ? qp : qp##dir );\
  6013. if(!(edge&1)) {\
  6014. filter_mb_edgec##hv( h, &img_cb[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\
  6015. filter_mb_edgec##hv( h, &img_cr[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\
  6016. }\
  6017. }
  6018. if( edges == 1 ) {
  6019. FILTER(v,0,0);
  6020. FILTER(h,1,0);
  6021. } else if( IS_8x8DCT(mb_type) ) {
  6022. FILTER(v,0,0);
  6023. FILTER(v,0,2);
  6024. FILTER(h,1,0);
  6025. FILTER(h,1,2);
  6026. } else {
  6027. FILTER(v,0,0);
  6028. FILTER(v,0,1);
  6029. FILTER(v,0,2);
  6030. FILTER(v,0,3);
  6031. FILTER(h,1,0);
  6032. FILTER(h,1,1);
  6033. FILTER(h,1,2);
  6034. FILTER(h,1,3);
  6035. }
  6036. #undef FILTER
  6037. }
  6038. }
  6039. 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) {
  6040. MpegEncContext * const s = &h->s;
  6041. const int mb_xy= mb_x + mb_y*s->mb_stride;
  6042. const int mb_type = s->current_picture.mb_type[mb_xy];
  6043. const int mvy_limit = IS_INTERLACED(mb_type) ? 2 : 4;
  6044. int first_vertical_edge_done = 0;
  6045. int dir;
  6046. /* FIXME: A given frame may occupy more than one position in
  6047. * the reference list. So ref2frm should be populated with
  6048. * frame numbers, not indices. */
  6049. static const int ref2frm[34] = {-1,-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
  6050. 16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};
  6051. //for sufficiently low qp, filtering wouldn't do anything
  6052. //this is a conservative estimate: could also check beta_offset and more accurate chroma_qp
  6053. if(!FRAME_MBAFF){
  6054. int qp_thresh = 15 - h->slice_alpha_c0_offset - FFMAX(0, FFMAX(h->pps.chroma_qp_index_offset[0], h->pps.chroma_qp_index_offset[1]));
  6055. int qp = s->current_picture.qscale_table[mb_xy];
  6056. if(qp <= qp_thresh
  6057. && (mb_x == 0 || ((qp + s->current_picture.qscale_table[mb_xy-1] + 1)>>1) <= qp_thresh)
  6058. && (mb_y == 0 || ((qp + s->current_picture.qscale_table[h->top_mb_xy] + 1)>>1) <= qp_thresh)){
  6059. return;
  6060. }
  6061. }
  6062. if (FRAME_MBAFF
  6063. // left mb is in picture
  6064. && h->slice_table[mb_xy-1] != 255
  6065. // and current and left pair do not have the same interlaced type
  6066. && (IS_INTERLACED(mb_type) != IS_INTERLACED(s->current_picture.mb_type[mb_xy-1]))
  6067. // and left mb is in the same slice if deblocking_filter == 2
  6068. && (h->deblocking_filter!=2 || h->slice_table[mb_xy-1] == h->slice_table[mb_xy])) {
  6069. /* First vertical edge is different in MBAFF frames
  6070. * There are 8 different bS to compute and 2 different Qp
  6071. */
  6072. const int pair_xy = mb_x + (mb_y&~1)*s->mb_stride;
  6073. const int left_mb_xy[2] = { pair_xy-1, pair_xy-1+s->mb_stride };
  6074. int16_t bS[8];
  6075. int qp[2];
  6076. int bqp[2];
  6077. int rqp[2];
  6078. int mb_qp, mbn0_qp, mbn1_qp;
  6079. int i;
  6080. first_vertical_edge_done = 1;
  6081. if( IS_INTRA(mb_type) )
  6082. bS[0] = bS[1] = bS[2] = bS[3] = bS[4] = bS[5] = bS[6] = bS[7] = 4;
  6083. else {
  6084. for( i = 0; i < 8; i++ ) {
  6085. int mbn_xy = MB_FIELD ? left_mb_xy[i>>2] : left_mb_xy[i&1];
  6086. if( IS_INTRA( s->current_picture.mb_type[mbn_xy] ) )
  6087. bS[i] = 4;
  6088. else if( h->non_zero_count_cache[12+8*(i>>1)] != 0 ||
  6089. /* FIXME: with 8x8dct + cavlc, should check cbp instead of nnz */
  6090. h->non_zero_count[mbn_xy][MB_FIELD ? i&3 : (i>>2)+(mb_y&1)*2] )
  6091. bS[i] = 2;
  6092. else
  6093. bS[i] = 1;
  6094. }
  6095. }
  6096. mb_qp = s->current_picture.qscale_table[mb_xy];
  6097. mbn0_qp = s->current_picture.qscale_table[left_mb_xy[0]];
  6098. mbn1_qp = s->current_picture.qscale_table[left_mb_xy[1]];
  6099. qp[0] = ( mb_qp + mbn0_qp + 1 ) >> 1;
  6100. bqp[0] = ( get_chroma_qp( h, 0, mb_qp ) +
  6101. get_chroma_qp( h, 0, mbn0_qp ) + 1 ) >> 1;
  6102. rqp[0] = ( get_chroma_qp( h, 1, mb_qp ) +
  6103. get_chroma_qp( h, 1, mbn0_qp ) + 1 ) >> 1;
  6104. qp[1] = ( mb_qp + mbn1_qp + 1 ) >> 1;
  6105. bqp[1] = ( get_chroma_qp( h, 0, mb_qp ) +
  6106. get_chroma_qp( h, 0, mbn1_qp ) + 1 ) >> 1;
  6107. rqp[1] = ( get_chroma_qp( h, 1, mb_qp ) +
  6108. get_chroma_qp( h, 1, mbn1_qp ) + 1 ) >> 1;
  6109. /* Filter edge */
  6110. 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);
  6111. { int i; for (i = 0; i < 8; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }
  6112. filter_mb_mbaff_edgev ( h, &img_y [0], linesize, bS, qp );
  6113. filter_mb_mbaff_edgecv( h, &img_cb[0], uvlinesize, bS, bqp );
  6114. filter_mb_mbaff_edgecv( h, &img_cr[0], uvlinesize, bS, rqp );
  6115. }
  6116. /* dir : 0 -> vertical edge, 1 -> horizontal edge */
  6117. for( dir = 0; dir < 2; dir++ )
  6118. {
  6119. int edge;
  6120. const int mbm_xy = dir == 0 ? mb_xy -1 : h->top_mb_xy;
  6121. const int mbm_type = s->current_picture.mb_type[mbm_xy];
  6122. int start = h->slice_table[mbm_xy] == 255 ? 1 : 0;
  6123. const int edges = (mb_type & (MB_TYPE_16x16|MB_TYPE_SKIP))
  6124. == (MB_TYPE_16x16|MB_TYPE_SKIP) ? 1 : 4;
  6125. // how often to recheck mv-based bS when iterating between edges
  6126. const int mask_edge = (mb_type & (MB_TYPE_16x16 | (MB_TYPE_16x8 << dir))) ? 3 :
  6127. (mb_type & (MB_TYPE_8x16 >> dir)) ? 1 : 0;
  6128. // how often to recheck mv-based bS when iterating along each edge
  6129. const int mask_par0 = mb_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir));
  6130. if (first_vertical_edge_done) {
  6131. start = 1;
  6132. first_vertical_edge_done = 0;
  6133. }
  6134. if (h->deblocking_filter==2 && h->slice_table[mbm_xy] != h->slice_table[mb_xy])
  6135. start = 1;
  6136. if (FRAME_MBAFF && (dir == 1) && ((mb_y&1) == 0) && start == 0
  6137. && !IS_INTERLACED(mb_type)
  6138. && IS_INTERLACED(mbm_type)
  6139. ) {
  6140. // This is a special case in the norm where the filtering must
  6141. // be done twice (one each of the field) even if we are in a
  6142. // frame macroblock.
  6143. //
  6144. static const int nnz_idx[4] = {4,5,6,3};
  6145. unsigned int tmp_linesize = 2 * linesize;
  6146. unsigned int tmp_uvlinesize = 2 * uvlinesize;
  6147. int mbn_xy = mb_xy - 2 * s->mb_stride;
  6148. int qp;
  6149. int i, j;
  6150. int16_t bS[4];
  6151. for(j=0; j<2; j++, mbn_xy += s->mb_stride){
  6152. if( IS_INTRA(mb_type) ||
  6153. IS_INTRA(s->current_picture.mb_type[mbn_xy]) ) {
  6154. bS[0] = bS[1] = bS[2] = bS[3] = 3;
  6155. } else {
  6156. const uint8_t *mbn_nnz = h->non_zero_count[mbn_xy];
  6157. for( i = 0; i < 4; i++ ) {
  6158. if( h->non_zero_count_cache[scan8[0]+i] != 0 ||
  6159. mbn_nnz[nnz_idx[i]] != 0 )
  6160. bS[i] = 2;
  6161. else
  6162. bS[i] = 1;
  6163. }
  6164. }
  6165. // Do not use s->qscale as luma quantizer because it has not the same
  6166. // value in IPCM macroblocks.
  6167. qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;
  6168. 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);
  6169. { int i; for (i = 0; i < 4; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }
  6170. filter_mb_edgeh( h, &img_y[j*linesize], tmp_linesize, bS, qp );
  6171. filter_mb_edgech( h, &img_cb[j*uvlinesize], tmp_uvlinesize, bS,
  6172. ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6173. filter_mb_edgech( h, &img_cr[j*uvlinesize], tmp_uvlinesize, bS,
  6174. ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6175. }
  6176. start = 1;
  6177. }
  6178. /* Calculate bS */
  6179. for( edge = start; edge < edges; edge++ ) {
  6180. /* mbn_xy: neighbor macroblock */
  6181. const int mbn_xy = edge > 0 ? mb_xy : mbm_xy;
  6182. const int mbn_type = s->current_picture.mb_type[mbn_xy];
  6183. int16_t bS[4];
  6184. int qp;
  6185. if( (edge&1) && IS_8x8DCT(mb_type) )
  6186. continue;
  6187. if( IS_INTRA(mb_type) ||
  6188. IS_INTRA(mbn_type) ) {
  6189. int value;
  6190. if (edge == 0) {
  6191. if ( (!IS_INTERLACED(mb_type) && !IS_INTERLACED(mbm_type))
  6192. || ((FRAME_MBAFF || (s->picture_structure != PICT_FRAME)) && (dir == 0))
  6193. ) {
  6194. value = 4;
  6195. } else {
  6196. value = 3;
  6197. }
  6198. } else {
  6199. value = 3;
  6200. }
  6201. bS[0] = bS[1] = bS[2] = bS[3] = value;
  6202. } else {
  6203. int i, l;
  6204. int mv_done;
  6205. if( edge & mask_edge ) {
  6206. bS[0] = bS[1] = bS[2] = bS[3] = 0;
  6207. mv_done = 1;
  6208. }
  6209. else if( FRAME_MBAFF && IS_INTERLACED(mb_type ^ mbn_type)) {
  6210. bS[0] = bS[1] = bS[2] = bS[3] = 1;
  6211. mv_done = 1;
  6212. }
  6213. else if( mask_par0 && (edge || (mbn_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir)))) ) {
  6214. int b_idx= 8 + 4 + edge * (dir ? 8:1);
  6215. int bn_idx= b_idx - (dir ? 8:1);
  6216. int v = 0;
  6217. for( l = 0; !v && l < 1 + (h->slice_type == B_TYPE); l++ ) {
  6218. v |= ref2frm[h->ref_cache[l][b_idx]+2] != ref2frm[h->ref_cache[l][bn_idx]+2] ||
  6219. FFABS( h->mv_cache[l][b_idx][0] - h->mv_cache[l][bn_idx][0] ) >= 4 ||
  6220. FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[l][bn_idx][1] ) >= mvy_limit;
  6221. }
  6222. bS[0] = bS[1] = bS[2] = bS[3] = v;
  6223. mv_done = 1;
  6224. }
  6225. else
  6226. mv_done = 0;
  6227. for( i = 0; i < 4; i++ ) {
  6228. int x = dir == 0 ? edge : i;
  6229. int y = dir == 0 ? i : edge;
  6230. int b_idx= 8 + 4 + x + 8*y;
  6231. int bn_idx= b_idx - (dir ? 8:1);
  6232. if( h->non_zero_count_cache[b_idx] != 0 ||
  6233. h->non_zero_count_cache[bn_idx] != 0 ) {
  6234. bS[i] = 2;
  6235. }
  6236. else if(!mv_done)
  6237. {
  6238. bS[i] = 0;
  6239. for( l = 0; l < 1 + (h->slice_type == B_TYPE); l++ ) {
  6240. if( ref2frm[h->ref_cache[l][b_idx]+2] != ref2frm[h->ref_cache[l][bn_idx]+2] ||
  6241. FFABS( h->mv_cache[l][b_idx][0] - h->mv_cache[l][bn_idx][0] ) >= 4 ||
  6242. FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[l][bn_idx][1] ) >= mvy_limit ) {
  6243. bS[i] = 1;
  6244. break;
  6245. }
  6246. }
  6247. }
  6248. }
  6249. if(bS[0]+bS[1]+bS[2]+bS[3] == 0)
  6250. continue;
  6251. }
  6252. /* Filter edge */
  6253. // Do not use s->qscale as luma quantizer because it has not the same
  6254. // value in IPCM macroblocks.
  6255. qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;
  6256. //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]);
  6257. 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);
  6258. { int i; for (i = 0; i < 4; i++) tprintf(s->avctx, " bS[%d]:%d", i, bS[i]); tprintf(s->avctx, "\n"); }
  6259. if( dir == 0 ) {
  6260. filter_mb_edgev( h, &img_y[4*edge], linesize, bS, qp );
  6261. if( (edge&1) == 0 ) {
  6262. filter_mb_edgecv( h, &img_cb[2*edge], uvlinesize, bS,
  6263. ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6264. filter_mb_edgecv( h, &img_cr[2*edge], uvlinesize, bS,
  6265. ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6266. }
  6267. } else {
  6268. filter_mb_edgeh( h, &img_y[4*edge*linesize], linesize, bS, qp );
  6269. if( (edge&1) == 0 ) {
  6270. filter_mb_edgech( h, &img_cb[2*edge*uvlinesize], uvlinesize, bS,
  6271. ( h->chroma_qp[0] + get_chroma_qp( h, 0, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6272. filter_mb_edgech( h, &img_cr[2*edge*uvlinesize], uvlinesize, bS,
  6273. ( h->chroma_qp[1] + get_chroma_qp( h, 1, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1);
  6274. }
  6275. }
  6276. }
  6277. }
  6278. }
  6279. static int decode_slice(H264Context *h){
  6280. MpegEncContext * const s = &h->s;
  6281. const int part_mask= s->partitioned_frame ? (AC_END|AC_ERROR) : 0x7F;
  6282. s->mb_skip_run= -1;
  6283. if( h->pps.cabac ) {
  6284. int i;
  6285. /* realign */
  6286. align_get_bits( &s->gb );
  6287. /* init cabac */
  6288. ff_init_cabac_states( &h->cabac);
  6289. ff_init_cabac_decoder( &h->cabac,
  6290. s->gb.buffer + get_bits_count(&s->gb)/8,
  6291. ( s->gb.size_in_bits - get_bits_count(&s->gb) + 7)/8);
  6292. /* calculate pre-state */
  6293. for( i= 0; i < 460; i++ ) {
  6294. int pre;
  6295. if( h->slice_type == I_TYPE )
  6296. pre = av_clip( ((cabac_context_init_I[i][0] * s->qscale) >>4 ) + cabac_context_init_I[i][1], 1, 126 );
  6297. else
  6298. 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 );
  6299. if( pre <= 63 )
  6300. h->cabac_state[i] = 2 * ( 63 - pre ) + 0;
  6301. else
  6302. h->cabac_state[i] = 2 * ( pre - 64 ) + 1;
  6303. }
  6304. for(;;){
  6305. //START_TIMER
  6306. int ret = decode_mb_cabac(h);
  6307. int eos;
  6308. //STOP_TIMER("decode_mb_cabac")
  6309. if(ret>=0) hl_decode_mb(h);
  6310. if( ret >= 0 && FRAME_MBAFF ) { //FIXME optimal? or let mb_decode decode 16x32 ?
  6311. s->mb_y++;
  6312. if(ret>=0) ret = decode_mb_cabac(h);
  6313. if(ret>=0) hl_decode_mb(h);
  6314. s->mb_y--;
  6315. }
  6316. eos = get_cabac_terminate( &h->cabac );
  6317. if( ret < 0 || h->cabac.bytestream > h->cabac.bytestream_end + 2) {
  6318. 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);
  6319. 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);
  6320. return -1;
  6321. }
  6322. if( ++s->mb_x >= s->mb_width ) {
  6323. s->mb_x = 0;
  6324. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  6325. ++s->mb_y;
  6326. if(FRAME_MBAFF) {
  6327. ++s->mb_y;
  6328. }
  6329. }
  6330. if( eos || s->mb_y >= s->mb_height ) {
  6331. tprintf(s->avctx, "slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  6332. 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);
  6333. return 0;
  6334. }
  6335. }
  6336. } else {
  6337. for(;;){
  6338. int ret = decode_mb_cavlc(h);
  6339. if(ret>=0) hl_decode_mb(h);
  6340. if(ret>=0 && FRAME_MBAFF){ //FIXME optimal? or let mb_decode decode 16x32 ?
  6341. s->mb_y++;
  6342. ret = decode_mb_cavlc(h);
  6343. if(ret>=0) hl_decode_mb(h);
  6344. s->mb_y--;
  6345. }
  6346. if(ret<0){
  6347. av_log(h->s.avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);
  6348. 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);
  6349. return -1;
  6350. }
  6351. if(++s->mb_x >= s->mb_width){
  6352. s->mb_x=0;
  6353. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  6354. ++s->mb_y;
  6355. if(FRAME_MBAFF) {
  6356. ++s->mb_y;
  6357. }
  6358. if(s->mb_y >= s->mb_height){
  6359. tprintf(s->avctx, "slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  6360. if(get_bits_count(&s->gb) == s->gb.size_in_bits ) {
  6361. 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);
  6362. return 0;
  6363. }else{
  6364. 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);
  6365. return -1;
  6366. }
  6367. }
  6368. }
  6369. if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->mb_skip_run<=0){
  6370. tprintf(s->avctx, "slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  6371. if(get_bits_count(&s->gb) == s->gb.size_in_bits ){
  6372. 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);
  6373. return 0;
  6374. }else{
  6375. 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);
  6376. return -1;
  6377. }
  6378. }
  6379. }
  6380. }
  6381. #if 0
  6382. for(;s->mb_y < s->mb_height; s->mb_y++){
  6383. for(;s->mb_x < s->mb_width; s->mb_x++){
  6384. int ret= decode_mb(h);
  6385. hl_decode_mb(h);
  6386. if(ret<0){
  6387. av_log(s->avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);
  6388. 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);
  6389. return -1;
  6390. }
  6391. if(++s->mb_x >= s->mb_width){
  6392. s->mb_x=0;
  6393. if(++s->mb_y >= s->mb_height){
  6394. if(get_bits_count(s->gb) == s->gb.size_in_bits){
  6395. 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);
  6396. return 0;
  6397. }else{
  6398. 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);
  6399. return -1;
  6400. }
  6401. }
  6402. }
  6403. if(get_bits_count(s->?gb) >= s->gb?.size_in_bits){
  6404. if(get_bits_count(s->gb) == s->gb.size_in_bits){
  6405. 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);
  6406. return 0;
  6407. }else{
  6408. 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);
  6409. return -1;
  6410. }
  6411. }
  6412. }
  6413. s->mb_x=0;
  6414. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  6415. }
  6416. #endif
  6417. return -1; //not reached
  6418. }
  6419. static int decode_unregistered_user_data(H264Context *h, int size){
  6420. MpegEncContext * const s = &h->s;
  6421. uint8_t user_data[16+256];
  6422. int e, build, i;
  6423. if(size<16)
  6424. return -1;
  6425. for(i=0; i<sizeof(user_data)-1 && i<size; i++){
  6426. user_data[i]= get_bits(&s->gb, 8);
  6427. }
  6428. user_data[i]= 0;
  6429. e= sscanf(user_data+16, "x264 - core %d"/*%s - H.264/MPEG-4 AVC codec - Copyleft 2005 - http://www.videolan.org/x264.html*/, &build);
  6430. if(e==1 && build>=0)
  6431. h->x264_build= build;
  6432. if(s->avctx->debug & FF_DEBUG_BUGS)
  6433. av_log(s->avctx, AV_LOG_DEBUG, "user data:\"%s\"\n", user_data+16);
  6434. for(; i<size; i++)
  6435. skip_bits(&s->gb, 8);
  6436. return 0;
  6437. }
  6438. static int decode_sei(H264Context *h){
  6439. MpegEncContext * const s = &h->s;
  6440. while(get_bits_count(&s->gb) + 16 < s->gb.size_in_bits){
  6441. int size, type;
  6442. type=0;
  6443. do{
  6444. type+= show_bits(&s->gb, 8);
  6445. }while(get_bits(&s->gb, 8) == 255);
  6446. size=0;
  6447. do{
  6448. size+= show_bits(&s->gb, 8);
  6449. }while(get_bits(&s->gb, 8) == 255);
  6450. switch(type){
  6451. case 5:
  6452. if(decode_unregistered_user_data(h, size) < 0)
  6453. return -1;
  6454. break;
  6455. default:
  6456. skip_bits(&s->gb, 8*size);
  6457. }
  6458. //FIXME check bits here
  6459. align_get_bits(&s->gb);
  6460. }
  6461. return 0;
  6462. }
  6463. static inline void decode_hrd_parameters(H264Context *h, SPS *sps){
  6464. MpegEncContext * const s = &h->s;
  6465. int cpb_count, i;
  6466. cpb_count = get_ue_golomb(&s->gb) + 1;
  6467. get_bits(&s->gb, 4); /* bit_rate_scale */
  6468. get_bits(&s->gb, 4); /* cpb_size_scale */
  6469. for(i=0; i<cpb_count; i++){
  6470. get_ue_golomb(&s->gb); /* bit_rate_value_minus1 */
  6471. get_ue_golomb(&s->gb); /* cpb_size_value_minus1 */
  6472. get_bits1(&s->gb); /* cbr_flag */
  6473. }
  6474. get_bits(&s->gb, 5); /* initial_cpb_removal_delay_length_minus1 */
  6475. get_bits(&s->gb, 5); /* cpb_removal_delay_length_minus1 */
  6476. get_bits(&s->gb, 5); /* dpb_output_delay_length_minus1 */
  6477. get_bits(&s->gb, 5); /* time_offset_length */
  6478. }
  6479. static inline int decode_vui_parameters(H264Context *h, SPS *sps){
  6480. MpegEncContext * const s = &h->s;
  6481. int aspect_ratio_info_present_flag;
  6482. unsigned int aspect_ratio_idc;
  6483. int nal_hrd_parameters_present_flag, vcl_hrd_parameters_present_flag;
  6484. aspect_ratio_info_present_flag= get_bits1(&s->gb);
  6485. if( aspect_ratio_info_present_flag ) {
  6486. aspect_ratio_idc= get_bits(&s->gb, 8);
  6487. if( aspect_ratio_idc == EXTENDED_SAR ) {
  6488. sps->sar.num= get_bits(&s->gb, 16);
  6489. sps->sar.den= get_bits(&s->gb, 16);
  6490. }else if(aspect_ratio_idc < 14){
  6491. sps->sar= pixel_aspect[aspect_ratio_idc];
  6492. }else{
  6493. av_log(h->s.avctx, AV_LOG_ERROR, "illegal aspect ratio\n");
  6494. return -1;
  6495. }
  6496. }else{
  6497. sps->sar.num=
  6498. sps->sar.den= 0;
  6499. }
  6500. // s->avctx->aspect_ratio= sar_width*s->width / (float)(s->height*sar_height);
  6501. if(get_bits1(&s->gb)){ /* overscan_info_present_flag */
  6502. get_bits1(&s->gb); /* overscan_appropriate_flag */
  6503. }
  6504. if(get_bits1(&s->gb)){ /* video_signal_type_present_flag */
  6505. get_bits(&s->gb, 3); /* video_format */
  6506. get_bits1(&s->gb); /* video_full_range_flag */
  6507. if(get_bits1(&s->gb)){ /* colour_description_present_flag */
  6508. get_bits(&s->gb, 8); /* colour_primaries */
  6509. get_bits(&s->gb, 8); /* transfer_characteristics */
  6510. get_bits(&s->gb, 8); /* matrix_coefficients */
  6511. }
  6512. }
  6513. if(get_bits1(&s->gb)){ /* chroma_location_info_present_flag */
  6514. get_ue_golomb(&s->gb); /* chroma_sample_location_type_top_field */
  6515. get_ue_golomb(&s->gb); /* chroma_sample_location_type_bottom_field */
  6516. }
  6517. sps->timing_info_present_flag = get_bits1(&s->gb);
  6518. if(sps->timing_info_present_flag){
  6519. sps->num_units_in_tick = get_bits_long(&s->gb, 32);
  6520. sps->time_scale = get_bits_long(&s->gb, 32);
  6521. sps->fixed_frame_rate_flag = get_bits1(&s->gb);
  6522. }
  6523. nal_hrd_parameters_present_flag = get_bits1(&s->gb);
  6524. if(nal_hrd_parameters_present_flag)
  6525. decode_hrd_parameters(h, sps);
  6526. vcl_hrd_parameters_present_flag = get_bits1(&s->gb);
  6527. if(vcl_hrd_parameters_present_flag)
  6528. decode_hrd_parameters(h, sps);
  6529. if(nal_hrd_parameters_present_flag || vcl_hrd_parameters_present_flag)
  6530. get_bits1(&s->gb); /* low_delay_hrd_flag */
  6531. get_bits1(&s->gb); /* pic_struct_present_flag */
  6532. sps->bitstream_restriction_flag = get_bits1(&s->gb);
  6533. if(sps->bitstream_restriction_flag){
  6534. unsigned int num_reorder_frames;
  6535. get_bits1(&s->gb); /* motion_vectors_over_pic_boundaries_flag */
  6536. get_ue_golomb(&s->gb); /* max_bytes_per_pic_denom */
  6537. get_ue_golomb(&s->gb); /* max_bits_per_mb_denom */
  6538. get_ue_golomb(&s->gb); /* log2_max_mv_length_horizontal */
  6539. get_ue_golomb(&s->gb); /* log2_max_mv_length_vertical */
  6540. num_reorder_frames= get_ue_golomb(&s->gb);
  6541. get_ue_golomb(&s->gb); /*max_dec_frame_buffering*/
  6542. if(num_reorder_frames > 16 /*max_dec_frame_buffering || max_dec_frame_buffering > 16*/){
  6543. av_log(h->s.avctx, AV_LOG_ERROR, "illegal num_reorder_frames %d\n", num_reorder_frames);
  6544. return -1;
  6545. }
  6546. sps->num_reorder_frames= num_reorder_frames;
  6547. }
  6548. return 0;
  6549. }
  6550. static void decode_scaling_list(H264Context *h, uint8_t *factors, int size,
  6551. const uint8_t *jvt_list, const uint8_t *fallback_list){
  6552. MpegEncContext * const s = &h->s;
  6553. int i, last = 8, next = 8;
  6554. const uint8_t *scan = size == 16 ? zigzag_scan : zigzag_scan8x8;
  6555. if(!get_bits1(&s->gb)) /* matrix not written, we use the predicted one */
  6556. memcpy(factors, fallback_list, size*sizeof(uint8_t));
  6557. else
  6558. for(i=0;i<size;i++){
  6559. if(next)
  6560. next = (last + get_se_golomb(&s->gb)) & 0xff;
  6561. if(!i && !next){ /* matrix not written, we use the preset one */
  6562. memcpy(factors, jvt_list, size*sizeof(uint8_t));
  6563. break;
  6564. }
  6565. last = factors[scan[i]] = next ? next : last;
  6566. }
  6567. }
  6568. static void decode_scaling_matrices(H264Context *h, SPS *sps, PPS *pps, int is_sps,
  6569. uint8_t (*scaling_matrix4)[16], uint8_t (*scaling_matrix8)[64]){
  6570. MpegEncContext * const s = &h->s;
  6571. int fallback_sps = !is_sps && sps->scaling_matrix_present;
  6572. const uint8_t *fallback[4] = {
  6573. fallback_sps ? sps->scaling_matrix4[0] : default_scaling4[0],
  6574. fallback_sps ? sps->scaling_matrix4[3] : default_scaling4[1],
  6575. fallback_sps ? sps->scaling_matrix8[0] : default_scaling8[0],
  6576. fallback_sps ? sps->scaling_matrix8[1] : default_scaling8[1]
  6577. };
  6578. if(get_bits1(&s->gb)){
  6579. sps->scaling_matrix_present |= is_sps;
  6580. decode_scaling_list(h,scaling_matrix4[0],16,default_scaling4[0],fallback[0]); // Intra, Y
  6581. decode_scaling_list(h,scaling_matrix4[1],16,default_scaling4[0],scaling_matrix4[0]); // Intra, Cr
  6582. decode_scaling_list(h,scaling_matrix4[2],16,default_scaling4[0],scaling_matrix4[1]); // Intra, Cb
  6583. decode_scaling_list(h,scaling_matrix4[3],16,default_scaling4[1],fallback[1]); // Inter, Y
  6584. decode_scaling_list(h,scaling_matrix4[4],16,default_scaling4[1],scaling_matrix4[3]); // Inter, Cr
  6585. decode_scaling_list(h,scaling_matrix4[5],16,default_scaling4[1],scaling_matrix4[4]); // Inter, Cb
  6586. if(is_sps || pps->transform_8x8_mode){
  6587. decode_scaling_list(h,scaling_matrix8[0],64,default_scaling8[0],fallback[2]); // Intra, Y
  6588. decode_scaling_list(h,scaling_matrix8[1],64,default_scaling8[1],fallback[3]); // Inter, Y
  6589. }
  6590. } else if(fallback_sps) {
  6591. memcpy(scaling_matrix4, sps->scaling_matrix4, 6*16*sizeof(uint8_t));
  6592. memcpy(scaling_matrix8, sps->scaling_matrix8, 2*64*sizeof(uint8_t));
  6593. }
  6594. }
  6595. /**
  6596. * Returns and optionally allocates SPS / PPS structures in the supplied array 'vec'
  6597. */
  6598. static void *
  6599. alloc_parameter_set(H264Context *h, void **vec, const unsigned int id, const unsigned int max,
  6600. const size_t size, const char *name)
  6601. {
  6602. if(id>=max) {
  6603. av_log(h->s.avctx, AV_LOG_ERROR, "%s_id (%d) out of range\n", name, id);
  6604. return NULL;
  6605. }
  6606. if(!vec[id]) {
  6607. vec[id] = av_mallocz(size);
  6608. if(vec[id] == NULL)
  6609. av_log(h->s.avctx, AV_LOG_ERROR, "cannot allocate memory for %s\n", name);
  6610. }
  6611. return vec[id];
  6612. }
  6613. static inline int decode_seq_parameter_set(H264Context *h){
  6614. MpegEncContext * const s = &h->s;
  6615. int profile_idc, level_idc;
  6616. unsigned int sps_id, tmp, mb_width, mb_height;
  6617. int i;
  6618. SPS *sps;
  6619. profile_idc= get_bits(&s->gb, 8);
  6620. get_bits1(&s->gb); //constraint_set0_flag
  6621. get_bits1(&s->gb); //constraint_set1_flag
  6622. get_bits1(&s->gb); //constraint_set2_flag
  6623. get_bits1(&s->gb); //constraint_set3_flag
  6624. get_bits(&s->gb, 4); // reserved
  6625. level_idc= get_bits(&s->gb, 8);
  6626. sps_id= get_ue_golomb(&s->gb);
  6627. sps = alloc_parameter_set(h, (void **)h->sps_buffers, sps_id, MAX_SPS_COUNT, sizeof(SPS), "sps");
  6628. if(sps == NULL)
  6629. return -1;
  6630. sps->profile_idc= profile_idc;
  6631. sps->level_idc= level_idc;
  6632. if(sps->profile_idc >= 100){ //high profile
  6633. if(get_ue_golomb(&s->gb) == 3) //chroma_format_idc
  6634. get_bits1(&s->gb); //residual_color_transform_flag
  6635. get_ue_golomb(&s->gb); //bit_depth_luma_minus8
  6636. get_ue_golomb(&s->gb); //bit_depth_chroma_minus8
  6637. sps->transform_bypass = get_bits1(&s->gb);
  6638. decode_scaling_matrices(h, sps, NULL, 1, sps->scaling_matrix4, sps->scaling_matrix8);
  6639. }else
  6640. sps->scaling_matrix_present = 0;
  6641. sps->log2_max_frame_num= get_ue_golomb(&s->gb) + 4;
  6642. sps->poc_type= get_ue_golomb(&s->gb);
  6643. if(sps->poc_type == 0){ //FIXME #define
  6644. sps->log2_max_poc_lsb= get_ue_golomb(&s->gb) + 4;
  6645. } else if(sps->poc_type == 1){//FIXME #define
  6646. sps->delta_pic_order_always_zero_flag= get_bits1(&s->gb);
  6647. sps->offset_for_non_ref_pic= get_se_golomb(&s->gb);
  6648. sps->offset_for_top_to_bottom_field= get_se_golomb(&s->gb);
  6649. tmp= get_ue_golomb(&s->gb);
  6650. if(tmp >= sizeof(sps->offset_for_ref_frame) / sizeof(sps->offset_for_ref_frame[0])){
  6651. av_log(h->s.avctx, AV_LOG_ERROR, "poc_cycle_length overflow %u\n", tmp);
  6652. return -1;
  6653. }
  6654. sps->poc_cycle_length= tmp;
  6655. for(i=0; i<sps->poc_cycle_length; i++)
  6656. sps->offset_for_ref_frame[i]= get_se_golomb(&s->gb);
  6657. }else if(sps->poc_type != 2){
  6658. av_log(h->s.avctx, AV_LOG_ERROR, "illegal POC type %d\n", sps->poc_type);
  6659. return -1;
  6660. }
  6661. tmp= get_ue_golomb(&s->gb);
  6662. if(tmp > MAX_PICTURE_COUNT-2){
  6663. av_log(h->s.avctx, AV_LOG_ERROR, "too many reference frames\n");
  6664. }
  6665. sps->ref_frame_count= tmp;
  6666. sps->gaps_in_frame_num_allowed_flag= get_bits1(&s->gb);
  6667. mb_width= get_ue_golomb(&s->gb) + 1;
  6668. mb_height= get_ue_golomb(&s->gb) + 1;
  6669. if(mb_width >= INT_MAX/16 || mb_height >= INT_MAX/16 ||
  6670. avcodec_check_dimensions(NULL, 16*mb_width, 16*mb_height)){
  6671. av_log(h->s.avctx, AV_LOG_ERROR, "mb_width/height overflow\n");
  6672. return -1;
  6673. }
  6674. sps->mb_width = mb_width;
  6675. sps->mb_height= mb_height;
  6676. sps->frame_mbs_only_flag= get_bits1(&s->gb);
  6677. if(!sps->frame_mbs_only_flag)
  6678. sps->mb_aff= get_bits1(&s->gb);
  6679. else
  6680. sps->mb_aff= 0;
  6681. sps->direct_8x8_inference_flag= get_bits1(&s->gb);
  6682. #ifndef ALLOW_INTERLACE
  6683. if(sps->mb_aff)
  6684. av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF support not included; enable it at compile-time.\n");
  6685. #endif
  6686. if(!sps->direct_8x8_inference_flag && sps->mb_aff)
  6687. av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF + !direct_8x8_inference is not implemented\n");
  6688. sps->crop= get_bits1(&s->gb);
  6689. if(sps->crop){
  6690. sps->crop_left = get_ue_golomb(&s->gb);
  6691. sps->crop_right = get_ue_golomb(&s->gb);
  6692. sps->crop_top = get_ue_golomb(&s->gb);
  6693. sps->crop_bottom= get_ue_golomb(&s->gb);
  6694. if(sps->crop_left || sps->crop_top){
  6695. av_log(h->s.avctx, AV_LOG_ERROR, "insane cropping not completely supported, this could look slightly wrong ...\n");
  6696. }
  6697. }else{
  6698. sps->crop_left =
  6699. sps->crop_right =
  6700. sps->crop_top =
  6701. sps->crop_bottom= 0;
  6702. }
  6703. sps->vui_parameters_present_flag= get_bits1(&s->gb);
  6704. if( sps->vui_parameters_present_flag )
  6705. decode_vui_parameters(h, sps);
  6706. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  6707. 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",
  6708. sps_id, sps->profile_idc, sps->level_idc,
  6709. sps->poc_type,
  6710. sps->ref_frame_count,
  6711. sps->mb_width, sps->mb_height,
  6712. sps->frame_mbs_only_flag ? "FRM" : (sps->mb_aff ? "MB-AFF" : "PIC-AFF"),
  6713. sps->direct_8x8_inference_flag ? "8B8" : "",
  6714. sps->crop_left, sps->crop_right,
  6715. sps->crop_top, sps->crop_bottom,
  6716. sps->vui_parameters_present_flag ? "VUI" : ""
  6717. );
  6718. }
  6719. return 0;
  6720. }
  6721. static void
  6722. build_qp_table(PPS *pps, int t, int index)
  6723. {
  6724. int i;
  6725. for(i = 0; i < 255; i++)
  6726. pps->chroma_qp_table[t][i & 0xff] = chroma_qp[av_clip(i + index, 0, 51)];
  6727. }
  6728. static inline int decode_picture_parameter_set(H264Context *h, int bit_length){
  6729. MpegEncContext * const s = &h->s;
  6730. unsigned int tmp, pps_id= get_ue_golomb(&s->gb);
  6731. PPS *pps;
  6732. pps = alloc_parameter_set(h, (void **)h->pps_buffers, pps_id, MAX_PPS_COUNT, sizeof(PPS), "pps");
  6733. if(pps == NULL)
  6734. return -1;
  6735. tmp= get_ue_golomb(&s->gb);
  6736. if(tmp>=MAX_SPS_COUNT || h->sps_buffers[tmp] == NULL){
  6737. av_log(h->s.avctx, AV_LOG_ERROR, "sps_id out of range\n");
  6738. return -1;
  6739. }
  6740. pps->sps_id= tmp;
  6741. pps->cabac= get_bits1(&s->gb);
  6742. pps->pic_order_present= get_bits1(&s->gb);
  6743. pps->slice_group_count= get_ue_golomb(&s->gb) + 1;
  6744. if(pps->slice_group_count > 1 ){
  6745. pps->mb_slice_group_map_type= get_ue_golomb(&s->gb);
  6746. av_log(h->s.avctx, AV_LOG_ERROR, "FMO not supported\n");
  6747. switch(pps->mb_slice_group_map_type){
  6748. case 0:
  6749. #if 0
  6750. | for( i = 0; i <= num_slice_groups_minus1; i++ ) | | |
  6751. | run_length[ i ] |1 |ue(v) |
  6752. #endif
  6753. break;
  6754. case 2:
  6755. #if 0
  6756. | for( i = 0; i < num_slice_groups_minus1; i++ ) | | |
  6757. |{ | | |
  6758. | top_left_mb[ i ] |1 |ue(v) |
  6759. | bottom_right_mb[ i ] |1 |ue(v) |
  6760. | } | | |
  6761. #endif
  6762. break;
  6763. case 3:
  6764. case 4:
  6765. case 5:
  6766. #if 0
  6767. | slice_group_change_direction_flag |1 |u(1) |
  6768. | slice_group_change_rate_minus1 |1 |ue(v) |
  6769. #endif
  6770. break;
  6771. case 6:
  6772. #if 0
  6773. | slice_group_id_cnt_minus1 |1 |ue(v) |
  6774. | for( i = 0; i <= slice_group_id_cnt_minus1; i++ | | |
  6775. |) | | |
  6776. | slice_group_id[ i ] |1 |u(v) |
  6777. #endif
  6778. break;
  6779. }
  6780. }
  6781. pps->ref_count[0]= get_ue_golomb(&s->gb) + 1;
  6782. pps->ref_count[1]= get_ue_golomb(&s->gb) + 1;
  6783. if(pps->ref_count[0]-1 > 32-1 || pps->ref_count[1]-1 > 32-1){
  6784. av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow (pps)\n");
  6785. pps->ref_count[0]= pps->ref_count[1]= 1;
  6786. return -1;
  6787. }
  6788. pps->weighted_pred= get_bits1(&s->gb);
  6789. pps->weighted_bipred_idc= get_bits(&s->gb, 2);
  6790. pps->init_qp= get_se_golomb(&s->gb) + 26;
  6791. pps->init_qs= get_se_golomb(&s->gb) + 26;
  6792. pps->chroma_qp_index_offset[0]= get_se_golomb(&s->gb);
  6793. pps->deblocking_filter_parameters_present= get_bits1(&s->gb);
  6794. pps->constrained_intra_pred= get_bits1(&s->gb);
  6795. pps->redundant_pic_cnt_present = get_bits1(&s->gb);
  6796. pps->transform_8x8_mode= 0;
  6797. h->dequant_coeff_pps= -1; //contents of sps/pps can change even if id doesn't, so reinit
  6798. memset(pps->scaling_matrix4, 16, 6*16*sizeof(uint8_t));
  6799. memset(pps->scaling_matrix8, 16, 2*64*sizeof(uint8_t));
  6800. if(get_bits_count(&s->gb) < bit_length){
  6801. pps->transform_8x8_mode= get_bits1(&s->gb);
  6802. decode_scaling_matrices(h, h->sps_buffers[pps->sps_id], pps, 0, pps->scaling_matrix4, pps->scaling_matrix8);
  6803. pps->chroma_qp_index_offset[1]= get_se_golomb(&s->gb); //second_chroma_qp_index_offset
  6804. } else {
  6805. pps->chroma_qp_index_offset[1]= pps->chroma_qp_index_offset[0];
  6806. }
  6807. build_qp_table(pps, 0, pps->chroma_qp_index_offset[0]);
  6808. if(pps->chroma_qp_index_offset[0] != pps->chroma_qp_index_offset[1]) {
  6809. build_qp_table(pps, 1, pps->chroma_qp_index_offset[1]);
  6810. h->pps.chroma_qp_diff= 1;
  6811. } else
  6812. memcpy(pps->chroma_qp_table[1], pps->chroma_qp_table[0], 256);
  6813. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  6814. 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",
  6815. pps_id, pps->sps_id,
  6816. pps->cabac ? "CABAC" : "CAVLC",
  6817. pps->slice_group_count,
  6818. pps->ref_count[0], pps->ref_count[1],
  6819. pps->weighted_pred ? "weighted" : "",
  6820. pps->init_qp, pps->init_qs, pps->chroma_qp_index_offset[0], pps->chroma_qp_index_offset[1],
  6821. pps->deblocking_filter_parameters_present ? "LPAR" : "",
  6822. pps->constrained_intra_pred ? "CONSTR" : "",
  6823. pps->redundant_pic_cnt_present ? "REDU" : "",
  6824. pps->transform_8x8_mode ? "8x8DCT" : ""
  6825. );
  6826. }
  6827. return 0;
  6828. }
  6829. static int decode_nal_units(H264Context *h, uint8_t *buf, int buf_size){
  6830. MpegEncContext * const s = &h->s;
  6831. AVCodecContext * const avctx= s->avctx;
  6832. int buf_index=0;
  6833. #if 0
  6834. int i;
  6835. for(i=0; i<50; i++){
  6836. av_log(NULL, AV_LOG_ERROR,"%02X ", buf[i]);
  6837. }
  6838. #endif
  6839. if(!(s->flags2 & CODEC_FLAG2_CHUNKS)){
  6840. h->slice_num = 0;
  6841. s->current_picture_ptr= NULL;
  6842. }
  6843. for(;;){
  6844. int consumed;
  6845. int dst_length;
  6846. int bit_length;
  6847. uint8_t *ptr;
  6848. int i, nalsize = 0;
  6849. if(h->is_avc) {
  6850. if(buf_index >= buf_size) break;
  6851. nalsize = 0;
  6852. for(i = 0; i < h->nal_length_size; i++)
  6853. nalsize = (nalsize << 8) | buf[buf_index++];
  6854. if(nalsize <= 1 || (nalsize+buf_index > buf_size)){
  6855. if(nalsize == 1){
  6856. buf_index++;
  6857. continue;
  6858. }else{
  6859. av_log(h->s.avctx, AV_LOG_ERROR, "AVC: nal size %d\n", nalsize);
  6860. break;
  6861. }
  6862. }
  6863. } else {
  6864. // start code prefix search
  6865. for(; buf_index + 3 < buf_size; buf_index++){
  6866. // This should always succeed in the first iteration.
  6867. if(buf[buf_index] == 0 && buf[buf_index+1] == 0 && buf[buf_index+2] == 1)
  6868. break;
  6869. }
  6870. if(buf_index+3 >= buf_size) break;
  6871. buf_index+=3;
  6872. }
  6873. ptr= decode_nal(h, buf + buf_index, &dst_length, &consumed, h->is_avc ? nalsize : buf_size - buf_index);
  6874. if (ptr==NULL || dst_length < 0){
  6875. return -1;
  6876. }
  6877. while(ptr[dst_length - 1] == 0 && dst_length > 0)
  6878. dst_length--;
  6879. bit_length= !dst_length ? 0 : (8*dst_length - decode_rbsp_trailing(h, ptr + dst_length - 1));
  6880. if(s->avctx->debug&FF_DEBUG_STARTCODE){
  6881. av_log(h->s.avctx, AV_LOG_DEBUG, "NAL %d at %d/%d length %d\n", h->nal_unit_type, buf_index, buf_size, dst_length);
  6882. }
  6883. if (h->is_avc && (nalsize != consumed))
  6884. av_log(h->s.avctx, AV_LOG_ERROR, "AVC: Consumed only %d bytes instead of %d\n", consumed, nalsize);
  6885. buf_index += consumed;
  6886. if( (s->hurry_up == 1 && h->nal_ref_idc == 0) //FIXME do not discard SEI id
  6887. ||(avctx->skip_frame >= AVDISCARD_NONREF && h->nal_ref_idc == 0))
  6888. continue;
  6889. switch(h->nal_unit_type){
  6890. case NAL_IDR_SLICE:
  6891. idr(h); //FIXME ensure we don't loose some frames if there is reordering
  6892. case NAL_SLICE:
  6893. init_get_bits(&s->gb, ptr, bit_length);
  6894. h->intra_gb_ptr=
  6895. h->inter_gb_ptr= &s->gb;
  6896. s->data_partitioning = 0;
  6897. if(decode_slice_header(h) < 0){
  6898. av_log(h->s.avctx, AV_LOG_ERROR, "decode_slice_header error\n");
  6899. break;
  6900. }
  6901. s->current_picture_ptr->key_frame= (h->nal_unit_type == NAL_IDR_SLICE);
  6902. if(h->redundant_pic_count==0 && s->hurry_up < 5
  6903. && (avctx->skip_frame < AVDISCARD_NONREF || h->nal_ref_idc)
  6904. && (avctx->skip_frame < AVDISCARD_BIDIR || h->slice_type!=B_TYPE)
  6905. && (avctx->skip_frame < AVDISCARD_NONKEY || h->slice_type==I_TYPE)
  6906. && avctx->skip_frame < AVDISCARD_ALL)
  6907. decode_slice(h);
  6908. break;
  6909. case NAL_DPA:
  6910. init_get_bits(&s->gb, ptr, bit_length);
  6911. h->intra_gb_ptr=
  6912. h->inter_gb_ptr= NULL;
  6913. s->data_partitioning = 1;
  6914. if(decode_slice_header(h) < 0){
  6915. av_log(h->s.avctx, AV_LOG_ERROR, "decode_slice_header error\n");
  6916. }
  6917. break;
  6918. case NAL_DPB:
  6919. init_get_bits(&h->intra_gb, ptr, bit_length);
  6920. h->intra_gb_ptr= &h->intra_gb;
  6921. break;
  6922. case NAL_DPC:
  6923. init_get_bits(&h->inter_gb, ptr, bit_length);
  6924. h->inter_gb_ptr= &h->inter_gb;
  6925. if(h->redundant_pic_count==0 && h->intra_gb_ptr && s->data_partitioning
  6926. && s->context_initialized
  6927. && s->hurry_up < 5
  6928. && (avctx->skip_frame < AVDISCARD_NONREF || h->nal_ref_idc)
  6929. && (avctx->skip_frame < AVDISCARD_BIDIR || h->slice_type!=B_TYPE)
  6930. && (avctx->skip_frame < AVDISCARD_NONKEY || h->slice_type==I_TYPE)
  6931. && avctx->skip_frame < AVDISCARD_ALL)
  6932. decode_slice(h);
  6933. break;
  6934. case NAL_SEI:
  6935. init_get_bits(&s->gb, ptr, bit_length);
  6936. decode_sei(h);
  6937. break;
  6938. case NAL_SPS:
  6939. init_get_bits(&s->gb, ptr, bit_length);
  6940. decode_seq_parameter_set(h);
  6941. if(s->flags& CODEC_FLAG_LOW_DELAY)
  6942. s->low_delay=1;
  6943. if(avctx->has_b_frames < 2)
  6944. avctx->has_b_frames= !s->low_delay;
  6945. break;
  6946. case NAL_PPS:
  6947. init_get_bits(&s->gb, ptr, bit_length);
  6948. decode_picture_parameter_set(h, bit_length);
  6949. break;
  6950. case NAL_AUD:
  6951. case NAL_END_SEQUENCE:
  6952. case NAL_END_STREAM:
  6953. case NAL_FILLER_DATA:
  6954. case NAL_SPS_EXT:
  6955. case NAL_AUXILIARY_SLICE:
  6956. break;
  6957. default:
  6958. av_log(avctx, AV_LOG_ERROR, "Unknown NAL code: %d\n", h->nal_unit_type);
  6959. }
  6960. }
  6961. return buf_index;
  6962. }
  6963. /**
  6964. * returns the number of bytes consumed for building the current frame
  6965. */
  6966. static int get_consumed_bytes(MpegEncContext *s, int pos, int buf_size){
  6967. if(s->flags&CODEC_FLAG_TRUNCATED){
  6968. pos -= s->parse_context.last_index;
  6969. if(pos<0) pos=0; // FIXME remove (unneeded?)
  6970. return pos;
  6971. }else{
  6972. if(pos==0) pos=1; //avoid infinite loops (i doubt that is needed but ...)
  6973. if(pos+10>buf_size) pos=buf_size; // oops ;)
  6974. return pos;
  6975. }
  6976. }
  6977. static int decode_frame(AVCodecContext *avctx,
  6978. void *data, int *data_size,
  6979. uint8_t *buf, int buf_size)
  6980. {
  6981. H264Context *h = avctx->priv_data;
  6982. MpegEncContext *s = &h->s;
  6983. AVFrame *pict = data;
  6984. int buf_index;
  6985. s->flags= avctx->flags;
  6986. s->flags2= avctx->flags2;
  6987. /* no supplementary picture */
  6988. if (buf_size == 0) {
  6989. Picture *out;
  6990. int i, out_idx;
  6991. //FIXME factorize this with the output code below
  6992. out = h->delayed_pic[0];
  6993. out_idx = 0;
  6994. for(i=1; h->delayed_pic[i] && !h->delayed_pic[i]->key_frame; i++)
  6995. if(h->delayed_pic[i]->poc < out->poc){
  6996. out = h->delayed_pic[i];
  6997. out_idx = i;
  6998. }
  6999. for(i=out_idx; h->delayed_pic[i]; i++)
  7000. h->delayed_pic[i] = h->delayed_pic[i+1];
  7001. if(out){
  7002. *data_size = sizeof(AVFrame);
  7003. *pict= *(AVFrame*)out;
  7004. }
  7005. return 0;
  7006. }
  7007. if(s->flags&CODEC_FLAG_TRUNCATED){
  7008. int next= ff_h264_find_frame_end(h, buf, buf_size);
  7009. if( ff_combine_frame(&s->parse_context, next, (const uint8_t **)&buf, &buf_size) < 0 )
  7010. return buf_size;
  7011. //printf("next:%d buf_size:%d last_index:%d\n", next, buf_size, s->parse_context.last_index);
  7012. }
  7013. if(h->is_avc && !h->got_avcC) {
  7014. int i, cnt, nalsize;
  7015. unsigned char *p = avctx->extradata;
  7016. if(avctx->extradata_size < 7) {
  7017. av_log(avctx, AV_LOG_ERROR, "avcC too short\n");
  7018. return -1;
  7019. }
  7020. if(*p != 1) {
  7021. av_log(avctx, AV_LOG_ERROR, "Unknown avcC version %d\n", *p);
  7022. return -1;
  7023. }
  7024. /* sps and pps in the avcC always have length coded with 2 bytes,
  7025. so put a fake nal_length_size = 2 while parsing them */
  7026. h->nal_length_size = 2;
  7027. // Decode sps from avcC
  7028. cnt = *(p+5) & 0x1f; // Number of sps
  7029. p += 6;
  7030. for (i = 0; i < cnt; i++) {
  7031. nalsize = AV_RB16(p) + 2;
  7032. if(decode_nal_units(h, p, nalsize) < 0) {
  7033. av_log(avctx, AV_LOG_ERROR, "Decoding sps %d from avcC failed\n", i);
  7034. return -1;
  7035. }
  7036. p += nalsize;
  7037. }
  7038. // Decode pps from avcC
  7039. cnt = *(p++); // Number of pps
  7040. for (i = 0; i < cnt; i++) {
  7041. nalsize = AV_RB16(p) + 2;
  7042. if(decode_nal_units(h, p, nalsize) != nalsize) {
  7043. av_log(avctx, AV_LOG_ERROR, "Decoding pps %d from avcC failed\n", i);
  7044. return -1;
  7045. }
  7046. p += nalsize;
  7047. }
  7048. // Now store right nal length size, that will be use to parse all other nals
  7049. h->nal_length_size = ((*(((char*)(avctx->extradata))+4))&0x03)+1;
  7050. // Do not reparse avcC
  7051. h->got_avcC = 1;
  7052. }
  7053. if(avctx->frame_number==0 && !h->is_avc && s->avctx->extradata_size){
  7054. if(decode_nal_units(h, s->avctx->extradata, s->avctx->extradata_size) < 0)
  7055. return -1;
  7056. }
  7057. buf_index=decode_nal_units(h, buf, buf_size);
  7058. if(buf_index < 0)
  7059. return -1;
  7060. if(!(s->flags2 & CODEC_FLAG2_CHUNKS) && !s->current_picture_ptr){
  7061. av_log(avctx, AV_LOG_ERROR, "no frame!\n");
  7062. return -1;
  7063. }
  7064. if(!(s->flags2 & CODEC_FLAG2_CHUNKS) || (s->mb_y >= s->mb_height && s->mb_height)){
  7065. Picture *out = s->current_picture_ptr;
  7066. Picture *cur = s->current_picture_ptr;
  7067. Picture *prev = h->delayed_output_pic;
  7068. int i, pics, cross_idr, out_of_order, out_idx;
  7069. s->mb_y= 0;
  7070. s->current_picture_ptr->qscale_type= FF_QSCALE_TYPE_H264;
  7071. s->current_picture_ptr->pict_type= s->pict_type;
  7072. h->prev_frame_num_offset= h->frame_num_offset;
  7073. h->prev_frame_num= h->frame_num;
  7074. if(s->current_picture_ptr->reference){
  7075. h->prev_poc_msb= h->poc_msb;
  7076. h->prev_poc_lsb= h->poc_lsb;
  7077. }
  7078. if(s->current_picture_ptr->reference)
  7079. execute_ref_pic_marking(h, h->mmco, h->mmco_index);
  7080. ff_er_frame_end(s);
  7081. MPV_frame_end(s);
  7082. //FIXME do something with unavailable reference frames
  7083. #if 0 //decode order
  7084. *data_size = sizeof(AVFrame);
  7085. #else
  7086. /* Sort B-frames into display order */
  7087. if(h->sps.bitstream_restriction_flag
  7088. && s->avctx->has_b_frames < h->sps.num_reorder_frames){
  7089. s->avctx->has_b_frames = h->sps.num_reorder_frames;
  7090. s->low_delay = 0;
  7091. }
  7092. pics = 0;
  7093. while(h->delayed_pic[pics]) pics++;
  7094. assert(pics+1 < sizeof(h->delayed_pic) / sizeof(h->delayed_pic[0]));
  7095. h->delayed_pic[pics++] = cur;
  7096. if(cur->reference == 0)
  7097. cur->reference = 1;
  7098. cross_idr = 0;
  7099. for(i=0; h->delayed_pic[i]; i++)
  7100. if(h->delayed_pic[i]->key_frame || h->delayed_pic[i]->poc==0)
  7101. cross_idr = 1;
  7102. out = h->delayed_pic[0];
  7103. out_idx = 0;
  7104. for(i=1; h->delayed_pic[i] && !h->delayed_pic[i]->key_frame; i++)
  7105. if(h->delayed_pic[i]->poc < out->poc){
  7106. out = h->delayed_pic[i];
  7107. out_idx = i;
  7108. }
  7109. out_of_order = !cross_idr && prev && out->poc < prev->poc;
  7110. if(h->sps.bitstream_restriction_flag && s->avctx->has_b_frames >= h->sps.num_reorder_frames)
  7111. { }
  7112. else if(prev && pics <= s->avctx->has_b_frames)
  7113. out = prev;
  7114. else if((out_of_order && pics-1 == s->avctx->has_b_frames && pics < 15)
  7115. || (s->low_delay &&
  7116. ((!cross_idr && prev && out->poc > prev->poc + 2)
  7117. || cur->pict_type == B_TYPE)))
  7118. {
  7119. s->low_delay = 0;
  7120. s->avctx->has_b_frames++;
  7121. out = prev;
  7122. }
  7123. else if(out_of_order)
  7124. out = prev;
  7125. if(out_of_order || pics > s->avctx->has_b_frames){
  7126. for(i=out_idx; h->delayed_pic[i]; i++)
  7127. h->delayed_pic[i] = h->delayed_pic[i+1];
  7128. }
  7129. if(prev == out)
  7130. *data_size = 0;
  7131. else
  7132. *data_size = sizeof(AVFrame);
  7133. if(prev && prev != out && prev->reference == 1)
  7134. prev->reference = 0;
  7135. h->delayed_output_pic = out;
  7136. #endif
  7137. if(out)
  7138. *pict= *(AVFrame*)out;
  7139. else
  7140. av_log(avctx, AV_LOG_DEBUG, "no picture\n");
  7141. }
  7142. assert(pict->data[0] || !*data_size);
  7143. ff_print_debug_info(s, pict);
  7144. //printf("out %d\n", (int)pict->data[0]);
  7145. #if 0 //?
  7146. /* Return the Picture timestamp as the frame number */
  7147. /* we substract 1 because it is added on utils.c */
  7148. avctx->frame_number = s->picture_number - 1;
  7149. #endif
  7150. return get_consumed_bytes(s, buf_index, buf_size);
  7151. }
  7152. #if 0
  7153. static inline void fill_mb_avail(H264Context *h){
  7154. MpegEncContext * const s = &h->s;
  7155. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  7156. if(s->mb_y){
  7157. h->mb_avail[0]= s->mb_x && h->slice_table[mb_xy - s->mb_stride - 1] == h->slice_num;
  7158. h->mb_avail[1]= h->slice_table[mb_xy - s->mb_stride ] == h->slice_num;
  7159. h->mb_avail[2]= s->mb_x+1 < s->mb_width && h->slice_table[mb_xy - s->mb_stride + 1] == h->slice_num;
  7160. }else{
  7161. h->mb_avail[0]=
  7162. h->mb_avail[1]=
  7163. h->mb_avail[2]= 0;
  7164. }
  7165. h->mb_avail[3]= s->mb_x && h->slice_table[mb_xy - 1] == h->slice_num;
  7166. h->mb_avail[4]= 1; //FIXME move out
  7167. h->mb_avail[5]= 0; //FIXME move out
  7168. }
  7169. #endif
  7170. #if 0 //selftest
  7171. #define COUNT 8000
  7172. #define SIZE (COUNT*40)
  7173. int main(){
  7174. int i;
  7175. uint8_t temp[SIZE];
  7176. PutBitContext pb;
  7177. GetBitContext gb;
  7178. // int int_temp[10000];
  7179. DSPContext dsp;
  7180. AVCodecContext avctx;
  7181. dsputil_init(&dsp, &avctx);
  7182. init_put_bits(&pb, temp, SIZE);
  7183. printf("testing unsigned exp golomb\n");
  7184. for(i=0; i<COUNT; i++){
  7185. START_TIMER
  7186. set_ue_golomb(&pb, i);
  7187. STOP_TIMER("set_ue_golomb");
  7188. }
  7189. flush_put_bits(&pb);
  7190. init_get_bits(&gb, temp, 8*SIZE);
  7191. for(i=0; i<COUNT; i++){
  7192. int j, s;
  7193. s= show_bits(&gb, 24);
  7194. START_TIMER
  7195. j= get_ue_golomb(&gb);
  7196. if(j != i){
  7197. printf("mismatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);
  7198. // return -1;
  7199. }
  7200. STOP_TIMER("get_ue_golomb");
  7201. }
  7202. init_put_bits(&pb, temp, SIZE);
  7203. printf("testing signed exp golomb\n");
  7204. for(i=0; i<COUNT; i++){
  7205. START_TIMER
  7206. set_se_golomb(&pb, i - COUNT/2);
  7207. STOP_TIMER("set_se_golomb");
  7208. }
  7209. flush_put_bits(&pb);
  7210. init_get_bits(&gb, temp, 8*SIZE);
  7211. for(i=0; i<COUNT; i++){
  7212. int j, s;
  7213. s= show_bits(&gb, 24);
  7214. START_TIMER
  7215. j= get_se_golomb(&gb);
  7216. if(j != i - COUNT/2){
  7217. printf("mismatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);
  7218. // return -1;
  7219. }
  7220. STOP_TIMER("get_se_golomb");
  7221. }
  7222. printf("testing 4x4 (I)DCT\n");
  7223. DCTELEM block[16];
  7224. uint8_t src[16], ref[16];
  7225. uint64_t error= 0, max_error=0;
  7226. for(i=0; i<COUNT; i++){
  7227. int j;
  7228. // printf("%d %d %d\n", r1, r2, (r2-r1)*16);
  7229. for(j=0; j<16; j++){
  7230. ref[j]= random()%255;
  7231. src[j]= random()%255;
  7232. }
  7233. h264_diff_dct_c(block, src, ref, 4);
  7234. //normalize
  7235. for(j=0; j<16; j++){
  7236. // printf("%d ", block[j]);
  7237. block[j]= block[j]*4;
  7238. if(j&1) block[j]= (block[j]*4 + 2)/5;
  7239. if(j&4) block[j]= (block[j]*4 + 2)/5;
  7240. }
  7241. // printf("\n");
  7242. s->dsp.h264_idct_add(ref, block, 4);
  7243. /* for(j=0; j<16; j++){
  7244. printf("%d ", ref[j]);
  7245. }
  7246. printf("\n");*/
  7247. for(j=0; j<16; j++){
  7248. int diff= FFABS(src[j] - ref[j]);
  7249. error+= diff*diff;
  7250. max_error= FFMAX(max_error, diff);
  7251. }
  7252. }
  7253. printf("error=%f max_error=%d\n", ((float)error)/COUNT/16, (int)max_error );
  7254. #if 0
  7255. printf("testing quantizer\n");
  7256. for(qp=0; qp<52; qp++){
  7257. for(i=0; i<16; i++)
  7258. src1_block[i]= src2_block[i]= random()%255;
  7259. }
  7260. #endif
  7261. printf("Testing NAL layer\n");
  7262. uint8_t bitstream[COUNT];
  7263. uint8_t nal[COUNT*2];
  7264. H264Context h;
  7265. memset(&h, 0, sizeof(H264Context));
  7266. for(i=0; i<COUNT; i++){
  7267. int zeros= i;
  7268. int nal_length;
  7269. int consumed;
  7270. int out_length;
  7271. uint8_t *out;
  7272. int j;
  7273. for(j=0; j<COUNT; j++){
  7274. bitstream[j]= (random() % 255) + 1;
  7275. }
  7276. for(j=0; j<zeros; j++){
  7277. int pos= random() % COUNT;
  7278. while(bitstream[pos] == 0){
  7279. pos++;
  7280. pos %= COUNT;
  7281. }
  7282. bitstream[pos]=0;
  7283. }
  7284. START_TIMER
  7285. nal_length= encode_nal(&h, nal, bitstream, COUNT, COUNT*2);
  7286. if(nal_length<0){
  7287. printf("encoding failed\n");
  7288. return -1;
  7289. }
  7290. out= decode_nal(&h, nal, &out_length, &consumed, nal_length);
  7291. STOP_TIMER("NAL")
  7292. if(out_length != COUNT){
  7293. printf("incorrect length %d %d\n", out_length, COUNT);
  7294. return -1;
  7295. }
  7296. if(consumed != nal_length){
  7297. printf("incorrect consumed length %d %d\n", nal_length, consumed);
  7298. return -1;
  7299. }
  7300. if(memcmp(bitstream, out, COUNT)){
  7301. printf("mismatch\n");
  7302. return -1;
  7303. }
  7304. }
  7305. printf("Testing RBSP\n");
  7306. return 0;
  7307. }
  7308. #endif
  7309. static int decode_end(AVCodecContext *avctx)
  7310. {
  7311. H264Context *h = avctx->priv_data;
  7312. MpegEncContext *s = &h->s;
  7313. av_freep(&h->rbsp_buffer[0]);
  7314. av_freep(&h->rbsp_buffer[1]);
  7315. free_tables(h); //FIXME cleanup init stuff perhaps
  7316. MPV_common_end(s);
  7317. // memset(h, 0, sizeof(H264Context));
  7318. return 0;
  7319. }
  7320. AVCodec h264_decoder = {
  7321. "h264",
  7322. CODEC_TYPE_VIDEO,
  7323. CODEC_ID_H264,
  7324. sizeof(H264Context),
  7325. decode_init,
  7326. NULL,
  7327. decode_end,
  7328. decode_frame,
  7329. /*CODEC_CAP_DRAW_HORIZ_BAND |*/ CODEC_CAP_DR1 | CODEC_CAP_TRUNCATED | CODEC_CAP_DELAY,
  7330. .flush= flush_dpb,
  7331. };
  7332. #include "svq3.c"