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
|
/* -*- c++ -*- */
/*
* Copyright 2008,2010 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 "ring.h"
namespace usrp2 {
ring::ring(unsigned int entries)
: d_max(entries), d_read_ind(0), d_write_ind(0), d_ring(entries),
d_mutex(), d_not_empty()
{
for (unsigned int i = 0; i < entries; i++) {
d_ring[i].d_base = 0;
d_ring[i].d_len = 0;
}
}
void
ring::wait_for_not_empty()
{
gruel::scoped_lock l(d_mutex);
while (empty())
d_not_empty.wait(l);
}
bool
ring::enqueue(void *p, size_t len)
{
gruel::scoped_lock l(d_mutex);
if (full())
return false;
d_ring[d_write_ind].d_len = len;
d_ring[d_write_ind].d_base = p;
inc_write_ind();
d_not_empty.notify_one();
return true;
}
bool
ring::dequeue(void **p, size_t *len)
{
gruel::scoped_lock l(d_mutex);
if (empty())
return false;
*p = d_ring[d_read_ind].d_base;
*len = d_ring[d_read_ind].d_len;
inc_read_ind();
return true;
}
} // namespace usrp2
|
