aboutsummaryrefslogtreecommitdiff
path: root/src/protocol/pubsub/sub.c
blob: a1f2360766e4cd2784f50aac421f27eaeb031d95 (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
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
337
338
339
340
341
342
343
344
345
346
347
348
//
// Copyright 2016 Garrett D'Amore <garrett@damore.org>
//
// This software is supplied under the terms of the MIT License, a
// copy of which should be located in the distribution where this
// file was obtained (LICENSE.txt).  A copy of the license may also be
// found online at https://opensource.org/licenses/MIT.
//

#include <stdlib.h>
#include <string.h>

#include "core/nng_impl.h"

// Subscriber protocol.  The SUB protocol receives messages sent to
// it from publishers, and filters out those it is not interested in,
// only passing up ones that match known subscriptions.

typedef struct nni_sub_pipe	nni_sub_pipe;
typedef struct nni_sub_sock	nni_sub_sock;
typedef struct nni_sub_topic	nni_sub_topic;

struct nni_sub_topic {
	nni_list_node	node;
	size_t		len;
	void *		buf;
};

// An nni_rep_sock is our per-socket protocol private structure.
struct nni_sub_sock {
	nni_sock *	sock;
	nni_mtx		mx;
	nni_list	topics;
	nni_msgq *	urq;
	int		raw;
};

// An nni_rep_pipe is our per-pipe protocol private structure.
struct nni_sub_pipe {
	nni_pipe *	pipe;
	nni_sub_sock *	sub;
};

static int
nni_sub_init(void **subp, nni_sock *sock)
{
	nni_sub_sock *sub;
	int rv;

	if ((sub = NNI_ALLOC_STRUCT(sub)) == NULL) {
		return (NNG_ENOMEM);
	}
	if ((rv = nni_mtx_init(&sub->mx)) != 0) {
		NNI_FREE_STRUCT(sub);
		return (rv);
	}
	NNI_LIST_INIT(&sub->topics, nni_sub_topic, node);
	sub->sock = sock;
	sub->raw = 0;

	sub->urq = nni_sock_recvq(sock);
	nni_sock_senderr(sock, NNG_ENOTSUP);
	*subp = sub;
	return (0);
}


static void
nni_sub_fini(void *arg)
{
	nni_sub_sock *sub = arg;

	// XXX: free subscriptions...
	nni_mtx_fini(&sub->mx);
	NNI_FREE_STRUCT(sub);
}


static int
nni_sub_pipe_init(void **spp, nni_pipe *pipe, void *ssock)
{
	nni_sub_pipe *sp;
	int rv;

	if ((sp = NNI_ALLOC_STRUCT(sp)) == NULL) {
		return (NNG_ENOMEM);
	}
	sp->pipe = pipe;
	sp->sub = ssock;
	*spp = sp;
	return (0);
}


static void
nni_sub_pipe_fini(void *arg)
{
	nni_sub_pipe *sp = arg;

	NNI_FREE_STRUCT(sp);
}


static int
nni_sub_pipe_add(void *arg)
{
	nni_sub_pipe *sp = arg;

	if (nni_pipe_peer(sp->pipe) != NNG_PROTO_PUB) {
		return (NNG_EPROTO);
	}
	return (0);
}


static void
nni_sub_pipe_rem(void *arg)
{
	NNI_ARG_UNUSED(arg);
}


static void
nni_sub_pipe_send(void *arg)
{
	NNI_ARG_UNUSED(arg);
}


static void
nni_sub_pipe_recv(void *arg)
{
	nni_sub_pipe *sp = arg;
	nni_sub_sock *sub = sp->sub;
	nni_msgq *urq = sub->urq;
	nni_pipe *pipe = sp->pipe;
	nni_msg *msg;
	int rv;

	for (;;) {
		rv = nni_pipe_recv(pipe, &msg);
		if (rv != 0) {
			break;
		}

		// Now send it up.
		rv = nni_msgq_put(urq, msg);
		if (rv != 0) {
			nni_msg_free(msg);
			break;
		}
	}
	// Nobody else to signal...
	nni_pipe_close(pipe);
}


// For now we maintain subscriptions on a sorted linked list.  As we do not
// expect to have huge numbers of subscriptions, and as the operation is
// really O(n), we think this is acceptable.  In the future we might decide
// to replace this with a patricia trie, like old nanomsg had.

static int
nni_sub_subscribe(nni_sub_sock *sub, const void *buf, size_t sz)
{
	nni_sub_topic *topic;
	nni_sub_topic *newtopic;

	NNI_LIST_FOREACH (&sub->topics, topic) {
		int rv;
		if (topic->len >= sz) {
			rv = memcmp(topic->buf, buf, sz);
		} else {
			rv = memcmp(topic->buf, buf, topic->len);
		}
		if (rv == 0) {
			if (topic->len == sz) {
				// Already inserted.
				return (0);
			}
			if (topic->len > sz) {
				break;
			}
		} else if (rv > 0) {
			break;
		}
	}

	if ((newtopic = NNI_ALLOC_STRUCT(newtopic)) == NULL) {
		return (NNG_ENOMEM);
	}
	if ((newtopic->buf = nni_alloc(sz)) == NULL) {
		return (NNG_ENOMEM);
	}
	NNI_LIST_NODE_INIT(&newtopic->node);
	newtopic->len = sz;
	if (topic != NULL) {
		nni_list_insert_before(&sub->topics, newtopic, topic);
	}
	return (0);
}


static int
nni_sub_unsubscribe(nni_sub_sock *sub, const void *buf, size_t sz)
{
	nni_sub_topic *topic;
	int rv;

	NNI_LIST_FOREACH (&sub->topics, topic) {
		if (topic->len >= sz) {
			rv = memcmp(topic->buf, buf, sz);
		} else {
			rv = memcmp(topic->buf, buf, topic->len);
		}
		if (rv == 0) {
			if (topic->len == sz) {
				nni_list_remove(&sub->topics, topic);
				nni_free(topic->buf, topic->len);
				NNI_FREE_STRUCT(topic);
				return (0);
			}
			if (topic->len > sz) {
				return (NNG_ENOENT);
			}
		}
		if (rv > 0) {
			return (NNG_ENOENT);
		}
	}
	return (NNG_ENOENT);
}


static int
nni_sub_setopt(void *arg, int opt, const void *buf, size_t sz)
{
	nni_sub_sock *sub = arg;
	int rv;

	switch (opt) {
	case NNG_OPT_RAW:
		nni_mtx_lock(&sub->mx);
		rv = nni_setopt_int(&sub->raw, buf, sz, 0, 1);
		nni_mtx_unlock(&sub->mx);
		break;
	case NNG_OPT_SUBSCRIBE:
		nni_mtx_lock(&sub->mx);
		rv = nni_sub_subscribe(sub, buf, sz);
		nni_mtx_unlock(&sub->mx);
		break;
	case NNG_OPT_UNSUBSCRIBE:
		nni_mtx_lock(&sub->mx);
		rv = nni_sub_unsubscribe(sub, buf, sz);
		nni_mtx_unlock(&sub->mx);
		break;
	default:
		rv = NNG_ENOTSUP;
	}
	return (rv);
}


static int
nni_sub_getopt(void *arg, int opt, void *buf, size_t *szp)
{
	nni_sub_sock *sub = arg;
	int rv;

	switch (opt) {
	case NNG_OPT_RAW:
		nni_mtx_lock(&sub->mx);
		rv = nni_getopt_int(&sub->raw, buf, szp);
		nni_mtx_unlock(&sub->mx);
		break;
	default:
		rv = NNG_ENOTSUP;
	}
	return (rv);
}


static nni_msg *
nni_sub_recvfilter(void *arg, nni_msg *msg)
{
	nni_sub_sock *sub = arg;
	nni_sub_topic *topic;
	char *body;
	size_t len;
	int match;

	nni_mtx_lock(&sub->mx);
	if (sub->raw) {
		nni_mtx_unlock(&sub->mx);
		return (msg);
	}

	body = nni_msg_body(msg, &len);

	// Check to see if the message matches one of our subscriptions.
	NNI_LIST_FOREACH (&sub->topics, topic) {
		if (len >= topic->len) {
			int rv = memcmp(topic->buf, body, topic->len);
			if (rv == 0) {
				// Matched!
				match = 1;
				break;
			}
			if (rv > 0) {
				match = 0;
				break;
			}
		} else if (memcmp(topic->buf, body, len) >= 0) {
			match = 0;
			break;
		}
	}
	nni_mtx_unlock(&sub->mx);
	if (!match) {
		nni_msg_free(msg);
		return (NULL);
	}
	return (0);
}


// This is the global protocol structure -- our linkage to the core.
// This should be the only global non-static symbol in this file.
static nni_proto_pipe nni_sub_proto_pipe = {
	.pipe_init	= nni_sub_pipe_init,
	.pipe_fini	= nni_sub_pipe_fini,
	.pipe_add	= nni_sub_pipe_add,
	.pipe_rem	= nni_sub_pipe_rem,
	.pipe_send	= nni_sub_pipe_send,
	.pipe_recv	= nni_sub_pipe_recv,
};

nni_proto nni_sub_proto = {
	.proto_self		= NNG_PROTO_SUB,
	.proto_peer		= NNG_PROTO_PUB,
	.proto_name		= "sub",
	.proto_pipe		= &nni_sub_proto_pipe,
	.proto_init		= nni_sub_init,
	.proto_fini		= nni_sub_fini,
	.proto_setopt		= nni_sub_setopt,
	.proto_getopt		= nni_sub_getopt,
	.proto_recv_filter	= nni_sub_recvfilter,
};