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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
|
/*
Copyright (c) 2010-2012 250bpm s.r.o.
Copyright (c) 2011 VMware, Inc.
Copyright (c) 2010-2011 Other contributors as noted in the AUTHORS file
This file is part of Crossroads I/O project.
Crossroads I/O is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
Crossroads 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <string.h>
#include "../include/xs.h"
#include "xpub.hpp"
#include "pipe.hpp"
#include "wire.hpp"
#include "err.hpp"
#include "msg.hpp"
xs::xpub_t::xpub_t (class ctx_t *parent_, uint32_t tid_, int sid_) :
socket_base_t (parent_, tid_, sid_),
more (false),
tmp_filter_id (-1)
{
options.type = XS_XPUB;
options.sp_pattern = SP_PUBSUB;
options.sp_version = 4;
options.sp_role = SP_PUBSUB_PUB;
options.sp_complement = SP_PUBSUB_SUB;
}
xs::xpub_t::~xpub_t ()
{
// Deallocate all the filters.
for (filters_t::iterator it = filters.begin (); it != filters.end (); ++it)
it->type->pf_destroy ((void*) (core_t*) this, it->instance);
}
int xs::xpub_t::xsetsockopt (int option_, const void *optval_,
size_t optvallen_)
{
if (option_ != XS_PATTERN_VERSION) {
errno = EINVAL;
return -1;
}
if (optvallen_ != sizeof (int)) {
errno = EINVAL;
return -1;
}
if (!optval_) {
errno = EFAULT;
return -1;
}
int version = *(int *) optval_;
switch (version) {
case 1:
options.legacy_protocol = true;
options.sp_version = 1;
break;
case 3:
options.legacy_protocol = false;
options.sp_version = 3;
break;
default:
errno = EINVAL;
return -1;
}
return 0;
}
void xs::xpub_t::xattach_pipe (pipe_t *pipe_, bool icanhasall_)
{
xs_assert (pipe_);
dist.attach (pipe_);
// If icanhasall_ is specified, the caller would like to subscribe
// to all data on this pipe, implicitly. Also, if we are using
// 0MQ/2.1-style protocol, there's no subscription forwarding. Thus,
// we need to subscribe for all messages automatically.
if (icanhasall_|| pipe_->get_sp_version () == 1) {
// Find the prefix filter.
// TODO: Change this to ALL filter.
filters_t::iterator it;
for (it = filters.begin (); it != filters.end (); ++it)
if (it->type->id (NULL) == XS_FILTER_PREFIX)
break;
if (it == filters.end ()) {
filter_t f;
f.type = get_filter (XS_FILTER_PREFIX);
xs_assert (f.type);
f.instance = f.type->pf_create ((void*) (core_t*) this);
xs_assert (f.instance);
filters.push_back (f);
it = filters.end () - 1;
}
it->type->pf_subscribe ((void*) (core_t*) this, it->instance, pipe_,
NULL, 0);
}
// The pipe is active when attached. Let's read the subscriptions from
// it, if any.
xread_activated (pipe_);
}
void xs::xpub_t::xread_activated (pipe_t *pipe_)
{
// There are some subscriptions waiting. Let's process them.
msg_t sub;
sub.init ();
while (true) {
// Grab next subscription.
if (!pipe_->read (&sub)) {
sub.close ();
return;
}
// Apply the subscription to the trie.
unsigned char *data = (unsigned char*) sub.data ();
size_t size = sub.size ();
// TODO: In the case of malformed subscription we will simply ignore
// it for now. However, we should close the connection instead.
if (size < 4) {
sub.close ();
return;
}
#if 0
// TODO: This is 0MQ/3.1 protocol.
if (size < 1) {
sub.close ();
return;
}
#endif
int cmd = get_uint16 (data);
int filter_id = get_uint16 (data + 2);
#if 0
// TODO: This is 0MQ/3.1 protocol.
int cmd = data [0] ? XS_CMD_SUBSCRIBE : XS_CMD_UNSUBSCRIBE;
int filter_id = XS_FILTER_PREFIX;
#endif
if (cmd != SP_PUBSUB_CMD_SUBSCRIBE &&
cmd != SP_PUBSUB_CMD_UNSUBSCRIBE) {
sub.close ();
return;
}
// Find the relevant filter.
filters_t::iterator it;
for (it = filters.begin (); it != filters.end (); ++it)
if (it->type->id (NULL) == filter_id)
break;
bool unique;
if (cmd == SP_PUBSUB_CMD_UNSUBSCRIBE) {
xs_assert (it != filters.end ());
unique = it->type->pf_unsubscribe ((void*) (core_t*) this,
it->instance, pipe_, data + 4, size - 4) ? true : false;
#if 0
// TODO: This is 0MQ/3.1 protocol.
unique = it->type->pf_unsubscribe ((void*) (core_t*) this,
it->instance, pipe_, data + 1, size - 1) ? true : false;
#endif
}
else {
// If the filter of the specified type does not exist yet,
// create it.
if (it == filters.end ()) {
filter_t f;
f.type = get_filter (filter_id);
xs_assert (f.type);
f.instance = f.type->pf_create ((void*) (core_t*) this);
xs_assert (f.instance);
filters.push_back (f);
it = filters.end () - 1;
}
unique = it->type->pf_subscribe ((void*) (core_t*) this,
it->instance, pipe_, data + 4, size - 4) ? true : false;
#if 0
// TODO: This is 0MQ/3.1 protocol.
unique = it->type->pf_subscribe ((void*) (core_t*) this,
it->instance, pipe_, data + 1, size - 1) ? true : false;
#endif
}
// If the subscription is not a duplicate store it so that it can be
// passed to used on next recv call.
if (unique && options.type != XS_PUB)
pending.push_back (blob_t ((unsigned char*) sub.data (),
sub.size ()));
}
sub.close ();
}
void xs::xpub_t::xwrite_activated (pipe_t *pipe_)
{
dist.activated (pipe_);
}
void xs::xpub_t::xterminated (pipe_t *pipe_)
{
// Remove the pipe from all the filters.
for (filters_t::iterator it = filters.begin (); it != filters.end ();
++it) {
tmp_filter_id = it->type->id (NULL);
it->type->pf_unsubscribe_all ((void*) (core_t*) this, it->instance,
(void*) pipe_);
tmp_filter_id = -1;
}
dist.terminated (pipe_);
}
int xs::xpub_t::xsend (msg_t *msg_, int flags_)
{
bool msg_more = msg_->flags () & msg_t::more ? true : false;
// For the first part of multi-part message, find the matching pipes.
if (!more) {
for (filters_t::iterator it = filters.begin (); it != filters.end ();
++it)
it->type->pf_match ((void*) (core_t*) this, it->instance,
(unsigned char*) msg_->data (), msg_->size ());
}
// Send the message to all the pipes that were marked as matching
// in the previous step.
int rc = dist.send_to_matching (msg_, flags_);
if (rc != 0)
return rc;
// If we are at the end of multi-part message we can mark all the pipes
// as non-matching.
if (!msg_more)
dist.unmatch ();
more = msg_more;
return 0;
}
bool xs::xpub_t::xhas_out ()
{
return dist.has_out ();
}
int xs::xpub_t::xrecv (msg_t *msg_, int flags_)
{
// If there is at least one
if (pending.empty ()) {
errno = EAGAIN;
return -1;
}
int rc = msg_->close ();
errno_assert (rc == 0);
rc = msg_->init_size (pending.front ().size ());
errno_assert (rc == 0);
memcpy (msg_->data (), pending.front ().data (),
pending.front ().size ());
pending.pop_front ();
return 0;
}
bool xs::xpub_t::xhas_in ()
{
return !pending.empty ();
}
int xs::xpub_t::filter_unsubscribed (const unsigned char *data_, size_t size_)
{
// In XS_PUB socket, the subscriptions are not passed upstream.
if (options.type != XS_PUB) {
// Place the unsubscription to the queue of pending (un)sunscriptions
// to be retrived by the user later on.
blob_t unsub (size_ + 4, 0);
put_uint16 ((unsigned char*) unsub.data (), SP_PUBSUB_CMD_UNSUBSCRIBE);
put_uint16 ((unsigned char*) unsub.data () + 2, tmp_filter_id);
memcpy ((void*) (unsub.data () + 4), data_, size_);
#if 0
// TODO: This is 0MQ/3.1 protocol.
blob_t unsub (size_ + 1, 0);
unsub [0] = 0;
memcpy ((void*) (unsub.data () + 1), data_, size_);
#endif
pending.push_back (unsub);
}
return 0;
}
int xs::xpub_t::filter_matching (void *subscriber_)
{
dist.match ((xs::pipe_t*) subscriber_);
return 0;
}
xs::xpub_session_t::xpub_session_t (io_thread_t *io_thread_, bool connect_,
socket_base_t *socket_, const options_t &options_,
const char *protocol_, const char *address_) :
session_base_t (io_thread_, connect_, socket_, options_, protocol_,
address_)
{
}
xs::xpub_session_t::~xpub_session_t ()
{
}
|