1 use nihav_core::codecs::DecoderResult;
2 use nihav_core::frame::{FrameType, NAVideoBufferRef};
3 use nihav_core::refs::*;
4 use nihav_codec_support::codecs::MV;
5 use super::sets::SeqParameterSet;
10 pub struct PictureInfo {
13 pub pic_type: FrameType,
14 pub buf: NAVideoBufferRef<u8>,
17 pub long_term: Option<usize>,
19 pub mv_info: NABufferRef<FrameMV>,
22 #[derive(Clone,Copy,Default, Debug)]
23 pub struct FrameMBInfo {
24 pub mb_type: CompactMBType,
25 pub ref_poc: [[u16; 2]; 4],
26 pub ref_idx: [[PicRef; 2]; 4],
27 pub mv: [[MV; 2]; 16],
31 pub fn new() -> Self { Self::default() }
36 pub mbs: Vec<FrameMBInfo>,
41 pub fn new(mb_w: usize, mb_h: usize) -> Self {
43 mbs: vec![FrameMBInfo::default(); mb_w * mb_h],
50 pub struct SliceRefs {
51 pub ref_list0: Vec<Option<PictureInfo>>,
52 pub ref_list1: Vec<Option<PictureInfo>>,
57 pub fn select_ref_pic(&self, list_id: u8, ref_id: usize) -> Option<NAVideoBufferRef<u8>> {
58 let ref_list = if list_id == 0 { &self.ref_list0 } else { &self.ref_list1 };
59 if ref_list.len() > ref_id {
60 ref_list[ref_id].as_ref().map(|pic| pic.buf.clone())
65 pub fn get_colocated_info(&self, mb_x: usize, mb_y: usize) -> (FrameMBInfo, u16, bool) {
66 if let Some(ref ref_pic) = &self.ref_list1[0] {
67 let mv_info = &ref_pic.mv_info;
68 let mb = mv_info.mbs[mb_x + mb_y * mv_info.mb_stride];
69 (mb, ref_pic.full_id as u16, ref_pic.long_term.is_some())
71 (FrameMBInfo::default(), 0, false)
74 pub fn map_ref0(&self, ref0_id: u16) -> (PicRef, bool) {
77 for (i, rpic0) in self.ref_list0.iter().enumerate() {
78 if let Some(ref pic) = rpic0 {
79 if (pic.full_id as u16) == ref0_id {
81 long = pic.long_term.is_some();
86 (PicRef::new(r0_idx), long)
88 pub fn map_refs(&self, ref_idx: [PicRef; 2]) -> [u16; 2] {
89 let r0 = ref_idx[0].index();
90 let r1 = ref_idx[1].index();
91 let ref0 = if r0 < self.ref_list0.len() {
92 if let Some(ref pic) = self.ref_list0[r0] {
100 let ref1 = if r1 < self.ref_list1.len() {
101 if let Some(ref pic) = self.ref_list1[r1] {
111 pub fn cmp_refs(&self, ref1: [PicRef; 2], ref2: [PicRef; 2]) -> bool {
113 self.cmp_ref(ref1[0], ref2[0], 0) && self.cmp_ref(ref1[1], ref2[1], 1)
118 fn cmp_ref(&self, ref1: PicRef, ref2: PicRef, list: u8) -> bool {
122 let idx0 = ref1.index();
123 let idx1 = ref2.index();
127 let src = if list == 0 { &self.ref_list0 } else { &self.ref_list1 };
128 if idx0 >= src.len() || idx1 >= src.len() {
129 //panic!("wrong refs");
132 if let (Some(ref pic0), Some(ref pic1)) = (&src[idx0], &src[idx1]) {
133 pic0.full_id == pic1.full_id
135 //panic!("missing pics");
142 pub struct FrameRefs {
143 pub ref_pics: Vec<PictureInfo>,
144 pub cur_refs: SliceRefs,
145 pub long_term: Vec<Option<PictureInfo>>,
149 prev_ref_poc_lsb: u16,
151 frame_num_offset: u32,
156 pub fn new() -> Self {
158 ref_pics: Vec::with_capacity(16),
159 cur_refs: SliceRefs {
160 ref_list0: Vec::with_capacity(3),
161 ref_list1: Vec::with_capacity(3),
164 long_term: Vec::new(),
174 pub fn calc_picture_num(&mut self, slice_hdr: &SliceHeader, is_idr: bool, ref_id: u8, sps: &SeqParameterSet) -> u32 {
175 self.max_frame_num = 1 << sps.log2_max_frame_num;
176 match sps.pic_order_cnt_type {
179 //self.prev_poc_msb = 0;
180 self.prev_poc_lsb = 0;
182 self.prev_poc_lsb = self.prev_ref_poc_lsb;
184 let max_poc_lsb = 1 << sps.log2_max_pic_order_cnt_lsb;
185 let half_max_poc_lsb = 1 << (sps.log2_max_pic_order_cnt_lsb - 1);
186 let cur_lsb = slice_hdr.pic_order_cnt_lsb;
187 let poc_msb = if cur_lsb < self.prev_poc_lsb && (self.prev_poc_lsb - cur_lsb >= half_max_poc_lsb) {
188 self.prev_poc_msb + max_poc_lsb
189 } else if cur_lsb > self.prev_poc_lsb && (cur_lsb - self.prev_poc_lsb > half_max_poc_lsb) {
190 self.prev_poc_msb.wrapping_sub(max_poc_lsb)
194 let poc = poc_msb + u32::from(cur_lsb);
196 self.prev_ref_poc_lsb = slice_hdr.pic_order_cnt_lsb;
197 self.prev_poc_msb = poc_msb;
202 let off = if self.prev_frame_num > slice_hdr.frame_num {
203 self.frame_num_offset + (1 << sps.log2_max_frame_num)
205 self.frame_num_offset
207 let mut anum = if sps.num_ref_frames_in_pic_order_cnt_cycle != 0 {
208 (off as i32) + i32::from(slice_hdr.frame_num)
212 if ref_id == 0 && anum > 0 {
215 let (poc_cycle_cnt, fno_in_poc_cycle) = if anum > 0 {
216 let nrf = sps.num_ref_frames_in_pic_order_cnt_cycle as i32;
217 ((anum - 1) / nrf, (anum - 1) % nrf)
221 let mut expected_delta = 0;
222 for &offset in sps.offset_for_ref_frame[..sps.num_ref_frames_in_pic_order_cnt_cycle].iter() {
223 expected_delta += offset;
225 let mut expected_poc = if anum > 0 {
226 let mut sum = poc_cycle_cnt * expected_delta;
227 for &offset in sps.offset_for_ref_frame[..=fno_in_poc_cycle as usize].iter() {
235 expected_poc += sps.offset_for_non_ref_pic;
237 let (top_id, _bottom_id) = if !slice_hdr.field_pic {
238 let top_id = expected_poc + slice_hdr.delta_pic_order_cnt[0];
239 let bot_id = top_id + sps.offset_for_top_to_bottom_field + slice_hdr.delta_pic_order_cnt[1];
241 } else if !slice_hdr.bottom_field {
242 (expected_poc + slice_hdr.delta_pic_order_cnt[0], 0)
244 (0, sps.offset_for_top_to_bottom_field + slice_hdr.delta_pic_order_cnt[1])
246 self.prev_frame_num = slice_hdr.frame_num;
247 self.frame_num_offset = off;
251 if slice_hdr.frame_num < self.prev_frame_num {
252 self.frame_num_offset += 1 << sps.log2_max_frame_num;
254 self.prev_frame_num = slice_hdr.frame_num;
255 self.frame_num_offset + u32::from(slice_hdr.frame_num)
259 pub fn apply_adaptive_marking(&mut self, marking: &AdaptiveMarking, cur_id: u16, max_id: u16) -> DecoderResult<()> {
260 let all_ref_pics = self.ref_pics.clone();
262 for (&op, (&arg1, &arg2)) in marking.memory_management_control_op.iter().zip(marking.operation_arg.iter().zip(marking.operation_arg2.iter())).take(marking.num_ops) {
265 let src_id = cur_id.wrapping_sub(arg1) & (max_id - 1);
266 let mut found = false;
268 for (i, pic) in self.ref_pics.iter().enumerate() {
269 if pic.id == src_id {
276 self.ref_pics.remove(idx);
279 2 => { // mark long term picture as unused
280 let idx = arg1 as usize;
281 if idx < self.long_term.len() {
282 self.long_term[idx] = None;
286 let src_id = cur_id.wrapping_sub(arg1) & (max_id - 1);
288 let didx = arg2 as usize;
289 for pic in all_ref_pics.iter() {
290 if pic.id == src_id {
291 if didx < self.long_term.len() {
292 self.long_term[didx] = Some(pic.clone());
299 self.long_term.resize(arg1 as usize, None);
302 self.ref_pics.clear();
303 self.long_term.clear();
306 // assign an long term index to current pic - done elsewhere
313 pub fn clear_refs(&mut self) {
314 self.ref_pics.clear();
315 self.long_term.clear();
317 #[allow(clippy::cognitive_complexity)]
318 pub fn select_refs(&mut self, sps: &SeqParameterSet, slice_hdr: &SliceHeader, cur_id: u32) {
319 self.cur_refs.cur_id = cur_id;
320 self.cur_refs.ref_list0.clear();
321 self.cur_refs.ref_list1.clear();
322 let pic_num_mask = if sps.log2_max_frame_num == 16 {
325 (1 << sps.log2_max_frame_num) - 1
328 if !slice_hdr.slice_type.is_intra() {
329 let has_reordering = slice_hdr.ref_pic_list_reordering_l0;
331 let num_ref = slice_hdr.num_ref_idx_l0_active;
332 if slice_hdr.slice_type.is_p() {
333 if !self.ref_pics.is_empty() {
334 for pic in self.ref_pics.iter().rev().take(num_ref) {
335 self.cur_refs.ref_list0.push(Some(pic.clone()));
340 for (i, pic) in self.ref_pics.iter().enumerate() {
342 if pic.full_id > cur_id {
346 for pic in self.ref_pics[..pivot].iter().rev() {
347 if self.cur_refs.ref_list0.len() >= num_ref {
350 self.cur_refs.ref_list0.push(Some(pic.clone()));
352 for pic in self.ref_pics.iter().skip(pivot) {
353 if self.cur_refs.ref_list0.len() >= num_ref {
356 self.cur_refs.ref_list0.push(Some(pic.clone()));
359 if !self.long_term.is_empty() && self.cur_refs.ref_list0.len() < num_ref {
360 let copy_size = num_ref - self.cur_refs.ref_list0.len();
361 for ltpic in self.long_term.iter().take(copy_size) {
362 self.cur_refs.ref_list0.push(ltpic.clone());
366 form_ref_list(&mut self.cur_refs.ref_list0,
367 &self.ref_pics, &self.long_term,
368 &slice_hdr.reordering_list_l0,
369 slice_hdr.frame_num, pic_num_mask);
371 if slice_hdr.slice_type.is_b() {
372 let has_reordering = slice_hdr.ref_pic_list_reordering_l1;
374 let num_ref = slice_hdr.num_ref_idx_l1_active;
376 for (i, pic) in self.ref_pics.iter().enumerate() {
378 if pic.full_id > cur_id {
382 for pic in self.ref_pics.iter().skip(pivot) {
383 if self.cur_refs.ref_list1.len() >= num_ref {
386 self.cur_refs.ref_list1.push(Some(pic.clone()));
388 for pic in self.ref_pics[..pivot].iter().rev() {
389 if self.cur_refs.ref_list1.len() >= num_ref {
392 self.cur_refs.ref_list1.push(Some(pic.clone()));
394 if !self.long_term.is_empty() && self.cur_refs.ref_list1.len() < num_ref {
395 let copy_size = num_ref - self.cur_refs.ref_list1.len();
396 for ltpic in self.long_term.iter().take(copy_size) {
397 self.cur_refs.ref_list1.push(ltpic.clone());
400 if self.cur_refs.ref_list1.len() > 1 && self.cur_refs.ref_list0.len() == self.cur_refs.ref_list1.len() {
401 let mut equal = true;
402 for (pic1, pic2) in self.cur_refs.ref_list0.iter().zip(self.cur_refs.ref_list1.iter()) {
404 (Some(p1), Some(p2)) => {
405 if p1.full_id != p2.full_id {
418 self.cur_refs.ref_list1.swap(0, 1);
422 form_ref_list(&mut self.cur_refs.ref_list1,
423 &self.ref_pics, &self.long_term,
424 &slice_hdr.reordering_list_l1,
425 slice_hdr.frame_num, pic_num_mask);
430 pub fn add_short_term(&mut self, cpic: PictureInfo, num_ref_frames: usize) {
431 if !self.ref_pics.is_empty() && self.ref_pics.len() >= num_ref_frames {
432 let base_id = i32::from(cpic.id);
433 let mut min_id = base_id;
435 for (i, pic) in self.ref_pics.iter().enumerate() {
436 let mut pic_id = i32::from(pic.id);
437 if pic_id > base_id {
438 pic_id -= self.max_frame_num;
445 self.ref_pics.remove(min_idx);
447 if self.ref_pics.is_empty() || self.ref_pics.last().unwrap().full_id < cpic.full_id {
448 self.ref_pics.push(cpic);
451 for (i, pic) in self.ref_pics.iter().enumerate() {
452 if pic.full_id < cpic.full_id {
458 self.ref_pics.insert(idx + 1, cpic);
461 pub fn add_long_term(&mut self, lt_idx: usize, cpic: PictureInfo) {
462 if lt_idx < self.long_term.len() {
463 self.long_term[lt_idx] = Some(cpic);
468 fn form_ref_list(ref_list: &mut Vec<Option<PictureInfo>>, ref_pics: &[PictureInfo], long_term: &[Option<PictureInfo>], reord_info: &ReorderingInfo, cur_id: u16, pic_num_mask: u16) {
469 let mut ref_pic_id = cur_id;
470 for (&op, &num) in reord_info.reordering_of_pic_nums_idc.iter().zip(reord_info.abs_diff_or_num.iter()).take(reord_info.num_ops) {
473 ref_pic_id = ref_pic_id.wrapping_sub(num) & pic_num_mask;
475 ref_pic_id = ref_pic_id.wrapping_add(num) & pic_num_mask;
477 let mut found = false;
478 for pic in ref_pics.iter() {
479 if pic.id == ref_pic_id {
480 ref_list.push(Some(pic.clone()));
489 let idx = num as usize;
490 if idx < long_term.len() {
491 ref_list.push(long_term[idx].clone());