4 * Copyright (C) 2012 - 2013 Guillaume Martres
6 * This file is part of Libav.
8 * Libav 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 * Libav 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 Libav; 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"
27 #include "bit_depth_template.c"
29 #define POS(x, y) src[(x) + stride * (y)]
31 static av_always_inline void FUNC(intra_pred)(HEVCContext *s, int x0, int y0,
32 int log2_size, int c_idx)
35 ((x) >> s->sps->log2_min_pu_size)
37 (s->ref->tab_mvf[(x) + (y) * min_pu_width])
38 #define MVF_PU(x, y) \
39 MVF(PU(x0 + ((x) << hshift)), PU(y0 + ((y) << vshift)))
40 #define IS_INTRA(x, y) \
42 #define MIN_TB_ADDR_ZS(x, y) \
43 s->pps->min_tb_addr_zs[(y) * s->sps->min_tb_width + (x)]
44 #define EXTEND_LEFT(ptr, start, length) \
45 for (i = (start); i > (start) - (length); i--) \
47 #define EXTEND_RIGHT(ptr, start, length) \
48 for (i = (start); i < (start) + (length); i++) \
50 #define EXTEND_UP(ptr, start, length) EXTEND_LEFT(ptr, start, length)
51 #define EXTEND_DOWN(ptr, start, length) EXTEND_RIGHT(ptr, start, length)
52 #define EXTEND_LEFT_CIP(ptr, start, length) \
53 for (i = (start); i > (start) - (length); i--) \
54 if (!IS_INTRA(i - 1, -1)) \
56 #define EXTEND_RIGHT_CIP(ptr, start, length) \
57 for (i = (start); i < (start) + (length); i++) \
58 if (!IS_INTRA(i, -1)) \
60 #define EXTEND_UP_CIP(ptr, start, length) \
61 for (i = (start); i > (start) - (length); i--) \
62 if (!IS_INTRA(-1, i - 1)) \
64 #define EXTEND_UP_CIP_0(ptr, start, length) \
65 for (i = (start); i > (start) - (length); i--) \
67 #define EXTEND_DOWN_CIP(ptr, start, length) \
68 for (i = (start); i < (start) + (length); i++) \
69 if (!IS_INTRA(-1, i)) \
71 HEVCLocalContext *lc = &s->HEVClc;
73 int hshift = s->sps->hshift[c_idx];
74 int vshift = s->sps->vshift[c_idx];
75 int size = (1 << log2_size);
76 int size_in_luma = size << hshift;
77 int size_in_tbs = size_in_luma >> s->sps->log2_min_tb_size;
80 int x_tb = x0 >> s->sps->log2_min_tb_size;
81 int y_tb = y0 >> s->sps->log2_min_tb_size;
82 int cur_tb_addr = MIN_TB_ADDR_ZS(x_tb, y_tb);
84 ptrdiff_t stride = s->frame->linesize[c_idx] / sizeof(pixel);
85 pixel *src = (pixel*)s->frame->data[c_idx] + x + y * stride;
87 int min_pu_width = s->sps->min_pu_width;
89 enum IntraPredMode mode = c_idx ? lc->pu.intra_pred_mode_c :
90 lc->tu.cur_intra_pred_mode;
92 pixel left_array[2 * MAX_TB_SIZE + 1];
93 pixel filtered_left_array[2 * MAX_TB_SIZE + 1];
94 pixel top_array[2 * MAX_TB_SIZE + 1];
95 pixel filtered_top_array[2 * MAX_TB_SIZE + 1];
97 pixel *left = left_array + 1;
98 pixel *top = top_array + 1;
99 pixel *filtered_left = filtered_left_array + 1;
100 pixel *filtered_top = filtered_top_array + 1;
102 int cand_bottom_left = lc->na.cand_bottom_left && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb - 1, y_tb + size_in_tbs);
103 int cand_left = lc->na.cand_left;
104 int cand_up_left = lc->na.cand_up_left;
105 int cand_up = lc->na.cand_up;
106 int cand_up_right = lc->na.cand_up_right && cur_tb_addr > MIN_TB_ADDR_ZS(x_tb + size_in_tbs, y_tb - 1);
108 int bottom_left_size = (FFMIN(y0 + 2 * size_in_luma, s->sps->height) -
109 (y0 + size_in_luma)) >> vshift;
110 int top_right_size = (FFMIN(x0 + 2 * size_in_luma, s->sps->width) -
111 (x0 + size_in_luma)) >> hshift;
113 if (s->pps->constrained_intra_pred_flag == 1) {
114 int size_in_luma_pu = PU(size_in_luma);
115 int on_pu_edge_x = !(x0 & ((1 << s->sps->log2_min_pu_size) - 1));
116 int on_pu_edge_y = !(y0 & ((1 << s->sps->log2_min_pu_size) - 1));
117 if (!size_in_luma_pu)
119 if (cand_bottom_left == 1 && on_pu_edge_x) {
120 int x_left_pu = PU(x0 - 1);
121 int y_bottom_pu = PU(y0 + size_in_luma);
122 int max = FFMIN(size_in_luma_pu, s->sps->min_pu_height - y_bottom_pu);
123 cand_bottom_left = 0;
124 for (i = 0; i < max; i++)
125 cand_bottom_left |= MVF(x_left_pu, y_bottom_pu + i).is_intra;
127 if (cand_left == 1 && on_pu_edge_x) {
128 int x_left_pu = PU(x0 - 1);
129 int y_left_pu = PU(y0);
130 int max = FFMIN(size_in_luma_pu, s->sps->min_pu_height - y_left_pu);
132 for (i = 0; i < max; i++)
133 cand_left |= MVF(x_left_pu, y_left_pu + i).is_intra;
135 if (cand_up_left == 1) {
136 int x_left_pu = PU(x0 - 1);
137 int y_top_pu = PU(y0 - 1);
138 cand_up_left = MVF(x_left_pu, y_top_pu).is_intra;
140 if (cand_up == 1 && on_pu_edge_y) {
141 int x_top_pu = PU(x0);
142 int y_top_pu = PU(y0 - 1);
143 int max = FFMIN(size_in_luma_pu, s->sps->min_pu_width - x_top_pu);
145 for (i = 0; i < max; i++)
146 cand_up |= MVF(x_top_pu + i, y_top_pu).is_intra;
148 if (cand_up_right == 1 && on_pu_edge_y) {
149 int y_top_pu = PU(y0 - 1);
150 int x_right_pu = PU(x0 + size_in_luma);
151 int max = FFMIN(size_in_luma_pu, s->sps->min_pu_width - x_right_pu);
153 for (i = 0; i < max; i++)
154 cand_up_right |= MVF(x_right_pu + i, y_top_pu).is_intra;
156 for (i = 0; i < 2 * MAX_TB_SIZE; i++) {
161 if (cand_bottom_left) {
162 for (i = size + bottom_left_size; i < (size << 1); i++)
163 if (IS_INTRA(-1, size + bottom_left_size - 1) ||
164 !s->pps->constrained_intra_pred_flag)
165 left[i] = POS(-1, size + bottom_left_size - 1);
166 for (i = size + bottom_left_size - 1; i >= size; i--)
167 if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)
168 left[i] = POS(-1, i);
171 for (i = size - 1; i >= 0; i--)
172 if (IS_INTRA(-1, i) || !s->pps->constrained_intra_pred_flag)
173 left[i] = POS(-1, i);
175 if (IS_INTRA(-1, -1) || !s->pps->constrained_intra_pred_flag) {
176 left[-1] = POS(-1, -1);
180 for (i = size - 1; i >= 0; i--)
181 if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)
184 for (i = size + top_right_size; i < (size << 1); i++)
185 if (IS_INTRA(size + top_right_size - 1, -1) ||
186 !s->pps->constrained_intra_pred_flag)
187 top[i] = POS(size + top_right_size - 1, -1);
188 for (i = size + top_right_size - 1; i >= size; i--)
189 if (IS_INTRA(i, -1) || !s->pps->constrained_intra_pred_flag)
193 if (s->pps->constrained_intra_pred_flag == 1) {
194 if (cand_bottom_left || cand_left || cand_up_left || cand_up || cand_up_right) {
195 int size_max_x = x0 + ((2 * size) << hshift) < s->sps->width ?
196 2 * size : (s->sps->width - x0) >> hshift;
197 int size_max_y = y0 + ((2 * size) << vshift) < s->sps->height ?
198 2 * size : (s->sps->height - y0) >> vshift;
199 int j = size + (cand_bottom_left? bottom_left_size: 0) -1;
200 if (!cand_up_right) {
201 size_max_x = x0 + ((size) << hshift) < s->sps->width ?
202 size : (s->sps->width - x0) >> hshift;
204 if (!cand_bottom_left) {
205 size_max_y = y0 + (( size) << vshift) < s->sps->height ?
206 size : (s->sps->height - y0) >> vshift;
208 if (cand_bottom_left || cand_left || cand_up_left) {
209 while (j > -1 && !IS_INTRA(-1, j))
211 if (!IS_INTRA(-1, j)) {
213 while (j < size_max_x && !IS_INTRA(j, -1))
215 EXTEND_LEFT_CIP(top, j, j + 1);
221 while (j < size_max_x && !IS_INTRA(j, -1))
225 EXTEND_LEFT_CIP(top, j, j + 1);
227 EXTEND_LEFT_CIP(top, j, j);
233 if (cand_bottom_left || cand_left) {
234 EXTEND_DOWN_CIP(left, j, size_max_y - j);
237 EXTEND_DOWN(left, 0, size);
239 if (!cand_bottom_left) {
240 EXTEND_DOWN(left, size, size);
242 if (x0 != 0 && y0 != 0) {
243 EXTEND_UP_CIP(left, size_max_y - 1, size_max_y);
244 } else if (x0 == 0) {
245 EXTEND_UP_CIP_0(left, size_max_y - 1, size_max_y);
247 EXTEND_UP_CIP(left, size_max_y - 1, size_max_y - 1);
251 EXTEND_RIGHT_CIP(top, 0, size_max_x);
255 // Infer the unavailable samples
256 if (!cand_bottom_left) {
258 EXTEND_DOWN(left, size, size);
259 } else if (cand_up_left) {
260 EXTEND_DOWN(left, 0, 2 * size);
262 } else if (cand_up) {
264 EXTEND_DOWN(left, 0, 2 * size);
267 } else if (cand_up_right) {
268 EXTEND_LEFT(top, size, size);
270 EXTEND_DOWN(left, 0, 2 * size);
274 } else { // No samples available
275 top[0] = left[-1] = (1 << (BIT_DEPTH - 1));
276 EXTEND_RIGHT(top, 1, 2 * size - 1);
277 EXTEND_DOWN(left, 0, 2 * size);
282 EXTEND_UP(left, size, size);
289 EXTEND_RIGHT(top, 1, size - 1);
291 if (!cand_up_right) {
292 EXTEND_RIGHT(top, size, size);
298 if (c_idx == 0 && mode != INTRA_DC && size != 4) {
299 int intra_hor_ver_dist_thresh[] = { 7, 1, 0 };
300 int min_dist_vert_hor = FFMIN(FFABS((int)mode - 26),
301 FFABS((int)mode - 10));
302 if (min_dist_vert_hor > intra_hor_ver_dist_thresh[log2_size - 3]) {
303 int threshold = 1 << (BIT_DEPTH - 5);
304 if (s->sps->sps_strong_intra_smoothing_enable_flag &&
306 FFABS(top[-1] + top[63] - 2 * top[31]) < threshold &&
307 FFABS(left[-1] + left[63] - 2 * left[31]) < threshold) {
308 // We can't just overwrite values in top because it could be
309 // a pointer into src
310 filtered_top[-1] = top[-1];
311 filtered_top[63] = top[63];
312 for (i = 0; i < 63; i++)
313 filtered_top[i] = ((64 - (i + 1)) * top[-1] +
314 (i + 1) * top[63] + 32) >> 6;
315 for (i = 0; i < 63; i++)
316 left[i] = ((64 - (i + 1)) * left[-1] +
317 (i + 1) * left[63] + 32) >> 6;
320 filtered_left[2 * size - 1] = left[2 * size - 1];
321 filtered_top[2 * size - 1] = top[2 * size - 1];
322 for (i = 2 * size - 2; i >= 0; i--)
323 filtered_left[i] = (left[i + 1] + 2 * left[i] +
324 left[i - 1] + 2) >> 2;
326 filtered_left[-1] = (left[0] + 2 * left[-1] + top[0] + 2) >> 2;
327 for (i = 2 * size - 2; i >= 0; i--)
328 filtered_top[i] = (top[i + 1] + 2 * top[i] +
329 top[i - 1] + 2) >> 2;
330 left = filtered_left;
338 s->hpc.pred_planar[log2_size - 2]((uint8_t *)src, (uint8_t *)top,
339 (uint8_t *)left, stride);
342 s->hpc.pred_dc((uint8_t *)src, (uint8_t *)top,
343 (uint8_t *)left, stride, log2_size, c_idx);
346 s->hpc.pred_angular[log2_size - 2]((uint8_t *)src, (uint8_t *)top,
347 (uint8_t *)left, stride, c_idx,
353 #define INTRA_PRED(size) \
354 static void FUNC(intra_pred_ ## size)(HEVCContext *s, int x0, int y0, int c_idx) \
356 FUNC(intra_pred)(s, x0, y0, size, c_idx); \
366 static av_always_inline void FUNC(pred_planar)(uint8_t *_src, const uint8_t *_top,
367 const uint8_t *_left, ptrdiff_t stride,
371 pixel *src = (pixel *)_src;
372 const pixel *top = (const pixel *)_top;
373 const pixel *left = (const pixel *)_left;
374 int size = 1 << trafo_size;
375 for (y = 0; y < size; y++)
376 for (x = 0; x < size; x++)
377 POS(x, y) = ((size - 1 - x) * left[y] + (x + 1) * top[size] +
378 (size - 1 - y) * top[x] + (y + 1) * left[size] + size) >> (trafo_size + 1);
381 #define PRED_PLANAR(size)\
382 static void FUNC(pred_planar_ ## size)(uint8_t *src, const uint8_t *top, \
383 const uint8_t *left, ptrdiff_t stride) \
385 FUNC(pred_planar)(src, top, left, stride, size + 2); \
395 static void FUNC(pred_dc)(uint8_t *_src, const uint8_t *_top,
396 const uint8_t *_left,
397 ptrdiff_t stride, int log2_size, int c_idx)
400 int size = (1 << log2_size);
401 pixel *src = (pixel *)_src;
402 const pixel *top = (const pixel *)_top;
403 const pixel *left = (const pixel *)_left;
406 for (i = 0; i < size; i++)
407 dc += left[i] + top[i];
409 dc >>= log2_size + 1;
411 a = PIXEL_SPLAT_X4(dc);
413 for (i = 0; i < size; i++)
414 for (j = 0; j < size / 4; j++)
415 AV_WN4PA(&POS(j * 4, i), a);
417 if (c_idx == 0 && size < 32) {
418 POS(0, 0) = (left[0] + 2 * dc + top[0] + 2) >> 2;
419 for (x = 1; x < size; x++)
420 POS(x, 0) = (top[x] + 3 * dc + 2) >> 2;
421 for (y = 1; y < size; y++)
422 POS(0, y) = (left[y] + 3 * dc + 2) >> 2;
426 static av_always_inline void FUNC(pred_angular)(uint8_t *_src,
428 const uint8_t *_left,
429 ptrdiff_t stride, int c_idx,
433 pixel *src = (pixel *)_src;
434 const pixel *top = (const pixel *)_top;
435 const pixel *left = (const pixel *)_left;
437 static const int intra_pred_angle[] = {
438 32, 26, 21, 17, 13, 9, 5, 2, 0, -2, -5, -9, -13, -17, -21, -26, -32,
439 -26, -21, -17, -13, -9, -5, -2, 0, 2, 5, 9, 13, 17, 21, 26, 32
441 static const int inv_angle[] = {
442 -4096, -1638, -910, -630, -482, -390, -315, -256, -315, -390, -482,
443 -630, -910, -1638, -4096
446 int angle = intra_pred_angle[mode - 2];
447 pixel ref_array[3 * MAX_TB_SIZE + 1];
448 pixel *ref_tmp = ref_array + size;
450 int last = (size * angle) >> 5;
454 if (angle < 0 && last < -1) {
455 for (x = 0; x <= size; x++)
456 ref_tmp[x] = top[x - 1];
457 for (x = last; x <= -1; x++)
458 ref_tmp[x] = left[-1 + ((x * inv_angle[mode - 11] + 128) >> 8)];
462 for (y = 0; y < size; y++) {
463 int idx = ((y + 1) * angle) >> 5;
464 int fact = ((y + 1) * angle) & 31;
466 for (x = 0; x < size; x++) {
467 POS(x, y) = ((32 - fact) * ref[x + idx + 1] +
468 fact * ref[x + idx + 2] + 16) >> 5;
471 for (x = 0; x < size; x++)
472 POS(x, y) = ref[x + idx + 1];
475 if (mode == 26 && c_idx == 0 && size < 32) {
476 for (y = 0; y < size; y++)
477 POS(0, y) = av_clip_pixel(top[0] + ((left[y] - left[-1]) >> 1));
481 if (angle < 0 && last < -1) {
482 for (x = 0; x <= size; x++)
483 ref_tmp[x] = left[x - 1];
484 for (x = last; x <= -1; x++)
485 ref_tmp[x] = top[-1 + ((x * inv_angle[mode - 11] + 128) >> 8)];
489 for (x = 0; x < size; x++) {
490 int idx = ((x + 1) * angle) >> 5;
491 int fact = ((x + 1) * angle) & 31;
493 for (y = 0; y < size; y++) {
494 POS(x, y) = ((32 - fact) * ref[y + idx + 1] +
495 fact * ref[y + idx + 2] + 16) >> 5;
498 for (y = 0; y < size; y++)
499 POS(x, y) = ref[y + idx + 1];
502 if (mode == 10 && c_idx == 0 && size < 32) {
503 for (x = 0; x < size; x++)
504 POS(x, 0) = av_clip_pixel(left[0] + ((top[x] - top[-1]) >> 1));
509 static void FUNC(pred_angular_0)(uint8_t *src, const uint8_t *top,
511 ptrdiff_t stride, int c_idx, int mode)
513 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 2);
516 static void FUNC(pred_angular_1)(uint8_t *src, const uint8_t *top,
518 ptrdiff_t stride, int c_idx, int mode)
520 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 3);
523 static void FUNC(pred_angular_2)(uint8_t *src, const uint8_t *top,
525 ptrdiff_t stride, int c_idx, int mode)
527 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 4);
530 static void FUNC(pred_angular_3)(uint8_t *src, const uint8_t *top,
532 ptrdiff_t stride, int c_idx, int mode)
534 FUNC(pred_angular)(src, top, left, stride, c_idx, mode, 1 << 5);
537 #undef EXTEND_LEFT_CIP
538 #undef EXTEND_RIGHT_CIP
540 #undef EXTEND_DOWN_CIP
549 #undef MIN_TB_ADDR_ZS