breadcast/breadcast-caststream-sys/vendor/openscreen/cast/streaming/impl/sender_impl.cc

// Copyright 2026 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "cast/streaming/impl/sender_impl.h"

#include <algorithm>
#include <chrono>
#include <ratio>
#include <utility>

#include "cast/streaming/impl/rtp_defines.h"
#include "cast/streaming/impl/statistics_common.h"
#include "cast/streaming/public/session_config.h"
#include "platform/base/trivial_clock_traits.h"
#include "util/chrono_helpers.h"
#include "util/osp_logging.h"
#include "util/std_util.h"
#include "util/string_util.h"
#include "util/trace_logging.h"

namespace openscreen::cast {
namespace {

// The minimum amount of media the Sender keeps in-flight, regardless of the
// measured network round-trip time. This keeps the encoder pipeline flowing on
// low-latency networks (roughly two video frames at 30 FPS). See
// crbug.com/498035450.
constexpr Clock::duration kMinSenderInFlight =
    Clock::to_duration(milliseconds(66));

}  // namespace

using clock_operators::operator<<;

SenderImpl::SenderImpl(Environment& environment,
                       SenderPacketRouter& packet_router,
                       SessionConfig config,
                       RtpPayloadType rtp_payload_type)
    : config_(config),
      packet_router_(packet_router),
      rtcp_session_(config.sender_ssrc,
                    config.receiver_ssrc,
                    environment.now()),
      rtcp_parser_(rtcp_session_, *this),
      sender_report_builder_(rtcp_session_),
      rtp_packetizer_(rtp_payload_type,
                      config.sender_ssrc,
                      packet_router_->max_packet_size()),
      rtp_timebase_(config.rtp_timebase),
      crypto_(config.aes_secret_key, config.aes_iv_mask),
      statistics_dispatcher_(environment),
      target_playout_delay_(config.target_playout_delay) {
  OSP_CHECK_NE(rtcp_session_.sender_ssrc(), rtcp_session_.receiver_ssrc());
  OSP_CHECK_GT(rtp_timebase_, 0);
  OSP_CHECK_GT(target_playout_delay_, milliseconds::zero());

  pending_sender_report_.reference_time = SenderPacketRouter::kNever;

  packet_router_->OnSenderCreated(rtcp_session_.receiver_ssrc(), this);
}

SenderImpl::~SenderImpl() {
  packet_router_->OnSenderDestroyed(rtcp_session_.receiver_ssrc());
}

void SenderImpl::SetObserver(openscreen::cast::Sender::Observer* observer) {
  OSP_CHECK_NE(observer_, observer);
  observer_ = observer;
}

size_t SenderImpl::GetInFlightFrameCount() const {
  return num_frames_in_flight_;
}

Clock::duration SenderImpl::GetInFlightMediaDuration(
    RtpTimeTicks next_frame_rtp_timestamp) const {
  if (num_frames_in_flight_ == 0) {
    return Clock::duration::zero();  // No frames are currently in-flight.
  }

  const PendingFrameSlot& oldest_slot = get_slot_for(checkpoint_frame_id_ + 1);
  // Note: The oldest slot's frame cannot have been canceled because the
  // protocol does not allow ACK'ing this particular frame without also moving
  // the checkpoint forward. See "CST2 feedback" discussion in rtp_defines.h.
  OSP_CHECK(oldest_slot.is_active_for_frame(checkpoint_frame_id_ + 1));

  return (next_frame_rtp_timestamp - oldest_slot.frame->rtp_timestamp)
      .ToDuration<Clock::duration>(rtp_timebase_);
}

Clock::duration SenderImpl::GetMaxInFlightMediaDuration() const {
  // The Sender keeps only enough media in-flight to drive the loss-detection
  // and retransmit feedback loop, which takes on the order of two network
  // round-trips (one to detect a loss via NACK, one to retransmit). A small
  // floor (`kMinSenderInFlight`) keeps the encoder pipeline flowing on
  // low-latency networks where 2*RTT is negligible.
  //
  // The result is capped at a third of the playout delay window so that the
  // majority of the budget is reserved for the Receiver, which needs buffer to
  // absorb NACK retransmissions. Bounding the Sender this way also makes it
  // drop frames earlier during congestion (saving bandwidth and CPU) rather
  // than over-buffering. See crbug.com/498035450.
  //
  // Note: the upper bound is held at or above `kMinSenderInFlight` so the
  // std::clamp() bounds remain well-ordered even for very small playout delays.
  const Clock::duration max_in_flight = std::max(
      kMinSenderInFlight, Clock::to_duration(target_playout_delay_) / 3);
  return std::clamp(round_trip_time_ * 2, kMinSenderInFlight, max_in_flight);
}

bool SenderImpl::NeedsKeyFrame() const {
  return last_enqueued_key_frame_id_ <= picture_lost_at_frame_id_;
}

FrameId SenderImpl::GetNextFrameId() const {
  return last_enqueued_frame_id_ + 1;
}

Clock::duration SenderImpl::GetCurrentRoundTripTime() const {
  return round_trip_time_;
}

openscreen::cast::Sender::EnqueueFrameResult SenderImpl::EnqueueFrame(
    const EncodedFrame& frame) {
  // Assume the fields of the `frame` have all been set correctly, with
  // monotonically increasing timestamps and a valid pointer to the data.
  OSP_CHECK_EQ(frame.frame_id, GetNextFrameId());
  OSP_CHECK_GE(frame.referenced_frame_id, FrameId::first());
  if (frame.frame_id != FrameId::first()) {
    OSP_CHECK_GT(frame.rtp_timestamp, pending_sender_report_.rtp_timestamp);
    if (frame.reference_time <= pending_sender_report_.reference_time) {
      OSP_DLOG_WARN << "Frame " << frame.frame_id
                    << " has non-monotonic reference_time: "
                    << frame.reference_time
                    << " <= " << pending_sender_report_.reference_time;
    }
  }
  OSP_CHECK(frame.data.data());

  const auto capture_begin_time =
      (frame.capture_begin_time > Clock::time_point::min())
          ? frame.capture_begin_time
          : Clock::now();

  TRACE_FLOW_BEGIN_WITH_TIME(TraceCategory::kSender, "Frame.Capture",
                             frame.frame_id, capture_begin_time);

  if (frame.capture_end_time > Clock::time_point::min()) {
    TRACE_FLOW_STEP_WITH_TIME(TraceCategory::kSender, "Frame.Capture.End",
                              frame.frame_id, frame.capture_end_time);
  }

  TRACE_FLOW_STEP(TraceCategory::kSender, "Frame.Encode.End", frame.frame_id);

  // Check whether enqueuing the frame would exceed the design limit for the
  // span of FrameIds. Even if `num_frames_in_flight_` is less than
  // kMaxUnackedFrames, it's the span of FrameIds that is restricted.
  if ((frame.frame_id - checkpoint_frame_id_) > kMaxUnackedFrames) {
    return REACHED_ID_SPAN_LIMIT;
  }

  // Check whether enqueuing the frame would exceed the current maximum media
  // duration limit.
  if (GetInFlightMediaDuration(frame.rtp_timestamp) >
      GetMaxInFlightMediaDuration()) {
    return MAX_DURATION_IN_FLIGHT;
  }

  // Encrypt the frame and initialize the slot tracking its sending.
  PendingFrameSlot& slot = get_slot_for(frame.frame_id);
  OSP_CHECK(!slot.frame);
  slot.frame = crypto_.Encrypt(frame);
  const int packet_count = rtp_packetizer_.ComputeNumberOfPackets(*slot.frame);
  if (packet_count <= 0) {
    slot.frame.reset();
    return PAYLOAD_TOO_LARGE;
  }
  slot.send_flags.Resize(packet_count, BitVector::SET);
  slot.packet_sent_times.assign(packet_count, SenderPacketRouter::kNever);

  // Officially record the "enqueue."
  ++num_frames_in_flight_;
  last_enqueued_frame_id_ = slot.frame->frame_id;
  OSP_CHECK_LE(
      num_frames_in_flight_,
      static_cast<size_t>(last_enqueued_frame_id_ - checkpoint_frame_id_));
  if (slot.frame->dependency == EncodedFrame::Dependency::kKeyFrame) {
    last_enqueued_key_frame_id_ = slot.frame->frame_id;
  }
  TRACE_FLOW_STEP(TraceCategory::kSender, "Frame.Enqueued", frame.frame_id);

  // Update the target playout delay, if necessary.
  if (slot.frame->new_playout_delay > milliseconds::zero()) {
    target_playout_delay_ = slot.frame->new_playout_delay;
    playout_delay_change_at_frame_id_ = slot.frame->frame_id;
  }

  // Update the lip-sync information for the next Sender Report, ensuring that
  // the reference time is monotonically increasing.
  pending_sender_report_.reference_time =
      frame.frame_id == FrameId::first()
          ? slot.frame->reference_time
          : std::max(slot.frame->reference_time,
                     pending_sender_report_.reference_time);
  pending_sender_report_.rtp_timestamp = slot.frame->rtp_timestamp;

  // If the round trip time hasn't been computed yet, immediately send a RTCP
  // packet (i.e., before the RTP packets are sent). The RTCP packet will
  // provide a Sender Report which contains the required lip-sync information
  // the Receiver needs for timing the media playout.
  //
  // Detail: Working backwards, if the round trip time is not known, then this
  // Sender has never processed a Receiver Report. Thus, the Receiver has never
  // provided a Receiver Report, which it can only do after having processed a
  // Sender Report from this Sender. Thus, this Sender really needs to send
  // that, right now!
  if (round_trip_time_ == Clock::duration::zero()) {
    packet_router_->RequestRtcpSend(rtcp_session_.receiver_ssrc());
  }

  // Re-activate RTP sending if it was suspended.
  packet_router_->RequestRtpSend(rtcp_session_.receiver_ssrc());
  statistics_dispatcher_.DispatchEnqueueEvents(config_.stream_type, frame);

  return OK;
}

void SenderImpl::CancelInFlightData() {
  TRACE_DEFAULT_SCOPED1(
      TraceCategory::kSender, "frames_in_flight",
      std::to_string(last_enqueued_frame_id_ - checkpoint_frame_id_));

  while (checkpoint_frame_id_ < last_enqueued_frame_id_) {
    ++checkpoint_frame_id_;
    CancelPendingFrame(checkpoint_frame_id_, /*was_acked*/ false);
  }
  DispatchCancellations();
}

void SenderImpl::ReportFrameDropEvent(FrameId frame_id,
                                      RtpTimeTicks rtp_timestamp,
                                      Clock::time_point drop_time) {
  statistics_dispatcher_.DispatchFrameDropEvent(config_.stream_type, frame_id,
                                                rtp_timestamp, drop_time);
}

void SenderImpl::OnReceivedRtcpPacket(Clock::time_point arrival_time,
                                      ByteView packet) {
  rtcp_packet_arrival_time_ = arrival_time;
  // This call to Parse() invoke zero or more of the OnReceiverXYZ() methods in
  // the current call stack:
  if (rtcp_parser_.Parse(packet, last_enqueued_frame_id_)) {
    packet_router_->OnRtcpReceived(arrival_time, round_trip_time_);
  }
}

ByteBuffer SenderImpl::GetRtcpPacketForImmediateSend(
    Clock::time_point send_time,
    ByteBuffer buffer) {
  if (pending_sender_report_.reference_time == SenderPacketRouter::kNever) {
    // Cannot send a report if one is not available (i.e., a frame has never
    // been enqueued).
    return buffer.subspan(0, 0);
  }

  // The Sender Report to be sent is a snapshot of the "pending Sender Report,"
  // but with its timestamp fields modified. First, the reference time is set to
  // the RTCP packet's send time. Then, the corresponding RTP timestamp is
  // translated to match (for lip-sync).
  RtcpSenderReport sender_report = pending_sender_report_;
  sender_report.reference_time = send_time;
  sender_report.rtp_timestamp += RtpTimeDelta::FromDuration(
      sender_report.reference_time - pending_sender_report_.reference_time,
      rtp_timebase_);

  return sender_report_builder_.BuildPacket(sender_report, buffer).first;
}

ByteBuffer SenderImpl::GetRtpPacketForImmediateSend(Clock::time_point send_time,
                                                    ByteBuffer buffer) {
  ChosenPacket chosen = ChooseNextRtpPacketNeedingSend();

  // If no packets need sending (i.e., all packets have been sent at least once
  // and do not need to be re-sent yet), check whether a Kickstart packet should
  // be sent. It's possible that there has been complete packet loss of some
  // frames, and the Receiver may not be aware of the existence of the latest
  // frame(s). Kickstarting is the only way the Receiver can discover the newer
  // frames it doesn't know about.
  if (!chosen) {
    const ChosenPacketAndWhen kickstart = ChooseKickstartPacket();
    if (kickstart.when > send_time) {
      // Nothing to send, so return "empty" signal to the packet router. The
      // packet router will suspend RTP sending until this Sender explicitly
      // resumes it.
      return buffer.subspan(0, 0);
    }
    chosen = kickstart;
    OSP_CHECK(chosen);
  }

  const ByteBuffer result = rtp_packetizer_.GeneratePacket(
      *chosen.slot->frame, chosen.packet_id, buffer);
  chosen.slot->send_flags.Clear(chosen.packet_id);
  chosen.slot->packet_sent_times[chosen.packet_id] = send_time;

  ++pending_sender_report_.send_packet_count;
  // According to RFC3550, the octet count does not include the RTP header. The
  // following is just a good approximation, however, because the header size
  // will very infrequently be 4 bytes greater (see
  // RtpPacketizer::kAdaptiveLatencyHeaderSize). No known Cast Streaming
  // Receiver implementations use this for anything, and so this should be fine.
  const int approximate_octet_count =
      static_cast<int>(result.size()) - RtpPacketizer::kBaseRtpHeaderSize;
  OSP_CHECK_GE(approximate_octet_count, 0);
  pending_sender_report_.send_octet_count += approximate_octet_count;

  return result;
}

Clock::time_point SenderImpl::GetRtpResumeTime() {
  if (ChooseNextRtpPacketNeedingSend()) {
    return Alarm::kImmediately;
  }
  return ChooseKickstartPacket().when;
}

RtpTimeTicks SenderImpl::GetLastRtpTimestamp() const {
  return {};
}

StreamType SenderImpl::GetStreamType() const {
  return config_.stream_type;
}

void SenderImpl::OnReceiverReferenceTimeAdvanced(
    Clock::time_point reference_time) {
  // Not used.
}

// static
Clock::duration SenderImpl::SmoothRoundTripTime(Clock::duration estimate,
                                                Clock::duration measurement) {
  // Measurements typically have high variance, so smooth them with an
  // exponentially-weighted moving average. The filter is asymmetric ("fast
  // attack, slow decay"): it reacts quickly to upward spikes so the Sender
  // notices congestion onset promptly and backs off, but decays slowly on the
  // way down so a single low sample doesn't collapse the estimate. See
  // crbug.com/498036656.
  if (estimate == Clock::duration::zero()) {
    return measurement;
  }
  if (measurement > estimate) {
    // Spike / congestion onset: give the new measurement half the weight so the
    // estimate climbs quickly.
    return (estimate + measurement) / 2;
  }
  // Recovery: give the new measurement 1/8 weight (and the old estimate 7/8) to
  // de-noise, since downward measurements are typically the network settling
  // rather than a sustained improvement.
  constexpr int kInertia = 7;
  return (kInertia * estimate + measurement) / (kInertia + 1);
}

void SenderImpl::OnReceiverReport(const RtcpReportBlock& receiver_report) {
  OSP_CHECK_NE(rtcp_packet_arrival_time_, SenderPacketRouter::kNever);

  const Clock::duration total_delay =
      rtcp_packet_arrival_time_ -
      sender_report_builder_.GetRecentReportTime(
          receiver_report.last_status_report_id, rtcp_packet_arrival_time_);
  const auto non_network_delay =
      Clock::to_duration(receiver_report.delay_since_last_report);

  // Round trip time measurement: This is the time elapsed since the Sender
  // Report was sent, minus the time the Receiver did other stuff before sending
  // the Receiver Report back.
  //
  // If the round trip time seems to be less than or equal to zero, assume clock
  // imprecision by one or both peers caused a bad value to be calculated. The
  // true value is likely very close to zero (i.e., this is ideal network
  // behavior); and so just represent this as 75 µs, an optimistic
  // wired-Ethernet LAN ping time.
  constexpr auto kNearZeroRoundTripTime = Clock::to_duration(microseconds(75));
  static_assert(kNearZeroRoundTripTime > Clock::duration::zero(),
                "More precision in Clock::duration needed!");
  const Clock::duration measurement =
      std::max(total_delay - non_network_delay, kNearZeroRoundTripTime);

  // Validate the measurement by using the current target playout delay as a
  // "reasonable upper-bound." It's certainly possible that the actual network
  // round-trip time could exceed the target playout delay, but that would mean
  // the current network performance is totally inadequate for streaming anyway.
  // We cap the measurement here instead of ignoring it so the Sender still
  // backs off its estimates during severe network congestion.
  Clock::duration clamped_measurement = measurement;
  if (clamped_measurement > target_playout_delay_) {
    OSP_LOG_WARN << "Capping round-trip time measurement (" << measurement
                 << ") to the current target playout delay ("
                 << target_playout_delay_ << ").";
    clamped_measurement = target_playout_delay_;
  }

  round_trip_time_ = SmoothRoundTripTime(round_trip_time_, clamped_measurement);
  TRACE_SCOPED1(TraceCategory::kSender, "UpdatedRoundTripTime",
                "round_trip_time", ToString(round_trip_time_));
}

void SenderImpl::OnCastReceiverFrameLogMessages(
    std::vector<RtcpReceiverFrameLogMessage> messages) {
  statistics_dispatcher_.DispatchFrameLogMessages(config_.stream_type,
                                                  messages);
}

void SenderImpl::OnReceiverIndicatesPictureLoss() {
  TRACE_DEFAULT_SCOPED1(TraceCategory::kSender, "last_received_frame_id",
                        picture_lost_at_frame_id_.ToString());
  // The Receiver will continue the PLI notifications until it has received a
  // key frame. Thus, if a key frame is already in-flight, don't make a state
  // change that would cause this Sender to force another expensive key frame.
  if (checkpoint_frame_id_ < last_enqueued_key_frame_id_) {
    return;
  }

  picture_lost_at_frame_id_ = checkpoint_frame_id_;

  if (observer_) {
    observer_->OnPictureLost();
  }

  // Note: It may seem that all pending frames should be canceled until
  // EnqueueFrame() is called with a key frame. However:
  //
  //   1. The Receiver should still be the main authority on what frames/packets
  //      are being ACK'ed and NACK'ed.
  //
  //   2. It may be desirable for the Receiver to be "limping along" in the
  //      meantime. For example, video may be corrupted but mostly watchable,
  //      and so it's best for the Sender to continue sending the non-key frames
  //      until the Receiver indicates otherwise.
}

void SenderImpl::OnReceiverCheckpoint(FrameId frame_id,
                                      milliseconds playout_delay) {
  TRACE_DEFAULT_SCOPED2(TraceCategory::kSender, "frame_id", frame_id.ToString(),
                        "playout_delay", ToString(playout_delay));
  if (frame_id > last_enqueued_frame_id_) {
    TRACE_SET_RESULT(Error::Code::kParameterOutOfRange);
    OSP_LOG_ERROR
        << "Ignoring checkpoint for " << latest_expected_frame_id_
        << " because this Sender could not have sent any frames after "
        << last_enqueued_frame_id_ << '.';
    return;
  }
  // CompoundRtcpParser should guarantee this:
  OSP_CHECK_GE(playout_delay, milliseconds::zero());
  while (checkpoint_frame_id_ < frame_id) {
    ++checkpoint_frame_id_;
    PendingFrameSlot& slot = get_slot_for(checkpoint_frame_id_);
    if (slot.is_active_for_frame(checkpoint_frame_id_)) {
      const RtpTimeTicks rtp_timestamp = slot.frame->rtp_timestamp;
      statistics_dispatcher_.DispatchAckEvent(
          config_.stream_type, rtp_timestamp, checkpoint_frame_id_);
      CancelPendingFrame(checkpoint_frame_id_, /*was_acked*/ true);

      TRACE_FLOW_STEP(TraceCategory::kSender, "Frame.Acked",
                      checkpoint_frame_id_);
    }
  }
  latest_expected_frame_id_ = std::max(latest_expected_frame_id_, frame_id);
  DispatchCancellations();

  if (playout_delay != target_playout_delay_ &&
      frame_id >= playout_delay_change_at_frame_id_) {
    OSP_LOG_WARN << "Sender's target playout delay (" << target_playout_delay_
                 << ") disagrees with the Receiver's (" << playout_delay << ")";
  }
}

void SenderImpl::OnReceiverHasFrames(std::vector<FrameId> acks) {
  OSP_DCHECK(!acks.empty() && AreElementsSortedAndUnique(acks));
  TRACE_DEFAULT_SCOPED1(TraceCategory::kSender, "frame_ids",
                        string_util::Join(acks));

  if (acks.back() > last_enqueued_frame_id_) {
    TRACE_SET_RESULT(Error::Code::kParameterOutOfRange);
    OSP_LOG_ERROR << "Ignoring individual frame ACKs: ACKing frame "
                  << latest_expected_frame_id_
                  << " is invalid because this Sender could not have sent any "
                     "frames after "
                  << last_enqueued_frame_id_ << '.';
    return;
  }

  for (FrameId id : acks) {
    TRACE_FLOW_STEP(TraceCategory::kSender, "Frame.Acked", id);
    PendingFrameSlot& slot = get_slot_for(id);
    if (slot.is_active_for_frame(id)) {
      const RtpTimeTicks rtp_timestamp = slot.frame->rtp_timestamp;
      statistics_dispatcher_.DispatchAckEvent(config_.stream_type,
                                              rtp_timestamp, id);
    }
    CancelPendingFrame(id, /*was_acked*/ true);
  }
  latest_expected_frame_id_ = std::max(latest_expected_frame_id_, acks.back());
  DispatchCancellations();
}

void SenderImpl::OnReceiverIsMissingPackets(std::vector<PacketNack> nacks) {
  TRACE_DEFAULT_SCOPED1(TraceCategory::kSender, "number_of_packets",
                        std::to_string(nacks.size()));
  OSP_DCHECK(!nacks.empty() && AreElementsSortedAndUnique(nacks));
  OSP_CHECK_NE(rtcp_packet_arrival_time_, SenderPacketRouter::kNever);

  // This is a point-in-time threshold that indicates whether each NACK will
  // trigger a packet retransmit. The threshold is based on the network round
  // trip time because a Receiver's NACK may have been issued while the needed
  // packet was in-flight from the Sender. In such cases, the Receiver's NACK is
  // likely stale and this Sender should not redundantly re-transmit the packet
  // again.
  const Clock::time_point too_recent_a_send_time =
      rtcp_packet_arrival_time_ - round_trip_time_;

  // Iterate over all the NACKs...
  bool need_to_send = false;
  for (auto nack_it = nacks.begin(); nack_it != nacks.end();) {
    // Find the slot associated with the NACK's frame ID.
    const FrameId frame_id = nack_it->frame_id;
    PendingFrameSlot* slot = nullptr;
    if (frame_id <= last_enqueued_frame_id_) {
      PendingFrameSlot& candidate_slot = get_slot_for(frame_id);
      if (candidate_slot.is_active_for_frame(frame_id)) {
        slot = &candidate_slot;
      }
    }

    // If no slot was found (i.e., the NACK is invalid) for the frame, skip-over
    // all other NACKs for the same frame. While it seems to be a bug that the
    // Receiver would attempt to NACK a frame that does not yet exist, this can
    // happen in rare cases where RTCP packets arrive out-of-order (i.e., the
    // network shuffled them).
    if (!slot) {
      TRACE_SCOPED1(TraceCategory::kSender, "MissingNackSlot", "frame_id",
                    frame_id.ToString());
      for (++nack_it; nack_it != nacks.end() && nack_it->frame_id == frame_id;
           ++nack_it) {
      }
      continue;
    }

    latest_expected_frame_id_ = std::max(latest_expected_frame_id_, frame_id);

    const auto HandleIndividualNack = [&](FramePacketId packet_id) {
      if (slot->packet_sent_times[packet_id] <= too_recent_a_send_time) {
        slot->send_flags.Set(packet_id);
        need_to_send = true;
      }
    };
    const FramePacketId range_end = slot->packet_sent_times.size();
    if (nack_it->packet_id == kAllPacketsLost) {
      for (FramePacketId packet_id = 0; packet_id < range_end; ++packet_id) {
        HandleIndividualNack(packet_id);
      }
      ++nack_it;
    } else {
      do {
        if (nack_it->packet_id < range_end) {
          HandleIndividualNack(nack_it->packet_id);
        } else {
          OSP_LOG_WARN
              << "Ignoring NACK for packet that doesn't exist in frame "
              << frame_id << ": " << static_cast<int>(nack_it->packet_id);
        }
        ++nack_it;
      } while (nack_it != nacks.end() && nack_it->frame_id == frame_id);
    }
  }

  if (need_to_send) {
    packet_router_->RequestRtpSend(rtcp_session_.receiver_ssrc());
  }
}

SenderImpl::ChosenPacket SenderImpl::ChooseNextRtpPacketNeedingSend() {
  // Find the oldest packet needing to be sent (or re-sent).
  for (FrameId frame_id = checkpoint_frame_id_ + 1;
       frame_id <= last_enqueued_frame_id_; ++frame_id) {
    PendingFrameSlot& slot = get_slot_for(frame_id);
    if (!slot.is_active_for_frame(frame_id)) {
      continue;  // Frame was canceled. None of its packets need to be sent.
    }
    const FramePacketId packet_id = slot.send_flags.FindFirstSet();
    if (packet_id < slot.send_flags.size()) {
      return {&slot, packet_id};
    }
  }

  return {};  // Nothing needs to be sent.
}

SenderImpl::ChosenPacketAndWhen SenderImpl::ChooseKickstartPacket() {
  if (latest_expected_frame_id_ >= last_enqueued_frame_id_) {
    // Since the Receiver must know about all of the frames currently queued, no
    // Kickstart packet is necessary.
    return {};
  }

  // The Kickstart packet is always in the last-enqueued frame, so that the
  // Receiver will know about every frame the Sender has. However, which packet
  // should be chosen? Any would do, since all packets contain the frame's total
  // packet count. For historical reasons, all sender implementations have
  // always just sent the last packet; and so that tradition is continued here.
  ChosenPacketAndWhen chosen;
  chosen.slot = &get_slot_for(last_enqueued_frame_id_);
  // Note: This frame cannot have been canceled since
  // `latest_expected_frame_id_` hasn't yet reached this point.
  OSP_CHECK(chosen.slot->is_active_for_frame(last_enqueued_frame_id_));
  chosen.packet_id = chosen.slot->send_flags.size() - 1;

  const Clock::time_point time_last_sent =
      chosen.slot->packet_sent_times[chosen.packet_id];
  // Sanity-check: This method should not be called to choose a packet while
  // there are still unsent packets.
  OSP_CHECK_NE(time_last_sent, SenderPacketRouter::kNever);

  // The desired Kickstart interval is a fraction of the total
  // `target_playout_delay_`. The reason for the specific ratio here is based on
  // lost knowledge (from legacy implementations); but it makes sense (i.e., to
  // be a good "network citizen") to be less aggressive for larger playout delay
  // windows, and more aggressive for shorter ones to avoid too-late packet
  // arrivals.
  using kWaitFraction = std::ratio<1, 20>;
  const Clock::duration desired_kickstart_interval =
      Clock::to_duration(target_playout_delay_) * kWaitFraction::num /
      kWaitFraction::den;
  // The actual interval used is increased, if current network performance
  // warrants waiting longer. Don't send a Kickstart packet until no NACKs
  // have been received for two network round-trip periods.
  constexpr int kLowerBoundRoundTrips = 2;
  const Clock::duration kickstart_interval = std::max(
      desired_kickstart_interval, round_trip_time_ * kLowerBoundRoundTrips);
  chosen.when = time_last_sent + kickstart_interval;

  return chosen;
}

void SenderImpl::CancelPendingFrame(FrameId frame_id, bool was_acked) {
  TRACE_FLOW_END(TraceCategory::kSender, "Frame.Cancelled", frame_id);

  PendingFrameSlot& slot = get_slot_for(frame_id);
  if (!slot.is_active_for_frame(frame_id)) {
    return;  // Frame was already canceled.
  }

  if (was_acked) {
    packet_router_->OnPayloadReceived(
        slot.frame->data.size(), rtcp_packet_arrival_time_, round_trip_time_);
  }

  slot.frame.reset();
  OSP_CHECK_GT(num_frames_in_flight_, 0);
  --num_frames_in_flight_;
  if (observer_) {
    pending_cancellations_.emplace_back(frame_id);
  }
}

void SenderImpl::DispatchCancellations() {
  if (observer_) {
    for (const FrameId id : pending_cancellations_) {
      observer_->OnFrameCanceled(id);
    }
  }
  pending_cancellations_.clear();

  // At this point, there should either be no frames in flight, or the frame
  // immediately after `checkpoint_frame_id_` must be valid.
  OSP_DCHECK((num_frames_in_flight_ == 0) ||
             get_slot_for(checkpoint_frame_id_ + 1)
                 .is_active_for_frame(checkpoint_frame_id_ + 1));
}

SenderImpl::PendingFrameSlot::PendingFrameSlot() = default;
SenderImpl::PendingFrameSlot::~PendingFrameSlot() = default;

}  // namespace openscreen::cast