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.
27 #include <gr_message_source.h>
28 #include <gr_io_signature.h>
31 #include <sys/types.h>
38 // public constructor that returns a shared_ptr
40 gr_message_source_sptr
41 gr_make_message_source(size_t itemsize, int msgq_limit)
43 return gr_message_source_sptr(new gr_message_source(itemsize, msgq_limit));
46 // public constructor that takes existing message queue
47 gr_message_source_sptr
48 gr_make_message_source(size_t itemsize, gr_msg_queue_sptr msgq)
50 return gr_message_source_sptr(new gr_message_source(itemsize, msgq));
53 gr_message_source::gr_message_source (size_t itemsize, int msgq_limit)
54 : gr_sync_block("message_source",
55 gr_make_io_signature(0, 0, 0),
56 gr_make_io_signature(1, 1, itemsize)),
57 d_itemsize(itemsize), d_msgq(gr_make_msg_queue(msgq_limit)), d_msg_offset(0), d_eof(false)
61 gr_message_source::gr_message_source (size_t itemsize, gr_msg_queue_sptr msgq)
62 : gr_sync_block("message_source",
63 gr_make_io_signature(0, 0, 0),
64 gr_make_io_signature(1, 1, itemsize)),
65 d_itemsize(itemsize), d_msgq(msgq), d_msg_offset(0), d_eof(false)
69 gr_message_source::~gr_message_source()
74 gr_message_source::work(int noutput_items,
75 gr_vector_const_void_star &input_items,
76 gr_vector_void_star &output_items)
78 char *out = (char *) output_items[0];
81 while (nn < noutput_items){
84 // Consume whatever we can from the current message
86 int mm = std::min(noutput_items - nn, (int)((d_msg->length() - d_msg_offset) / d_itemsize));
87 memcpy (out, &(d_msg->msg()[d_msg_offset]), mm * d_itemsize);
90 out += mm * d_itemsize;
91 d_msg_offset += mm * d_itemsize;
92 assert(d_msg_offset <= d_msg->length());
94 if (d_msg_offset == d_msg->length()){
95 if (d_msg->type() == 1) // type == 1 sets EOF
102 // No current message
104 if (d_msgq->empty_p() && nn > 0){ // no more messages in the queue, return what we've got
111 d_msg = d_msgq->delete_head(); // block, waiting for a message
114 if ((d_msg->length() % d_itemsize) != 0)
115 throw std::runtime_error("msg length is not a multiple of d_itemsize");