/home/serif/byzantine_generals/src/orderqueue.cpp

Go to the documentation of this file.

/**
 * @file orderqueue.cpp
 * @author Reshen Amin <reshen@zensrc.com>
 *
 * @brief Contains the class declaration for @ref OrderQueue
 *
 * @license Byzantine Generals Problem Coding Sample.<br>
 * Copyright (C) 2010  Reshen Amin.<br>
 * See @ref license_sec for details.<br>
 */

#include "orderqueue.h"

#include <boost/interprocess/sync/interprocess_mutex.hpp>

OrderQueue::OrderQueue(const OrderAllocator &order_alloc)
    : order_list_(order_alloc),
      mutex_(),
      sem_fill_(0) {
}

OrderQueue::~OrderQueue() {
}

void OrderQueue::PushBack(const Order& ord) {
    /* Lock down our shared data structure */
    mutex_.lock();

    /* Enqueue provided order */
    order_list_.push_back(ord);

    /* Unlock shared data structure */
    mutex_.unlock();

    /* Notify any pending threads that we have a new order available for
     * consumption */
    sem_fill_.post();
}

Order OrderQueue::PopFront() {
    /* Pend waiting for orders to consume from this queue */
    sem_fill_.wait();

    /* Lock down our shared data structure */
    mutex_.lock();

    /* Dequeue oldest order from queue */
    Order front_order = order_list_.front();
    order_list_.pop_front();

    /* Unlock shared data structure */
    mutex_.unlock();

    return front_order;
}

bool OrderQueue::Empty() {
    bool empty = false;

    /* Lock down our shared data structure */
    mutex_.lock();

    /* Check queue empty status */
    empty = order_list_.empty();

    /* Unlock shared data structure */
    mutex_.unlock();

    return empty;
}

---