Repository navigation
Expand file tree
/
Copy pathframe.rs
More file actions
302 lines (271 loc) · 9.17 KB
/
Copy pathframe.rs
File metadata and controls
302 lines (271 loc) · 9.17 KB
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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
//! Decoded frame storage and the per-8x8 mode info grid.
use crate::tables::{INTRA_FRAME, NONE};
/// A motion vector in 1/8 sample units.
#[derive(Clone, Copy, Debug, Default, PartialEq, Eq)]
pub struct Mv {
pub row: i16,
pub col: i16,
}
impl Mv {
pub const ZERO: Mv = Mv { row: 0, col: 0 };
pub fn new(row: i32, col: i32) -> Mv {
Mv { row: row as i16, col: col as i16 }
}
}
/// Mode info of one 8x8 block (the arrays of 6.4.4: Skips, TxSizes, MiSizes, YModes, SubModes,
/// RefFrames, InterpFilters, Mvs / SubMvs).
#[derive(Clone, Copy, Debug)]
pub struct MiInfo {
pub sb_size: u8,
pub skip: bool,
pub tx_size: u8,
pub y_mode: u8,
pub sub_modes: [u8; 4],
pub seg_id: u8,
pub ref_frame: [i8; 2],
pub interp_filter: u8,
/// SubMvs[refList][b]; Mvs[refList] is `mv[refList][3]`.
pub mv: [[Mv; 4]; 2],
}
impl Default for MiInfo {
fn default() -> Self {
MiInfo {
sb_size: 0,
skip: false,
tx_size: 0,
y_mode: 0,
sub_modes: [0; 4],
seg_id: 0,
ref_frame: [INTRA_FRAME, NONE],
interp_filter: 0,
mv: [[Mv::ZERO; 4]; 2],
}
}
}
/// Mode info of a whole frame (MiRows x MiCols).
#[derive(Clone, Debug, Default)]
pub struct MiGrid {
pub cols: usize,
pub rows: usize,
pub mi: Vec<MiInfo>,
}
impl MiGrid {
#[inline]
pub fn at(&self, r: usize, c: usize) -> &MiInfo {
&self.mi[r * self.cols + c]
}
}
/// Scratch rows above the samples of every band: the loop filter of superblock row r reads 8
/// and modifies up to 7 rows of row r - 1 (the 16-wide filter of the horizontal edges on top of
/// row r), so those rows are copied there while row r is filtered (see `decoder::post`).
pub const BAND_PAD: usize = 8;
/// One superblock row (64 luma rows) of a frame: per plane `BAND_PAD` scratch rows followed by
/// the band's rows, all `Frame::strides[p]` samples wide.
pub struct Band {
pub planes: [Vec<u16>; 3],
}
/// Frame metadata from the frame header.
#[derive(Clone, Copy, Debug)]
pub struct FrameInfo {
pub width: u32,
pub height: u32,
pub ss_x: bool,
pub ss_y: bool,
pub bit_depth: u8,
pub color_space: u8,
pub color_range: bool,
pub render_width: u32,
pub render_height: u32,
pub key: bool,
pub intra_only: bool,
}
/// A decoded frame (also used as reference). Its samples are published one superblock row
/// ("band") at a time, once loop filtered, so that later frames can predict from the finished
/// top of a frame while its bottom is still being filtered (frame threading).
pub struct Frame {
pub info: FrameInfo,
/// Allocated plane widths (whole superblocks) = row strides.
pub strides: [usize; 3],
/// Rows per band of each plane.
pub band_h: [usize; 3],
/// Visible (cropped) plane sizes.
pub vis: [(usize, usize); 3],
bands: Box<[std::sync::OnceLock<Band>]>,
pools: std::sync::Arc<Pools>,
}
impl Frame {
pub fn new(info: FrameInfo, pools: std::sync::Arc<Pools>) -> Frame {
let geo = plane_geometry(info.width, info.height, info.ss_x, info.ss_y);
let sb_rows = (info.height as usize).div_ceil(64);
Frame {
info,
strides: geo.map(|g| g.0),
band_h: [64, 64 >> info.ss_y as usize, 64 >> info.ss_y as usize],
vis: geo.map(|g| (g.2, g.3)),
bands: (0..sb_rows).map(|_| std::sync::OnceLock::new()).collect(),
pools,
}
}
pub fn sb_rows(&self) -> usize {
self.bands.len()
}
/// A band buffer for this frame's geometry (recycled memory, contents unspecified).
pub fn new_band(&self) -> Band {
Band { planes: std::array::from_fn(|p| self.pools.bands.take_any((self.band_h[p] + BAND_PAD) * self.strides[p], 0)) }
}
/// Publish band `r` (ignored if already published).
pub fn publish(&self, r: usize, band: Band) {
if let Err(b) = self.bands[r].set(band) {
for p in b.planes {
self.pools.bands.put(p);
}
}
}
pub fn is_published(&self, r: usize) -> bool {
self.bands[r].get().is_some()
}
pub fn is_complete(&self) -> bool {
self.bands.iter().all(|b| b.get().is_some())
}
/// Band `r`, waiting until it has been published.
#[inline]
pub fn band(&self, r: usize) -> &Band {
#[cfg(feature = "threads")]
{
self.bands[r].wait()
}
#[cfg(not(feature = "threads"))]
{
// Bands are decoded in order before use; an unpublished one reads as empty.
static EMPTY: Band = Band { planes: [Vec::new(), Vec::new(), Vec::new()] };
self.bands[r].get().unwrap_or(&EMPTY)
}
}
/// Row `y` of plane `p` (all `strides[p]` samples), waiting until it is final.
#[inline]
pub fn row(&self, p: usize, y: usize) -> &[u16] {
let bh = self.band_h[p];
let s = self.strides[p];
let o = (y % bh + BAND_PAD) * s;
&self.band(y / bh).planes[p][o..o + s]
}
/// Rows `y0..y1` of plane `p` as one slice with stride `strides[p]` when they lie in one band:
/// (band samples, offset of row y0).
#[inline]
pub fn span(&self, p: usize, y0: usize, y1: usize) -> Option<(&[u16], usize)> {
let bh = self.band_h[p];
let r = y0 / bh;
if (y1 - 1) / bh != r {
return None;
}
Some((&self.band(r).planes[p], (y0 % bh + BAND_PAD) * self.strides[p]))
}
/// A complete frame from full planes (tests).
#[cfg(test)]
pub fn from_planes(info: FrameInfo, planes: [&[u16]; 3]) -> Frame {
let f = Frame::new(info, Default::default());
for r in 0..f.sb_rows() {
let mut b = f.new_band();
for p in 0..3 {
let (s, bh) = (f.strides[p], f.band_h[p]);
for k in 0..bh {
let y = r * bh + k;
if let Some(src) = planes[p].get(y * s..y * s + s) {
b.planes[p][(k + BAND_PAD) * s..(k + BAND_PAD + 1) * s].copy_from_slice(src);
}
}
}
f.publish(r, b);
}
f
}
}
impl Drop for Frame {
fn drop(&mut self) {
for b in std::mem::take(&mut self.bands).into_vec().into_iter().filter_map(|b| b.into_inner()) {
for p in b.planes {
self.pools.bands.put(p);
}
}
}
}
/// Geometry of the frame planes: allocation sizes for (MiCols, MiRows) rounded to superblocks.
pub fn plane_geometry(width: u32, height: u32, ss_x: bool, ss_y: bool) -> [(usize, usize, usize, usize); 3] {
let sb_cols = (width as usize).div_ceil(64);
let sb_rows = (height as usize).div_ceil(64);
let (aw, ah) = (sb_cols * 64, sb_rows * 64);
let (sx, sy) = (ss_x as usize, ss_y as usize);
let cw = (width as usize + sx) >> sx;
let ch = (height as usize + sy) >> sy;
[(aw, ah, width as usize, height as usize), (aw >> sx, ah >> sy, cw, ch), (aw >> sx, ah >> sy, cw, ch)]
}
/// Recycled buffers (strip / frame planes, mode info), so that steady-state decoding does not
/// allocate (and page-fault) megabytes per frame.
pub struct Pool<T> {
bufs: std::sync::Mutex<Vec<Vec<T>>>,
max: usize,
}
impl<T> Default for Pool<T> {
fn default() -> Self {
Pool::with_max(32)
}
}
impl<T> Pool<T> {
/// A pool keeping at most `max` buffers.
pub fn with_max(max: usize) -> Self {
Pool { bufs: Default::default(), max }
}
}
impl<T: Clone> Pool<T> {
/// A buffer of `len` elements with unspecified contents (recycled memory when available;
/// `fill` only initialises fresh memory).
pub fn take_any(&self, len: usize, fill: T) -> Vec<T> {
let found = {
let mut b = self.bufs.lock().unwrap_or_else(std::sync::PoisonError::into_inner);
b.iter().position(|v| v.len() >= len).map(|i| b.swap_remove(i))
};
match found {
Some(mut v) => {
v.truncate(len);
v
}
None => vec![fill; len],
}
}
/// A buffer of `len` copies of `fill` (recycled memory when available).
pub fn take(&self, len: usize, fill: T) -> Vec<T> {
let found = {
let mut b = self.bufs.lock().unwrap_or_else(std::sync::PoisonError::into_inner);
b.iter().position(|v| v.capacity() >= len).map(|i| b.swap_remove(i))
};
match found {
Some(mut v) => {
v.clear();
v.resize(len, fill);
v
}
None => vec![fill; len],
}
}
pub fn put(&self, v: Vec<T>) {
if v.capacity() == 0 {
return;
}
let mut b = self.bufs.lock().unwrap_or_else(std::sync::PoisonError::into_inner);
if b.len() < self.max {
b.push(v);
}
}
}
/// The decoder's buffer pools.
pub struct Pools {
pub samples: Pool<u16>,
/// Frame bands (many small buffers per frame).
pub bands: Pool<u16>,
pub mi: Pool<MiInfo>,
}
impl Default for Pools {
fn default() -> Self {
Pools { samples: Pool::default(), bands: Pool::with_max(1024), mi: Pool::default() }
}
}