1 use nihav_core::frame::*;
2 use nihav_codec_support::codecs::{MV, ZERO_MV};
3 use super::super::vpcommon::*;
4 use super::super::vp6dsp::*;
5 use super::super::vp6data::*;
10 #[derive(Debug,Clone,Copy,PartialEq)]
11 pub enum MVSearchMode {
17 impl Default for MVSearchMode {
18 fn default() -> Self { MVSearchMode::Hexagon }
21 pub struct ParseError{}
23 impl FromStr for MVSearchMode {
24 type Err = ParseError;
26 #[allow(clippy::single_match)]
27 fn from_str(s: &str) -> Result<Self, Self::Err> {
29 "full" => Ok(MVSearchMode::Full),
30 "dia" => Ok(MVSearchMode::Diamond),
31 "hex" => Ok(MVSearchMode::Hexagon),
32 _ => Err(ParseError{}),
37 impl std::fmt::Display for MVSearchMode {
38 fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
40 MVSearchMode::Full => write!(f, "full"),
41 MVSearchMode::Diamond => write!(f, "dia"),
42 MVSearchMode::Hexagon => write!(f, "hex"),
48 const C1S7: i32 = 64277;
49 const C2S6: i32 = 60547;
50 const C3S5: i32 = 54491;
51 const C4S4: i32 = 46341;
52 const C5S3: i32 = 36410;
53 const C6S2: i32 = 25080;
54 const C7S1: i32 = 12785;
56 fn mul16(a: i32, b: i32) -> i32 {
58 (res + if res < 0 { 0xFFFF } else { 0 }) >> 16
61 macro_rules! fdct_step {
62 ($s0:expr, $s1:expr, $s2:expr, $s3:expr, $s4:expr, $s5:expr, $s6:expr, $s7:expr,
63 $d0:expr, $d1:expr, $d2:expr, $d3:expr, $d4:expr, $d5:expr, $d6:expr, $d7:expr) => {
64 let t_g = i32::from($s0) + i32::from($s7);
65 let t_c = i32::from($s0) - i32::from($s7);
66 let t_a = i32::from($s1) + i32::from($s2);
67 let t_h = i32::from($s1) - i32::from($s2);
68 let t_e1 = i32::from($s3) + i32::from($s4);
69 let t_d = i32::from($s3) - i32::from($s4);
70 let t_f = i32::from($s5) + i32::from($s6);
71 let t_b = i32::from($s5) - i32::from($s6);
80 $d2 = (mul16(C2S6, t_g) + mul16(C6S2, t_h)).max(-32768).min(32767) as i16;
81 $d6 = (mul16(C6S2, t_g) - mul16(C2S6, t_h)).max(-32768).min(32767) as i16;
82 $d0 = mul16(C4S4, t_e + t_f).max(-32768).min(32767) as i16;
83 $d4 = mul16(C4S4, t_e - t_f).max(-32768).min(32767) as i16;
84 let t_a = t_c + mul16(C4S4, t_a1);
85 let t_c = t_c - mul16(C4S4, t_a1);
86 let t_b = t_d + mul16(C4S4, t_b1);
87 let t_d = t_d - mul16(C4S4, t_b1);
88 $d3 = (mul16(C3S5, t_c) - mul16(C5S3, t_d)).max(-32768).min(32767) as i16;
89 $d5 = (mul16(C5S3, t_c) + mul16(C3S5, t_d)).max(-32768).min(32767) as i16;
90 $d1 = (mul16(C1S7, t_a) + mul16(C7S1, t_b)).max(-32768).min(32767) as i16;
91 $d7 = (mul16(C7S1, t_a) - mul16(C1S7, t_b)).max(-32768).min(32767) as i16;
95 #[allow(clippy::erasing_op)]
96 pub fn vp_fdct(blk: &mut [i16; 64]) {
97 for row in blk.chunks_mut(8) {
98 fdct_step!(row[0], row[1], row[2], row[3], row[4], row[5], row[6], row[7],
99 row[0], row[1], row[2], row[3], row[4], row[5], row[6], row[7]);
102 fdct_step!(blk[0 * 8 + i], blk[1 * 8 + i], blk[2 * 8 + i], blk[3 * 8 + i],
103 blk[4 * 8 + i], blk[5 * 8 + i], blk[6 * 8 + i], blk[7 * 8 + i],
104 blk[0 * 8 + i], blk[1 * 8 + i], blk[2 * 8 + i], blk[3 * 8 + i],
105 blk[4 * 8 + i], blk[5 * 8 + i], blk[6 * 8 + i], blk[7 * 8 + i]);
109 const MAX_DIST: u32 = std::u32::MAX;
110 const DIST_THRESH: u32 = 256;
113 fn from_pixels(self) -> Self;
116 impl FromPixels for MV {
117 fn from_pixels(self) -> MV {
118 MV { x: self.x * 4, y: self.y * 4 }
123 fn search_mb(&mut self, mv_est: &mut MVEstimator, cur_blk: &[[u8; 64]; 6], mb_x: usize, mb_y: usize) -> (MV, u32);
124 fn search_blk(&mut self, mv_est: &mut MVEstimator, cur_blk: &[u8; 64], xpos: usize, ypos: usize) -> (MV, u32);
127 pub struct FullMVSearch {}
130 pub fn new() -> Self { Self{} }
133 impl MVSearch for FullMVSearch {
134 fn search_mb(&mut self, mv_est: &mut MVEstimator, cur_blk: &[[u8; 64]; 6], mb_x: usize, mb_y: usize) -> (MV, u32) {
135 let mut best_dist = MAX_DIST;
136 let mut best_mv = ZERO_MV;
138 let mut cur_mv = ZERO_MV;
139 for ytry in 0..mv_est.mv_range * 2 + 1 {
140 let dy = if (ytry & 1) == 0 { ytry >> 1 } else { -((ytry + 1) >> 1) };
142 for xtry in 0..mv_est.mv_range * 2 + 1 {
143 let dx = if (xtry & 1) == 0 { xtry >> 1 } else { -((xtry + 1) >> 1) };
146 let dist = mv_est.sad_mb(cur_blk, mb_x, mb_y, cur_mv, best_dist);
148 if dist < best_dist {
156 fn search_blk(&mut self, mv_est: &mut MVEstimator, cur_blk: &[u8; 64], xpos: usize, ypos: usize) -> (MV, u32) {
157 let mut best_dist = MAX_DIST;
158 let mut best_mv = ZERO_MV;
160 let mut cur_mv = ZERO_MV;
161 for ytry in 0..mv_est.mv_range * 2 + 1 {
162 let dy = if (ytry & 1) == 0 { ytry >> 1 } else { -((ytry + 1) >> 1) };
164 for xtry in 0..mv_est.mv_range * 2 + 1 {
165 let dx = if (xtry & 1) == 0 { xtry >> 1 } else { -((xtry + 1) >> 1) };
168 let dist = mv_est.sad_blk(cur_blk, xpos, ypos, cur_mv, best_dist);
170 if dist < best_dist {
180 const DIA_PATTERN: [MV; 9] = [
192 const HEX_PATTERN: [MV; 7] = [
202 const REFINEMENT: [MV; 4] = [
209 macro_rules! search_template {
210 ($self: expr, $mv_est: expr, $cur_blk: expr, $mb_x: expr, $mb_y: expr, $sad_func: ident) => ({
211 let mut best_dist = MAX_DIST;
219 let mut cur_best_dist = best_dist;
220 for (dist, &point) in $self.dist.iter_mut().zip($self.point.iter()) {
221 if *dist == MAX_DIST {
222 *dist = $mv_est.$sad_func($cur_blk, $mb_x, $mb_y, point.from_pixels(), cur_best_dist);
223 cur_best_dist = cur_best_dist.min(*dist);
224 if *dist <= DIST_THRESH {
229 min_dist = $self.dist[0];
231 for (i, &dist) in $self.dist.iter().enumerate().skip(1) {
235 if dist <= DIST_THRESH {
240 if min_dist <= DIST_THRESH || min_idx == 0 || best_dist == min_dist || $self.point[min_idx].x.abs() >= $mv_est.mv_range || $self.point[min_idx].y.abs() >= $mv_est.mv_range {
243 best_dist = min_dist;
244 $self.update($self.steps[min_idx]);
246 best_dist = min_dist;
247 best_mv = $self.point[min_idx];
248 if best_dist <= DIST_THRESH {
249 return (best_mv.from_pixels(), best_dist);
251 for &step in REFINEMENT.iter() {
252 let mv = best_mv + step;
253 let dist = $mv_est.$sad_func($cur_blk, $mb_x, $mb_y, mv.from_pixels(), MAX_DIST);
254 if best_dist > dist {
259 best_mv = best_mv.from_pixels();
260 if best_dist <= DIST_THRESH {
261 return (best_mv, best_dist);
265 $self.set_new_point(best_mv, best_dist);
267 let mut cur_best_dist = best_dist;
268 for (dist, &point) in $self.dist.iter_mut().zip($self.point.iter()) {
269 if *dist == MAX_DIST {
270 *dist = $mv_est.$sad_func($cur_blk, $mb_x, $mb_y, point, cur_best_dist);
271 cur_best_dist = cur_best_dist.min(*dist);
272 if *dist <= DIST_THRESH {
277 min_dist = $self.dist[0];
279 for (i, &dist) in $self.dist.iter().enumerate().skip(1) {
283 if dist <= DIST_THRESH {
288 if min_dist <= DIST_THRESH || min_idx == 0 || best_dist == min_dist || $self.point[min_idx].x.abs() >= $mv_est.mv_range * 4 || $self.point[min_idx].y.abs() >= $mv_est.mv_range * 4 {
291 best_dist = min_dist;
292 $self.update($self.steps[min_idx]);
294 best_dist = min_dist;
295 best_mv = $self.point[min_idx];
296 if best_dist <= DIST_THRESH {
297 return (best_mv, best_dist);
299 for &step in REFINEMENT.iter() {
300 let mv = best_mv + step;
301 let dist = $mv_est.$sad_func($cur_blk, $mb_x, $mb_y, mv, MAX_DIST);
302 if best_dist > dist {
311 macro_rules! pattern_search {
312 ($struct_name: ident, $patterns: expr) => {
313 pub struct $struct_name {
314 point: [MV; $patterns.len()],
315 dist: [u32; $patterns.len()],
316 steps: &'static [MV; $patterns.len()],
320 pub fn new() -> Self {
323 dist: [MAX_DIST; $patterns.len()],
327 fn reset(&mut self) {
328 self.point = $patterns;
329 self.dist = [MAX_DIST; $patterns.len()];
331 fn set_new_point(&mut self, start: MV, dist: u32) {
332 for (dst, &src) in self.point.iter_mut().zip(self.steps.iter()) {
335 self.dist = [MAX_DIST; $patterns.len()];
338 fn update(&mut self, step: MV) {
339 let mut new_point = self.point;
340 let mut new_dist = [MAX_DIST; $patterns.len()];
342 for point in new_point.iter_mut() {
346 for (new_point, new_dist) in new_point.iter_mut().zip(new_dist.iter_mut()) {
347 for (&old_point, &old_dist) in self.point.iter().zip(self.dist.iter()) {
348 if *new_point == old_point {
349 *new_dist = old_dist;
354 self.point = new_point;
355 self.dist = new_dist;
359 impl MVSearch for $struct_name {
360 fn search_mb(&mut self, mv_est: &mut MVEstimator, cur_blk: &[[u8; 64]; 6], mb_x: usize, mb_y: usize) -> (MV, u32) {
361 search_template!(self, mv_est, cur_blk, mb_x, mb_y, sad_mb)
363 fn search_blk(&mut self, mv_est: &mut MVEstimator, cur_blk: &[u8; 64], xpos: usize, ypos: usize) -> (MV, u32) {
364 search_template!(self, mv_est, cur_blk, xpos, ypos, sad_blk)
370 pattern_search!(DiaSearch, DIA_PATTERN);
371 pattern_search!(HexSearch, HEX_PATTERN);
373 pub struct MVEstimator {
374 pub ref_blk: [[u8; 64]; 6],
375 mc_buf: NAVideoBufferRef<u8>,
376 ref_frame: NAVideoBufferRef<u8>,
390 pub fn new(ref_frame: NAVideoBufferRef<u8>, mc_buf: NAVideoBufferRef<u8>, loop_thr: i16, mv_range: i16) -> Self {
392 ref_blk: [[0; 64]; 6],
406 pub fn mc_block(&mut self, dst_idx: usize, plane: usize, x: usize, y: usize, mv: MV) {
407 let is_luma = (plane != 1) && (plane != 2);
408 let (sx, sy, mx, my, msx, msy) = if is_luma {
409 (mv.x >> 2, mv.y >> 2, (mv.x & 3) << 1, (mv.y & 3) << 1, mv.x / 4, mv.y / 4)
411 (mv.x >> 3, mv.y >> 3, mv.x & 7, mv.y & 7, mv.x / 8, mv.y / 8)
413 let tmp_blk = self.mc_buf.get_data_mut().unwrap();
414 get_block(tmp_blk, 16, self.ref_frame.clone(), plane, x, y, sx, sy);
416 let foff = (8 - (sx & 7)) as usize;
418 vp31_loop_filter(tmp_blk, off, 1, 16, 12, self.loop_thr);
421 let foff = (8 - (sy & 7)) as usize;
422 let off = (2 + foff) * 16;
423 vp31_loop_filter(tmp_blk, off, 16, 1, 12, self.loop_thr);
425 let copy_mode = (mx == 0) && (my == 0);
426 let mut bicubic = !copy_mode && is_luma && self.bicubic;
427 if is_luma && !copy_mode && self.adv_profile {
428 if !self.autosel_pm {
431 let mv_limit = 1 << (self.mv_thresh + 1);
432 if (mv.x.abs() <= mv_limit) && (mv.y.abs() <= mv_limit) {
433 let mut var_off = 16 * 2 + 2;
434 if mv.x < 0 { var_off += 1; }
435 if mv.y < 0 { var_off += 16; }
436 let var = calc_variance(&tmp_blk[var_off..], 16);
437 if var >= self.var_thresh {
443 let dst = &mut self.ref_blk[dst_idx];
445 let src = &tmp_blk[2 * 16 + 2..];
446 for (dline, sline) in dst.chunks_mut(8).zip(src.chunks(16)).take(8) {
447 dline.copy_from_slice(&sline[..8]);
450 let coeff_h = &VP6_BICUBIC_COEFFS[self.filter_alpha][mx as usize];
451 let coeff_v = &VP6_BICUBIC_COEFFS[self.filter_alpha][my as usize];
452 mc_bicubic(dst, 8, tmp_blk, 16 * 2 + 2, 16, coeff_h, coeff_v);
454 mc_bilinear(dst, 8, tmp_blk, 16 * 2 + 2, 16, mx as u16, my as u16);
457 fn sad_mb(&mut self, cur_blk: &[[u8; 64]; 6], mb_x: usize, mb_y: usize, cur_mv: MV, best_dist: u32) -> u32 {
460 self.mc_block(i, 0, mb_x * 16 + (i & 1) * 8, mb_y * 16 + (i >> 1) * 8, cur_mv);
461 dist += sad(&cur_blk[i], &self.ref_blk[i]);
463 if dist > best_dist {
467 if dist <= best_dist {
469 self.mc_block(plane + 3, plane, mb_x * 8, mb_y * 8, cur_mv);
470 dist += sad(&cur_blk[plane + 3], &self.ref_blk[plane + 3]);
472 if dist > best_dist {
480 fn sad_blk(&mut self, cur_blk: &[u8; 64], xpos: usize, ypos: usize, cur_mv: MV, _: u32) -> u32 {
481 self.mc_block(0, 0, xpos, ypos, cur_mv);
482 sad(cur_blk, &self.ref_blk[0])
486 fn sad(src1: &[u8; 64], src2: &[u8; 64]) -> u32 {
488 for (&p1, &p2) in src1.iter().zip(src2.iter()) {
489 sum += (i32::from(p1) - i32::from(p2)).abs() as u32;
494 pub fn sub_blk(dst: &mut [i16; 64], src1: &[u8; 64], src2: &[u8; 64]) {
495 for (dst, (&p1, &p2)) in dst.iter_mut().zip(src1.iter().zip(src2.iter())) {
496 *dst = i16::from(p1) - i16::from(p2);
500 pub fn calc_mb_dist(mb1: &ResidueMB, mb2: &ResidueMB) -> u32 {
502 for (blk1, blk2) in mb1.coeffs.iter().zip(mb2.coeffs.iter()) {
503 for (&c1, &c2) in blk1.iter().zip(blk2.iter()) {
504 sum += (i32::from(c1) - i32::from(c2)).abs() as u32;