我目前正在重构我在nvidia硬件编码器中找到的用于压缩视频图像的一些代码。最初的问题是:wondering if I can use stl smart pointers for this
根据答案,我更新了我的代码如下:
根据答案和评论,我试图制作一个线程安全的缓冲区数组。这里是。请评论。
#ifndef __BUFFER_ARRAY_H__
#define __BUFFER_ARRAY_H__
#include <vector>
#include <mutex>
#include <thread>
template<class T>
class BufferArray
{
public:
class BufferArray()
:num_pending_items(0), pending_index(0), available_index(0)
{}
// This method is not thread-safe.
// Add an item to our buffer list
// Note we do not take ownership of the incoming pointer.
void add(T * buffer)
{
buffer_array.push_back(buffer);
}
// Returns a naked pointer to an available buffer. Should not be
// deleted by the caller.
T * get_available()
{
std::lock_guard<std::mutex> lock(buffer_array_mutex);
if (num_pending_items == buffer_array.size()) {
return NULL;
}
T * buffer = buffer_array[available_index];
// Update the indexes.
available_index = (available_index + 1) % buffer_array.size();
num_pending_items += 1;
return buffer;
}
T * get_pending()
{
std::lock_guard<std::mutex> lock(buffer_array_mutex);
if (num_pending_items == 0) {
return NULL;
}
T * buffer = buffer_array[pending_index];
pending_index = (pending_index + 1) % buffer_array.size();
num_pending_items -= 1;
return buffer;
}
private:
std::vector<T * > buffer_array;
std::mutex buffer_array_mutex;
unsigned int num_pending_items;
unsigned int pending_index;
unsigned int available_index;
// No copy semantics
BufferArray(const BufferArray &) = delete;
void operator=(const BufferArray &) = delete;
};
#endif
我的问题是我是否在这里打破一些C ++良好实践建议?此外,我正在扩展该类,以便可以访问它并使用我的多个线程。我想知道是否有任何我可能错过的东西。
答案 0 :(得分:1)
我想我会接近这样的事情:
在此测试中,“处理”只是将int乘以2.但请注意处理器线程如何从待处理队列中取出待处理数据,处理它,然后将可用数据推送到可用队列。然后,它(通过条件变量)发出消息(在这种情况下,您的磁盘写入器)应再次查看可用数据的信号。
#include <vector>
#include <mutex>
#include <thread>
#include <queue>
#include <condition_variable>
#include <iostream>
namespace notstd {
template<class Mutex> auto getlock(Mutex& m)
{
return std::unique_lock<Mutex>(m);
}
}
template<class T>
class ProcessQueue
{
public:
ProcessQueue()
{}
// This method is not thread-safe.
// Add an item to our buffer list
// Note we do not take ownership of the incoming pointer.
// @pre start_processing shall not have been called
void add(T * buffer)
{
pending_.push(buffer);
}
void start_processing()
{
process_thread_ = std::thread([this] {
while(not this->pending_.empty())
{
auto lock = notstd::getlock(this->mutex_);
auto buf = this->pending_.front();
lock.unlock();
//
// this is the part that processes the "buffer"
*buf *= 2;
//
// now notify the structure that the processing is done - buffer is available
//
lock.lock();
this->pending_.pop();
this->available_.push(buf);
lock.unlock();
this->change_.notify_one();
}
});
}
T* wait_available()
{
auto lock = notstd::getlock(mutex_);
change_.wait(lock, [this] { return not this->available_.empty() or this->pending_.empty(); });
if (not available_.empty())
{
auto p = available_.front();
available_.pop();
return p;
}
lock.unlock();
process_thread_.join();
return nullptr;
}
private:
std::queue<T * > pending_;
std::queue<T * > available_;
std::mutex mutex_;
std::condition_variable change_;
std::thread process_thread_;
// No copy semantics - implicit because of the mutex
};
int main()
{
ProcessQueue<int> pq;
std::vector<int> v = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
for (auto& i : v) {
pq.add(std::addressof(i));
}
pq.start_processing();
while (auto p = pq.wait_available())
{
std::cout << *p << '\n';
}
}
预期产出:
2
4
6
8
10
12
14
16
18