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 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352
// Symphonia // Copyright (c) 2019 The Project Symphonia Developers. // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at https://mozilla.org/MPL/2.0/. //! The `format` module provides the traits and support structures necessary to implement media //! demuxers. use crate::codecs::CodecParameters; use crate::errors::Result; use crate::io::{BufStream, MediaSourceStream}; use crate::meta::{MetadataQueue, Tag}; use crate::units::{Time, TimeStamp}; pub mod prelude { //! The `formats` module prelude. pub use crate::units::{Duration, TimeBase, TimeStamp}; pub use super::{ Cue, FormatOptions, FormatReader, Packet, SeekedTo, SeekTo, Stream, }; } /// `SeekTo` specifies a location to seek to. pub enum SeekTo { /// Seek to an absolute `Time`. Time { time: Time }, /// Seek to a stream's `TimeStamp`. TimeStamp { ts: TimeStamp, stream: u32 }, } /// `SeekedTo` provides the actual location seeked to. pub type SeekedTo = SeekTo; /// `FormatOptions` is a common set of options that all demuxers use. pub struct FormatOptions { } impl Default for FormatOptions { fn default() -> Self { FormatOptions { } } } /// A `Cue` is a designated point of time within a media stream. /// /// A `Cue` may be a mapping from either a source track, a chapter, cuesheet, or a timestamp /// depending on the source media. A `Cue`'s duration is the difference between the `Cue`'s /// timestamp and the next. Each `Cue` may contain an optional index of points relative to the `Cue` /// that never exceed the timestamp of the next `Cue`. A `Cue` may also have associated `Tag`s. pub struct Cue { /// A unique index for the `Cue`. pub index: u32, /// The starting timestamp in number of frames from the start of the stream. pub start_ts: u64, /// A list of `Tag`s associated with the `Cue`. pub tags: Vec<Tag>, /// A list of `CuePoints`s that are contained within this `Cue`. These points are children of /// the `Cue` since the `Cue` itself is an implicit `CuePoint`. pub points: Vec<CuePoint>, } /// A `CuePoint` is a point, represented as a frame offset, within a `Cue`. /// /// A `CuePoint` provides more precise indexing within a parent `Cue`. Additional `Tag`s may be /// associated with a `CuePoint`. pub struct CuePoint { /// The offset of the first frame in the `CuePoint` relative to the start of the parent `Cue`. pub start_offset_ts: u64, /// A list of `Tag`s associated with the `CuePoint`. pub tags: Vec<Tag>, } /// A `Stream` is an independently coded media stream. A media format may contain multiple media /// streams in one container. Each of those media streams are represented by one `Stream`. pub struct Stream { /// A unique identifier for the stream. pub id: u32, /// The parameters defining the codec for the `Stream`. pub codec_params: CodecParameters, /// The language of the `Stream`. May be unknown. pub language: Option<String>, } impl Stream { pub fn new(id: u32, codec_params: CodecParameters) -> Self { Stream { id, codec_params, language: None, } } } /// A `FormatReader` is a container demuxer. It provides methods to probe a media container for /// information and access the streams encapsulated in the container. /// /// Most, if not all, media containers contain metadata, then a number of packetized, and /// interleaved codec bitstreams. Generally, the encapsulated bitstreams are independently encoded /// using some codec. The allowed codecs for a container are defined in the specification of the /// container format. /// /// While demuxing, packets are read one-by-one and may be discarded or decoded at the choice of /// the caller. The contents of a packet is undefined, it may be a frame of video, 1 millisecond /// or 1 second of audio, but a packet will never contain data from two different bitstreams. /// Therefore the caller can be selective in what stream(s) should be decoded and consumed. /// /// `FormatReader` provides an Iterator-like interface over packets for easy consumption and /// filtering. Seeking will invalidate the assumed state of any decoder processing packets from /// `FormatReader` and should be reset after a successful seek operation. pub trait FormatReader { /// Attempt to instantiate a `FormatReader` using the provided `FormatOptions` and /// `MediaSourceStream`. The reader will probe the container to verify format support, determine /// the number of contained streams, and read any initial metadata. fn try_new(source: MediaSourceStream, options: &FormatOptions) -> Result<Self> where Self: Sized; /// Gets a list of all `Cue`s. fn cues(&self) -> &[Cue]; /// Gets the metadata revision queue. fn metadata(&self) -> &MetadataQueue; /// Seek, as closely as possible, to the `Time` or stream `TimeStamp` requested. Returns the /// actual `Time` or `TimeStamp` seeked to. /// /// Note: Many container formats cannot seek to a precise frame, rather they can only seek to a /// coarse location and then the decoder must decode packets until the exact location is /// reached. fn seek(&mut self, to: SeekTo) -> Result<SeekedTo>; /// Gets a list of streams in the container. fn streams(&self) -> &[Stream]; /// Gets the default stream. If the `FormatReader` has a method of determing the default stream, /// this function should return it. Otherwise, the first stream is returned. If no streams are /// present then None is returned. fn default_stream(&self) -> Option<&Stream> { let streams = self.streams(); match streams.len() { 0 => None, _ => Some(&streams[0]), } } /// Get the next packet from the container. fn next_packet(&mut self) -> Result<Packet>; } /// A `Packet` contains a discrete amount of encoded data for a single codec bitstream. The exact /// amount of data is bounded, but not defined, and is dependant on the container and/or the /// encapsulated codec. pub struct Packet { id: u32, pts: u64, dur: u64, data: Box<[u8]>, } impl Packet { /// Create a new `Packet` from a slice. pub fn new_from_slice(id: u32, pts: u64, dur: u64, buf: &[u8]) -> Self { Packet { id, pts, dur, data: Box::from(buf) } } /// Create a new `Packet` from a boxed slice. pub fn new_from_boxed_slice(id: u32, pts: u64, dur: u64, data: Box<[u8]>) -> Self { Packet { id, pts, dur, data } } /// The stream identifier of the stream this packet belongs to. pub fn stream_id(&self) -> u32 { self.id } /// Get the presentation timestamp of the packet in `TimeBase` units. May be 0 if unknown. pub fn pts(&self) -> u64 { self.pts } /// Get the duration of the packet in `TimeBase` units. May be 0 if unknown. pub fn duration(&self) -> u64 { self.dur } /// Get the packet buffer as an immutable slice. pub fn buf(&self) -> &[u8] { &self.data } /// Get a `BufStream` to read the packet data buffer sequentially. pub fn as_buf_stream(&self) -> BufStream { BufStream::new(&self.data) } } pub mod util { //! Helper utilities for implementing `FormatReader`s. /// A `SeekPoint` is a mapping between a sample or frame number to byte offset within a media /// stream. #[derive(Copy, Clone, Debug, PartialEq)] pub struct SeekPoint { /// The frame or sample timestamp of the `SeekPoint`. pub frame_ts: u64, /// The byte offset of the `SeekPoint`s timestamp relative to a format-specific location. pub byte_offset: u64, /// The number of frames the `SeekPoint` covers. pub n_frames: u32, } impl SeekPoint { fn new(frame_ts: u64, byte_offset: u64, n_frames: u32) -> Self { SeekPoint { frame_ts, byte_offset, n_frames } } } /// A `SeekIndex` stores `SeekPoint`s (generally a sample or frame number to byte offset) within /// a media stream and provides methods to efficiently search for the nearest `SeekPoint`(s) /// given a timestamp. /// /// A `SeekIndex` does not require complete coverage of the entire media stream. However, the /// better the coverage, the smaller the manual search range the `SeekIndex` will return. pub struct SeekIndex { points: Vec<SeekPoint>, } /// `SeekSearchResult` is the return value for a search on a `SeekIndex`. It returns a range of /// `SeekPoint`s a `FormatReader` should search to find the desired timestamp. Ranges are /// lower-bound inclusive, and upper-bound exclusive. #[derive(Debug, PartialEq)] pub enum SeekSearchResult { /// The `SeekIndex` is empty so the desired timestamp could not be found. The entire stream /// should be searched for the desired timestamp. Stream, /// The desired timestamp can be found before, the `SeekPoint`. The stream should be /// searched for the desired timestamp from the start of the stream up-to, but not /// including, the `SeekPoint`. Upper(SeekPoint), /// The desired timestamp can be found at, or after, the `SeekPoint`. The stream should be /// searched for the desired timestamp starting at the provided `SeekPoint` up-to the end of /// the stream. Lower(SeekPoint), /// The desired timestamp can be found within the range. The stream should be searched for /// the desired starting at the first `SeekPoint` up-to, but not-including, the second /// `SeekPoint`. Range(SeekPoint, SeekPoint) } impl SeekIndex { /// Create an empty `SeekIndex` pub fn new() -> SeekIndex { SeekIndex { points: Vec::new(), } } /// Insert a `SeekPoint` into the index. pub fn insert(&mut self, frame: u64, byte_offset: u64, n_frames: u32) { // TODO: Ensure monotonic timestamp ordering of self.points. self.points.push(SeekPoint::new(frame, byte_offset, n_frames)); } /// Search the index to find a bounded range of bytes wherein the specified frame timestamp /// will be contained. If the index is empty, this function simply returns a result /// indicating the entire stream should be searched manually. pub fn search(&self, frame_ts: u64) -> SeekSearchResult { // The index must contain atleast one SeekPoint to return a useful result. if !self.points.is_empty() { let mut lower = 0; let mut upper = self.points.len() - 1; // If the desired timestamp is less than the first SeekPoint within the index, // indicate that the stream should be searched from the beginning. if frame_ts < self.points[lower].frame_ts { return SeekSearchResult::Upper(self.points[lower]); } // If the desired timestamp is greater than or equal to the last SeekPoint within // the index, indicate that the stream should be searched from the last SeekPoint. else if frame_ts >= self.points[upper].frame_ts { return SeekSearchResult::Lower(self.points[upper]); } // Desired timestamp is between the lower and upper indicies. Perform a binary // search to find a range of SeekPoints containing the desired timestamp. The binary // search exits when either two adjacent SeekPoints or a single SeekPoint is found. while upper - lower > 1 { let mid = (lower + upper) / 2; let mid_ts = self.points[mid].frame_ts; if frame_ts < mid_ts { upper = mid; } else { lower = mid; } } return SeekSearchResult::Range(self.points[lower], self.points[upper]); } // The index is empty, the stream must be searched manually. SeekSearchResult::Stream } } #[cfg(test)] mod tests { use super::{SeekIndex, SeekPoint, SeekSearchResult}; #[test] fn verify_seek_index_search() { let mut index = SeekIndex::new(); index.insert(50 , 0, 45); index.insert(120, 0, 4); index.insert(320, 0, 100); index.insert(421, 0, 10); index.insert(500, 0, 12); index.insert(600, 0, 12); assert_eq!(index.search(25) , SeekSearchResult::Upper(SeekPoint::new(50 ,0, 45))); assert_eq!(index.search(700), SeekSearchResult::Lower(SeekPoint::new(600,0, 12))); assert_eq!( index.search(110), SeekSearchResult::Range(SeekPoint::new(50 ,0, 45), SeekPoint::new(120,0,4)) ); assert_eq!( index.search(340), SeekSearchResult::Range(SeekPoint::new(320,0,100), SeekPoint::new(421,0,10)) ); assert_eq!( index.search(320), SeekSearchResult::Range(SeekPoint::new(320,0,100), SeekPoint::new(421,0,10)) ); } } }