blob: 275caf149dbc776f4fc233f1765b0537992f0591 [file] [log] [blame]
// Copyright 2024 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "quiche/quic/moqt/moqt_relay_track_publisher.h"
#include <cstdint>
#include <memory>
#include <optional>
#include "absl/base/attributes.h"
#include "absl/strings/string_view.h"
#include "quiche/quic/moqt/moqt_cached_object.h"
#include "quiche/quic/moqt/moqt_messages.h"
#include "quiche/quic/moqt/moqt_publisher.h"
#include "quiche/common/platform/api/quiche_logging.h"
#include "quiche/common/quiche_buffer_allocator.h"
#include "quiche/common/quiche_callbacks.h"
#include "quiche/common/quiche_mem_slice.h"
#include "quiche/common/simple_buffer_allocator.h"
#include "quiche/web_transport/web_transport.h"
namespace moqt {
bool MoqtRelayTrackPublisher::AddFin(Location sequence, uint64_t subgroup) {
if (!forwarding_preference_.has_value() ||
*forwarding_preference_ == MoqtForwardingPreference::kDatagram) {
return false;
}
auto group_it = queue_.find(sequence.group);
if (group_it == queue_.end()) {
// Group does not exist.
return false;
}
Group& group = group_it->second;
auto subgroup_it = group.subgroups.find(subgroup);
if (subgroup_it == group.subgroups.end()) {
// Subgroup does not exist.
return false;
}
if (subgroup_it->second.empty()) {
// Cannot FIN an empty subgroup.
return false;
}
if (subgroup_it->second.rbegin()->first != sequence.object) {
// The queue does not yet have the last object.
return false;
}
subgroup_it->second.rbegin()->second.fin_after_this = true;
for (MoqtObjectListener* listener : listeners_) {
listener->OnNewFinAvailable(sequence, subgroup);
}
return true;
}
bool MoqtRelayTrackPublisher::OnStreamReset(
uint64_t group_id, uint64_t subgroup_id,
webtransport::StreamErrorCode error_code) {
if (!forwarding_preference_.has_value() ||
*forwarding_preference_ == MoqtForwardingPreference::kDatagram) {
return false;
}
auto group_it = queue_.find(group_id);
if (group_it == queue_.end()) {
// Group does not exist.
return false;
}
Group& group = group_it->second;
auto subgroup_it = group.subgroups.find(subgroup_id);
if (subgroup_it == group.subgroups.end()) {
// Subgroup does not exist.
return false;
}
for (MoqtObjectListener* listener : listeners_) {
listener->OnSubgroupAbandoned(group_id, subgroup_id, error_code);
}
group.subgroups.erase(subgroup_id);
return true;
}
bool MoqtRelayTrackPublisher::AddObject(const PublishedObjectMetadata& metadata,
absl::string_view payload, bool fin) {
const Location& sequence = metadata.location;
bool last_object_in_stream = fin;
if (queue_.size() == kMaxQueuedGroups) {
if (queue_.begin()->first > sequence.group) {
QUICHE_DLOG(INFO) << "Skipping object from group " << sequence.group
<< " because it is too old.";
return true;
}
if (queue_.find(sequence.group) == queue_.end()) {
// Erase the oldest group.
for (MoqtObjectListener* listener : listeners_) {
listener->OnGroupAbandoned(queue_.begin()->first);
}
queue_.erase(queue_.begin());
}
}
// Validate the input given previously received markers.
if (end_of_track_.has_value() && sequence > *end_of_track_) {
QUICHE_DLOG(INFO) << "Skipping object because it is after the end of the "
<< "track";
return false;
}
if (metadata.status == MoqtObjectStatus::kEndOfTrack) {
if (sequence < next_sequence_) {
QUICHE_DLOG(INFO) << "EndOfTrack is too early.";
return false;
}
// TODO(martinduke): Check that EndOfTrack has normal IDs.
end_of_track_ = sequence;
}
auto group_it = queue_.try_emplace(sequence.group);
Group& group = group_it.first->second;
if (!group_it.second) { // Group already exists.
if (group.complete && sequence.object >= group.next_object) {
QUICHE_DLOG(INFO) << "Skipping object because it is after the end of the "
<< "group";
return false;
}
if (metadata.status == MoqtObjectStatus::kEndOfGroup &&
sequence.object < group.next_object) {
QUICHE_DLOG(INFO) << "Skipping EndOfGroup because it is not the last "
<< "object in the group.";
return false;
}
}
auto subgroup_it = group.subgroups.try_emplace(metadata.subgroup);
auto& subgroup = subgroup_it.first->second;
if (!subgroup.empty()) { // Check if the new object is valid
CachedObject& last_object = subgroup.rbegin()->second;
if (last_object.metadata.publisher_priority !=
metadata.publisher_priority) {
QUICHE_DLOG(INFO) << "Publisher priority changing in a subgroup";
return false;
}
if (last_object.fin_after_this) {
QUICHE_DLOG(INFO) << "Skipping object because it is after the end of the "
<< "subgroup";
return false;
}
// If last_object has stream-ending status, it should have been caught by
// the fin_after_this check above.
QUICHE_DCHECK(
last_object.metadata.status != MoqtObjectStatus::kEndOfGroup &&
last_object.metadata.status != MoqtObjectStatus::kEndOfTrack);
if (last_object.metadata.location.object >= sequence.object) {
QUICHE_DLOG(INFO) << "Skipping object because it does not increase the "
<< "object ID monotonically in the subgroup.";
return false;
}
}
// Object is valid. Update state.
if (next_sequence_ <= sequence) {
next_sequence_ = Location{sequence.group, sequence.object + 1};
}
if (sequence.object >= group.next_object) {
group.next_object = sequence.object + 1;
}
// Anticipate stream FIN with most non-normal objects.
switch (metadata.status) {
case MoqtObjectStatus::kEndOfTrack:
end_of_track_ = sequence;
last_object_in_stream = true;
ABSL_FALLTHROUGH_INTENDED;
case MoqtObjectStatus::kEndOfGroup:
group.complete = true;
last_object_in_stream = true;
break;
default:
break;
}
std::shared_ptr<quiche::QuicheMemSlice> slice =
payload.empty()
? nullptr
: std::make_shared<quiche::QuicheMemSlice>(quiche::QuicheBuffer::Copy(
quiche::SimpleBufferAllocator::Get(), payload));
subgroup.emplace(sequence.object,
CachedObject{metadata, slice, last_object_in_stream});
for (MoqtObjectListener* listener : listeners_) {
listener->OnNewObjectAvailable(sequence, metadata.subgroup,
metadata.publisher_priority);
}
return true;
}
std::optional<PublishedObject> MoqtRelayTrackPublisher::GetCachedObject(
uint64_t group_id, uint64_t subgroup_id, uint64_t min_object_id) const {
auto group_it = queue_.find(group_id);
if (group_it == queue_.end()) {
// Group does not exist.
return std::nullopt;
}
const Group& group = group_it->second;
auto subgroup_it = group.subgroups.find(subgroup_id);
if (subgroup_it == group.subgroups.end()) {
// Subgroup does not exist.
return std::nullopt;
}
const Subgroup& subgroup = subgroup_it->second;
if (subgroup.empty()) {
return std::nullopt; // There are no objects.
}
// Find an object with ID of at least min_object_id.
auto object_it = subgroup.lower_bound(min_object_id);
if (object_it == subgroup.end()) {
// No object after the last one received.
return std::nullopt;
}
return CachedObjectToPublishedObject(object_it->second);
}
void MoqtRelayTrackPublisher::ForAllObjects(
quiche::UnretainedCallback<void(const CachedObject&)> callback) {
for (auto& group_it : queue_) {
for (auto& subgroup_it : group_it.second.subgroups) {
for (auto& object_it : subgroup_it.second) {
callback(object_it.second);
}
}
}
}
std::optional<Location> MoqtRelayTrackPublisher::largest_location() const {
if (queue_.empty()) {
return std::nullopt;
}
return Location{next_sequence_.group, next_sequence_.object - 1};
}
} // namespace moqt