1 use nihav_core::codecs::DecoderResult;
2 use nihav_core::frame::{FrameType, NAVideoBufferRef, NATimeInfo};
3 use nihav_core::refs::*;
4 use nihav_codec_support::codecs::MV;
5 use super::sets::SeqParameterSet;
10 pub struct PictureInfo {
15 pub pic_type: FrameType,
16 pub buf: NAVideoBufferRef<u8>,
20 pub long_term: Option<usize>,
22 pub mv_info: NABufferRef<FrameMV>,
25 #[derive(Clone,Copy,Default, Debug)]
26 pub struct FrameMBInfo {
27 pub mb_type: CompactMBType,
28 pub ref_poc: [[u16; 2]; 4],
29 pub ref_idx: [[PicRef; 2]; 4],
30 pub mv: [[MV; 2]; 16],
34 pub fn new() -> Self { Self::default() }
39 pub mbs: Vec<FrameMBInfo>,
44 pub fn new(mb_w: usize, mb_h: usize) -> Self {
46 mbs: vec![FrameMBInfo::default(); mb_w * mb_h],
53 pub struct SliceRefs {
54 pub ref_list0: Vec<Option<PictureInfo>>,
55 pub ref_list1: Vec<Option<PictureInfo>>,
60 pub fn get_ref_id(&self, list_id: u8, ref_id: usize) -> Option<u32> {
61 let ref_list = if list_id == 0 { &self.ref_list0 } else { &self.ref_list1 };
62 if ref_list.len() > ref_id {
63 ref_list[ref_id].as_ref().map(|pic| pic.full_id)
68 pub fn select_ref_pic(&self, list_id: u8, ref_id: usize) -> Option<NAVideoBufferRef<u8>> {
69 let ref_list = if list_id == 0 { &self.ref_list0 } else { &self.ref_list1 };
70 if ref_list.len() > ref_id {
71 ref_list[ref_id].as_ref().map(|pic| pic.buf.clone())
76 pub fn get_colocated_info(&self, mb_x: usize, mb_y: usize) -> (FrameMBInfo, u16, bool) {
77 if let Some(ref ref_pic) = &self.ref_list1[0] {
78 let mv_info = &ref_pic.mv_info;
79 let mb = mv_info.mbs[mb_x + mb_y * mv_info.mb_stride];
80 (mb, ref_pic.full_id as u16, ref_pic.long_term.is_some())
82 (FrameMBInfo::default(), 0, false)
85 pub fn map_ref0(&self, ref0_id: u16) -> (PicRef, bool) {
88 for (i, rpic0) in self.ref_list0.iter().enumerate() {
89 if let Some(ref pic) = rpic0 {
90 if (pic.full_id as u16) == ref0_id {
92 long = pic.long_term.is_some();
97 (PicRef::new(r0_idx), long)
99 pub fn map_refs(&self, ref_idx: [PicRef; 2]) -> [u16; 2] {
100 let r0 = ref_idx[0].index();
101 let r1 = ref_idx[1].index();
102 let ref0 = if r0 < self.ref_list0.len() {
103 if let Some(ref pic) = self.ref_list0[r0] {
111 let ref1 = if r1 < self.ref_list1.len() {
112 if let Some(ref pic) = self.ref_list1[r1] {
122 pub fn cmp_refs(&self, ref1: [PicRef; 2], ref2: [PicRef; 2]) -> bool {
124 self.cmp_ref(ref1[0], ref2[0], 0) && self.cmp_ref(ref1[1], ref2[1], 1)
129 fn cmp_ref(&self, ref1: PicRef, ref2: PicRef, list: u8) -> bool {
133 let idx0 = ref1.index();
134 let idx1 = ref2.index();
138 let src = if list == 0 { &self.ref_list0 } else { &self.ref_list1 };
139 if idx0 >= src.len() || idx1 >= src.len() {
140 //panic!("wrong refs");
143 if let (Some(ref pic0), Some(ref pic1)) = (&src[idx0], &src[idx1]) {
144 pic0.full_id == pic1.full_id
146 //panic!("missing pics");
153 pub struct FrameRefs {
154 pub ref_pics: Vec<PictureInfo>,
155 pub cur_refs: SliceRefs,
156 pub long_term: Vec<Option<PictureInfo>>,
160 prev_ref_poc_lsb: u16,
162 frame_num_offset: u32,
167 pub fn new() -> Self {
169 ref_pics: Vec::with_capacity(16),
170 cur_refs: SliceRefs {
171 ref_list0: Vec::with_capacity(3),
172 ref_list1: Vec::with_capacity(3),
175 long_term: Vec::new(),
185 pub fn fill_ref_nums(&self, dst: &mut Vec<u32>) {
186 for pic in self.ref_pics.iter() {
187 if !dst.contains(&pic.full_id) {
188 dst.push(pic.full_id);
191 for pic in self.long_term.iter().flatten() {
192 if !dst.contains(&pic.full_id) {
193 dst.push(pic.full_id);
197 pub fn calc_picture_num(&mut self, slice_hdr: &SliceHeader, is_idr: bool, ref_id: u8, sps: &SeqParameterSet) -> u32 {
198 self.max_frame_num = 1 << sps.log2_max_frame_num;
199 match sps.pic_order_cnt_type {
202 //self.prev_poc_msb = 0;
203 self.prev_poc_lsb = 0;
205 self.prev_poc_lsb = self.prev_ref_poc_lsb;
207 let max_poc_lsb = 1 << sps.log2_max_pic_order_cnt_lsb;
208 let half_max_poc_lsb = 1 << (sps.log2_max_pic_order_cnt_lsb - 1);
209 let cur_lsb = slice_hdr.pic_order_cnt_lsb;
210 let poc_msb = if cur_lsb < self.prev_poc_lsb && (self.prev_poc_lsb - cur_lsb >= half_max_poc_lsb) {
211 self.prev_poc_msb + max_poc_lsb
212 } else if cur_lsb > self.prev_poc_lsb && (cur_lsb - self.prev_poc_lsb > half_max_poc_lsb) {
213 self.prev_poc_msb.wrapping_sub(max_poc_lsb)
217 let poc = poc_msb + u32::from(cur_lsb);
219 self.prev_ref_poc_lsb = slice_hdr.pic_order_cnt_lsb;
220 self.prev_poc_msb = poc_msb;
225 let off = if self.prev_frame_num > slice_hdr.frame_num {
226 self.frame_num_offset + (1 << sps.log2_max_frame_num)
228 self.frame_num_offset
230 let mut anum = if sps.num_ref_frames_in_pic_order_cnt_cycle != 0 {
231 (off as i32) + i32::from(slice_hdr.frame_num)
235 if ref_id == 0 && anum > 0 {
238 let (poc_cycle_cnt, fno_in_poc_cycle) = if anum > 0 {
239 let nrf = sps.num_ref_frames_in_pic_order_cnt_cycle as i32;
240 ((anum - 1) / nrf, (anum - 1) % nrf)
244 let mut expected_delta = 0;
245 for &offset in sps.offset_for_ref_frame[..sps.num_ref_frames_in_pic_order_cnt_cycle].iter() {
246 expected_delta += offset;
248 let mut expected_poc = if anum > 0 {
249 let mut sum = poc_cycle_cnt * expected_delta;
250 for &offset in sps.offset_for_ref_frame[..=fno_in_poc_cycle as usize].iter() {
258 expected_poc += sps.offset_for_non_ref_pic;
260 let (top_id, _bottom_id) = if !slice_hdr.field_pic {
261 let top_id = expected_poc + slice_hdr.delta_pic_order_cnt[0];
262 let bot_id = top_id + sps.offset_for_top_to_bottom_field + slice_hdr.delta_pic_order_cnt[1];
264 } else if !slice_hdr.bottom_field {
265 (expected_poc + slice_hdr.delta_pic_order_cnt[0], 0)
267 (0, sps.offset_for_top_to_bottom_field + slice_hdr.delta_pic_order_cnt[1])
269 self.prev_frame_num = slice_hdr.frame_num;
270 self.frame_num_offset = off;
274 if slice_hdr.frame_num < self.prev_frame_num {
275 self.frame_num_offset += 1 << sps.log2_max_frame_num;
277 self.prev_frame_num = slice_hdr.frame_num;
278 self.frame_num_offset + u32::from(slice_hdr.frame_num)
282 pub fn apply_adaptive_marking(&mut self, marking: &AdaptiveMarking, cur_id: u16, max_id: u16) -> DecoderResult<()> {
283 let all_ref_pics = self.ref_pics.clone();
285 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) {
288 let src_id = cur_id.wrapping_sub(arg1) & (max_id - 1);
289 let mut found = false;
291 for (i, pic) in self.ref_pics.iter().enumerate() {
292 if pic.id == src_id {
299 self.ref_pics.remove(idx);
302 2 => { // mark long term picture as unused
303 let idx = arg1 as usize;
304 if idx < self.long_term.len() {
305 self.long_term[idx] = None;
309 let src_id = cur_id.wrapping_sub(arg1) & (max_id - 1);
311 let didx = arg2 as usize;
312 for pic in all_ref_pics.iter() {
313 if pic.id == src_id {
314 if didx < self.long_term.len() {
315 self.long_term[didx] = Some(pic.clone());
322 self.long_term.resize(arg1 as usize, None);
325 self.ref_pics.clear();
326 self.long_term.clear();
329 // assign an long term index to current pic - done elsewhere
336 pub fn clear_refs(&mut self) {
337 self.ref_pics.clear();
338 self.long_term.clear();
340 #[allow(clippy::cognitive_complexity)]
341 pub fn select_refs(&mut self, sps: &SeqParameterSet, slice_hdr: &SliceHeader, cur_id: u32) {
342 self.cur_refs.cur_id = cur_id;
343 self.cur_refs.ref_list0.clear();
344 self.cur_refs.ref_list1.clear();
345 let pic_num_mask = if sps.log2_max_frame_num == 16 {
348 (1 << sps.log2_max_frame_num) - 1
351 if !slice_hdr.slice_type.is_intra() {
352 let has_reordering = slice_hdr.ref_pic_list_reordering_l0;
354 let num_ref = slice_hdr.num_ref_idx_l0_active;
355 if slice_hdr.slice_type.is_p() {
356 if !self.ref_pics.is_empty() {
357 for pic in self.ref_pics.iter().rev().take(num_ref) {
358 self.cur_refs.ref_list0.push(Some(pic.clone()));
363 for (i, pic) in self.ref_pics.iter().enumerate() {
365 if pic.full_id > cur_id {
369 for pic in self.ref_pics[..pivot].iter().rev() {
370 if self.cur_refs.ref_list0.len() >= num_ref {
373 self.cur_refs.ref_list0.push(Some(pic.clone()));
375 for pic in self.ref_pics.iter().skip(pivot) {
376 if self.cur_refs.ref_list0.len() >= num_ref {
379 self.cur_refs.ref_list0.push(Some(pic.clone()));
382 if !self.long_term.is_empty() && self.cur_refs.ref_list0.len() < num_ref {
383 let copy_size = num_ref - self.cur_refs.ref_list0.len();
384 for ltpic in self.long_term.iter().take(copy_size) {
385 self.cur_refs.ref_list0.push(ltpic.clone());
389 form_ref_list(&mut self.cur_refs.ref_list0,
390 &self.ref_pics, &self.long_term,
391 &slice_hdr.reordering_list_l0,
392 slice_hdr.frame_num, pic_num_mask);
394 if slice_hdr.slice_type.is_b() {
395 let has_reordering = slice_hdr.ref_pic_list_reordering_l1;
397 let num_ref = slice_hdr.num_ref_idx_l1_active;
399 for (i, pic) in self.ref_pics.iter().enumerate() {
401 if pic.full_id > cur_id {
405 for pic in self.ref_pics.iter().skip(pivot) {
406 if self.cur_refs.ref_list1.len() >= num_ref {
409 self.cur_refs.ref_list1.push(Some(pic.clone()));
411 for pic in self.ref_pics[..pivot].iter().rev() {
412 if self.cur_refs.ref_list1.len() >= num_ref {
415 self.cur_refs.ref_list1.push(Some(pic.clone()));
417 if !self.long_term.is_empty() && self.cur_refs.ref_list1.len() < num_ref {
418 let copy_size = num_ref - self.cur_refs.ref_list1.len();
419 for ltpic in self.long_term.iter().take(copy_size) {
420 self.cur_refs.ref_list1.push(ltpic.clone());
423 if self.cur_refs.ref_list1.len() > 1 && self.cur_refs.ref_list0.len() == self.cur_refs.ref_list1.len() {
424 let mut equal = true;
425 for (pic1, pic2) in self.cur_refs.ref_list0.iter().zip(self.cur_refs.ref_list1.iter()) {
427 (Some(p1), Some(p2)) => {
428 if p1.full_id != p2.full_id {
441 self.cur_refs.ref_list1.swap(0, 1);
445 form_ref_list(&mut self.cur_refs.ref_list1,
446 &self.ref_pics, &self.long_term,
447 &slice_hdr.reordering_list_l1,
448 slice_hdr.frame_num, pic_num_mask);
453 pub fn add_short_term(&mut self, cpic: PictureInfo, num_ref_frames: usize) {
454 if !self.ref_pics.is_empty() && self.ref_pics.len() >= num_ref_frames {
455 let base_id = i32::from(cpic.id);
456 let mut min_id = base_id;
458 for (i, pic) in self.ref_pics.iter().enumerate() {
459 let mut pic_id = i32::from(pic.id);
460 if pic_id > base_id {
461 pic_id -= self.max_frame_num;
468 self.ref_pics.remove(min_idx);
470 if self.ref_pics.is_empty() || self.ref_pics.last().unwrap().full_id < cpic.full_id {
471 self.ref_pics.push(cpic);
474 for (i, pic) in self.ref_pics.iter().enumerate() {
475 if pic.full_id < cpic.full_id {
481 self.ref_pics.insert(idx + 1, cpic);
484 pub fn add_long_term(&mut self, lt_idx: usize, cpic: PictureInfo) {
485 if lt_idx < self.long_term.len() {
486 self.long_term[lt_idx] = Some(cpic);
491 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) {
492 let mut ref_pic_id = cur_id;
493 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) {
496 ref_pic_id = ref_pic_id.wrapping_sub(num) & pic_num_mask;
498 ref_pic_id = ref_pic_id.wrapping_add(num) & pic_num_mask;
500 let mut found = false;
501 for pic in ref_pics.iter() {
502 if pic.id == ref_pic_id {
503 ref_list.push(Some(pic.clone()));
512 let idx = num as usize;
513 if idx < long_term.len() {
514 ref_list.push(long_term[idx].clone());