80 lines
2.5 KiB
C++
80 lines
2.5 KiB
C++
/*
|
|
* Copyright (C) 2014-2025 Amlogic, Inc. All rights reserved.
|
|
*
|
|
* All information contained herein is Amlogic confidential.
|
|
*
|
|
* This software is provided to you pursuant to Software License Agreement
|
|
* (SLA) with Amlogic Inc ("Amlogic"). This software may be used
|
|
* only in accordance with the terms of this agreement.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification is strictly prohibited without prior written permission from
|
|
* Amlogic.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
#include <condition_variable>
|
|
#include <list>
|
|
#include <mutex>
|
|
#include <chrono>
|
|
|
|
template <typename T>
|
|
class BlockChannel {
|
|
public:
|
|
BlockChannel(int maxSize = 1) : mMaxSize(maxSize) {}
|
|
~BlockChannel() {
|
|
std::lock_guard<std::mutex> lk(mMutex);
|
|
mList.clear();
|
|
}
|
|
|
|
void put(T item) {
|
|
std::unique_lock<std::mutex> lk(mMutex);
|
|
|
|
mCond.wait(lk, [this]() { return mList.size() < mMaxSize; });
|
|
|
|
mList.emplace_back(std::move(item));
|
|
mCond.notify_all();
|
|
}
|
|
|
|
T poll() {
|
|
std::unique_lock<std::mutex> lk(mMutex);
|
|
|
|
mCond.wait(lk, [this]() { return !mList.empty(); });
|
|
|
|
T item = std::move(mList.front());
|
|
mList.pop_front();
|
|
mCond.notify_all();
|
|
return item;
|
|
}
|
|
|
|
bool poll(T &out, int timeout_ms) {
|
|
std::unique_lock<std::mutex> lk(mMutex);
|
|
|
|
if (!mCond.wait_for(lk, std::chrono::milliseconds(timeout_ms), [this]() { return !mList.empty(); })) {
|
|
return false;
|
|
}
|
|
|
|
out = std::move(mList.front());
|
|
mList.pop_front();
|
|
mCond.notify_all();
|
|
return true;
|
|
}
|
|
|
|
private:
|
|
int mMaxSize;
|
|
std::list<T> mList;
|
|
std::mutex mMutex;
|
|
std::condition_variable mCond;
|
|
}; |