pub struct ChangeGate { /* private fields */ }Expand description
Forwards a video frame only when its picture is not the one it last
forwarded, and never more often than min_interval.
§What it is for
A live source produces frames at a rate, not on change. A screen capture of a still desktop captures nothing and re-emits the picture it already has; a compositor with nothing to recompose does the same. Everything downstream of that then works at the full rate to produce a result identical to the last one — and for a terminal that repaints a window per frame, that is the whole cost of an idle scene.
Put this in front of such a terminal and the idle scene costs nothing: it is not called at all until the picture changes.
§Why the rate limit lives here too
These two are one decision, and separating them breaks the second one.
A terminal that drops frames of its own — most do, to hold a preview to a rate a window can usefully repaint at — can drop a frame that did carry a change. The repeats that follow carry that same new picture, so a gate placed before such a terminal will suppress every one of them, and the display stays on the picture before the change until something else changes. Dropping to a rate and dropping repeats have to happen in that order, in one place, or the second silently defeats itself.
So the contract this offers a terminal is the useful one: the newest picture, no more often than this, and never the same one twice. A terminal behind this one should draw everything it receives.
§What it compares
Which buffer the pixels live in, not the frame around them — see
buffer::picture_id. It holds the frame it forwarded, which is what makes that
identity sound: a picture still held cannot be handed out again with
something else in it.
What it holds is the pooled reference it was given, not an
av_frame_ref of the picture inside it. A frame reference keeps the
buffer allocated but leaves the producer’s pool free to hand that slot
out again — and a producer that composites or scales into its pooled
frames then puts new pixels at the very address this is comparing
against, so a real change reads as “unchanged” and, if the scene goes
still right after, the display stays on the picture before it. Holding
the pooled reference keeps that slot checked out for exactly as long as
this names it. It costs the producer one frame, which its pool simply
grows by.
It reads no pixels, so it works the same on a GPU frame as on one in system memory, and costs a pointer comparison either way.
Implementations§
Source§impl ChangeGate
impl ChangeGate
Trait Implementations§
Source§impl Element for ChangeGate
impl Element for ChangeGate
Source§fn name(&self) -> Arc<str> ⓘ
fn name(&self) -> Arc<str> ⓘ
crate::bus::BusEvent stores names as
Arc<str> for exactly this reason: a hot path like
crate::queue::Queue posting BusEvent::Dropped once per
overflowed buffer shouldn’t pay for a fresh heap allocation every
time it wants to report which element it is.Source§fn element_type(&self) -> ElementType
fn element_type(&self) -> ElementType
ElementType.Source§fn pp_log(&self) -> &PpLog
fn pp_log(&self) -> &PpLog
crate::bus::Bus::post — same
id/name as Element::name, just already wrapped as the
crate::pp_log::PpLog its pp_info!/pp_warn!/pp_error! macros need. A
stored private field, not built fresh per call, for the same reason
name() returns a cheap Arc<str> clone instead of a fresh String
— see its own docs.Source§fn pp_log_mut(&mut self) -> &mut PpLog
fn pp_log_mut(&mut self) -> &mut PpLog
Element::pp_log reads — used by
crate::pipeline::ChainBuilder to stamp the owning
crate::pipeline::Pipeline’s id onto every element that
passes through it, via element_pp_log. Not meant to be called
from anywhere else.Source§fn graph_id(&self) -> Option<ElementId>
fn graph_id(&self) -> Option<ElementId>
ChainBuilder and keep the default None implementation.Source§fn attach_context(&mut self, _context: &Arc<Context>)
fn attach_context(&mut self, _context: &Arc<Context>)
Element::pp_log_mut hands it the pipeline’s
identity: the clock, the playback clock and the bus are the
pipeline’s to give, not the caller’s to choose. Read moreSource§impl Sink for ChangeGate
impl Sink for ChangeGate
Source§fn input_contract(&self) -> InputContract
fn input_contract(&self) -> InputContract
Whatever arrives, wherever its pixels live: this compares pointers and reads nothing, so it passes the upstream contract straight through.
Source§fn consume(&mut self, buf: MediaBuffer) -> Result<()>
fn consume(&mut self, buf: MediaBuffer) -> Result<()>
Source§fn control(&mut self, msg: ControlMsg) -> Result<()>
fn control(&mut self, msg: ControlMsg) -> Result<()>
ControlMsg (pause/resume/stop) and, for anything
with a downstream of its own, forwards it on — same shape as
consume, just a separate channel from MediaBuffer so it can
reach every element (not just ones that already know how to
interpret a data buffer) and, at a crate::queue::Queue, jump
ahead of whatever data is backed up instead of waiting behind it.
No default: every Sink has to consciously decide what this means
for it, rather than silently dropping it.Source§fn ready_consume(&mut self) -> bool
fn ready_consume(&mut self) -> bool
Self::consume can make progress now. Read more