/
bin.cpp
197 lines (156 loc) · 4.52 KB
/
bin.cpp
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
/**
@file bin.cpp
@brief Bin
<p>
Copyright (C) 2009-2010 Nokia Corporation
@author Semi Malinen <semi.malinen@nokia.com
@author Joep van Gassel <joep.van.gassel@nokia.com>
@author Timo Rongas <ext-timo.2.rongas@nokia.com>
@author Ustun Ergenoglu <ext-ustun.ergenoglu@nokia.com>
This file is part of Sensord.
Sensord is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License
version 2.1 as published by the Free Software Foundation.
Sensord 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with Sensord. If not, see <http://www.gnu.org/licenses/>.
</p>
*/
#include "bin.h"
#include "pusher.h"
#include "consumer.h"
#include "filter.h"
#include "source.h"
#include "sink.h"
#include "ringbuffer.h"
#include "logging.h"
Bin::Bin()
{
}
Bin::~Bin()
{
}
void Bin::start()
{
}
void Bin::stop()
{
}
void Bin::add(Pusher* pusher, const QString& name)
{
Q_ASSERT(!pushers_.contains(name));
Q_ASSERT(!filters_.contains(name));
pushers_.insert(name, pusher);
}
void Bin::add(Consumer* consumer, const QString& name)
{
Q_ASSERT(!consumers_.contains(name));
Q_ASSERT(!filters_.contains(name));
consumers_.insert(name, consumer);
}
void Bin::add(FilterBase* filter, const QString& name)
{
Q_ASSERT(!pushers_.contains(name));
Q_ASSERT(!consumers_.contains(name));
Q_ASSERT(!filters_.contains(name));
filters_.insert(name, filter);
}
bool Bin::join(const QString& producerName,
const QString& sourceName,
const QString& consumerName,
const QString& sinkName)
{
bool joined = false;
SourceBase* src = source(producerName, sourceName);
SinkBase* snk = sink(consumerName, sinkName);
if (src && snk) {
if (src->join(snk)) {
joined = true;
} else {
sensordLogT() << " source "
<< producerName << "/" << sourceName
<< " and sink "
<< consumerName << "/" << sinkName
<< " are of incompatible types";
}
} else {
if (!src) {
sensordLogT() << "source "
<< producerName << "/" << sourceName
<< " not found";
}
if (!snk) {
sensordLogT() << "sink "
<< consumerName << "/" << sinkName
<< " not found";
}
}
return joined;
}
bool Bin::unjoin(const QString& producerName,
const QString& sourceName,
const QString& consumerName,
const QString& sinkName)
{
SourceBase* src = source(producerName, sourceName);
SinkBase* snk = sink(consumerName, sinkName);
bool unjoined = false;
if (src && snk) {
if (src->unjoin(snk)) {
unjoined = true;
} else {
sensordLogT() << "Cannot unjoin sink & source. Possibly, they are not connected.";
}
} else {
if (!src) {
sensordLogT() << "source "
<< producerName << "/" << sourceName
<< " not found";
}
if (!snk) {
sensordLogT() << "sink "
<< consumerName << "/" << sinkName
<< " not found";
}
}
return unjoined;
}
SourceBase* Bin::source(const QString& producerName, const QString& sourceName) const
{
SourceBase* source = 0;
if (Producer* p = producer(producerName)) {
source = p->source(sourceName);
}
return source;
}
SinkBase* Bin::sink(const QString& consumerName, const QString& sinkName) const
{
SinkBase* sink = 0;
if (Consumer* c = consumer(consumerName)) {
sink = c->sink(sinkName);
}
return sink;
}
Producer* Bin::producer(const QString& name) const
{
Producer* p = 0;
if (pushers_.contains(name)) {
p = pushers_.value(name);
} else if (filters_.contains(name)) {
p = filters_.value(name);
}
return p;
}
Consumer* Bin::consumer(const QString& name) const
{
Consumer* c = 0;
if (consumers_.contains(name)) {
c = consumers_.value(name);
} else if (filters_.contains(name)) {
c = filters_.value(name);
}
return c;
}