4 * Copyright (C) 2012 - 2013 Guillaume Martres
6 * This file is part of FFmpeg.
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.
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.
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
23 #include "libavutil/pixdesc.h"
25 #include "bit_depth_template.c"
28 #define POS(x, y) src[(x) + stride * (y)]
30 static void FUNC(intra_pred)(HEVCContext *s, int x0, int y0, int log2_size, int c_idx)
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)) \
69 HEVCLocalContext *lc = s->HEVClc;
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;
80 int cur_tb_addr = MIN_TB_ADDR_ZS(x_tb, y_tb);
82 ptrdiff_t stride = s->frame->linesize[c_idx] / sizeof(pixel);
83 pixel *src = (pixel*)s->frame->data[c_idx] + x + y * stride;
85 int min_pu_width = s->sps->min_pu_width;
87 enum IntraPredMode mode = c_idx ? lc->pu.intra_pred_mode_c :
88 lc->tu.cur_intra_pred_mode;
90 pixel left_array[2 * MAX_TB_SIZE + 1];
91 pixel filtered_left_array[2 * MAX_TB_SIZE + 1];
92 pixel top_array[2 * MAX_TB_SIZE + 1];
93 pixel filtered_top_array[2 * MAX_TB_SIZE + 1];
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;
100 int cand_bottom_left = lc->na.cand_bottom_left && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb - 1, y_tb + size_in_tbs);
101 int cand_left = lc->na.cand_left;
102 int cand_up_left = lc->na.cand_up_left;
103 int cand_up = lc->na.cand_up;
104 int cand_up_right = lc->na.cand_up_right && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb + size_in_tbs, y_tb - 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;
154 for (i = 0; i < 2 * MAX_TB_SIZE; i++) {
160 if (cand_bottom_left) {
161 for (i = size + bottom_left_size; i < (size << 1); i++)
162 if (IS_INTRA(-1, size + bottom_left_size - 1) ||
163 !s->pps->constrained_intra_pred_flag)
164 left[i] = POS(-1, size + bottom_left_size - 1);
165 for (i = size + bottom_left_size - 1; i >= size; i--)
166 if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)
167 left[i] = POS(-1, i);
170 for (i = size - 1; i >= 0; i--)
171 if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)
172 left[i] = POS(-1, i);
174 if (IS_INTRA(-1, -1) || !s->pps->constrained_intra_pred_flag) {
175 left[-1] = POS(-1, -1);
179 for (i = size - 1; i >= 0; i--)
180 if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)
183 for (i = size + top_right_size; i < (size << 1); i++)
184 if (IS_INTRA(size + top_right_size - 1, -1) ||
185 !s->pps->constrained_intra_pred_flag)
186 top[i] = POS(size + top_right_size - 1, -1);
187 for (i = size + top_right_size - 1; i >= size; i--)
188 if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)
192 if (s->pps->constrained_intra_pred_flag == 1) {
193 if (cand_bottom_left || cand_left || cand_up_left || cand_up || cand_up_right) {
194 int size_max_x = x0 + ((2 * size) << hshift) < s->sps->width ?
195 2 * size : (s->sps->width - x0) >> hshift;
196 int size_max_y = y0 + ((2 * size) << vshift) < s->sps->height ?
197 2 * size : (s->sps->height - y0) >> vshift;
198 int j = size + (cand_bottom_left? bottom_left_size: 0) -1;
199 if (!cand_up_right) {
200 size_max_x = x0 + ((size) << hshift) < s->sps->width ?
201 size : (s->sps->width - x0) >> hshift;
203 if (!cand_bottom_left) {
204 size_max_y = y0 + (( size) << vshift) < s->sps->height ?
205 size : (s->sps->height - y0) >> vshift;
207 if (cand_bottom_left || cand_left || cand_up_left) {
208 while (j > -1 && !IS_INTRA(-1, j))
210 if (!IS_INTRA(-1, j)) {
212 while (j < size_max_x && !IS_INTRA(j, -1))
214 EXTEND_LEFT_CIP(top, j, j + 1);
220 while (j < size_max_x && !IS_INTRA(j, -1))
224 EXTEND_LEFT_CIP(top, j, j + 1);
226 EXTEND_LEFT_CIP(top, j, j);
232 if (cand_bottom_left || cand_left) {
233 EXTEND_DOWN_CIP(left, j, size_max_y - j);
236 EXTEND_DOWN(left, 0, size);
238 if (!cand_bottom_left) {
239 EXTEND_DOWN(left, size, size);
241 if (x0 != 0 && y0 != 0) {
242 EXTEND_UP_CIP(left, size_max_y - 1, size_max_y);
243 } else if (x0 == 0) {
244 EXTEND_UP_CIP_0(left, size_max_y - 1, size_max_y);
246 EXTEND_UP_CIP(left, size_max_y - 1, size_max_y - 1);
250 EXTEND_RIGHT_CIP(top, 0, size_max_x);
254 // Infer the unavailable samples
255 if (!cand_bottom_left) {
257 EXTEND_DOWN(left, size, size);
258 } else if (cand_up_left) {
259 EXTEND_DOWN(left, 0, 2 * size);
261 } else if (cand_up) {
263 EXTEND_DOWN(left, 0, 2 * size);
266 } else if (cand_up_right) {
267 EXTEND_LEFT(top, size, size);
269 EXTEND_DOWN(left, 0, 2 * size);
273 } else { // No samples available
274 top[0] = left[-1] = (1 << (BIT_DEPTH - 1));
275 EXTEND_RIGHT(top, 1, 2 * size - 1);
276 EXTEND_DOWN(left, 0, 2 * size);
281 EXTEND_UP(left, size, size);
288 EXTEND_RIGHT(top, 1, size - 1);
290 if (!cand_up_right) {
291 EXTEND_RIGHT(top, size, size);
297 if (c_idx == 0 && mode != INTRA_DC && size != 4) {
298 int intra_hor_ver_dist_thresh[] = { 7, 1, 0 };
299 int min_dist_vert_hor = FFMIN(FFABS((int)(mode - 26U)),
300 FFABS((int)(mode - 10U)));
301 if (min_dist_vert_hor > intra_hor_ver_dist_thresh[log2_size - 3]) {
302 int threshold = 1 << (BIT_DEPTH - 5);
303 if (s->sps->sps_strong_intra_smoothing_enable_flag &&
305 FFABS(top[-1] + top[63] - 2 * top[31]) < threshold &&
306 FFABS(left[-1] + left[63] - 2 * left[31]) < threshold) {
307 // We can't just overwrite values in top because it could be
308 // a pointer into src
309 filtered_top[-1] = top[-1];
310 filtered_top[63] = top[63];
311 for (i = 0; i < 63; i++)
312 filtered_top[i] = ((64 - (i + 1)) * top[-1] +
313 (i + 1) * top[63] + 32) >> 6;
314 for (i = 0; i < 63; i++)
315 left[i] = ((64 - (i + 1)) * left[-1] +
316 (i + 1) * left[63] + 32) >> 6;
319 filtered_left[2 * size - 1] = left[2 * size - 1];
320 filtered_top[2 * size - 1] = top[2 * size - 1];
321 for (i = 2 * size - 2; i >= 0; i--)
322 filtered_left[i] = (left[i + 1] + 2 * left[i] +
323 left[i - 1] + 2) >> 2;
325 filtered_left[-1] = (left[0] + 2 * left[-1] + top[0] + 2) >> 2;
326 for (i = 2 * size - 2; i >= 0; i--)
327 filtered_top[i] = (top[i + 1] + 2 * top[i] +
328 top[i - 1] + 2) >> 2;
329 left = filtered_left;
337 s->hpc.pred_planar[log2_size - 2]((uint8_t *)src, (uint8_t *)top,
338 (uint8_t *)left, stride);
341 s->hpc.pred_dc((uint8_t *)src, (uint8_t *)top,
342 (uint8_t *)left, stride, log2_size, c_idx);
345 s->hpc.pred_angular[log2_size - 2]((uint8_t *)src, (uint8_t *)top,
346 (uint8_t *)left, stride, c_idx,
352 static void FUNC(pred_planar_0)(uint8_t *_src, const uint8_t *_top,
353 const uint8_t *_left,
357 pixel *src = (pixel *)_src;
358 const pixel *top = (const pixel *)_top;
359 const pixel *left = (const pixel *)_left;
360 for (y = 0; y < 4; y++)
361 for (x = 0; x < 4; x++)
362 POS(x, y) = ((3 - x) * left[y] + (x + 1) * top[4] +
363 (3 - y) * top[x] + (y + 1) * left[4] + 4) >> 3;
366 static void FUNC(pred_planar_1)(uint8_t *_src, const uint8_t *_top,
367 const uint8_t *_left, ptrdiff_t stride)
370 pixel *src = (pixel *)_src;
371 const pixel *top = (const pixel *)_top;
372 const pixel *left = (const pixel *)_left;
373 for (y = 0; y < 8; y++)
374 for (x = 0; x < 8; x++)
375 POS(x, y) = ((7 - x) * left[y] + (x + 1) * top[8] +
376 (7 - y) * top[x] + (y + 1) * left[8] + 8) >> 4;
379 static void FUNC(pred_planar_2)(uint8_t *_src, const uint8_t *_top,
380 const uint8_t *_left, ptrdiff_t stride)
383 pixel *src = (pixel *)_src;
384 const pixel *top = (const pixel *)_top;
385 const pixel *left = (const pixel *)_left;
386 for (y = 0; y < 16; y++)
387 for (x = 0; x < 16; x++)
388 POS(x, y) = ((15 - x) * left[y] + (x + 1) * top[16] +
389 (15 - y) * top[x] + (y + 1) * left[16] + 16) >> 5;
392 static void FUNC(pred_planar_3)(uint8_t *_src, const uint8_t *_top,
393 const uint8_t *_left, ptrdiff_t stride)
396 pixel *src = (pixel *)_src;
397 const pixel *top = (const pixel *)_top;
398 const pixel *left = (const pixel *)_left;
399 for (y = 0; y < 32; y++)
400 for (x = 0; x < 32; x++)
401 POS(x, y) = ((31 - x) * left[y] + (x + 1) * top[32] +
402 (31 - y) * top[x] + (y + 1) * left[32] + 32) >> 6;
405 static void FUNC(pred_dc)(uint8_t *_src, const uint8_t *_top,
406 const uint8_t *_left,
407 ptrdiff_t stride, int log2_size, int c_idx)
410 int size = (1 << log2_size);
411 pixel *src = (pixel *)_src;
412 const pixel *top = (const pixel *)_top;
413 const pixel *left = (const pixel *)_left;
416 for (i = 0; i < size; i++)
417 dc += left[i] + top[i];
419 dc >>= log2_size + 1;
421 a = PIXEL_SPLAT_X4(dc);
423 for (i = 0; i < size; i++)
424 for (j = 0; j < size / 4; j++)
425 AV_WN4PA(&POS(j * 4, i), a);
427 if (c_idx == 0 && size < 32) {
428 POS(0, 0) = (left[0] + 2 * dc + top[0] + 2) >> 2;
429 for (x = 1; x < size; x++)
430 POS(x, 0) = (top[x] + 3 * dc + 2) >> 2;
431 for (y = 1; y < size; y++)
432 POS(0, y) = (left[y] + 3 * dc + 2) >> 2;
436 static av_always_inline void FUNC(pred_angular)(uint8_t *_src,
438 const uint8_t *_left,
439 ptrdiff_t stride, int c_idx,
443 pixel *src = (pixel *)_src;
444 const pixel *top = (const pixel *)_top;
445 const pixel *left = (const pixel *)_left;
447 static const int intra_pred_angle[] = {
448 32, 26, 21, 17, 13, 9, 5, 2, 0, -2, -5, -9, -13, -17, -21, -26, -32,
449 -26, -21, -17, -13, -9, -5, -2, 0, 2, 5, 9, 13, 17, 21, 26, 32
451 static const int inv_angle[] = {
452 -4096, -1638, -910, -630, -482, -390, -315, -256, -315, -390, -482,
453 -630, -910, -1638, -4096
456 int angle = intra_pred_angle[mode - 2];
457 pixel ref_array[3 * MAX_TB_SIZE + 1];
458 pixel *ref_tmp = ref_array + size;
460 int last = (size * angle) >> 5;
464 if (angle < 0 && last < -1) {
465 for (x = 0; x <= size; x++)
466 ref_tmp[x] = top[x - 1];
467 for (x = last; x <= -1; x++)
468 ref_tmp[x] = left[-1 + ((x * inv_angle[mode - 11] + 128) >> 8)];
472 for (y = 0; y < size; y++) {
473 int idx = ((y + 1) * angle) >> 5;
474 int fact = ((y + 1) * angle) & 31;
476 for (x = 0; x < size; x++) {
477 POS(x, y) = ((32 - fact) * ref[x + idx + 1] +
478 fact * ref[x + idx + 2] + 16) >> 5;
481 for (x = 0; x < size; x++)
482 POS(x, y) = ref[x + idx + 1];
485 if (mode == 26 && c_idx == 0 && size < 32) {
486 for (y = 0; y < size; y++)
487 POS(0, y) = av_clip_pixel(top[0] + ((left[y] - left[-1]) >> 1));
491 if (angle < 0 && last < -1) {
492 for (x = 0; x <= size; x++)
493 ref_tmp[x] = left[x - 1];
494 for (x = last; x <= -1; x++)
495 ref_tmp[x] = top[-1 + ((x * inv_angle[mode - 11] + 128) >> 8)];
499 for (x = 0; x < size; x++) {
500 int idx = ((x + 1) * angle) >> 5;
501 int fact = ((x + 1) * angle) & 31;
503 for (y = 0; y < size; y++) {
504 POS(x, y) = ((32 - fact) * ref[y + idx + 1] +
505 fact * ref[y + idx + 2] + 16) >> 5;
508 for (y = 0; y < size; y++)
509 POS(x, y) = ref[y + idx + 1];
512 if (mode == 10 && c_idx == 0 && size < 32) {
513 for (x = 0; x < size; x++)
514 POS(x, 0) = av_clip_pixel(left[0] + ((top[x] - top[-1]) >> 1));
519 static void FUNC(pred_angular_0)(uint8_t *src, const uint8_t *top,
521 ptrdiff_t stride, int c_idx, int mode)
523 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 2);
526 static void FUNC(pred_angular_1)(uint8_t *src, const uint8_t *top,
528 ptrdiff_t stride, int c_idx, int mode)
530 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 3);
533 static void FUNC(pred_angular_2)(uint8_t *src, const uint8_t *top,
535 ptrdiff_t stride, int c_idx, int mode)
537 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 4);
540 static void FUNC(pred_angular_3)(uint8_t *src, const uint8_t *top,
542 ptrdiff_t stride, int c_idx, int mode)
544 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 5);
547 #undef EXTEND_LEFT_CIP
548 #undef EXTEND_RIGHT_CIP
550 #undef EXTEND_DOWN_CIP
559 #undef MIN_TB_ADDR_ZS