15b2ca7e77
* Removes unused userData * Switches render time to a timestamp. Bug: None Change-Id: If6e055e9f5486081a850691f6c481c89b59d5de2 Reviewed-on: https://webrtc-review.googlesource.com/c/src/+/270580 Reviewed-by: Erik Språng <sprang@webrtc.org> Commit-Queue: Evan Shrubsole <eshr@webrtc.org> Cr-Commit-Position: refs/heads/main@{#37698}
80 lines
2.5 KiB
C++
80 lines
2.5 KiB
C++
/*
|
|
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
#include "modules/video_coding/timestamp_map.h"
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include "modules/include/module_common_types_public.h"
|
|
|
|
namespace webrtc {
|
|
|
|
TimestampMap::TimestampMap(size_t capacity)
|
|
: ring_buffer_(new TimestampDataTuple[capacity]),
|
|
capacity_(capacity),
|
|
next_add_idx_(0),
|
|
next_pop_idx_(0) {}
|
|
|
|
TimestampMap::~TimestampMap() {}
|
|
|
|
void TimestampMap::Add(uint32_t timestamp, const FrameInformation& data) {
|
|
ring_buffer_[next_add_idx_].timestamp = timestamp;
|
|
ring_buffer_[next_add_idx_].data = data;
|
|
next_add_idx_ = (next_add_idx_ + 1) % capacity_;
|
|
|
|
if (next_add_idx_ == next_pop_idx_) {
|
|
// Circular list full; forget oldest entry.
|
|
next_pop_idx_ = (next_pop_idx_ + 1) % capacity_;
|
|
}
|
|
}
|
|
|
|
absl::optional<FrameInformation> TimestampMap::Pop(uint32_t timestamp) {
|
|
while (!IsEmpty()) {
|
|
if (ring_buffer_[next_pop_idx_].timestamp == timestamp) {
|
|
// Found start time for this timestamp.
|
|
const FrameInformation& data = ring_buffer_[next_pop_idx_].data;
|
|
ring_buffer_[next_pop_idx_].timestamp = 0;
|
|
next_pop_idx_ = (next_pop_idx_ + 1) % capacity_;
|
|
return data;
|
|
} else if (IsNewerTimestamp(ring_buffer_[next_pop_idx_].timestamp,
|
|
timestamp)) {
|
|
// The timestamp we are looking for is not in the list.
|
|
return absl::nullopt;
|
|
}
|
|
|
|
// Not in this position, check next (and forget this position).
|
|
next_pop_idx_ = (next_pop_idx_ + 1) % capacity_;
|
|
}
|
|
|
|
// Could not find matching timestamp in list.
|
|
return absl::nullopt;
|
|
}
|
|
|
|
bool TimestampMap::IsEmpty() const {
|
|
return (next_add_idx_ == next_pop_idx_);
|
|
}
|
|
|
|
size_t TimestampMap::Size() const {
|
|
// The maximum number of elements in the list is `capacity_` - 1. The list is
|
|
// empty if the add and pop indices are equal.
|
|
return next_add_idx_ >= next_pop_idx_
|
|
? next_add_idx_ - next_pop_idx_
|
|
: next_add_idx_ + capacity_ - next_pop_idx_;
|
|
}
|
|
|
|
void TimestampMap::Clear() {
|
|
while (!IsEmpty()) {
|
|
ring_buffer_[next_pop_idx_].timestamp = 0;
|
|
next_pop_idx_ = (next_pop_idx_ + 1) % capacity_;
|
|
}
|
|
}
|
|
|
|
} // namespace webrtc
|