1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*
* Copyright © 2018, VideoLAN and dav1d authors
* Copyright © 2018, Two Orioles, LLC
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <stdint.h>
#include <string.h>
#include "common/intops.h"
#include "src/ipred_prepare.h"
static const uint8_t av1_mode_conv[N_INTRA_PRED_MODES]
[2 /* have_left */][2 /* have_top */] =
{
[DC_PRED] = { { DC_128_PRED, TOP_DC_PRED },
{ LEFT_DC_PRED, DC_PRED } },
[PAETH_PRED] = { { DC_128_PRED, VERT_PRED },
{ HOR_PRED, PAETH_PRED } },
};
static const uint8_t av1_mode_to_angle_map[8] = {
90, 180, 45, 135, 113, 157, 203, 67
};
static const struct {
uint8_t needs_left:1;
uint8_t needs_top:1;
uint8_t needs_topleft:1;
uint8_t needs_topright:1;
uint8_t needs_bottomleft:1;
} av1_intra_prediction_edges[N_IMPL_INTRA_PRED_MODES] = {
[DC_PRED] = { .needs_top = 1, .needs_left = 1 },
[VERT_PRED] = { .needs_top = 1 },
[HOR_PRED] = { .needs_left = 1 },
[LEFT_DC_PRED] = { .needs_left = 1 },
[TOP_DC_PRED] = { .needs_top = 1 },
[DC_128_PRED] = { 0 },
[Z1_PRED] = { .needs_top = 1, .needs_topright = 1,
.needs_topleft = 1 },
[Z2_PRED] = { .needs_left = 1, .needs_top = 1, .needs_topleft = 1 },
[Z3_PRED] = { .needs_left = 1, .needs_bottomleft = 1,
.needs_topleft = 1 },
[SMOOTH_PRED] = { .needs_left = 1, .needs_top = 1 },
[SMOOTH_V_PRED] = { .needs_left = 1, .needs_top = 1 },
[SMOOTH_H_PRED] = { .needs_left = 1, .needs_top = 1 },
[PAETH_PRED] = { .needs_left = 1, .needs_top = 1, .needs_topleft = 1 },
[FILTER_PRED] = { .needs_left = 1, .needs_top = 1, .needs_topleft = 1 },
};
enum IntraPredMode
bytefn(dav1d_prepare_intra_edges)(const int x, const int have_left,
const int y, const int have_top,
const int w, const int h,
const enum EdgeFlags edge_flags,
const pixel *const dst,
const ptrdiff_t stride,
const pixel *prefilter_toplevel_sb_edge,
enum IntraPredMode mode, int *const angle,
const int tw, const int th, const int filter_edge,
pixel *const topleft_out HIGHBD_DECL_SUFFIX)
{
const int bitdepth = bitdepth_from_max(bitdepth_max);
assert(y < h && x < w);
switch (mode) {
case VERT_PRED:
case HOR_PRED:
case DIAG_DOWN_LEFT_PRED:
case DIAG_DOWN_RIGHT_PRED:
case VERT_RIGHT_PRED:
case HOR_DOWN_PRED:
case HOR_UP_PRED:
case VERT_LEFT_PRED: {
*angle = av1_mode_to_angle_map[mode - VERT_PRED] + 3 * *angle;
if (*angle <= 90)
mode = *angle < 90 && have_top ? Z1_PRED : VERT_PRED;
else if (*angle < 180)
mode = Z2_PRED;
else
mode = *angle > 180 && have_left ? Z3_PRED : HOR_PRED;
break;
}
case DC_PRED:
case PAETH_PRED:
mode = av1_mode_conv[mode][have_left][have_top];
break;
default:
break;
}
const pixel *dst_top;
if (have_top &&
(av1_intra_prediction_edges[mode].needs_top ||
av1_intra_prediction_edges[mode].needs_topleft ||
(av1_intra_prediction_edges[mode].needs_left && !have_left)))
{
if (prefilter_toplevel_sb_edge) {
dst_top = &prefilter_toplevel_sb_edge[x * 4];
} else {
dst_top = &dst[-PXSTRIDE(stride)];
}
}
if (av1_intra_prediction_edges[mode].needs_left) {
const int sz = th << 2;
pixel *const left = &topleft_out[-sz];
if (have_left) {
const int px_have = imin(sz, (h - y) << 2);
for (int i = 0; i < px_have; i++)
left[sz - 1 - i] = dst[PXSTRIDE(stride) * i - 1];
if (px_have < sz)
pixel_set(left, left[sz - px_have], sz - px_have);
} else {
pixel_set(left, have_top ? *dst_top : ((1 << bitdepth) >> 1) + 1, sz);
}
if (av1_intra_prediction_edges[mode].needs_bottomleft) {
const int have_bottomleft = (!have_left || y + th >= h) ? 0 :
(edge_flags & EDGE_I444_LEFT_HAS_BOTTOM);
if (have_bottomleft) {
const int px_have = imin(sz, (h - y - th) << 2);
for (int i = 0; i < px_have; i++)
left[-(i + 1)] = dst[(sz + i) * PXSTRIDE(stride) - 1];
if (px_have < sz)
pixel_set(left - sz, left[-px_have], sz - px_have);
} else {
pixel_set(left - sz, left[0], sz);
}
}
}
if (av1_intra_prediction_edges[mode].needs_top) {
const int sz = tw << 2;
pixel *const top = &topleft_out[1];
if (have_top) {
const int px_have = imin(sz, (w - x) << 2);
pixel_copy(top, dst_top, px_have);
if (px_have < sz)
pixel_set(top + px_have, top[px_have - 1], sz - px_have);
} else {
pixel_set(top, have_left ? dst[-1] : ((1 << bitdepth) >> 1) - 1, sz);
}
if (av1_intra_prediction_edges[mode].needs_topright) {
const int have_topright = (!have_top || x + tw >= w) ? 0 :
(edge_flags & EDGE_I444_TOP_HAS_RIGHT);
if (have_topright) {
const int px_have = imin(sz, (w - x - tw) << 2);
pixel_copy(top + sz, &dst_top[sz], px_have);
if (px_have < sz)
pixel_set(top + sz + px_have, top[sz + px_have - 1],
sz - px_have);
} else {
pixel_set(top + sz, top[sz - 1], sz);
}
}
}
if (av1_intra_prediction_edges[mode].needs_topleft) {
if (have_left)
*topleft_out = have_top ? dst_top[-1] : dst[-1];
else
*topleft_out = have_top ? *dst_top : (1 << bitdepth) >> 1;
if (mode == Z2_PRED && tw + th >= 6 && filter_edge)
*topleft_out = ((topleft_out[-1] + topleft_out[1]) * 5 +
topleft_out[0] * 6 + 8) >> 4;
}
return mode;
}
|
