3 * Copyright 2005 Free Software Foundation, Inc.
5 * This file is part of GNU Radio
7 * GNU Radio is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 3, or (at your option)
12 * GNU Radio is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with GNU Radio; see the file COPYING. If not, write to
19 * the Free Software Foundation, Inc., 51 Franklin Street,
20 * Boston, MA 02110-1301, USA.
22 #ifndef INCLUDED_GR_MSG_QUEUE_H
23 #define INCLUDED_GR_MSG_QUEUE_H
25 #include <gr_msg_handler.h>
26 #include <gnuradio/omnithread.h>
29 typedef boost::shared_ptr<gr_msg_queue> gr_msg_queue_sptr;
31 gr_msg_queue_sptr gr_make_msg_queue(unsigned int limit=0);
34 * \brief thread-safe message queue
37 class gr_msg_queue : public gr_msg_handler {
39 omni_condition d_not_empty;
40 omni_condition d_not_full;
41 gr_message_sptr d_head;
42 gr_message_sptr d_tail;
43 unsigned int d_count; // # of messages in queue.
44 unsigned int d_limit; // max # of messages in queue. 0 -> unbounded
47 gr_msg_queue(unsigned int limit);
50 //! Generic msg_handler method: insert the message.
51 void handle(gr_message_sptr msg) { insert_tail (msg); }
54 * \brief Insert message at tail of queue.
57 * Block if queue if full.
59 void insert_tail(gr_message_sptr msg);
62 * \brief Delete message from head of queue and return it.
63 * Block if no message is available.
65 gr_message_sptr delete_head();
68 * \brief If there's a message in the q, delete it and return it.
69 * If no message is available, return 0.
71 gr_message_sptr delete_head_nowait();
73 //! Delete all messages from the queue
76 //! is the queue empty?
77 bool empty_p() const { return d_count == 0; }
79 //! is the queue full?
80 bool full_p() const { return d_limit != 0 && d_count >= d_limit; }
82 //! return number of messages in queue
83 unsigned int count() const { return d_count; }
85 //! return limit on number of message in queue. 0 -> unbounded
86 unsigned int limit() const { return d_limit; }
90 #endif /* INCLUDED_GR_MSG_QUEUE_H */