boost :: circular_buffer如何处理覆盖移位

Question

我有2个进程:一个生产者和"消费者",它仍然将值保留在缓冲区中,它们将被覆盖.

但让消费者跟踪是一个问题.当缓冲区已满并且值被覆盖时,指向索引0的值是刚刚覆盖的值之前的值(即下一个最旧的值),刚刚插入的值是最后一个索引,移动所有值之间.

cb.push_back(0)
cb.push_back(1)
cb.push_back(2)

consumer reads to cb[1], cb[2] should == 2 when next read

cb.push_back(3)

cb[2] now == 1 effectively reading the old value

有趣的是在循环缓冲区迭代器也保持相同的值,即使在缓冲开始被改写,并除非阅读当你达到这样的工作好吗end()迭代器,它会永远等于end()甚至将更多的值之后迭代器,所以那么你必须std::prev(iter, 1)经过你已经完成了消费,然后当你插入更多的值后再次阅读,std::next(iter, 1)这样你就不会读取你已经读过的值.

Answer 1

我相信circular_buffer恰好存在于从中抽象出迭代器定位.

缓冲区是循环的这一事实对你来说无关紧要:它只是一个队列接口.

circular_buffer如何想使用可以在这个例子中很清楚地看到:http://www.boost.org/doc/libs/1_60_0/libs/circular_buffer/example/circular_buffer_sum_example.cpp

如果你想要某种程度的控制,你也可以

• 想要使用更简单的容器原语并构建自己的逻辑

• 你可以在循环缓冲区顶部写下有界缓冲区.这里有一个完整的例子:http://www.boost.org/doc/libs/1_60_0/libs/circular_buffer/test/bounded_buffer_comparison.cpp

  该解释中提到:

  有界缓冲区通常用于生产者 - 消费者模式[...]

  [...]

  有界缓冲区:: pop_back()方法不会删除该项目,但该项目将保留在circular_buffer中,然后当circular_buffer已满时,该项目将替换为新的项目(由生产者插入).这种技术比通过调用circular_buffer的circular_buffer :: pop_back()方法显式删除项更有效.

听起来它应该对你有很大的帮助.

UPDATE

这是一个适合使用共享内存的演示:

#define BOOST_CB_DISABLE_DEBUG

#include <boost/circular_buffer.hpp>
#include <boost/thread/thread.hpp>
#include <boost/call_traits.hpp>
#include <boost/bind.hpp>
#include <boost/interprocess/allocators/allocator.hpp>
#include <boost/interprocess/managed_shared_memory.hpp>
#include <boost/interprocess/sync/interprocess_condition.hpp>
#include <boost/interprocess/sync/interprocess_mutex.hpp>
#include <iostream>

const unsigned long QUEUE_SIZE     = 1000L;
const unsigned long TOTAL_ELEMENTS = QUEUE_SIZE * 1000L;

namespace bip = boost::interprocess;

template <class T, class Alloc, typename CV = boost::condition_variable, typename Mutex = boost::mutex>
class bounded_buffer {
public:
    typedef boost::circular_buffer<T, Alloc> container_type;
    typedef typename container_type::size_type                  size_type;
    typedef typename container_type::value_type                 value_type;
    typedef typename container_type::allocator_type             allocator_type;
    typedef typename boost::call_traits<value_type>::param_type param_type;

    bounded_buffer(size_type capacity, Alloc alloc = Alloc()) : m_unread(0), m_container(capacity, alloc) {}

    void push_front(param_type item) {
        boost::unique_lock<Mutex> lock(m_mutex);

        m_not_full.wait(lock, boost::bind(&bounded_buffer::is_not_full, this));
        m_container.push_front(item);
        ++m_unread;
        lock.unlock();

        m_not_empty.notify_one();
    }

    void pop_back(value_type* pItem) {
        boost::unique_lock<Mutex> lock(m_mutex);

        m_not_empty.wait(lock, boost::bind(&bounded_buffer::is_not_empty, this));
        *pItem = m_container[--m_unread];
        lock.unlock();

        m_not_full.notify_one();
    }

private:
    bounded_buffer(const bounded_buffer&);              // Disabled copy constructor
    bounded_buffer& operator = (const bounded_buffer&); // Disabled assign operator

    bool is_not_empty() const { return m_unread > 0; }
    bool is_not_full() const { return m_unread < m_container.capacity(); }

    size_type m_unread;
    container_type m_container;
    Mutex m_mutex;
    CV m_not_empty;
    CV m_not_full;
};

namespace Shared {
    using segment = bip::managed_shared_memory;
    using smgr    = segment::segment_manager;
    template <typename T> using alloc = bip::allocator<T, smgr>;
    template <typename T> using bounded_buffer = ::bounded_buffer<T, alloc<T>, bip::interprocess_condition, bip::interprocess_mutex >;
}

template<class Buffer>
class Consumer {

    typedef typename Buffer::value_type value_type;
    Buffer* m_container;
    value_type m_item;

public:
    Consumer(Buffer* buffer) : m_container(buffer) {}

    void operator()() {
        for (unsigned long i = 0L; i < TOTAL_ELEMENTS; ++i) {
            m_container->pop_back(&m_item);
        }
    }
};

template<class Buffer>
class Producer {

    typedef typename Buffer::value_type value_type;
    Buffer* m_container;

public:
    Producer(Buffer* buffer) : m_container(buffer) {}

    void operator()() {
        for (unsigned long i = 0L; i < TOTAL_ELEMENTS; ++i) {
            m_container->push_front(value_type());
        }
    }
};

int main(int argc, char**) {
    using Buffer = Shared::bounded_buffer<int>;

    if (argc>1) {
        std::cout << "Creating shared buffer\n";
        Shared::segment mem(bip::create_only, "test_bounded_buffer", 10<<20); // 10 MiB
        Buffer* buffer = mem.find_or_construct<Buffer>("shared_buffer")(QUEUE_SIZE, mem.get_segment_manager());

        assert(buffer);

        // Initialize the buffer with some values before launching producer and consumer threads.
        for (unsigned long i = QUEUE_SIZE / 2L; i > 0; --i) {
            buffer->push_front(BOOST_DEDUCED_TYPENAME Buffer::value_type());
        }

        std::cout << "running producer\n";
        Producer<Buffer> producer(buffer);
        boost::thread(producer).join();
    } else {
        std::cout << "Opening shared buffer\n";

        Shared::segment mem(bip::open_only, "test_bounded_buffer");
        Buffer* buffer = mem.find_or_construct<Buffer>("shared_buffer")(QUEUE_SIZE, mem.get_segment_manager());

        assert(buffer);

        std::cout << "running consumer\n";
        Consumer<Buffer> consumer(buffer);
        boost::thread(consumer).join();
    }
}

当您运行两个进程时:

time (./test producer & sleep .1; ./test; wait)
Creating shared buffer
running producer
Opening shared buffer
running consumer

real    0m0.594s
user    0m0.372s
sys 0m0.600s