blob: 7977b7d80d188c8a0f08f2ebcc288b83ffcfa475 (
plain)
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
|
/* -*- c++ -*- */
/*
* Copyright 2007 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* GNU Radio is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* GNU Radio is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef INCLUDED_MB_MSG_QUEUE_H
#define INCLUDED_MB_MSG_QUEUE_H
#include <mb_common.h>
#include <omnithread.h>
/*!
* \brief priority queue for mblock messages
*/
class mb_msg_queue : boost::noncopyable
{
// When empty both head and tail are zero.
struct subq {
mb_message_sptr head;
mb_message_sptr tail;
bool empty_p() const { return head == 0; }
};
omni_mutex d_mutex;
omni_condition d_not_empty; // reader waits on this
// FIXME add bitmap to indicate which queues are non-empty.
subq d_queue[MB_NPRI];
mb_message_sptr get_highest_pri_msg_helper();
public:
mb_msg_queue();
~mb_msg_queue();
//! Insert \p msg into priority queue.
void insert(mb_message_sptr msg);
/*
* \brief Delete highest pri message from the queue and return it.
* Returns equivalent of zero pointer if queue is empty.
*/
mb_message_sptr get_highest_pri_msg_nowait();
/*
* \brief Delete highest pri message from the queue and return it.
* If the queue is empty, this call blocks until it can return a message.
*/
mb_message_sptr get_highest_pri_msg();
};
#endif /* INCLUDED_MB_MSG_QUEUE_H */
|
