b70b6fb43a
"failstar" sounds like a name for a cruise liner from the 80s. As "*" isn't a desirable part of directory names, just name the whole thing "fail/", the core parts being stored in "fail/core/". Additionally fixing two build system dependency issues: - missing jobserver -> protomessages dependency - broken bochs -> fail dependency (add_custom_target DEPENDS only allows plain file dependencies ... cmake for the win) git-svn-id: https://www4.informatik.uni-erlangen.de/i4svn/danceos/trunk/devel/fail@956 8c4709b5-6ec9-48aa-a5cd-a96041d1645a
91 lines
2.1 KiB
C++
91 lines
2.1 KiB
C++
// Queue class that has thread synchronisation
|
|
// from: http://www.quantnet.com/cplusplus-multithreading-boost/
|
|
|
|
#ifndef __SYNCHRONIZED_QUEUE_HPP__
|
|
#define __SYNCHRONIZED_QUEUE_HPP__
|
|
|
|
#include <queue>
|
|
#ifndef __puma
|
|
#include <boost/thread.hpp>
|
|
#endif
|
|
|
|
template <typename T>
|
|
class SynchronizedQueue
|
|
{
|
|
private:
|
|
std::queue<T> m_queue; // Use STL queue to store data
|
|
#ifndef __puma
|
|
boost::mutex m_mutex; // The mutex to synchronise on
|
|
boost::condition_variable m_cond; // The condition to wait for
|
|
#endif
|
|
public:
|
|
int Size(){
|
|
#ifndef __puma
|
|
boost::unique_lock<boost::mutex> lock(m_mutex);
|
|
#endif
|
|
return m_queue.size();
|
|
}
|
|
// Add data to the queue and notify others
|
|
void Enqueue(const T& data)
|
|
{
|
|
// Acquire lock on the queue
|
|
#ifndef __puma
|
|
boost::unique_lock<boost::mutex> lock(m_mutex);
|
|
#endif
|
|
// Add the data to the queue
|
|
m_queue.push(data);
|
|
// Notify others that data is ready
|
|
#ifndef __puma
|
|
m_cond.notify_one();
|
|
#endif
|
|
} // Lock is automatically released here
|
|
|
|
/**
|
|
* Get data from the queue. Wait for data if not available
|
|
*/
|
|
T Dequeue()
|
|
{
|
|
// Acquire lock on the queue
|
|
#ifndef __puma
|
|
boost::unique_lock<boost::mutex> lock(m_mutex);
|
|
#endif
|
|
// When there is no data, wait till someone fills it.
|
|
// Lock is automatically released in the wait and obtained
|
|
// again after the wait
|
|
#ifndef __puma
|
|
while (m_queue.size()==0) m_cond.wait(lock);
|
|
#endif
|
|
// Retrieve the data from the queue
|
|
T result=m_queue.front(); m_queue.pop();
|
|
return result;
|
|
} // Lock is automatically released here
|
|
|
|
|
|
/**
|
|
* Get data from the queue. Non blocking variant.
|
|
* @param d Pointer to copy queue element to
|
|
* @return false if no element in queue
|
|
*
|
|
*/
|
|
bool Dequeue_nb(T& d)
|
|
{
|
|
// Acquire lock on the queue
|
|
#ifndef __puma
|
|
boost::unique_lock<boost::mutex> lock(m_mutex);
|
|
#endif
|
|
// When there is no data, return false.
|
|
// Lock is automatically released in the wait and obtained
|
|
// again after the wait
|
|
if (m_queue.size() > 0){
|
|
// Retrieve the data from the queue
|
|
d = m_queue.front(); m_queue.pop();
|
|
return true;
|
|
}else{
|
|
return false;
|
|
}
|
|
} // Lock is automatically released here
|
|
|
|
|
|
};
|
|
#endif
|