/media/libvpx/vp8/decoder/reconintra_mt.c

http://github.com/zpao/v8monkey · C · 937 lines · 765 code · 147 blank · 25 comment · 88 complexity · 3fcca6d2543e021554284991cccb45d9 MD5 · raw file 

    

  1. /*
    2. 

  2.  *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
    3. 

  3.  *
    4. 

  4.  *  Use of this source code is governed by a BSD-style license
    5. 

  5.  *  that can be found in the LICENSE file in the root of the source
    6. 

  6.  *  tree. An additional intellectual property rights grant can be found
    7. 

  7.  *  in the file PATENTS.  All contributing project authors may
    8. 

  8.  *  be found in the AUTHORS file in the root of the source tree.
    9. 

  9.  */
    10. 

  10. 

  11. 

  12. #include "vpx_ports/config.h"
    13. 

  13. #include "vp8/common/recon.h"
    14. 

  14. #include "vp8/common/reconintra.h"
    15. 

  15. #include "vpx_mem/vpx_mem.h"
    16. 

  16. #include "onyxd_int.h"
    17. 

  17. 

  18. /* For skip_recon_mb(), add vp8_build_intra_predictors_mby_s(MACROBLOCKD *x) and
    19. 

  19.  * vp8_build_intra_predictors_mbuv_s(MACROBLOCKD *x).
    20. 

  20.  */
    21. 

  21. 

  22. void vp8mt_build_intra_predictors_mby(VP8D_COMP *pbi, MACROBLOCKD *x, int mb_row, int mb_col)
    23. 

  23. {
    24. 

  24.     unsigned char *yabove_row;    /* = x->dst.y_buffer - x->dst.y_stride; */
    25. 

  25.     unsigned char *yleft_col;
    26. 

  26.     unsigned char yleft_buf[16];
    27. 

  27.     unsigned char ytop_left;      /* = yabove_row[-1]; */
    28. 

  28.     unsigned char *ypred_ptr = x->predictor;
    29. 

  29.     int r, c, i;
    30. 

  30. 

  31.     if (pbi->common.filter_level)
    32. 

  32.     {
    33. 

  33.         yabove_row = pbi->mt_yabove_row[mb_row] + mb_col*16 +32;
    34. 

  34.         yleft_col = pbi->mt_yleft_col[mb_row];
    35. 

  35.     } else
    36. 

  36.     {
    37. 

  37.         yabove_row = x->dst.y_buffer - x->dst.y_stride;
    38. 

  38. 

  39.         for (i = 0; i < 16; i++)
    40. 

  40.             yleft_buf[i] = x->dst.y_buffer [i* x->dst.y_stride -1];
    41. 

  41.         yleft_col = yleft_buf;
    42. 

  42.     }
    43. 

  43. 

  44.     ytop_left = yabove_row[-1];
    45. 

  45. 

  46.     /* for Y */
    47. 

  47.     switch (x->mode_info_context->mbmi.mode)
    48. 

  48.     {
    49. 

  49.     case DC_PRED:
    50. 

  50.     {
    51. 

  51.         int expected_dc;
    52. 

  52.         int i;
    53. 

  53.         int shift;
    54. 

  54.         int average = 0;
    55. 

  55. 

  56. 

  57.         if (x->up_available || x->left_available)
    58. 

  58.         {
    59. 

  59.             if (x->up_available)
    60. 

  60.             {
    61. 

  61.                 for (i = 0; i < 16; i++)
    62. 

  62.                 {
    63. 

  63.                     average += yabove_row[i];
    64. 

  64.                 }
    65. 

  65.             }
    66. 

  66. 

  67.             if (x->left_available)
    68. 

  68.             {
    69. 

  69. 

  70.                 for (i = 0; i < 16; i++)
    71. 

  71.                 {
    72. 

  72.                     average += yleft_col[i];
    73. 

  73.                 }
    74. 

  74. 

  75.             }
    76. 

  76. 

  77. 

  78. 

  79.             shift = 3 + x->up_available + x->left_available;
    80. 

  80.             expected_dc = (average + (1 << (shift - 1))) >> shift;
    81. 

  81.         }
    82. 

  82.         else
    83. 

  83.         {
    84. 

  84.             expected_dc = 128;
    85. 

  85.         }
    86. 

  86. 

  87.         vpx_memset(ypred_ptr, expected_dc, 256);
    88. 

  88.     }
    89. 

  89.     break;
    90. 

  90.     case V_PRED:
    91. 

  91.     {
    92. 

  92. 

  93.         for (r = 0; r < 16; r++)
    94. 

  94.         {
    95. 

  95. 

  96.             ((int *)ypred_ptr)[0] = ((int *)yabove_row)[0];
    97. 

  97.             ((int *)ypred_ptr)[1] = ((int *)yabove_row)[1];
    98. 

  98.             ((int *)ypred_ptr)[2] = ((int *)yabove_row)[2];
    99. 

  99.             ((int *)ypred_ptr)[3] = ((int *)yabove_row)[3];
    100. 

  100.             ypred_ptr += 16;
    101. 

  101.         }
    102. 

  102.     }
    103. 

  103.     break;
    104. 

  104.     case H_PRED:
    105. 

  105.     {
    106. 

  106. 

  107.         for (r = 0; r < 16; r++)
    108. 

  108.         {
    109. 

  109. 

  110.             vpx_memset(ypred_ptr, yleft_col[r], 16);
    111. 

  111.             ypred_ptr += 16;
    112. 

  112.         }
    113. 

  113. 

  114.     }
    115. 

  115.     break;
    116. 

  116.     case TM_PRED:
    117. 

  117.     {
    118. 

  118. 

  119.         for (r = 0; r < 16; r++)
    120. 

  120.         {
    121. 

  121.             for (c = 0; c < 16; c++)
    122. 

  122.             {
    123. 

  123.                 int pred =  yleft_col[r] + yabove_row[ c] - ytop_left;
    124. 

  124. 

  125.                 if (pred < 0)
    126. 

  126.                     pred = 0;
    127. 

  127. 

  128.                 if (pred > 255)
    129. 

  129.                     pred = 255;
    130. 

  130. 

  131.                 ypred_ptr[c] = pred;
    132. 

  132.             }
    133. 

  133. 

  134.             ypred_ptr += 16;
    135. 

  135.         }
    136. 

  136. 

  137.     }
    138. 

  138.     break;
    139. 

  139.     case B_PRED:
    140. 

  140.     case NEARESTMV:
    141. 

  141.     case NEARMV:
    142. 

  142.     case ZEROMV:
    143. 

  143.     case NEWMV:
    144. 

  144.     case SPLITMV:
    145. 

  145.     case MB_MODE_COUNT:
    146. 

  146.         break;
    147. 

  147.     }
    148. 

  148. }
    149. 

  149. 

  150. void vp8mt_build_intra_predictors_mby_s(VP8D_COMP *pbi, MACROBLOCKD *x, int mb_row, int mb_col)
    151. 

  151. {
    152. 

  152.     unsigned char *yabove_row;    /* = x->dst.y_buffer - x->dst.y_stride; */
    153. 

  153.     unsigned char *yleft_col;
    154. 

  154.     unsigned char yleft_buf[16];
    155. 

  155.     unsigned char ytop_left;      /* = yabove_row[-1]; */
    156. 

  156.     unsigned char *ypred_ptr = x->predictor;
    157. 

  157.     int r, c, i;
    158. 

  158. 

  159.     int y_stride = x->dst.y_stride;
    160. 

  160.     ypred_ptr = x->dst.y_buffer; /*x->predictor;*/
    161. 

  161. 

  162.     if (pbi->common.filter_level)
    163. 

  163.     {
    164. 

  164.         yabove_row = pbi->mt_yabove_row[mb_row] + mb_col*16 +32;
    165. 

  165.         yleft_col = pbi->mt_yleft_col[mb_row];
    166. 

  166.     } else
    167. 

  167.     {
    168. 

  168.         yabove_row = x->dst.y_buffer - x->dst.y_stride;
    169. 

  169. 

  170.         for (i = 0; i < 16; i++)
    171. 

  171.             yleft_buf[i] = x->dst.y_buffer [i* x->dst.y_stride -1];
    172. 

  172.         yleft_col = yleft_buf;
    173. 

  173.     }
    174. 

  174. 

  175.     ytop_left = yabove_row[-1];
    176. 

  176. 

  177.     /* for Y */
    178. 

  178.     switch (x->mode_info_context->mbmi.mode)
    179. 

  179.     {
    180. 

  180.     case DC_PRED:
    181. 

  181.     {
    182. 

  182.         int expected_dc;
    183. 

  183.         int i;
    184. 

  184.         int shift;
    185. 

  185.         int average = 0;
    186. 

  186. 

  187. 

  188.         if (x->up_available || x->left_available)
    189. 

  189.         {
    190. 

  190.             if (x->up_available)
    191. 

  191.             {
    192. 

  192.                 for (i = 0; i < 16; i++)
    193. 

  193.                 {
    194. 

  194.                     average += yabove_row[i];
    195. 

  195.                 }
    196. 

  196.             }
    197. 

  197. 

  198.             if (x->left_available)
    199. 

  199.             {
    200. 

  200. 

  201.                 for (i = 0; i < 16; i++)
    202. 

  202.                 {
    203. 

  203.                     average += yleft_col[i];
    204. 

  204.                 }
    205. 

  205. 

  206.             }
    207. 

  207. 

  208. 

  209. 

  210.             shift = 3 + x->up_available + x->left_available;
    211. 

  211.             expected_dc = (average + (1 << (shift - 1))) >> shift;
    212. 

  212.         }
    213. 

  213.         else
    214. 

  214.         {
    215. 

  215.             expected_dc = 128;
    216. 

  216.         }
    217. 

  217. 

  218.         /*vpx_memset(ypred_ptr, expected_dc, 256);*/
    219. 

  219.         for (r = 0; r < 16; r++)
    220. 

  220.         {
    221. 

  221.             vpx_memset(ypred_ptr, expected_dc, 16);
    222. 

  222.             ypred_ptr += y_stride; /*16;*/
    223. 

  223.         }
    224. 

  224.     }
    225. 

  225.     break;
    226. 

  226.     case V_PRED:
    227. 

  227.     {
    228. 

  228. 

  229.         for (r = 0; r < 16; r++)
    230. 

  230.         {
    231. 

  231. 

  232.             ((int *)ypred_ptr)[0] = ((int *)yabove_row)[0];
    233. 

  233.             ((int *)ypred_ptr)[1] = ((int *)yabove_row)[1];
    234. 

  234.             ((int *)ypred_ptr)[2] = ((int *)yabove_row)[2];
    235. 

  235.             ((int *)ypred_ptr)[3] = ((int *)yabove_row)[3];
    236. 

  236.             ypred_ptr += y_stride; /*16;*/
    237. 

  237.         }
    238. 

  238.     }
    239. 

  239.     break;
    240. 

  240.     case H_PRED:
    241. 

  241.     {
    242. 

  242. 

  243.         for (r = 0; r < 16; r++)
    244. 

  244.         {
    245. 

  245. 

  246.             vpx_memset(ypred_ptr, yleft_col[r], 16);
    247. 

  247.             ypred_ptr += y_stride;  /*16;*/
    248. 

  248.         }
    249. 

  249. 

  250.     }
    251. 

  251.     break;
    252. 

  252.     case TM_PRED:
    253. 

  253.     {
    254. 

  254. 

  255.         for (r = 0; r < 16; r++)
    256. 

  256.         {
    257. 

  257.             for (c = 0; c < 16; c++)
    258. 

  258.             {
    259. 

  259.                 int pred =  yleft_col[r] + yabove_row[ c] - ytop_left;
    260. 

  260. 

  261.                 if (pred < 0)
    262. 

  262.                     pred = 0;
    263. 

  263. 

  264.                 if (pred > 255)
    265. 

  265.                     pred = 255;
    266. 

  266. 

  267.                 ypred_ptr[c] = pred;
    268. 

  268.             }
    269. 

  269. 

  270.             ypred_ptr += y_stride;  /*16;*/
    271. 

  271.         }
    272. 

  272. 

  273.     }
    274. 

  274.     break;
    275. 

  275.     case B_PRED:
    276. 

  276.     case NEARESTMV:
    277. 

  277.     case NEARMV:
    278. 

  278.     case ZEROMV:
    279. 

  279.     case NEWMV:
    280. 

  280.     case SPLITMV:
    281. 

  281.     case MB_MODE_COUNT:
    282. 

  282.         break;
    283. 

  283.     }
    284. 

  284. }
    285. 

  285. 

  286. void vp8mt_build_intra_predictors_mbuv(VP8D_COMP *pbi, MACROBLOCKD *x, int mb_row, int mb_col)
    287. 

  287. {
    288. 

  288.     unsigned char *uabove_row;   /* = x->dst.u_buffer - x->dst.uv_stride; */
    289. 

  289.     unsigned char *uleft_col;    /*[16];*/
    290. 

  290.     unsigned char uleft_buf[8];
    291. 

  291.     unsigned char utop_left;     /* = uabove_row[-1]; */
    292. 

  292.     unsigned char *vabove_row;   /* = x->dst.v_buffer - x->dst.uv_stride; */
    293. 

  293.     unsigned char *vleft_col;    /*[20];*/
    294. 

  294.     unsigned char vleft_buf[8];
    295. 

  295.     unsigned char vtop_left;     /* = vabove_row[-1]; */
    296. 

  296.     unsigned char *upred_ptr = &x->predictor[256];
    297. 

  297.     unsigned char *vpred_ptr = &x->predictor[320];
    298. 

  298.     int i, j;
    299. 

  299. 

  300.     if (pbi->common.filter_level)
    301. 

  301.     {
    302. 

  302.         uabove_row = pbi->mt_uabove_row[mb_row] + mb_col*8 +16;
    303. 

  303.         vabove_row = pbi->mt_vabove_row[mb_row] + mb_col*8 +16;
    304. 

  304.         uleft_col = pbi->mt_uleft_col[mb_row];
    305. 

  305.         vleft_col = pbi->mt_vleft_col[mb_row];
    306. 

  306.     } else
    307. 

  307.     {
    308. 

  308.         uabove_row = x->dst.u_buffer - x->dst.uv_stride;
    309. 

  309.         vabove_row = x->dst.v_buffer - x->dst.uv_stride;
    310. 

  310. 

  311.         for (i = 0; i < 8; i++)
    312. 

  312.         {
    313. 

  313.             uleft_buf[i] = x->dst.u_buffer [i* x->dst.uv_stride -1];
    314. 

  314.             vleft_buf[i] = x->dst.v_buffer [i* x->dst.uv_stride -1];
    315. 

  315.         }
    316. 

  316.         uleft_col = uleft_buf;
    317. 

  317.         vleft_col = vleft_buf;
    318. 

  318.     }
    319. 

  319.     utop_left = uabove_row[-1];
    320. 

  320.     vtop_left = vabove_row[-1];
    321. 

  321. 

  322.     switch (x->mode_info_context->mbmi.uv_mode)
    323. 

  323.     {
    324. 

  324.     case DC_PRED:
    325. 

  325.     {
    326. 

  326.         int expected_udc;
    327. 

  327.         int expected_vdc;
    328. 

  328.         int i;
    329. 

  329.         int shift;
    330. 

  330.         int Uaverage = 0;
    331. 

  331.         int Vaverage = 0;
    332. 

  332. 

  333.         if (x->up_available)
    334. 

  334.         {
    335. 

  335.             for (i = 0; i < 8; i++)
    336. 

  336.             {
    337. 

  337.                 Uaverage += uabove_row[i];
    338. 

  338.                 Vaverage += vabove_row[i];
    339. 

  339.             }
    340. 

  340.         }
    341. 

  341. 

  342.         if (x->left_available)
    343. 

  343.         {
    344. 

  344.             for (i = 0; i < 8; i++)
    345. 

  345.             {
    346. 

  346.                 Uaverage += uleft_col[i];
    347. 

  347.                 Vaverage += vleft_col[i];
    348. 

  348.             }
    349. 

  349.         }
    350. 

  350. 

  351.         if (!x->up_available && !x->left_available)
    352. 

  352.         {
    353. 

  353.             expected_udc = 128;
    354. 

  354.             expected_vdc = 128;
    355. 

  355.         }
    356. 

  356.         else
    357. 

  357.         {
    358. 

  358.             shift = 2 + x->up_available + x->left_available;
    359. 

  359.             expected_udc = (Uaverage + (1 << (shift - 1))) >> shift;
    360. 

  360.             expected_vdc = (Vaverage + (1 << (shift - 1))) >> shift;
    361. 

  361.         }
    362. 

  362. 

  363. 

  364.         vpx_memset(upred_ptr, expected_udc, 64);
    365. 

  365.         vpx_memset(vpred_ptr, expected_vdc, 64);
    366. 

  366. 

  367. 

  368.     }
    369. 

  369.     break;
    370. 

  370.     case V_PRED:
    371. 

  371.     {
    372. 

  372.         int i;
    373. 

  373. 

  374.         for (i = 0; i < 8; i++)
    375. 

  375.         {
    376. 

  376.             vpx_memcpy(upred_ptr, uabove_row, 8);
    377. 

  377.             vpx_memcpy(vpred_ptr, vabove_row, 8);
    378. 

  378.             upred_ptr += 8;
    379. 

  379.             vpred_ptr += 8;
    380. 

  380.         }
    381. 

  381. 

  382.     }
    383. 

  383.     break;
    384. 

  384.     case H_PRED:
    385. 

  385.     {
    386. 

  386.         int i;
    387. 

  387. 

  388.         for (i = 0; i < 8; i++)
    389. 

  389.         {
    390. 

  390.             vpx_memset(upred_ptr, uleft_col[i], 8);
    391. 

  391.             vpx_memset(vpred_ptr, vleft_col[i], 8);
    392. 

  392.             upred_ptr += 8;
    393. 

  393.             vpred_ptr += 8;
    394. 

  394.         }
    395. 

  395.     }
    396. 

  396. 

  397.     break;
    398. 

  398.     case TM_PRED:
    399. 

  399.     {
    400. 

  400.         int i;
    401. 

  401. 

  402.         for (i = 0; i < 8; i++)
    403. 

  403.         {
    404. 

  404.             for (j = 0; j < 8; j++)
    405. 

  405.             {
    406. 

  406.                 int predu = uleft_col[i] + uabove_row[j] - utop_left;
    407. 

  407.                 int predv = vleft_col[i] + vabove_row[j] - vtop_left;
    408. 

  408. 

  409.                 if (predu < 0)
    410. 

  410.                     predu = 0;
    411. 

  411. 

  412.                 if (predu > 255)
    413. 

  413.                     predu = 255;
    414. 

  414. 

  415.                 if (predv < 0)
    416. 

  416.                     predv = 0;
    417. 

  417. 

  418.                 if (predv > 255)
    419. 

  419.                     predv = 255;
    420. 

  420. 

  421.                 upred_ptr[j] = predu;
    422. 

  422.                 vpred_ptr[j] = predv;
    423. 

  423.             }
    424. 

  424. 

  425.             upred_ptr += 8;
    426. 

  426.             vpred_ptr += 8;
    427. 

  427.         }
    428. 

  428. 

  429.     }
    430. 

  430.     break;
    431. 

  431.     case B_PRED:
    432. 

  432.     case NEARESTMV:
    433. 

  433.     case NEARMV:
    434. 

  434.     case ZEROMV:
    435. 

  435.     case NEWMV:
    436. 

  436.     case SPLITMV:
    437. 

  437.     case MB_MODE_COUNT:
    438. 

  438.         break;
    439. 

  439.     }
    440. 

  440. }
    441. 

  441. 

  442. void vp8mt_build_intra_predictors_mbuv_s(VP8D_COMP *pbi, MACROBLOCKD *x, int mb_row, int mb_col)
    443. 

  443. {
    444. 

  444.     unsigned char *uabove_row;  /* = x->dst.u_buffer - x->dst.uv_stride; */
    445. 

  445.     unsigned char *uleft_col;   /*[16];*/
    446. 

  446.     unsigned char uleft_buf[8];
    447. 

  447.     unsigned char utop_left;    /* = uabove_row[-1]; */
    448. 

  448.     unsigned char *vabove_row;  /* = x->dst.v_buffer - x->dst.uv_stride; */
    449. 

  449.     unsigned char *vleft_col;   /*[20];*/
    450. 

  450.     unsigned char vleft_buf[8];
    451. 

  451.     unsigned char vtop_left;    /* = vabove_row[-1]; */
    452. 

  452.     unsigned char *upred_ptr = x->dst.u_buffer; /*&x->predictor[256];*/
    453. 

  453.     unsigned char *vpred_ptr = x->dst.v_buffer; /*&x->predictor[320];*/
    454. 

  454.     int uv_stride = x->dst.uv_stride;
    455. 

  455.     int i, j;
    456. 

  456. 

  457.     if (pbi->common.filter_level)
    458. 

  458.     {
    459. 

  459.         uabove_row = pbi->mt_uabove_row[mb_row] + mb_col*8 +16;
    460. 

  460.         vabove_row = pbi->mt_vabove_row[mb_row] + mb_col*8 +16;
    461. 

  461.         uleft_col = pbi->mt_uleft_col[mb_row];
    462. 

  462.         vleft_col = pbi->mt_vleft_col[mb_row];
    463. 

  463.     } else
    464. 

  464.     {
    465. 

  465.         uabove_row = x->dst.u_buffer - x->dst.uv_stride;
    466. 

  466.         vabove_row = x->dst.v_buffer - x->dst.uv_stride;
    467. 

  467. 

  468.         for (i = 0; i < 8; i++)
    469. 

  469.         {
    470. 

  470.             uleft_buf[i] = x->dst.u_buffer [i* x->dst.uv_stride -1];
    471. 

  471.             vleft_buf[i] = x->dst.v_buffer [i* x->dst.uv_stride -1];
    472. 

  472.         }
    473. 

  473.         uleft_col = uleft_buf;
    474. 

  474.         vleft_col = vleft_buf;
    475. 

  475.     }
    476. 

  476.     utop_left = uabove_row[-1];
    477. 

  477.     vtop_left = vabove_row[-1];
    478. 

  478. 

  479.     switch (x->mode_info_context->mbmi.uv_mode)
    480. 

  480.     {
    481. 

  481.     case DC_PRED:
    482. 

  482.     {
    483. 

  483.         int expected_udc;
    484. 

  484.         int expected_vdc;
    485. 

  485.         int i;
    486. 

  486.         int shift;
    487. 

  487.         int Uaverage = 0;
    488. 

  488.         int Vaverage = 0;
    489. 

  489. 

  490.         if (x->up_available)
    491. 

  491.         {
    492. 

  492.             for (i = 0; i < 8; i++)
    493. 

  493.             {
    494. 

  494.                 Uaverage += uabove_row[i];
    495. 

  495.                 Vaverage += vabove_row[i];
    496. 

  496.             }
    497. 

  497.         }
    498. 

  498. 

  499.         if (x->left_available)
    500. 

  500.         {
    501. 

  501.             for (i = 0; i < 8; i++)
    502. 

  502.             {
    503. 

  503.                 Uaverage += uleft_col[i];
    504. 

  504.                 Vaverage += vleft_col[i];
    505. 

  505.             }
    506. 

  506.         }
    507. 

  507. 

  508.         if (!x->up_available && !x->left_available)
    509. 

  509.         {
    510. 

  510.             expected_udc = 128;
    511. 

  511.             expected_vdc = 128;
    512. 

  512.         }
    513. 

  513.         else
    514. 

  514.         {
    515. 

  515.             shift = 2 + x->up_available + x->left_available;
    516. 

  516.             expected_udc = (Uaverage + (1 << (shift - 1))) >> shift;
    517. 

  517.             expected_vdc = (Vaverage + (1 << (shift - 1))) >> shift;
    518. 

  518.         }
    519. 

  519. 

  520. 

  521.         /*vpx_memset(upred_ptr,expected_udc,64);
    522. 

  522.         vpx_memset(vpred_ptr,expected_vdc,64);*/
    523. 

  523.         for (i = 0; i < 8; i++)
    524. 

  524.         {
    525. 

  525.             vpx_memset(upred_ptr, expected_udc, 8);
    526. 

  526.             vpx_memset(vpred_ptr, expected_vdc, 8);
    527. 

  527.             upred_ptr += uv_stride; /*8;*/
    528. 

  528.             vpred_ptr += uv_stride; /*8;*/
    529. 

  529.         }
    530. 

  530.     }
    531. 

  531.     break;
    532. 

  532.     case V_PRED:
    533. 

  533.     {
    534. 

  534.         int i;
    535. 

  535. 

  536.         for (i = 0; i < 8; i++)
    537. 

  537.         {
    538. 

  538.             vpx_memcpy(upred_ptr, uabove_row, 8);
    539. 

  539.             vpx_memcpy(vpred_ptr, vabove_row, 8);
    540. 

  540.             upred_ptr += uv_stride; /*8;*/
    541. 

  541.             vpred_ptr += uv_stride; /*8;*/
    542. 

  542.         }
    543. 

  543. 

  544.     }
    545. 

  545.     break;
    546. 

  546.     case H_PRED:
    547. 

  547.     {
    548. 

  548.         int i;
    549. 

  549. 

  550.         for (i = 0; i < 8; i++)
    551. 

  551.         {
    552. 

  552.             vpx_memset(upred_ptr, uleft_col[i], 8);
    553. 

  553.             vpx_memset(vpred_ptr, vleft_col[i], 8);
    554. 

  554.             upred_ptr += uv_stride; /*8;*/
    555. 

  555.             vpred_ptr += uv_stride; /*8;*/
    556. 

  556.         }
    557. 

  557.     }
    558. 

  558. 

  559.     break;
    560. 

  560.     case TM_PRED:
    561. 

  561.     {
    562. 

  562.         int i;
    563. 

  563. 

  564.         for (i = 0; i < 8; i++)
    565. 

  565.         {
    566. 

  566.             for (j = 0; j < 8; j++)
    567. 

  567.             {
    568. 

  568.                 int predu = uleft_col[i] + uabove_row[j] - utop_left;
    569. 

  569.                 int predv = vleft_col[i] + vabove_row[j] - vtop_left;
    570. 

  570. 

  571.                 if (predu < 0)
    572. 

  572.                     predu = 0;
    573. 

  573. 

  574.                 if (predu > 255)
    575. 

  575.                     predu = 255;
    576. 

  576. 

  577.                 if (predv < 0)
    578. 

  578.                     predv = 0;
    579. 

  579. 

  580.                 if (predv > 255)
    581. 

  581.                     predv = 255;
    582. 

  582. 

  583.                 upred_ptr[j] = predu;
    584. 

  584.                 vpred_ptr[j] = predv;
    585. 

  585.             }
    586. 

  586. 

  587.             upred_ptr += uv_stride; /*8;*/
    588. 

  588.             vpred_ptr += uv_stride; /*8;*/
    589. 

  589.         }
    590. 

  590. 

  591.     }
    592. 

  592.     break;
    593. 

  593.     case B_PRED:
    594. 

  594.     case NEARESTMV:
    595. 

  595.     case NEARMV:
    596. 

  596.     case ZEROMV:
    597. 

  597.     case NEWMV:
    598. 

  598.     case SPLITMV:
    599. 

  599.     case MB_MODE_COUNT:
    600. 

  600.         break;
    601. 

  601.     }
    602. 

  602. }
    603. 

  603. 

  604. 

  605. void vp8mt_predict_intra4x4(VP8D_COMP *pbi,
    606. 

  606.                           MACROBLOCKD *xd,
    607. 

  607.                           int b_mode,
    608. 

  608.                           unsigned char *predictor,
    609. 

  609.                           int mb_row,
    610. 

  610.                           int mb_col,
    611. 

  611.                           int num)
    612. 

  612. {
    613. 

  613.     int i, r, c;
    614. 

  614. 

  615.     unsigned char *Above;   /* = *(x->base_dst) + x->dst - x->dst_stride; */
    616. 

  616.     unsigned char Left[4];
    617. 

  617.     unsigned char top_left; /* = Above[-1]; */
    618. 

  618. 

  619.     BLOCKD *x = &xd->block[num];
    620. 

  620. 

  621.     /*Caution: For some b_mode, it needs 8 pixels (4 above + 4 above-right).*/
    622. 

  622.     if (num < 4 && pbi->common.filter_level)
    623. 

  623.         Above = pbi->mt_yabove_row[mb_row] + mb_col*16 + num*4 + 32;
    624. 

  624.     else
    625. 

  625.         Above = *(x->base_dst) + x->dst - x->dst_stride;
    626. 

  626. 

  627.     if (num%4==0 && pbi->common.filter_level)
    628. 

  628.     {
    629. 

  629.         for (i=0; i<4; i++)
    630. 

  630.             Left[i] = pbi->mt_yleft_col[mb_row][num + i];
    631. 

  631.     }else
    632. 

  632.     {
    633. 

  633.         Left[0] = (*(x->base_dst))[x->dst - 1];
    634. 

  634.         Left[1] = (*(x->base_dst))[x->dst - 1 + x->dst_stride];
    635. 

  635.         Left[2] = (*(x->base_dst))[x->dst - 1 + 2 * x->dst_stride];
    636. 

  636.         Left[3] = (*(x->base_dst))[x->dst - 1 + 3 * x->dst_stride];
    637. 

  637.     }
    638. 

  638. 

  639.     if ((num==4 || num==8 || num==12) && pbi->common.filter_level)
    640. 

  640.         top_left = pbi->mt_yleft_col[mb_row][num-1];
    641. 

  641.     else
    642. 

  642.         top_left = Above[-1];
    643. 

  643. 

  644.      switch (b_mode)
    645. 

  645.     {
    646. 

  646.     case B_DC_PRED:
    647. 

  647.     {
    648. 

  648.         int expected_dc = 0;
    649. 

  649. 

  650.         for (i = 0; i < 4; i++)
    651. 

  651.         {
    652. 

  652.             expected_dc += Above[i];
    653. 

  653.             expected_dc += Left[i];
    654. 

  654.         }
    655. 

  655. 

  656.         expected_dc = (expected_dc + 4) >> 3;
    657. 

  657. 

  658.         for (r = 0; r < 4; r++)
    659. 

  659.         {
    660. 

  660.             for (c = 0; c < 4; c++)
    661. 

  661.             {
    662. 

  662.                 predictor[c] = expected_dc;
    663. 

  663.             }
    664. 

  664. 

  665.             predictor += 16;
    666. 

  666.         }
    667. 

  667.     }
    668. 

  668.     break;
    669. 

  669.     case B_TM_PRED:
    670. 

  670.     {
    671. 

  671.         /* prediction similar to true_motion prediction */
    672. 

  672.         for (r = 0; r < 4; r++)
    673. 

  673.         {
    674. 

  674.             for (c = 0; c < 4; c++)
    675. 

  675.             {
    676. 

  676.                 int pred = Above[c] - top_left + Left[r];
    677. 

  677. 

  678.                 if (pred < 0)
    679. 

  679.                     pred = 0;
    680. 

  680. 

  681.                 if (pred > 255)
    682. 

  682.                     pred = 255;
    683. 

  683. 

  684.                 predictor[c] = pred;
    685. 

  685.             }
    686. 

  686. 

  687.             predictor += 16;
    688. 

  688.         }
    689. 

  689.     }
    690. 

  690.     break;
    691. 

  691. 

  692.     case B_VE_PRED:
    693. 

  693.     {
    694. 

  694. 

  695.         unsigned int ap[4];
    696. 

  696.         ap[0] = (top_left  + 2 * Above[0] + Above[1] + 2) >> 2;
    697. 

  697.         ap[1] = (Above[0] + 2 * Above[1] + Above[2] + 2) >> 2;
    698. 

  698.         ap[2] = (Above[1] + 2 * Above[2] + Above[3] + 2) >> 2;
    699. 

  699.         ap[3] = (Above[2] + 2 * Above[3] + Above[4] + 2) >> 2;
    700. 

  700. 

  701.         for (r = 0; r < 4; r++)
    702. 

  702.         {
    703. 

  703.             for (c = 0; c < 4; c++)
    704. 

  704.             {
    705. 

  705. 

  706.                 predictor[c] = ap[c];
    707. 

  707.             }
    708. 

  708. 

  709.             predictor += 16;
    710. 

  710.         }
    711. 

  711. 

  712.     }
    713. 

  713.     break;
    714. 

  714. 

  715. 

  716.     case B_HE_PRED:
    717. 

  717.     {
    718. 

  718. 

  719.         unsigned int lp[4];
    720. 

  720.         lp[0] = (top_left + 2 * Left[0] + Left[1] + 2) >> 2;
    721. 

  721.         lp[1] = (Left[0] + 2 * Left[1] + Left[2] + 2) >> 2;
    722. 

  722.         lp[2] = (Left[1] + 2 * Left[2] + Left[3] + 2) >> 2;
    723. 

  723.         lp[3] = (Left[2] + 2 * Left[3] + Left[3] + 2) >> 2;
    724. 

  724. 

  725.         for (r = 0; r < 4; r++)
    726. 

  726.         {
    727. 

  727.             for (c = 0; c < 4; c++)
    728. 

  728.             {
    729. 

  729.                 predictor[c] = lp[r];
    730. 

  730.             }
    731. 

  731. 

  732.             predictor += 16;
    733. 

  733.         }
    734. 

  734.     }
    735. 

  735.     break;
    736. 

  736.     case B_LD_PRED:
    737. 

  737.     {
    738. 

  738.         unsigned char *ptr = Above;
    739. 

  739.         predictor[0 * 16 + 0] = (ptr[0] + ptr[1] * 2 + ptr[2] + 2) >> 2;
    740. 

  740.         predictor[0 * 16 + 1] =
    741. 

  741.             predictor[1 * 16 + 0] = (ptr[1] + ptr[2] * 2 + ptr[3] + 2) >> 2;
    742. 

  742.         predictor[0 * 16 + 2] =
    743. 

  743.             predictor[1 * 16 + 1] =
    744. 

  744.                 predictor[2 * 16 + 0] = (ptr[2] + ptr[3] * 2 + ptr[4] + 2) >> 2;
    745. 

  745.         predictor[0 * 16 + 3] =
    746. 

  746.             predictor[1 * 16 + 2] =
    747. 

  747.                 predictor[2 * 16 + 1] =
    748. 

  748.                     predictor[3 * 16 + 0] = (ptr[3] + ptr[4] * 2 + ptr[5] + 2) >> 2;
    749. 

  749.         predictor[1 * 16 + 3] =
    750. 

  750.             predictor[2 * 16 + 2] =
    751. 

  751.                 predictor[3 * 16 + 1] = (ptr[4] + ptr[5] * 2 + ptr[6] + 2) >> 2;
    752. 

  752.         predictor[2 * 16 + 3] =
    753. 

  753.             predictor[3 * 16 + 2] = (ptr[5] + ptr[6] * 2 + ptr[7] + 2) >> 2;
    754. 

  754.         predictor[3 * 16 + 3] = (ptr[6] + ptr[7] * 2 + ptr[7] + 2) >> 2;
    755. 

  755. 

  756.     }
    757. 

  757.     break;
    758. 

  758.     case B_RD_PRED:
    759. 

  759.     {
    760. 

  760. 

  761.         unsigned char pp[9];
    762. 

  762. 

  763.         pp[0] = Left[3];
    764. 

  764.         pp[1] = Left[2];
    765. 

  765.         pp[2] = Left[1];
    766. 

  766.         pp[3] = Left[0];
    767. 

  767.         pp[4] = top_left;
    768. 

  768.         pp[5] = Above[0];
    769. 

  769.         pp[6] = Above[1];
    770. 

  770.         pp[7] = Above[2];
    771. 

  771.         pp[8] = Above[3];
    772. 

  772. 

  773.         predictor[3 * 16 + 0] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2;
    774. 

  774.         predictor[3 * 16 + 1] =
    775. 

  775.             predictor[2 * 16 + 0] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2;
    776. 

  776.         predictor[3 * 16 + 2] =
    777. 

  777.             predictor[2 * 16 + 1] =
    778. 

  778.                 predictor[1 * 16 + 0] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2;
    779. 

  779.         predictor[3 * 16 + 3] =
    780. 

  780.             predictor[2 * 16 + 2] =
    781. 

  781.                 predictor[1 * 16 + 1] =
    782. 

  782.                     predictor[0 * 16 + 0] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2;
    783. 

  783.         predictor[2 * 16 + 3] =
    784. 

  784.             predictor[1 * 16 + 2] =
    785. 

  785.                 predictor[0 * 16 + 1] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2;
    786. 

  786.         predictor[1 * 16 + 3] =
    787. 

  787.             predictor[0 * 16 + 2] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2;
    788. 

  788.         predictor[0 * 16 + 3] = (pp[6] + pp[7] * 2 + pp[8] + 2) >> 2;
    789. 

  789. 

  790.     }
    791. 

  791.     break;
    792. 

  792.     case B_VR_PRED:
    793. 

  793.     {
    794. 

  794. 

  795.         unsigned char pp[9];
    796. 

  796. 

  797.         pp[0] = Left[3];
    798. 

  798.         pp[1] = Left[2];
    799. 

  799.         pp[2] = Left[1];
    800. 

  800.         pp[3] = Left[0];
    801. 

  801.         pp[4] = top_left;
    802. 

  802.         pp[5] = Above[0];
    803. 

  803.         pp[6] = Above[1];
    804. 

  804.         pp[7] = Above[2];
    805. 

  805.         pp[8] = Above[3];
    806. 

  806. 

  807. 

  808.         predictor[3 * 16 + 0] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2;
    809. 

  809.         predictor[2 * 16 + 0] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2;
    810. 

  810.         predictor[3 * 16 + 1] =
    811. 

  811.             predictor[1 * 16 + 0] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2;
    812. 

  812.         predictor[2 * 16 + 1] =
    813. 

  813.             predictor[0 * 16 + 0] = (pp[4] + pp[5] + 1) >> 1;
    814. 

  814.         predictor[3 * 16 + 2] =
    815. 

  815.             predictor[1 * 16 + 1] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2;
    816. 

  816.         predictor[2 * 16 + 2] =
    817. 

  817.             predictor[0 * 16 + 1] = (pp[5] + pp[6] + 1) >> 1;
    818. 

  818.         predictor[3 * 16 + 3] =
    819. 

  819.             predictor[1 * 16 + 2] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2;
    820. 

  820.         predictor[2 * 16 + 3] =
    821. 

  821.             predictor[0 * 16 + 2] = (pp[6] + pp[7] + 1) >> 1;
    822. 

  822.         predictor[1 * 16 + 3] = (pp[6] + pp[7] * 2 + pp[8] + 2) >> 2;
    823. 

  823.         predictor[0 * 16 + 3] = (pp[7] + pp[8] + 1) >> 1;
    824. 

  824. 

  825.     }
    826. 

  826.     break;
    827. 

  827.     case B_VL_PRED:
    828. 

  828.     {
    829. 

  829. 

  830.         unsigned char *pp = Above;
    831. 

  831. 

  832.         predictor[0 * 16 + 0] = (pp[0] + pp[1] + 1) >> 1;
    833. 

  833.         predictor[1 * 16 + 0] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2;
    834. 

  834.         predictor[2 * 16 + 0] =
    835. 

  835.             predictor[0 * 16 + 1] = (pp[1] + pp[2] + 1) >> 1;
    836. 

  836.         predictor[1 * 16 + 1] =
    837. 

  837.             predictor[3 * 16 + 0] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2;
    838. 

  838.         predictor[2 * 16 + 1] =
    839. 

  839.             predictor[0 * 16 + 2] = (pp[2] + pp[3] + 1) >> 1;
    840. 

  840.         predictor[3 * 16 + 1] =
    841. 

  841.             predictor[1 * 16 + 2] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2;
    842. 

  842.         predictor[0 * 16 + 3] =
    843. 

  843.             predictor[2 * 16 + 2] = (pp[3] + pp[4] + 1) >> 1;
    844. 

  844.         predictor[1 * 16 + 3] =
    845. 

  845.             predictor[3 * 16 + 2] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2;
    846. 

  846.         predictor[2 * 16 + 3] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2;
    847. 

  847.         predictor[3 * 16 + 3] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2;
    848. 

  848.     }
    849. 

  849.     break;
    850. 

  850. 

  851.     case B_HD_PRED:
    852. 

  852.     {
    853. 

  853.         unsigned char pp[9];
    854. 

  854.         pp[0] = Left[3];
    855. 

  855.         pp[1] = Left[2];
    856. 

  856.         pp[2] = Left[1];
    857. 

  857.         pp[3] = Left[0];
    858. 

  858.         pp[4] = top_left;
    859. 

  859.         pp[5] = Above[0];
    860. 

  860.         pp[6] = Above[1];
    861. 

  861.         pp[7] = Above[2];
    862. 

  862.         pp[8] = Above[3];
    863. 

  863. 

  864. 

  865.         predictor[3 * 16 + 0] = (pp[0] + pp[1] + 1) >> 1;
    866. 

  866.         predictor[3 * 16 + 1] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2;
    867. 

  867.         predictor[2 * 16 + 0] =
    868. 

  868.             predictor[3 * 16 + 2] = (pp[1] + pp[2] + 1) >> 1;
    869. 

  869.         predictor[2 * 16 + 1] =
    870. 

  870.             predictor[3 * 16 + 3] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2;
    871. 

  871.         predictor[2 * 16 + 2] =
    872. 

  872.             predictor[1 * 16 + 0] = (pp[2] + pp[3] + 1) >> 1;
    873. 

  873.         predictor[2 * 16 + 3] =
    874. 

  874.             predictor[1 * 16 + 1] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2;
    875. 

  875.         predictor[1 * 16 + 2] =
    876. 

  876.             predictor[0 * 16 + 0] = (pp[3] + pp[4] + 1) >> 1;
    877. 

  877.         predictor[1 * 16 + 3] =
    878. 

  878.             predictor[0 * 16 + 1] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2;
    879. 

  879.         predictor[0 * 16 + 2] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2;
    880. 

  880.         predictor[0 * 16 + 3] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2;
    881. 

  881.     }
    882. 

  882.     break;
    883. 

  883. 

  884. 

  885.     case B_HU_PRED:
    886. 

  886.     {
    887. 

  887.         unsigned char *pp = Left;
    888. 

  888.         predictor[0 * 16 + 0] = (pp[0] + pp[1] + 1) >> 1;
    889. 

  889.         predictor[0 * 16 + 1] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2;
    890. 

  890.         predictor[0 * 16 + 2] =
    891. 

  891.             predictor[1 * 16 + 0] = (pp[1] + pp[2] + 1) >> 1;
    892. 

  892.         predictor[0 * 16 + 3] =
    893. 

  893.             predictor[1 * 16 + 1] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2;
    894. 

  894.         predictor[1 * 16 + 2] =
    895. 

  895.             predictor[2 * 16 + 0] = (pp[2] + pp[3] + 1) >> 1;
    896. 

  896.         predictor[1 * 16 + 3] =
    897. 

  897.             predictor[2 * 16 + 1] = (pp[2] + pp[3] * 2 + pp[3] + 2) >> 2;
    898. 

  898.         predictor[2 * 16 + 2] =
    899. 

  899.             predictor[2 * 16 + 3] =
    900. 

  900.                 predictor[3 * 16 + 0] =
    901. 

  901.                     predictor[3 * 16 + 1] =
    902. 

  902.                         predictor[3 * 16 + 2] =
    903. 

  903.                             predictor[3 * 16 + 3] = pp[3];
    904. 

  904.     }
    905. 

  905.     break;
    906. 

  906. 

  907. 

  908.     }
    909. 

  909. }
    910. 

  910. 

  911. /* copy 4 bytes from the above right down so that the 4x4 prediction modes using pixels above and
    912. 

  912.  * to the right prediction have filled in pixels to use.
    913. 

  913.  */
    914. 

  914. void vp8mt_intra_prediction_down_copy(VP8D_COMP *pbi, MACROBLOCKD *x, int mb_row, int mb_col)
    915. 

  915. {
    916. 

  916.     unsigned char *above_right;   /* = *(x->block[0].base_dst) + x->block[0].dst - x->block[0].dst_stride + 16; */
    917. 

  917.     unsigned int *src_ptr;
    918. 

  918.     unsigned int *dst_ptr0;
    919. 

  919.     unsigned int *dst_ptr1;
    920. 

  920.     unsigned int *dst_ptr2;
    921. 

  921. 

  922.     if (pbi->common.filter_level)
    923. 

  923.         above_right = pbi->mt_yabove_row[mb_row] + mb_col*16 + 32 +16;
    924. 

  924.     else
    925. 

  925.         above_right = *(x->block[0].base_dst) + x->block[0].dst - x->block[0].dst_stride + 16;
    926. 

  926. 

  927.     src_ptr = (unsigned int *)above_right;
    928. 

  928.     /*dst_ptr0 = (unsigned int *)(above_right + 4 * x->block[0].dst_stride);
    929. 

  929.     dst_ptr1 = (unsigned int *)(above_right + 8 * x->block[0].dst_stride);
    930. 

  930.     dst_ptr2 = (unsigned int *)(above_right + 12 * x->block[0].dst_stride);*/
    931. 

  931.     dst_ptr0 = (unsigned int *)(*(x->block[0].base_dst) + x->block[0].dst + 16 + 3 * x->block[0].dst_stride);
    932. 

  932.     dst_ptr1 = (unsigned int *)(*(x->block[0].base_dst) + x->block[0].dst + 16 + 7 * x->block[0].dst_stride);
    933. 

  933.     dst_ptr2 = (unsigned int *)(*(x->block[0].base_dst) + x->block[0].dst + 16 + 11 * x->block[0].dst_stride);
    934. 

  934.     *dst_ptr0 = *src_ptr;
    935. 

  935.     *dst_ptr1 = *src_ptr;
    936. 

  936.     *dst_ptr2 = *src_ptr;
    937. 

  937. }
    938.