blob: c68c5fd64bd2f9045104988d29ba56ef93885483 (
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
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
|
/* -*- c++ -*- */
/*
* Copyright 2007,2008 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 3, 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.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <mblock/msg_queue.h>
#include <mblock/message.h>
mb_msg_queue::mb_msg_queue()
: d_not_empty(&d_mutex)
{
}
mb_msg_queue::~mb_msg_queue()
{
}
void
mb_msg_queue::insert(mb_message_sptr msg)
{
omni_mutex_lock l(d_mutex);
mb_pri_t q = mb_pri_clamp(msg->priority());
if (d_queue[q].empty_p()){
d_queue[q].tail = d_queue[q].head = msg;
msg->d_next.reset(); //msg->d_next = 0;
}
else {
d_queue[q].tail->d_next = msg;
d_queue[q].tail = msg;
msg->d_next.reset(); // msg->d_next = 0;
}
// FIXME set bit in bitmap
d_not_empty.signal();
}
/*
* Delete highest pri message from the queue and return it.
* Returns equivalent of zero pointer if queue is empty.
*
* Caller must be holding d_mutex
*/
mb_message_sptr
mb_msg_queue::get_highest_pri_msg_helper()
{
// FIXME use bitmap and ffz to find best queue in O(1)
for (mb_pri_t q = 0; q <= MB_PRI_WORST; q++){
if (!d_queue[q].empty_p()){
mb_message_sptr msg = d_queue[q].head;
d_queue[q].head = msg->d_next;
if (d_queue[q].head == 0){
d_queue[q].tail.reset(); // d_queue[q].tail = 0;
// FIXME clear bit in bitmap
}
msg->d_next.reset(); // msg->d_next = 0;
return msg;
}
}
return mb_message_sptr(); // eqv to a zero pointer
}
mb_message_sptr
mb_msg_queue::get_highest_pri_msg_nowait()
{
omni_mutex_lock l(d_mutex);
return get_highest_pri_msg_helper();
}
mb_message_sptr
mb_msg_queue::get_highest_pri_msg()
{
omni_mutex_lock l(d_mutex);
while (1){
mb_message_sptr msg = get_highest_pri_msg_helper();
if (msg) // Got one; return it
return msg;
d_not_empty.wait(); // Wait for something
}
}
mb_message_sptr
mb_msg_queue::get_highest_pri_msg_timedwait(const mb_time &abs_time)
{
unsigned long secs = abs_time.d_secs;
unsigned long nsecs = abs_time.d_nsecs;
omni_mutex_lock l(d_mutex);
while (1){
mb_message_sptr msg = get_highest_pri_msg_helper();
if (msg) // Got one; return it
return msg;
if (!d_not_empty.timedwait(secs, nsecs)) // timed out
return mb_message_sptr(); // eqv to zero pointer
}
}
|
