blob: 2a70468e6920ac94d8a39fb4eb0af2c129435ebd (
plain)
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
|
/*
* Copyright (c) 2023 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 "test/pc/e2e/analyzer/video/dvqa/frames_storage.h"
#include <cstdint>
#include <utility>
#include "absl/types/optional.h"
#include "api/units/timestamp.h"
#include "api/video/video_frame.h"
namespace webrtc {
void FramesStorage::Add(const VideoFrame& frame, Timestamp captured_time) {
heap_.push_back(HeapNode{.frame = frame, .captured_time = captured_time});
frame_id_index_[frame.id()] = heap_.size() - 1;
Heapify(heap_.size() - 1);
RemoveTooOldFrames();
}
absl::optional<VideoFrame> FramesStorage::Get(uint16_t frame_id) {
auto it = frame_id_index_.find(frame_id);
if (it == frame_id_index_.end()) {
return absl::nullopt;
}
return heap_[it->second].frame;
}
void FramesStorage::Remove(uint16_t frame_id) {
RemoveInternal(frame_id);
RemoveTooOldFrames();
}
void FramesStorage::RemoveInternal(uint16_t frame_id) {
auto it = frame_id_index_.find(frame_id);
if (it == frame_id_index_.end()) {
return;
}
size_t index = it->second;
frame_id_index_.erase(it);
// If it's not the last element in the heap, swap the last element in the heap
// with element to remove.
if (index != heap_.size() - 1) {
heap_[index] = std::move(heap_[heap_.size() - 1]);
frame_id_index_[heap_[index].frame.id()] = index;
}
// Remove the last element.
heap_.pop_back();
if (index < heap_.size()) {
Heapify(index);
}
}
void FramesStorage::Heapify(size_t index) {
HeapifyUp(index);
HeapifyDown(index);
}
void FramesStorage::HeapifyUp(size_t index) {
if (index == 0) {
return;
}
RTC_CHECK_LT(index, heap_.size());
size_t parent = index / 2;
if (heap_[parent].captured_time <= heap_[index].captured_time) {
return;
}
HeapNode tmp = std::move(heap_[index]);
heap_[index] = std::move(heap_[parent]);
heap_[parent] = std::move(tmp);
frame_id_index_[heap_[index].frame.id()] = index;
frame_id_index_[heap_[parent].frame.id()] = parent;
HeapifyUp(parent);
}
void FramesStorage::HeapifyDown(size_t index) {
RTC_CHECK_GE(index, 0);
RTC_CHECK_LT(index, heap_.size());
size_t left_child = 2 * index;
size_t right_child = 2 * index + 1;
if (left_child >= heap_.size()) {
return;
}
size_t smallest_child = left_child;
if (right_child < heap_.size() &&
heap_[right_child].captured_time < heap_[left_child].captured_time) {
smallest_child = right_child;
}
if (heap_[index].captured_time <= heap_[smallest_child].captured_time) {
return;
}
HeapNode tmp = std::move(heap_[index]);
heap_[index] = std::move(heap_[smallest_child]);
heap_[smallest_child] = std::move(tmp);
frame_id_index_[heap_[index].frame.id()] = index;
frame_id_index_[heap_[smallest_child].frame.id()] = smallest_child;
HeapifyDown(smallest_child);
}
void FramesStorage::RemoveTooOldFrames() {
Timestamp now = clock_->CurrentTime();
while (!heap_.empty() &&
(heap_[0].captured_time + max_storage_duration_) < now) {
RemoveInternal(heap_[0].frame.id());
}
}
} // namespace webrtc
|
