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
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
|
//
// Copyright 2017 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 "nng.h"
#include "nng_compat.h"
#include <string.h>
#include <stdio.h>
// This file supplies the legacy compatibility API. Applications should
// avoid using these if at all possible, and instead use the new style APIs.
static struct {
int perr;
int nerr;
}
nn_errnos[] = {
{ NNG_EINTR, EINTR },
{ NNG_ENOMEM, ENOMEM },
{ NNG_EINVAL, EINVAL },
{ NNG_EBUSY, EBUSY },
{ NNG_ETIMEDOUT, ETIMEDOUT },
{ NNG_ECONNREFUSED, ECONNREFUSED },
{ NNG_ECLOSED, EBADF },
{ NNG_EAGAIN, EAGAIN },
{ NNG_ENOTSUP, ENOTSUP },
{ NNG_EADDRINUSE, EADDRINUSE },
{ NNG_ESTATE, EFSM },
{ NNG_ENOENT, ENOENT },
{ NNG_EPROTO, EPROTO },
{ NNG_EUNREACHABLE, EHOSTUNREACH },
{ NNG_EADDRINVAL, EADDRNOTAVAIL },
{ NNG_EPERM, EACCES },
{ NNG_EMSGSIZE, EMSGSIZE },
{ NNG_ECONNABORTED, ECONNABORTED },
{ NNG_ECONNRESET, ECONNRESET },
{ 0, 0 },
};
const char *
nn_strerror(int err)
{
int i;
static char msgbuf[32];
for (i = 0; nn_errnos[i].perr != 0; i++) {
if (nn_errnos[i].perr == err) {
return (nng_strerror(nn_errnos[i].nerr));
}
}
if (err == EIO) {
return ("Unknown I/O error");
}
// Arguablye we could use strerror() here, but we should only
// be getting errnos we understand at this point.
(void) snprintf(msgbuf, sizeof (msgbuf), "Unknown error %d", err);
return (msgbuf);
}
static void
nn_seterror(int err)
{
int i;
for (i = 0; nn_errnos[i].nerr != 0; i++) {
if (nn_errnos[i].nerr == err) {
errno = nn_errnos[i].perr;
return;
}
}
// No idea...
errno = EIO;
}
int
nn_socket(int domain, int protocol)
{
nng_socket sock;
int rv;
if ((domain != AF_SP) && (domain != AF_SP_RAW)) {
errno = EAFNOSUPPORT;
return (-1);
}
if ((rv = nng_open(&sock, protocol)) != 0) {
nn_seterror(rv);
return (-1);
}
if (domain == AF_SP_RAW) {
int raw = 1;
rv = nng_setopt(sock, NNG_OPT_RAW, &raw, sizeof (raw));
if (rv != 0) {
nn_seterror(rv);
nng_close(sock);
return (-1);
}
}
return ((int) sock);
}
int
nn_close(int s)
{
int rv;
if ((rv = nng_close((nng_socket) s)) != 0) {
nn_seterror(rv);
return (-1);
}
return (0);
}
int
nn_bind(int s, const char *addr)
{
int rv;
nng_endpoint ep;
if ((rv = nng_listen((nng_socket) s, addr, &ep, NNG_FLAG_SYNCH)) != 0) {
nn_seterror(rv);
return (-1);
}
return ((int) ep);
}
int
nn_connect(int s, const char *addr)
{
int rv;
nng_endpoint ep;
if ((rv = nng_dial((nng_socket) s, addr, &ep, 0)) != 0) {
nn_seterror(rv);
return (-1);
}
return ((int) ep);
}
int
nn_shutdown(int s, int ep)
{
int rv;
// Socket is wired into the endpoint... so passing a bad endpoint
// ID can result in affecting the wrong socket. But this requires
// a buggy application, and because we don't recycle endpoints
// until wrap, its unlikely to actually come up in practice.
if ((rv = nng_endpoint_close((nng_endpoint) ep)) != 0) {
nn_seterror(rv);
return (-1);
}
return (0);
}
void *
nn_allocmsg(size_t size, int type)
{
uintptr_t *ch;
nng_msg *msg;
int rv;
// Validate type and non-zero size. This also checks for overflow.
if ((type != 0) || (size < 1) || ((size + sizeof (msg) < size))) {
nn_seterror(NNG_EINVAL);
return (NULL);
}
// So our "messages" from nn are really going to be nng messages
// but to make this work, we use a bit of headroom in the message
// to stash the message header.
if ((rv = nng_msg_alloc(&msg, size + (sizeof (msg)))) != 0) {
nn_seterror(rv);
return (NULL);
}
memcpy(nng_msg_body(msg), &msg, sizeof (msg));
// We are counting on the implementation of nn_msg_trim to not
// reallocate the message but just to leave the prefix inplace.
(void) nng_msg_trim(msg, sizeof (msg));
return (nng_msg_body(msg));
}
int
nn_freemsg(void *ptr)
{
nng_msg *msg;
memcpy(&msg, ((char *) ptr) - sizeof (msg), sizeof (msg));
nng_msg_free(msg);
return (0);
}
void *
nn_reallocmsg(void *ptr, size_t len)
{
nng_msg *msg;
int rv;
if ((len + sizeof (msg)) < len) {
// overflowed!
nn_seterror(NNG_EINVAL);
return (NULL);
}
memcpy(&msg, ((char *) ptr) - sizeof (msg), sizeof (msg));
// We need to realloc the requested len, plus size for our header.
if ((rv = nng_msg_realloc(msg, len + sizeof (msg))) != 0) {
// We don't free the old message. Code is free to cope
// as it sees fit.
nn_seterror(rv);
return (NULL);
}
// Stash the msg header pointer
memcpy(nng_msg_body(msg), &msg, sizeof (msg));
nng_msg_trim(msg, sizeof (msg));
return (nng_msg_body(msg));
}
static int
nn_flags(int flags)
{
switch (flags) {
case 0:
return (0);
case NN_DONTWAIT:
return (NNG_FLAG_NONBLOCK);
default:
nn_seterror(NNG_EINVAL);
return (-1);
}
}
int
nn_send(int s, const void *buf, size_t len, int flags)
{
int rv;
if ((flags = nn_flags(flags)) == -1) {
return (-1);
}
if (len == NN_MSG) {
nng_msg *msg;
memcpy(&msg, ((char *) buf) - sizeof (msg), sizeof (msg));
len = nng_msg_len(msg);
rv = nng_sendmsg((nng_socket) s, msg, flags);
} else {
rv = nng_send((nng_socket) s, (void *) buf, len, flags);
}
if (rv != 0) {
nn_seterror(rv);
return (-1);
}
return ((int) len);
}
int
nn_recv(int s, void *buf, size_t len, int flags)
{
int rv;
if ((flags = nn_flags(flags)) == -1) {
return (-1);
}
if (len == NN_MSG) {
nng_msg *msg;
void *body;
if ((rv = nng_recvmsg((nng_socket) s, &msg, flags)) != 0) {
nn_seterror(rv);
return (-1);
}
// prepend our header to the body...
// Note that this *can* alter the message,
// although for performance reasons it ought not.
// (There should be sufficient headroom.)
if ((rv = nng_msg_prepend(msg, &msg, sizeof (msg))) != 0) {
nng_msg_free(msg);
nn_seterror(rv);
return (-1);
}
// now "trim" it off... the value is still there, but the
// contents are unreferenced. We rely on legacy nanomsg's
// ignorance of nng msgs to preserve this.
nng_msg_trim(msg, sizeof (msg));
*(void **) buf = nng_msg_body(msg);
return ((int) nng_msg_len(msg));
}
if ((rv = nng_recv((nng_socket) s, buf, &len, flags)) != 0) {
nn_seterror(rv);
return (-1);
}
return ((int) len);
}
int
nn_recvmsg(int s, struct nn_msghdr *mh, int flags)
{
int rv;
nng_msg *msg;
size_t len;
int keep = 0;
if ((flags = nn_flags(flags)) == -1) {
return (-1);
}
if (mh == NULL) {
nn_seterror(NNG_EINVAL);
return (-1);
}
if ((rv = nng_recvmsg((nng_socket) s, &msg, flags)) != 0) {
nn_seterror(rv);
return (-1);
}
if ((mh->msg_iovlen == 1) && (mh->msg_iov[0].iov_len == NN_MSG)) {
// Receiver wants to have a dynamically allocated message.
// There can only be one of these.
if ((rv = nng_msg_prepend(msg, &msg, sizeof (msg))) != 0) {
nng_msg_free(msg);
nn_seterror(rv);
return (-1);
}
nng_msg_trim(msg, sizeof (msg));
*(void **) (mh->msg_iov[0].iov_base) = nng_msg_body(msg);
len = nng_msg_len(msg);
keep = 1; // Do not discard message!
} else {
// copyout to multiple iovecs.
char *ptr = nng_msg_body(msg);
int i;
size_t n;
len = nng_msg_len(msg);
for (i = 0; i < mh->msg_iovlen; i++) {
if ((n = mh->msg_iov[i].iov_len) == NN_MSG) {
// This is forbidden!
nn_seterror(NNG_EINVAL);
nng_msg_free(msg);
return (-1);
}
if (n > len) {
n = len;
}
memcpy(mh->msg_iov[i].iov_base, ptr, n);
len -= n;
ptr += n;
}
// If we copied everything, len will be zero, otherwise,
// it represents the amount of data that we were unable to
// copyout. The caller is responsible for noticing this,
// as there is no API to pass this information out.
len = nng_msg_len(msg);
}
// If the caller has requested control information (header details),
// we grab it.
if (mh->msg_control != NULL) {
char *cdata;
size_t clen;
size_t tlen;
struct nn_cmsghdr *hdr;
clen = NN_CMSG_SPACE(nng_msg_header_len(msg));
if ((tlen = mh->msg_controllen) == NN_MSG) {
// Ideally we'd use the same msg, but we would need
// to set up reference counts on the message, so
// instead we just make a new message.
nng_msg *nmsg;
rv = nng_msg_alloc(&nmsg, clen + sizeof (nmsg));
if (rv != 0) {
nng_msg_free(msg);
nn_seterror(rv);
return (-1);
}
memcpy(nng_msg_body(nmsg), &nmsg, sizeof (nmsg));
nng_msg_trim(nmsg, sizeof (nmsg));
cdata = nng_msg_body(nmsg);
*(void **) mh->msg_control = cdata;
tlen = clen;
} else {
cdata = mh->msg_control;
memset(cdata, 0,
tlen > sizeof (*hdr) ? sizeof (*hdr) : tlen);
}
if (clen <= tlen) {
hdr = (void *) cdata;
hdr->cmsg_len = nng_msg_header_len(msg);
hdr->cmsg_level = PROTO_SP;
hdr->cmsg_type = SP_HDR;
memcpy(NN_CMSG_DATA(cdata), nng_msg_header(msg),
nng_msg_header_len(msg));
}
}
if (!keep) {
nng_msg_free(msg);
}
return (len);
}
#if 0
int
nn_sendmsg(int s, const struct nn_msghdr *mh, int flags)
{
void *chunk;
switch (flags) {
case NN_DONTWAIT:
flags = NN_FLAG_NONBLOCK;
break;
case 0:
break;
default:
nn_seterror(NNG_EINVAL);
return (-1);
}
// Iterate over the iovecs. The first iov may be NN_MSG,
// in which case it must be the only iovec.
if ((mh->msg_iovlen == 1) && (mh->msg_iov[0].iov_len == NN_MSG)) {
// Chunk is stored at the offset...
chunk = *(void **) mh->msg_iov[0].iov_base;
// Chunk must be aligned
if ((chuink & (sizeof (void *) - 1)) != 0) {
nn_seterror(NNG_EINVAL);
return (-1);
}
size = (size_t) (*(uintptr_t *) (((void **) chunk) - 1));
}
}
#endif
|