/usr/include/ace/TMCast/MTQueue.hpp is in libace-tmcast-dev 6.3.3+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 | // author : Boris Kolpackov <boris@dre.vanderbilt.edu>
#ifndef TMCAST_MT_QUEUE_HPP
#define TMCAST_MT_QUEUE_HPP
#include "ace/Auto_Ptr.h"
#include "ace/Unbounded_Set.h"
#include "ace/Unbounded_Queue.h"
#include "ace/os_include/sys/os_types.h"
#include "ace/Condition_T.h"
namespace ACE_TMCast
{
template <typename T,
typename M,
typename C,
typename Q = ACE_Unbounded_Queue<T> >
class MTQueue
{
public:
typedef T ElementType;
typedef M MutexType;
typedef C ConditionalType;
typedef Q QueueType;
public:
MTQueue ()
: mutexp_ (new MutexType),
mutex_ (*mutexp_),
queue_ (),
signal_ (false)
{
}
MTQueue (MutexType& mutex)
: mutexp_ (),
mutex_ (mutex),
queue_ (),
signal_ (false)
{
}
public:
bool
empty () const
{
return queue_.is_empty ();
}
size_t
size () const
{
return queue_.size ();
}
// typedef typename QueueType::Empty Empty;
class Empty {};
T&
front ()
{
ACE_Unbounded_Queue_Iterator<T> f (queue_);
T* tmp;
if (!f.next (tmp)) throw Empty ();
return *tmp;
}
T const&
front () const
{
ACE_Unbounded_Queue_Const_Iterator<T> f (queue_);
T* tmp;
if (!f.next (tmp)) throw Empty ();
return *tmp;
}
/*
T&
back ()
{
return queue_.back ();
}
T const&
back () const
{
return queue_.back ();
}
*/
void
push (T const& t)
{
signal_ = empty ();
queue_.enqueue_tail (t);
}
void
pop ()
{
T junk;
queue_.dequeue_head (junk);
}
public:
void
lock () const
{
mutex_.acquire ();
}
void
unlock () const
{
if (signal_)
{
signal_ = false;
for (ConditionalSetConstIterator_ i (cond_set_);
!i.done ();
i.advance ())
{
ConditionalType** c = 0;
i.next (c);
(*c)->signal ();
}
}
mutex_.release ();
}
void
subscribe (ConditionalType& c)
{
//@@ should check for duplicates
//
cond_set_.insert (&c);
}
void
unsubscribe (ConditionalType& c)
{
//@@ should check for absence
//
cond_set_.remove (&c);
}
private:
auto_ptr<MutexType> mutexp_;
MutexType& mutex_;
QueueType queue_;
typedef
ACE_Unbounded_Set<ConditionalType*>
ConditionalSet_;
typedef
ACE_Unbounded_Set_Const_Iterator<ConditionalType*>
ConditionalSetConstIterator_;
ConditionalSet_ cond_set_;
mutable bool signal_;
};
}
#endif // TMCAST_MT_QUEUE_HPP
|