1 /*
2 * Copyright 2019 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17 //#define LOG_NDEBUG 0
18 #define LOG_TAG "PipelineWatcher"
19
20 #include <numeric>
21
22 #include <log/log.h>
23
24 #include "PipelineWatcher.h"
25
26 namespace android {
27
inputDelay(uint32_t value)28 PipelineWatcher &PipelineWatcher::inputDelay(uint32_t value) {
29 mInputDelay = value;
30 return *this;
31 }
32
pipelineDelay(uint32_t value)33 PipelineWatcher &PipelineWatcher::pipelineDelay(uint32_t value) {
34 mPipelineDelay = value;
35 return *this;
36 }
37
outputDelay(uint32_t value)38 PipelineWatcher &PipelineWatcher::outputDelay(uint32_t value) {
39 mOutputDelay = value;
40 return *this;
41 }
42
smoothnessFactor(uint32_t value)43 PipelineWatcher &PipelineWatcher::smoothnessFactor(uint32_t value) {
44 mSmoothnessFactor = value;
45 return *this;
46 }
47
onWorkQueued(uint64_t frameIndex,std::vector<std::shared_ptr<C2Buffer>> && buffers,const Clock::time_point & queuedAt)48 void PipelineWatcher::onWorkQueued(
49 uint64_t frameIndex,
50 std::vector<std::shared_ptr<C2Buffer>> &&buffers,
51 const Clock::time_point &queuedAt) {
52 ALOGV("onWorkQueued(frameIndex=%llu, buffers(size=%zu), queuedAt=%lld)",
53 (unsigned long long)frameIndex,
54 buffers.size(),
55 (long long)queuedAt.time_since_epoch().count());
56 auto it = mFramesInPipeline.find(frameIndex);
57 if (it != mFramesInPipeline.end()) {
58 ALOGD("onWorkQueued: Duplicate frame index (%llu); previous entry removed",
59 (unsigned long long)frameIndex);
60 (void)mFramesInPipeline.erase(it);
61 }
62 (void)mFramesInPipeline.try_emplace(frameIndex, std::move(buffers), queuedAt);
63 }
64
onInputBufferReleased(uint64_t frameIndex,size_t arrayIndex)65 std::shared_ptr<C2Buffer> PipelineWatcher::onInputBufferReleased(
66 uint64_t frameIndex, size_t arrayIndex) {
67 ALOGV("onInputBufferReleased(frameIndex=%llu, arrayIndex=%zu)",
68 (unsigned long long)frameIndex, arrayIndex);
69 auto it = mFramesInPipeline.find(frameIndex);
70 if (it == mFramesInPipeline.end()) {
71 ALOGD("onInputBufferReleased: frameIndex not found (%llu); ignored",
72 (unsigned long long)frameIndex);
73 return nullptr;
74 }
75 if (it->second.buffers.size() <= arrayIndex) {
76 ALOGD("onInputBufferReleased: buffers at %llu: size %zu, requested index: %zu",
77 (unsigned long long)frameIndex, it->second.buffers.size(), arrayIndex);
78 return nullptr;
79 }
80 std::shared_ptr<C2Buffer> buffer(std::move(it->second.buffers[arrayIndex]));
81 ALOGD_IF(!buffer, "onInputBufferReleased: buffer already released (%llu:%zu)",
82 (unsigned long long)frameIndex, arrayIndex);
83 return buffer;
84 }
85
onWorkDone(uint64_t frameIndex)86 void PipelineWatcher::onWorkDone(uint64_t frameIndex) {
87 ALOGV("onWorkDone(frameIndex=%llu)", (unsigned long long)frameIndex);
88 auto it = mFramesInPipeline.find(frameIndex);
89 if (it == mFramesInPipeline.end()) {
90 ALOGD("onWorkDone: frameIndex not found (%llu); ignored",
91 (unsigned long long)frameIndex);
92 return;
93 }
94 (void)mFramesInPipeline.erase(it);
95 }
96
flush()97 void PipelineWatcher::flush() {
98 mFramesInPipeline.clear();
99 }
100
pipelineFull() const101 bool PipelineWatcher::pipelineFull() const {
102 if (mFramesInPipeline.size() >=
103 mInputDelay + mPipelineDelay + mOutputDelay + mSmoothnessFactor) {
104 ALOGV("pipelineFull: too many frames in pipeline (%zu)", mFramesInPipeline.size());
105 return true;
106 }
107 size_t sizeWithInputReleased = std::count_if(
108 mFramesInPipeline.begin(),
109 mFramesInPipeline.end(),
110 [](const decltype(mFramesInPipeline)::value_type &value) {
111 for (const std::shared_ptr<C2Buffer> &buffer : value.second.buffers) {
112 if (buffer) {
113 return false;
114 }
115 }
116 return true;
117 });
118 if (sizeWithInputReleased >=
119 mPipelineDelay + mOutputDelay + mSmoothnessFactor) {
120 ALOGV("pipelineFull: too many frames in pipeline, with input released (%zu)",
121 sizeWithInputReleased);
122 return true;
123 }
124
125 size_t sizeWithInputsPending = mFramesInPipeline.size() - sizeWithInputReleased;
126 if (sizeWithInputsPending > mPipelineDelay + mInputDelay + mSmoothnessFactor) {
127 ALOGV("pipelineFull: too many inputs pending (%zu) in pipeline, with inputs released (%zu)",
128 sizeWithInputsPending, sizeWithInputReleased);
129 return true;
130 }
131 ALOGV("pipeline has room (total: %zu, input released: %zu)",
132 mFramesInPipeline.size(), sizeWithInputReleased);
133 return false;
134 }
135
elapsed(const PipelineWatcher::Clock::time_point & now,size_t n) const136 PipelineWatcher::Clock::duration PipelineWatcher::elapsed(
137 const PipelineWatcher::Clock::time_point &now, size_t n) const {
138 if (mFramesInPipeline.size() <= n) {
139 return Clock::duration::zero();
140 }
141 std::vector<Clock::duration> durations;
142 for (const decltype(mFramesInPipeline)::value_type &value : mFramesInPipeline) {
143 Clock::duration elapsed = now - value.second.queuedAt;
144 ALOGV("elapsed: frameIndex = %llu elapsed = %lldms",
145 (unsigned long long)value.first,
146 std::chrono::duration_cast<std::chrono::milliseconds>(elapsed).count());
147 durations.push_back(elapsed);
148 }
149 std::nth_element(durations.begin(), durations.begin() + n, durations.end(),
150 std::greater<Clock::duration>());
151 return durations[n];
152 }
153
154 } // namespace android
155