|
| 1 | +/** |
| 2 | + * Copyright (c) 2020 Filip Klembara (in2core) |
| 3 | + * |
| 4 | + * This Source Code Form is subject to the terms of the Mozilla Public |
| 5 | + * License, v. 2.0. If a copy of the MPL was not distributed with this |
| 6 | + * file, You can obtain one at https://mozilla.org/MPL/2.0/. |
| 7 | + */ |
| 8 | + |
| 9 | +#if RTC_ENABLE_MEDIA |
| 10 | + |
| 11 | +#include <memory> |
| 12 | + |
| 13 | +#include "pacinghandler.hpp" |
| 14 | + |
| 15 | +#include "impl/internals.hpp" |
| 16 | +#include "impl/threadpool.hpp" |
| 17 | + |
| 18 | +namespace rtc { |
| 19 | + |
| 20 | +PacingHandler::PacingHandler(float bitsPerSecond, std::chrono::milliseconds sendInterval, |
| 21 | + float overageFactor) |
| 22 | + : mBytesPerMillisecond((bitsPerSecond / 1000) / 8), mSendInterval(sendInterval), |
| 23 | + mOverageFactor(overageFactor), mStorage(std::make_shared<Storage>()){}; |
| 24 | + |
| 25 | +void PacingHandler::schedule(const message_callback &send) { |
| 26 | + if (!mHaveScheduled.exchange(true)) { |
| 27 | + return; |
| 28 | + } |
| 29 | + |
| 30 | + impl::ThreadPool::Instance().schedule(mSendInterval, [weak_this = weak_from_this(), send]() { |
| 31 | + if (auto locked = std::dynamic_pointer_cast<PacingHandler>(weak_this.lock())) { |
| 32 | + const std::lock_guard<std::mutex> lock(locked->mStorage->mMutex); |
| 33 | + locked->mHaveScheduled.store(false); |
| 34 | + |
| 35 | + // set byteBudget to how many milliseconds have elapsed since last run |
| 36 | + size_t byteBudget = locked->mSendInterval.count(); |
| 37 | + if (locked->mLastRun != |
| 38 | + std::chrono::time_point<std::chrono::high_resolution_clock>::min()) { |
| 39 | + byteBudget = std::chrono::duration_cast<std::chrono::milliseconds>( |
| 40 | + std::chrono::high_resolution_clock::now() - locked->mLastRun) |
| 41 | + .count(); |
| 42 | + } |
| 43 | + |
| 44 | + // byteBudget is now the total amount of bytes that we can send since last run |
| 45 | + byteBudget *= locked->mBytesPerMillisecond; |
| 46 | + |
| 47 | + size_t amountSent = 0; |
| 48 | + while (!locked->mStorage->mRtpBuffer.empty()) { |
| 49 | + auto pktSize = locked->mStorage->mRtpBuffer.front()->size(); |
| 50 | + |
| 51 | + // If overage is available spend it on current packet |
| 52 | + // Otherwise don't send anymore packets |
| 53 | + if ((amountSent + pktSize) >= byteBudget) { |
| 54 | + if (locked->mOverage > pktSize) { |
| 55 | + locked->mOverage -= pktSize; |
| 56 | + } else { |
| 57 | + return; |
| 58 | + } |
| 59 | + } |
| 60 | + |
| 61 | + send(std::move(locked->mStorage->mRtpBuffer.front())); |
| 62 | + amountSent += pktSize; |
| 63 | + locked->mStorage->mRtpBuffer.pop_front(); |
| 64 | + } |
| 65 | + |
| 66 | + // The remaining byteBudget is added to the overage |
| 67 | + locked->mOverage += (byteBudget - amountSent); |
| 68 | + locked->mOverage = std::min(static_cast<size_t>(byteBudget * locked->mOverageFactor), |
| 69 | + locked->mOverage); |
| 70 | + locked->mLastRun = std::chrono::high_resolution_clock::now(); |
| 71 | + } |
| 72 | + }); |
| 73 | +} |
| 74 | + |
| 75 | +void PacingHandler::outgoing(message_vector &messages, const message_callback &send) { |
| 76 | + |
| 77 | + std::lock_guard<std::mutex> lock(mStorage->mMutex); |
| 78 | + |
| 79 | + std::move(std::begin(messages), std::end(messages), std::back_inserter(mStorage->mRtpBuffer)); |
| 80 | + messages.clear(); |
| 81 | + |
| 82 | + schedule(send); |
| 83 | +} |
| 84 | + |
| 85 | +} // namespace rtc |
| 86 | + |
| 87 | +#endif /* RTC_ENABLE_MEDIA */ |
0 commit comments