Difference between revisions of "NUT"

From MultimediaWiki
Jump to navigation Jump to search
m (typo)
(small wording improvement)
Line 2: Line 2:
 
* Website: http://www.nut.hu/
 
* Website: http://www.nut.hu/
  
NUT is (still) experimental format under construction by [[MPlayer]] and [[FFmpeg]] developers.
+
NUT is a container format under construction by [[MPlayer]] and [[FFmpeg]] developers.
Main goals are to be simple, flexible, error resistant and of course with smallest possible overhead.
+
Its main goals are to be simple, flexible and error-resistant while maintaining the smallest possible overhead.
  
 
== NUT seeking algo in libnut ==
 
== NUT seeking algo in libnut ==

Revision as of 11:11, 1 February 2006

NUT is a container format under construction by MPlayer and FFmpeg developers. Its main goals are to be simple, flexible and error-resistant while maintaining the smallest possible overhead.

NUT seeking algo in libnut

Step 1 - Binary search and linear interpolation

Startup

Go to beginning of file if first syncpoint has not been found, and then go to EOF and search backward to find last syncpoint. Pick the closest possible syncpoints for requested pts, one higher and one lower. If requested pts is lower than first syncpoint or higher than last syncpoint, then seek to either of those syncpoints and end seek.

Binary search is ended when the entire region between the 2 syncpoints picked has been scanned. Which could even be before it has begun thanks to syncpoint cache.

Guess position

Best results have been achieved by combining both linear interpolation and binary search, giving most of the weight to interpolation.

hi, hi_pd
file position and timestamp of the top edge of the binary search.
lo, lo_pd
file position and timestamp of the bottom edge of the binary search.
time_pos
Requested pts.
guess
begginning of linear search for syncpoint.
#define INTERPOLATE_WEIGHT (7./8)
if (hi - lo < nut->max_distance) guess = lo + 8;
else { // linear interpolation
    double a = (double)(hi - lo) / (hi_pd - lo_pd);
    guess = lo + a * (time_pos - lo_pd);
    guess = guess * INTERPOLATE_WEIGHT + (lo+hi)/2 * (1 - INTERPOLATE_WEIGHT);
    if (hi - guess < nut->max_distance*2) guess = hi - nut->max_distance*2; //(lo + hi)/2;
}
if (guess < lo + 8) guess = lo + 8;

The first conditional prevents too much recursing when the distance is already low. The last conditional prevents infinite loop of syncpoint search constantly finding lo and achieving nothing.

Binary search

Now, find a syncpoint, bounded between guess and hi. If it has a pts higher than requested pts, then replace hi and hi_pd, otherwise replace lo and lo_pd. If a syncpoint was not found between guess and hi, then, if guess is smaller or equal to lo + 11, then you have scanned the entire area between lo and hi, and your binary search is done. Otherwise, replace hi with guess and repeat the binary search.

After finding the 2 closest syncpoints bounding your requested pts, the bounds of linear are search are:

*start = lo_s.pos - (lo_s.back_ptr * 8 + 7);
*end = lo_s.pos;
*stopper = hi_s;

stopper is used later to end linear search prematurely.

Step 2 - Linear search

Bounds of linear search

Linear search of course ends at end, however, it can end earlier:

  • When you find any frame of an active stream, with a pts higher than requested pts.
  • When you find a syncpoint immediately following the syncpoint pointed to by stopper's back_ptr, (from here on this syncpoint will be called stopper_syncpoint) and all streams are active.
  • When you find a keyframe for all non-active streams after after stopper_syncpoint with a pts higher than stopper.pts. The logic is:
    • stopper.pts is higher than requested pts.
    • stopper_syncpoint is not the syncpoint pointed to by stopper.back_ptr, but the one immediately following.
    • If there was a keyframe for every non active stream after stopper_syncpoint, with a pts lower than stopper.pts, then the reason stopper does not point to stopper_syncpoint must be that there are no keyframes for active streams with a pts lower than stopper.pts after stopper_syncpoint.
    • There might be more keyframes in the region with a pts higher than stopper.pts, but those are irrelevant because they are higher than requested pts.

Linear search implementation

  1. Start at start.
  2. Search for syncpoint. If it is further than start + 7, then the file is errored, and you can start playing immediately from this syncpoint.
  3. Perform full demuxing, buffering everything read.
  4. On every syncpoint, flush the buffer and cache the syncpoint position.
  5. When finding keyframe of active stream with pts lower than requested pts, store position of keyframe. Discard previous value.
  6. End linear search as necessary by bounds given above.
  7. Pick the lowest value from positions of keyframes for active streams. This is the final position.
  8. Seek to closest syncpoint before the final position, preform a minimal demuxing until final position (to get proper last_pts context across all streams).

Index

With index, binary search step is skipped, and a much more limited linear search used, between two immediate syncpoints. The syncpoints picked are the highest possible ones that have a keyframe for each active stream past the syncpoint with a pts lower than requested pts. The end of the linear search is the syncpoint immediately following.

Dynamic index is used in the same manner as complete index. However, when deciding a syncpoint, the entire range of the syncpoint picked until the first syncpoint with a pts higher than requested is checked for having been already researched. If a "hole" is found anywhere in this range, dynamic index is disregarded and full binary search is performed.