28 #define POS(x, y) src[(x) + stride * (y)]
33 ((x) >> s->sps->log2_min_pu_size)
35 (s->ref->tab_mvf[(x) + (y) * min_pu_width])
36 #define MVF_PU(x, y) \
37 MVF(PU(x0 + ((x) << hshift)), PU(y0 + ((y) << vshift)))
38 #define IS_INTRA(x, y) \
40 #define MIN_TB_ADDR_ZS(x, y) \
41 s->pps->min_tb_addr_zs[(y) * s->sps->min_tb_width + (x)]
42 #define EXTEND_LEFT(ptr, start, length) \
43 for (i = (start); i > (start) - (length); i--) \
45 #define EXTEND_RIGHT(ptr, start, length) \
46 for (i = (start); i < (start) + (length); i++) \
48 #define EXTEND_UP(ptr, start, length) EXTEND_LEFT(ptr, start, length)
49 #define EXTEND_DOWN(ptr, start, length) EXTEND_RIGHT(ptr, start, length)
50 #define EXTEND_LEFT_CIP(ptr, start, length) \
51 for (i = (start); i > (start) - (length); i--) \
52 if (!IS_INTRA(i - 1, -1)) \
54 #define EXTEND_RIGHT_CIP(ptr, start, length) \
55 for (i = (start); i < (start) + (length); i++) \
56 if (!IS_INTRA(i, -1)) \
58 #define EXTEND_UP_CIP(ptr, start, length) \
59 for (i = (start); i > (start) - (length); i--) \
60 if (!IS_INTRA(-1, i - 1)) \
62 #define EXTEND_UP_CIP_0(ptr, start, length) \
63 for (i = (start); i > (start) - (length); i--) \
65 #define EXTEND_DOWN_CIP(ptr, start, length) \
66 for (i = (start); i < (start) + (length); i++) \
67 if (!IS_INTRA(-1, i)) \
71 int hshift =
s->sps->hshift[c_idx];
72 int vshift =
s->sps->vshift[c_idx];
73 int size = (1 << log2_size);
74 int size_in_luma = size << hshift;
75 int size_in_tbs = size_in_luma >>
s->sps->log2_min_tb_size;
78 int x_tb = x0 >>
s->sps->log2_min_tb_size;
79 int y_tb = y0 >>
s->sps->log2_min_tb_size;
82 ptrdiff_t
stride =
s->frame->linesize[c_idx] /
sizeof(
pixel);
85 int min_pu_width =
s->sps->min_pu_width;
95 pixel *left = left_array + 1;
96 pixel *top = top_array + 1;
97 pixel *filtered_left = filtered_left_array + 1;
98 pixel *filtered_top = filtered_top_array + 1;
106 int bottom_left_size = (
FFMIN(y0 + 2 * size_in_luma,
s->sps->height) -
107 (y0 + size_in_luma)) >> vshift;
108 int top_right_size = (
FFMIN(x0 + 2 * size_in_luma,
s->sps->width) -
109 (x0 + size_in_luma)) >> hshift;
111 if (
s->pps->constrained_intra_pred_flag == 1) {
112 int size_in_luma_pu =
PU(size_in_luma);
113 int on_pu_edge_x = !(x0 & ((1 <<
s->sps->log2_min_pu_size) - 1));
114 int on_pu_edge_y = !(y0 & ((1 <<
s->sps->log2_min_pu_size) - 1));
115 if (!size_in_luma_pu)
117 if (cand_bottom_left == 1 && on_pu_edge_x) {
118 int x_left_pu =
PU(x0 - 1);
119 int y_bottom_pu =
PU(y0 + size_in_luma);
120 int max =
FFMIN(size_in_luma_pu,
s->sps->min_pu_height - y_bottom_pu);
121 cand_bottom_left = 0;
122 for (i = 0; i < max; i++)
123 cand_bottom_left |=
MVF(x_left_pu, y_bottom_pu + i).is_intra;
125 if (cand_left == 1 && on_pu_edge_x) {
126 int x_left_pu =
PU(x0 - 1);
127 int y_left_pu =
PU(y0);
128 int max =
FFMIN(size_in_luma_pu,
s->sps->min_pu_height - y_left_pu);
130 for (i = 0; i < max; i++)
131 cand_left |=
MVF(x_left_pu, y_left_pu + i).is_intra;
133 if (cand_up_left == 1) {
134 int x_left_pu =
PU(x0 - 1);
135 int y_top_pu =
PU(y0 - 1);
136 cand_up_left =
MVF(x_left_pu, y_top_pu).is_intra;
138 if (cand_up == 1 && on_pu_edge_y) {
139 int x_top_pu =
PU(x0);
140 int y_top_pu =
PU(y0 - 1);
141 int max =
FFMIN(size_in_luma_pu,
s->sps->min_pu_width - x_top_pu);
143 for (i = 0; i < max; i++)
144 cand_up |=
MVF(x_top_pu + i, y_top_pu).is_intra;
146 if (cand_up_right == 1 && on_pu_edge_y) {
147 int y_top_pu =
PU(y0 - 1);
148 int x_right_pu =
PU(x0 + size_in_luma);
149 int max =
FFMIN(size_in_luma_pu,
s->sps->min_pu_width - x_right_pu);
151 for (i = 0; i < max; i++)
152 cand_up_right |=
MVF(x_right_pu + i, y_top_pu).is_intra;
159 if (cand_bottom_left) {
160 for (i = size + bottom_left_size; i < (size << 1); i++)
161 if (
IS_INTRA(-1, size + bottom_left_size - 1) ||
162 !
s->pps->constrained_intra_pred_flag)
163 left[i] =
POS(-1, size + bottom_left_size - 1);
164 for (i = size + bottom_left_size - 1; i >=
size; i--)
165 if (
IS_INTRA(-1, i) || !
s->pps->constrained_intra_pred_flag)
166 left[i] =
POS(-1, i);
169 for (i = size - 1; i >= 0; i--)
170 if (
IS_INTRA(-1, i) || !
s->pps->constrained_intra_pred_flag)
171 left[i] =
POS(-1, i);
173 if (
IS_INTRA(-1, -1) || !
s->pps->constrained_intra_pred_flag) {
174 left[-1] =
POS(-1, -1);
178 for (i = size - 1; i >= 0; i--)
179 if (
IS_INTRA(i, -1) || !
s->pps->constrained_intra_pred_flag)
182 for (i = size + top_right_size; i < (size << 1); i++)
183 if (
IS_INTRA(size + top_right_size - 1, -1) ||
184 !
s->pps->constrained_intra_pred_flag)
185 top[i] =
POS(size + top_right_size - 1, -1);
186 for (i = size + top_right_size - 1; i >=
size; i--)
187 if (
IS_INTRA(i, -1) || !
s->pps->constrained_intra_pred_flag)
191 if (
s->pps->constrained_intra_pred_flag == 1) {
192 if (cand_bottom_left || cand_left || cand_up_left || cand_up || cand_up_right) {
193 int size_max_x = x0 + ((2 *
size) << hshift) <
s->sps->width ?
194 2 * size : (
s->sps->width - x0) >> hshift;
195 int size_max_y = y0 + ((2 *
size) << vshift) <
s->sps->height ?
196 2 * size : (
s->sps->height - y0) >> vshift;
197 int j = size + (cand_bottom_left? bottom_left_size: 0) -1;
198 if (!cand_up_right) {
199 size_max_x = x0 + ((
size) << hshift) <
s->sps->width ?
200 size : (
s->sps->width - x0) >> hshift;
202 if (!cand_bottom_left) {
203 size_max_y = y0 + ((
size) << vshift) <
s->sps->height ?
204 size : (
s->sps->height - y0) >> vshift;
206 if (cand_bottom_left || cand_left || cand_up_left) {
211 while (j < size_max_x && !
IS_INTRA(j, -1))
219 while (j < size_max_x && !
IS_INTRA(j, -1))
231 if (cand_bottom_left || cand_left) {
237 if (!cand_bottom_left) {
240 if (x0 != 0 && y0 != 0) {
242 }
else if (x0 == 0) {
254 if (!cand_bottom_left) {
257 }
else if (cand_up_left) {
260 }
else if (cand_up) {
265 }
else if (cand_up_right) {
273 top[0] = left[-1] = (1 << (
BIT_DEPTH - 1));
289 if (!cand_up_right) {
297 int intra_hor_ver_dist_thresh[] = { 7, 1, 0 };
300 if (min_dist_vert_hor > intra_hor_ver_dist_thresh[log2_size - 3]) {
302 if (
s->sps->sps_strong_intra_smoothing_enable_flag &&
304 FFABS(top[-1] + top[63] - 2 * top[31]) < threshold &&
305 FFABS(left[-1] + left[63] - 2 * left[31]) < threshold) {
308 filtered_top[-1] = top[-1];
309 filtered_top[63] = top[63];
310 for (i = 0; i < 63; i++)
311 filtered_top[i] = ((64 - (i + 1)) * top[-1] +
312 (i + 1) * top[63] + 32) >> 6;
313 for (i = 0; i < 63; i++)
314 left[i] = ((64 - (i + 1)) * left[-1] +
315 (i + 1) * left[63] + 32) >> 6;
318 filtered_left[2 * size - 1] = left[2 * size - 1];
319 filtered_top[2 * size - 1] = top[2 * size - 1];
320 for (i = 2 * size - 2; i >= 0; i--)
321 filtered_left[i] = (left[i + 1] + 2 * left[i] +
322 left[i - 1] + 2) >> 2;
324 filtered_left[-1] = (left[0] + 2 * left[-1] + top[0] + 2) >> 2;
325 for (i = 2 * size - 2; i >= 0; i--)
326 filtered_top[i] = (top[i + 1] + 2 * top[i] +
327 top[i - 1] + 2) >> 2;
328 left = filtered_left;
341 (
uint8_t *)left, stride, log2_size, c_idx);
345 (
uint8_t *)left, stride, c_idx,
359 for (y = 0; y < 4; y++)
360 for (x = 0; x < 4; x++)
361 POS(x, y) = ((3 - x) * left[y] + (x + 1) * top[4] +
362 (3 -
y) * top[x] + (y + 1) * left[4] + 4) >> 3;
372 for (y = 0; y < 8; y++)
373 for (x = 0; x < 8; x++)
374 POS(x, y) = ((7 - x) * left[y] + (x + 1) * top[8] +
375 (7 -
y) * top[x] + (y + 1) * left[8] + 8) >> 4;
385 for (y = 0; y < 16; y++)
386 for (x = 0; x < 16; x++)
387 POS(x, y) = ((15 - x) * left[y] + (x + 1) * top[16] +
388 (15 -
y) * top[x] + (y + 1) * left[16] + 16) >> 5;
398 for (y = 0; y < 32; y++)
399 for (x = 0; x < 32; x++)
400 POS(x, y) = ((31 - x) * left[y] + (x + 1) * top[32] +
401 (31 -
y) * top[x] + (y + 1) * left[32] + 32) >> 6;
406 ptrdiff_t
stride,
int log2_size,
int c_idx)
409 int size = (1 << log2_size);
415 for (i = 0; i <
size; i++)
416 dc += left[i] + top[i];
418 dc >>= log2_size + 1;
422 for (i = 0; i <
size; i++)
423 for (j = 0; j < size / 4; j++)
426 if (c_idx == 0 && size < 32) {
427 POS(0, 0) = (left[0] + 2 * dc + top[0] + 2) >> 2;
428 for (x = 1; x <
size; x++)
429 POS(x, 0) = (top[x] + 3 * dc + 2) >> 2;
430 for (y = 1; y <
size; y++)
431 POS(0, y) = (left[
y] + 3 * dc + 2) >> 2;
438 ptrdiff_t
stride,
int c_idx,
446 static const int intra_pred_angle[] = {
447 32, 26, 21, 17, 13, 9, 5, 2, 0, -2, -5, -9, -13, -17, -21, -26, -32,
448 -26, -21, -17, -13, -9, -5, -2, 0, 2, 5, 9, 13, 17, 21, 26, 32
450 static const int inv_angle[] = {
451 -4096, -1638, -910, -630, -482, -390, -315, -256, -315, -390, -482,
452 -630, -910, -1638, -4096
455 int angle = intra_pred_angle[
mode - 2];
459 int last = (size * angle) >> 5;
463 if (angle < 0 && last < -1) {
464 for (x = 0; x <=
size; x++)
465 ref_tmp[x] = top[x - 1];
466 for (x = last; x <= -1; x++)
467 ref_tmp[x] = left[-1 + ((x * inv_angle[
mode - 11] + 128) >> 8)];
471 for (y = 0; y <
size; y++) {
472 int idx = ((y + 1) * angle) >> 5;
473 int fact = ((y + 1) * angle) & 31;
475 for (x = 0; x <
size; x++) {
476 POS(x, y) = ((32 - fact) * ref[x + idx + 1] +
477 fact * ref[x + idx + 2] + 16) >> 5;
480 for (x = 0; x <
size; x++)
481 POS(x, y) = ref[x + idx + 1];
484 if (
mode == 26 && c_idx == 0 && size < 32) {
485 for (y = 0; y <
size; y++)
490 if (angle < 0 && last < -1) {
491 for (x = 0; x <=
size; x++)
492 ref_tmp[x] = left[x - 1];
493 for (x = last; x <= -1; x++)
494 ref_tmp[x] = top[-1 + ((x * inv_angle[
mode - 11] + 128) >> 8)];
498 for (x = 0; x <
size; x++) {
499 int idx = ((x + 1) * angle) >> 5;
500 int fact = ((x + 1) * angle) & 31;
502 for (y = 0; y <
size; y++) {
503 POS(x, y) = ((32 - fact) * ref[y + idx + 1] +
504 fact * ref[y + idx + 2] + 16) >> 5;
507 for (y = 0; y <
size; y++)
508 POS(x, y) = ref[y + idx + 1];
511 if (
mode == 10 && c_idx == 0 && size < 32) {
512 for (x = 0; x <
size; x++)
546 #undef EXTEND_LEFT_CIP
547 #undef EXTEND_RIGHT_CIP
549 #undef EXTEND_DOWN_CIP
558 #undef MIN_TB_ADDR_ZS