falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
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.
57330 Commits
32 Branches
283MB
Tree: 0c8aba3842
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '0c8aba3842'
${ noResults }
FFmpeg/libavcodec/hevcpred_template.c

552 lines
21KB
Raw Blame History 

  1. /*

  2.  * HEVC video Decoder

  3.  *

  4.  * Copyright (C) 2012 - 2013 Guillaume Martres

  5.  *

  6.  * This file is part of FFmpeg.

  7.  *

  8.  * FFmpeg is free software; you can redistribute it and/or

  9.  * modify it under the terms of the GNU Lesser General Public

  10.  * License as published by the Free Software Foundation; either

  11.  * version 2.1 of the License, or (at your option) any later version.

  12.  *

  13.  * FFmpeg is distributed in the hope that it will be useful,

  14.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  15.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  16.  * Lesser General Public License for more details.

  17.  *

  18.  * You should have received a copy of the GNU Lesser General Public

  19.  * License along with FFmpeg; if not, write to the Free Software

  20.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  21.  */

  22. 

  23. #include "libavutil/pixdesc.h"

  24. #include "bit_depth_template.c"

  25. #include "hevcpred.h"

  26. 

  27. #define POS(x, y) src[(x) + stride * (y)]

  28. 

  29. static void FUNC(intra_pred)(HEVCContext *s, int x0, int y0, int log2_size, int c_idx)

  30. {

  31. #define PU(x) \

  32.     ((x) >> s->sps->log2_min_pu_size)

  33. #define MVF(x, y) \

  34.     (s->ref->tab_mvf[(x) + (y) * pic_width_in_min_pu])

  35. #define MVF_PU(x, y) \

  36.     MVF(PU(x0 + ((x) << hshift)), PU(y0 + ((y) << vshift)))

  37. #define IS_INTRA(x, y) \

  38.     MVF_PU(x, y).is_intra

  39. #define MIN_TB_ADDR_ZS(x, y) \

  40.     s->pps->min_tb_addr_zs[(y) * s->sps->min_tb_width + (x)]

  41. #define EXTEND_LEFT(ptr, start, length) \

  42.         for (i = (start); i > (start) - (length); i--) \

  43.             ptr[i - 1] = ptr[i]

  44. #define EXTEND_RIGHT(ptr, start, length) \

  45.         for (i = (start); i < (start) + (length); i++) \

  46.             ptr[i] = ptr[i - 1]

  47. #define EXTEND_UP(ptr, start, length)   EXTEND_LEFT(ptr, start, length)

  48. #define EXTEND_DOWN(ptr, start, length) EXTEND_RIGHT(ptr, start, length)

  49. #define EXTEND_LEFT_CIP(ptr, start, length) \

  50.         for (i = (start); i > (start) - (length); i--) \

  51.             if (!IS_INTRA(i - 1, -1)) \

  52.                 ptr[i - 1] = ptr[i]

  53. #define EXTEND_RIGHT_CIP(ptr, start, length) \

  54.         for (i = (start); i < (start) + (length); i++) \

  55.             if (!IS_INTRA(i, -1)) \

  56.                 ptr[i] = ptr[i - 1]

  57. #define EXTEND_UP_CIP(ptr, start, length) \

  58.         for (i = (start); i > (start) - (length); i--) \

  59.             if (!IS_INTRA(-1, i - 1)) \

  60.                 ptr[i - 1] = ptr[i]

  61. #define EXTEND_UP_CIP_0(ptr, start, length) \

  62.         for (i = (start); i > (start) - (length); i--) \

  63.             ptr[i - 1] = ptr[i]

  64. #define EXTEND_DOWN_CIP(ptr, start, length) \

  65.         for (i = (start); i < (start) + (length); i++) \

  66.             if (!IS_INTRA(-1, i)) \

  67.                 ptr[i] = ptr[i - 1]

  68.     HEVCLocalContext *lc = s->HEVClc;

  69.     int i;

  70.     int hshift = s->sps->hshift[c_idx];

  71.     int vshift = s->sps->vshift[c_idx];

  72.     int size = (1 << log2_size);

  73.     int size_in_luma = size << hshift;

  74.     int size_in_tbs = size_in_luma >> s->sps->log2_min_transform_block_size;

  75.     int x = x0 >> hshift;

  76.     int y = y0 >> vshift;

  77.     int x_tb = x0 >> s->sps->log2_min_transform_block_size;

  78.     int y_tb = y0 >> s->sps->log2_min_transform_block_size;

  79.     int cur_tb_addr = MIN_TB_ADDR_ZS(x_tb, y_tb);

  80. 

  81.     ptrdiff_t stride = s->frame->linesize[c_idx] / sizeof(pixel);

  82.     pixel *src = (pixel*)s->frame->data[c_idx] + x + y * stride;

  83. 

  84.     int pic_width_in_min_pu = PU(s->sps->width);

  85. 

  86.     enum IntraPredMode mode = c_idx ? lc->pu.intra_pred_mode_c :

  87.                               lc->tu.cur_intra_pred_mode;

  88. 

  89.     pixel left_array[2 * MAX_TB_SIZE + 1];

  90.     pixel filtered_left_array[2 * MAX_TB_SIZE + 1];

  91.     pixel top_array[2 * MAX_TB_SIZE + 1];

  92.     pixel filtered_top_array[2 * MAX_TB_SIZE + 1];

  93. 

  94.     pixel *left          = left_array + 1;

  95.     pixel *top           = top_array + 1;

  96.     pixel *filtered_left = filtered_left_array + 1;

  97.     pixel *filtered_top  = filtered_top_array + 1;

  98. 

  99.     int cand_bottom_left = lc->na.cand_bottom_left && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb - 1, y_tb + size_in_tbs);

  100.     int cand_left        = lc->na.cand_left;

  101.     int cand_up_left     = lc->na.cand_up_left;

  102.     int cand_up          = lc->na.cand_up;

  103.     int cand_up_right    = lc->na.cand_up_right && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb + size_in_tbs, y_tb - 1);

  104. 

  105.     int bottom_left_size = (FFMIN(y0 + 2 * size_in_luma, s->sps->height) -

  106.                             (y0 + size_in_luma)) >> vshift;

  107.     int top_right_size   = (FFMIN(x0 + 2 * size_in_luma, s->sps->width) -

  108.                             (x0 + size_in_luma)) >> hshift;

  109. 

  110.     if (s->pps->constrained_intra_pred_flag == 1) {

  111.         int size_in_luma_pu = PU(size_in_luma);

  112.         int on_pu_edge_x = !(x0 & ((1 << s->sps->log2_min_pu_size) - 1));

  113.         int on_pu_edge_y = !(y0 & ((1 << s->sps->log2_min_pu_size) - 1));

  114.         if(!size_in_luma_pu)

  115.             size_in_luma_pu++;

  116.         if (cand_bottom_left == 1 && on_pu_edge_x) {

  117.             int x_left_pu   = PU(x0 - 1);

  118.             int y_bottom_pu = PU(y0 + size_in_luma);

  119.             cand_bottom_left = 0;

  120.             for(i = 0; i < size_in_luma_pu; i++)

  121.                 cand_bottom_left |= MVF(x_left_pu, y_bottom_pu + i).is_intra;

  122.         }

  123.         if (cand_left == 1 && on_pu_edge_x) {

  124.             int x_left_pu   = PU(x0 - 1);

  125.             int y_left_pu   = PU(y0);

  126.             cand_left = 0;

  127.             for(i = 0; i < size_in_luma_pu; i++)

  128.                 cand_left |= MVF(x_left_pu, y_left_pu + i).is_intra;

  129.         }

  130.         if (cand_up_left == 1) {

  131.             int x_left_pu   = PU(x0 - 1);

  132.             int y_top_pu    = PU(y0 - 1);

  133.             cand_up_left = MVF(x_left_pu, y_top_pu).is_intra;

  134.         }

  135.         if (cand_up == 1 && on_pu_edge_y) {

  136.             int x_top_pu    = PU(x0);

  137.             int y_top_pu    = PU(y0 - 1);

  138.             cand_up = 0;

  139.             for(i = 0; i < size_in_luma_pu; i++)

  140.                 cand_up |= MVF(x_top_pu + i, y_top_pu).is_intra;

  141.         }

  142.         if (cand_up_right == 1 && on_pu_edge_y) {

  143.             int y_top_pu    = PU(y0 - 1);

  144.             int x_right_pu  = PU(x0 + size_in_luma);

  145.             cand_up_right = 0;

  146.             for(i = 0; i < size_in_luma_pu; i++)

  147.                 cand_up_right |= MVF(x_right_pu + i, y_top_pu).is_intra;

  148.         }

  149.         for (i = 0; i < 2 * MAX_TB_SIZE; i++) {

  150.             left[i] = 128;

  151.             top[i]  = 128;

  152.         }

  153.     }

  154.     if (cand_bottom_left) {

  155.         for (i = size + bottom_left_size; i < (size << 1); i++)

  156.             if (IS_INTRA(-1, size + bottom_left_size - 1) || !s->pps->constrained_intra_pred_flag)

  157.                 left[i] = POS(-1, size + bottom_left_size - 1);

  158.         for (i = size + bottom_left_size - 1; i >= size; i--)

  159.             if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)

  160.                 left[i] = POS(-1, i);

  161.     }

  162.     if (cand_left)

  163.         for (i = size - 1; i >= 0; i--)

  164.             if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)

  165.                 left[i] = POS(-1, i);

  166.     if (cand_up_left)

  167.         if (IS_INTRA(-1, -1) || !s->pps->constrained_intra_pred_flag) {

  168.             left[-1] = POS(-1, -1);

  169.             top[-1]  = left[-1];

  170.         }

  171.     if (cand_up)

  172.         for (i = size - 1; i >= 0; i--)

  173.             if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)

  174.                 top[i] = POS(i, -1);

  175.     if (cand_up_right) {

  176.         for (i = size + top_right_size; i < (size << 1); i++)

  177.             if (IS_INTRA(size + top_right_size - 1, -1) || !s->pps->constrained_intra_pred_flag)

  178.                 top[i] = POS(size + top_right_size - 1, -1);

  179.         for (i = size + top_right_size - 1; i >= size; i--)

  180.             if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)

  181.                 top[i] = POS(i, -1);

  182.     }

  183. 

  184.     if (s->pps->constrained_intra_pred_flag == 1) {

  185.         if (cand_bottom_left || cand_left || cand_up_left || cand_up || cand_up_right) {

  186.             int size_max_x = x0 + ((2 * size) << hshift) < s->sps->width ?

  187.                                     2 * size : (s->sps->width - x0) >> hshift;

  188.             int size_max_y = y0 + ((2 * size) << vshift) < s->sps->height ?

  189.                                     2 * size : (s->sps->height - y0) >> vshift;

  190.             int j = size + (cand_bottom_left? bottom_left_size: 0) -1;

  191.             if (!cand_up_right) {

  192.                 size_max_x = x0 + ((size) << hshift) < s->sps->width ?

  193.                                                     size : (s->sps->width - x0) >> hshift;

  194.             }

  195.             if (!cand_bottom_left) {

  196.                 size_max_y = y0 + (( size) << vshift) < s->sps->height ?

  197.                                                      size : (s->sps->height - y0) >> vshift;

  198.             }

  199.             if (cand_bottom_left || cand_left || cand_up_left) {

  200.                 while (j>-1 && !IS_INTRA(-1, j)) j--;

  201.                 if (!IS_INTRA(-1, j)) {

  202.                     j = 0;

  203.                     while(j < size_max_x && !IS_INTRA(j, -1)) j++;

  204.                     EXTEND_LEFT_CIP(top, j, j+1);

  205.                     left[-1] = top[-1];

  206.                     j = 0;

  207.                 }

  208.             } else {

  209.                 j = 0;

  210.                 while (j < size_max_x && !IS_INTRA(j, -1)) j++;

  211.                 if (j > 0)

  212.                     if (x0 > 0) {

  213.                         EXTEND_LEFT_CIP(top, j, j+1);

  214.                     } else {

  215.                         EXTEND_LEFT_CIP(top, j, j);

  216.                         top[-1] = top[0];

  217.                     }

  218.                 left[-1] = top[-1];

  219.                 j = 0;

  220.             }

  221.             if (cand_bottom_left || cand_left) {

  222.                 EXTEND_DOWN_CIP(left, j, size_max_y-j);

  223.             }

  224.             if (!cand_left) {

  225.                 EXTEND_DOWN(left, 0, size);

  226.             }

  227.             if (!cand_bottom_left) {

  228.                 EXTEND_DOWN(left, size, size);

  229.             }

  230.             if (x0 != 0 && y0 != 0) {

  231.                 EXTEND_UP_CIP(left, size_max_y - 1, size_max_y);

  232.             } else if( x0 == 0) {

  233.                 EXTEND_UP_CIP_0(left, size_max_y - 1, size_max_y);

  234.             } else{

  235.                 EXTEND_UP_CIP(left, size_max_y - 1, size_max_y-1);

  236.             }

  237.             top[-1] = left[-1];

  238.             if (y0 != 0) {

  239.                 EXTEND_RIGHT_CIP(top, 0, size_max_x);

  240.             }

  241.         }

  242.     }

  243.     // Infer the unavailable samples

  244.     if (!cand_bottom_left) {

  245.         if (cand_left) {

  246.             EXTEND_DOWN(left, size, size);

  247.         } else if (cand_up_left) {

  248.             EXTEND_DOWN(left, 0, 2 * size);

  249.             cand_left = 1;

  250.         } else if (cand_up) {

  251.             left[-1] = top[0];

  252.             EXTEND_DOWN(left, 0, 2 * size);

  253.             cand_up_left = 1;

  254.             cand_left = 1;

  255.         } else if (cand_up_right) {

  256.             EXTEND_LEFT(top, size, size);

  257.             left[-1] = top[0];

  258.             EXTEND_DOWN(left ,0 , 2 * size);

  259.             cand_up = 1;

  260.             cand_up_left = 1;

  261.             cand_left = 1;

  262.         } else { // No samples available

  263.             top[0] = left[-1] = (1 << (BIT_DEPTH - 1));

  264.             EXTEND_RIGHT(top, 1, 2 * size - 1);

  265.             EXTEND_DOWN(left, 0, 2 * size);

  266.         }

  267.     }

  268. 

  269.     if (!cand_left) {

  270.         EXTEND_UP(left, size, size);

  271.     }

  272.     if (!cand_up_left) {

  273.         left[-1] = left[0];

  274.     }

  275.     if (!cand_up) {

  276.         top[0] = left[-1];

  277.         EXTEND_RIGHT(top, 1, size-1);

  278.     }

  279.     if (!cand_up_right) {

  280.         EXTEND_RIGHT(top, size, size);

  281.     }

  282. 

  283.     top[-1] = left[-1];

  284. 

  285. #undef EXTEND_LEFT_CIP

  286. #undef EXTEND_RIGHT_CIP

  287. #undef EXTEND_UP_CIP

  288. #undef EXTEND_DOWN_CIP

  289. #undef IS_INTRA

  290. #undef MVF_PU

  291. #undef MVF

  292. #undef PU

  293. #undef EXTEND_LEFT

  294. #undef EXTEND_RIGHT

  295. #undef EXTEND_UP

  296. #undef EXTEND_DOWN

  297. #undef MIN_TB_ADDR_ZS

  298. 

  299.     // Filtering process

  300.     if (c_idx == 0 && mode != INTRA_DC && size != 4) {

  301.         int intra_hor_ver_dist_thresh[] = { 7, 1, 0 };

  302.         int min_dist_vert_hor           = FFMIN(FFABS((int)mode - 26),

  303.                                                 FFABS((int)mode - 10));

  304.         if (min_dist_vert_hor > intra_hor_ver_dist_thresh[log2_size - 3]) {

  305.             int threshold = 1 << (BIT_DEPTH - 5);

  306.             if (s->sps->sps_strong_intra_smoothing_enable_flag &&

  307.                 log2_size == 5 &&

  308.                 FFABS(top[-1] + top[63] - 2 * top[31]) < threshold &&

  309.                 FFABS(left[-1] + left[63] - 2 * left[31]) < threshold) {

  310.                 // We can't just overwrite values in top because it could be

  311.                 // a pointer into src

  312.                 filtered_top[-1] = top[-1];

  313.                 filtered_top[63] = top[63];

  314.                 for (i = 0; i < 63; i++)

  315.                     filtered_top[i] = ((64 - (i + 1)) * top[-1] +

  316.                                              (i + 1)  * top[63] + 32) >> 6;

  317.                 for (i = 0; i < 63; i++)

  318.                     left[i] = ((64 - (i + 1)) * left[-1] +

  319.                                      (i + 1)  * left[63] + 32) >> 6;

  320.                 top = filtered_top;

  321.             } else {

  322.                 filtered_left[2 * size - 1] = left[2 * size - 1];

  323.                 filtered_top[2 * size - 1]  = top[2 * size - 1];

  324.                 for (i = 2 * size - 2; i >= 0; i--)

  325.                     filtered_left[i] = (left[i + 1] + 2 * left[i] +

  326.                                         left[i - 1] + 2) >> 2;

  327.                 filtered_top[-1] =

  328.                 filtered_left[-1] = (left[0] + 2 * left[-1] +

  329.                                      top[0]  + 2) >> 2;

  330.                 for (i = 2 * size - 2; i >= 0; i--)

  331.                     filtered_top[i] = (top[i + 1] + 2 * top[i] +

  332.                                        top[i - 1] + 2) >> 2;

  333.                 left = filtered_left;

  334.                 top  = filtered_top;

  335.             }

  336.         }

  337.     }

  338. 

  339.     switch (mode) {

  340.     case INTRA_PLANAR:

  341.         s->hpc.pred_planar[log2_size - 2]((uint8_t*)src, (uint8_t*)top,

  342.                                           (uint8_t*)left, stride);

  343.         break;

  344.     case INTRA_DC:

  345.         s->hpc.pred_dc((uint8_t*)src, (uint8_t*)top,

  346.                        (uint8_t*)left, stride, log2_size, c_idx);

  347.         break;

  348.     default:

  349.         s->hpc.pred_angular[log2_size - 2]((uint8_t*)src, (uint8_t*)top,

  350.                                            (uint8_t*)left, stride, c_idx, mode);

  351.         break;

  352.     }

  353. }

  354. 

  355. static void FUNC(pred_planar_0)(uint8_t *_src, const uint8_t *_top,

  356.                                 const uint8_t *_left,

  357.                                 ptrdiff_t stride)

  358. {

  359.     int x, y;

  360.     pixel *src = (pixel*)_src;

  361.     const pixel *top  = (const pixel*)_top;

  362.     const pixel *left = (const pixel*)_left;

  363.     for (y = 0; y < 4; y++)

  364.         for (x = 0; x < 4; x++)

  365.             POS(x, y) = ((3 - x) * left[y]  + (x + 1) * top[4] +

  366.                          (3 - y) * top[x]   + (y + 1) * left[4] + 4) >> 3;

  367. }

  368. 

  369. static void FUNC(pred_planar_1)(uint8_t *_src, const uint8_t *_top,

  370.                                 const uint8_t *_left, ptrdiff_t stride)

  371. {

  372.     int x, y;

  373.     pixel *src = (pixel*)_src;

  374.     const pixel *top  = (const pixel*)_top;

  375.     const pixel *left = (const pixel*)_left;

  376.     for (y = 0; y < 8; y++)

  377.         for (x = 0; x < 8; x++)

  378.             POS(x, y) = ((7 - x) * left[y]  + (x + 1) * top[8] +

  379.                          (7 - y) * top[x]   + (y + 1) * left[8] + 8) >> 4;

  380. }

  381. 

  382. static void FUNC(pred_planar_2)(uint8_t *_src, const uint8_t *_top,

  383.                                 const uint8_t *_left, ptrdiff_t stride)

  384. {

  385.     int x, y;

  386.     pixel *src = (pixel*)_src;

  387.     const pixel *top  = (const pixel*)_top;

  388.     const pixel *left = (const pixel*)_left;

  389.     for (y = 0; y < 16; y++)

  390.         for (x = 0; x < 16; x++)

  391.             POS(x, y) = ((15 - x) * left[y]  + (x + 1) * top[16] +

  392.                          (15 - y) * top[x]   + (y + 1) * left[16] + 16) >> 5;

  393. }

  394. 

  395. static void FUNC(pred_planar_3)(uint8_t *_src, const uint8_t *_top,

  396.                                 const uint8_t *_left, ptrdiff_t stride)

  397. {

  398.     int x, y;

  399.     pixel *src = (pixel*)_src;

  400.     const pixel *top  = (const pixel*)_top;

  401.     const pixel *left = (const pixel*)_left;

  402.     for (y = 0; y < 32; y++)

  403.         for (x = 0; x < 32; x++)

  404.             POS(x, y) = ((31 - x) * left[y]  + (x + 1) * top[32] +

  405.                          (31 - y) * top[x]   + (y + 1) * left[32] + 32) >> 6;

  406. }

  407. 

  408. static void FUNC(pred_dc)(uint8_t *_src, const uint8_t *_top,

  409.                           const uint8_t *_left,

  410.                           ptrdiff_t stride, int log2_size, int c_idx)

  411. {

  412.     int i, j, x, y;

  413.     int size = (1 << log2_size);

  414.     pixel *src        = (pixel*)_src;

  415.     const pixel *top  = (const pixel*)_top;

  416.     const pixel *left = (const pixel*)_left;

  417.     int dc = size;

  418.     pixel4 a;

  419.     for (i = 0; i < size; i++)

  420.         dc += left[i] + top[i];

  421. 

  422.     dc >>= log2_size + 1;

  423. 

  424.     a = PIXEL_SPLAT_X4(dc);

  425. 

  426.     for (i = 0; i < size; i++)

  427.         for (j = 0; j < size / 4; j++)

  428.             AV_WN4PA(&POS(j * 4, i), a);

  429. 

  430.     if (c_idx == 0 && size < 32) {

  431.         POS(0, 0) = (left[0] + 2 * dc  + top[0] + 2) >> 2;

  432.         for (x = 1; x < size; x++)

  433.             POS(x, 0) = (top[x] + 3 * dc + 2) >> 2;

  434.         for (y = 1; y < size; y++)

  435.             POS(0, y) = (left[y] + 3 * dc + 2) >> 2;

  436.     }

  437. }

  438. 

  439. static av_always_inline void FUNC(pred_angular)(uint8_t *_src,

  440.                                                 const uint8_t *_top,

  441.                                                 const uint8_t *_left,

  442.                                                 ptrdiff_t stride, int c_idx,

  443.                                                 int mode, int size)

  444. {

  445.     int x, y;

  446.     pixel *src = (pixel*)_src;

  447.     const pixel *top  = (const pixel*)_top;

  448.     const pixel *left = (const pixel*)_left;

  449. 

  450.     static const int intra_pred_angle[] = {

  451.         32, 26, 21, 17, 13, 9, 5, 2, 0, -2, -5, -9, -13, -17, -21, -26, -32,

  452.         -26, -21, -17, -13, -9, -5, -2, 0, 2, 5, 9, 13, 17, 21, 26, 32

  453.     };

  454.     static const int inv_angle[] = {

  455.         -4096, -1638, -910, -630, -482, -390, -315, -256, -315, -390, -482,

  456.         -630, -910, -1638, -4096

  457.     };

  458. 

  459.     int angle = intra_pred_angle[mode - 2];

  460.     pixel ref_array[3 * MAX_TB_SIZE + 1];

  461.     pixel *ref_tmp = ref_array + size;

  462.     const pixel *ref;

  463.     int last = (size * angle) >> 5;

  464. 

  465.     if (mode >= 18) {

  466.         ref = top - 1;

  467.         if (angle < 0 && last < -1) {

  468.             for (x = 0; x <= size; x++)

  469.                 ref_tmp[x] = top[x - 1];

  470.             for (x = last; x <= -1; x++)

  471.                 ref_tmp[x] = left[-1 + ((x * inv_angle[mode-11] + 128) >> 8)];

  472.             ref = ref_tmp;

  473.         }

  474. 

  475.         for (y = 0; y < size; y++) {

  476.             int idx  = ((y + 1) * angle) >> 5;

  477.             int fact = ((y + 1) * angle) & 31;

  478.             if (fact) {

  479.                 for (x = 0; x < size; x++) {

  480.                     POS(x, y) = ((32 - fact) * ref[x + idx + 1] +

  481.                                        fact  * ref[x + idx + 2] + 16) >> 5;

  482.                 }

  483.             } else {

  484.                 for (x = 0; x < size; x++) {

  485.                     POS(x, y) = ref[x + idx + 1];

  486.                 }

  487.             }

  488.         }

  489.         if (mode == 26 && c_idx == 0 && size < 32) {

  490.             for (y = 0; y < size; y++)

  491.                 POS(0, y) = av_clip_pixel(top[0] + ((left[y] - left[-1]) >> 1));

  492.         }

  493.     } else {

  494.         ref = left - 1;

  495.         if (angle < 0 && last < -1) {

  496.             for (x = 0; x <= size; x++)

  497.                 ref_tmp[x] = left[x - 1];

  498.             for (x = last; x <= -1; x++)

  499.                 ref_tmp[x] = top[-1 + ((x * inv_angle[mode-11] + 128) >> 8)];

  500.             ref = ref_tmp;

  501.         }

  502. 

  503.         for (x = 0; x < size; x++) {

  504.             int idx  = ((x + 1) * angle) >> 5;

  505.             int fact = ((x + 1) * angle) & 31;

  506.             if (fact) {

  507.                 for (y = 0; y < size; y++) {

  508.                     POS(x, y) = ((32 - fact) * ref[y + idx + 1] +

  509.                                        fact  * ref[y + idx + 2] + 16) >> 5;

  510.                 }

  511.             } else {

  512.                 for (y = 0; y < size; y++) {

  513.                     POS(x, y) = ref[y + idx + 1];

  514.                 }

  515.             }

  516.         }

  517.         if (mode == 10 && c_idx == 0 && size < 32) {

  518.             for (x = 0; x < size; x++)

  519.                 POS(x, 0) = av_clip_pixel(left[0] + ((top[x] - top[-1]) >> 1));

  520.         }

  521.     }

  522. }

  523. 

  524. static void FUNC(pred_angular_0)(uint8_t *src, const uint8_t *top,

  525.                                  const uint8_t *left,

  526.                                  ptrdiff_t stride, int c_idx, int mode)

  527. {

  528.     FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 2);

  529. }

  530. 

  531. static void FUNC(pred_angular_1)(uint8_t *src, const uint8_t *top,

  532.                                  const uint8_t *left,

  533.                                  ptrdiff_t stride, int c_idx, int mode)

  534. {

  535.     FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 3);

  536. }

  537. 

  538. static void FUNC(pred_angular_2)(uint8_t *src, const uint8_t *top,

  539.                                  const uint8_t *left,

  540.                                  ptrdiff_t stride, int c_idx, int mode)

  541. {

  542.     FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 4);

  543. }

  544. 

  545. static void FUNC(pred_angular_3)(uint8_t *src, const uint8_t *top,

  546.                                  const uint8_t *left,

  547.                                  ptrdiff_t stride, int c_idx, int mode)

  548. {

  549.     FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 5);

  550. }

  551. #undef POS