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
|
//
// Copyright 2019 Staysail Systems, Inc. <info@staysail.tech>
// Copyright 2018 Capitar IT Group BV <info@capitar.com>
//
// 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 "core/nng_impl.h"
#ifdef NNG_USE_POSIX_RESOLV_GAI
#include <arpa/inet.h>
#include <ctype.h>
#include <errno.h>
#include <netdb.h>
#include <netinet/in.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <sys/uio.h>
#include <sys/un.h>
#include <unistd.h>
// We use a single resolver taskq - but we allocate a few threads
// for it to ensure that names can be looked up concurrently. This isn't
// as elegant or scaleable as a true asynchronous resolver would be, but
// it has the advantage of being fairly portable, and concurrent enough for
// the vast, vast majority of use cases. The total thread count can be
// changed with this define. Note that some platforms may not have a
// thread-safe getaddrinfo(). In that case they should set this to 1.
#ifndef NNG_RESOLV_CONCURRENCY
#define NNG_RESOLV_CONCURRENCY 4
#endif
static nni_mtx resolv_mtx;
static nni_cv resolv_cv;
static bool resolv_fini;
static nni_list resolv_aios;
static nni_thr resolv_thrs[NNG_RESOLV_CONCURRENCY];
typedef struct resolv_item resolv_item;
struct resolv_item {
int family;
int passive;
const char * name;
int proto;
int socktype;
uint16_t port;
nni_aio * aio;
nng_sockaddr sa;
};
static void
resolv_cancel(nni_aio *aio, void *arg, int rv)
{
resolv_item *item = arg;
nni_mtx_lock(&resolv_mtx);
if (item != nni_aio_get_prov_extra(aio, 0)) {
// Already canceled?
nni_mtx_unlock(&resolv_mtx);
return;
}
nni_aio_set_prov_extra(aio, 0, NULL);
if (nni_aio_list_active(aio)) {
// We have not been picked up by a resolver thread yet,
// so we can just discard everything.
nni_aio_list_remove(aio);
nni_mtx_unlock(&resolv_mtx);
NNI_FREE_STRUCT(item);
} else {
// This case indicates the resolver is still processing our
// node. We can discard our interest in the result, but we
// can't interrupt the resolver itself. (Too bad, name
// resolution is utterly synchronous for now.)
item->aio = NULL;
nni_mtx_unlock(&resolv_mtx);
}
nni_aio_finish_error(aio, rv);
}
static int
posix_gai_errno(int rv)
{
switch (rv) {
case 0:
return (0);
case EAI_MEMORY:
return (NNG_ENOMEM);
case EAI_SYSTEM:
return (nni_plat_errno(errno));
case EAI_NONAME:
#ifdef EAI_NODATA
case EAI_NODATA:
#endif
case EAI_SERVICE:
return (NNG_EADDRINVAL);
case EAI_BADFLAGS:
return (NNG_EINVAL);
case EAI_SOCKTYPE:
return (NNG_ENOTSUP);
#ifdef EAI_CANCELED
case EAI_CANCELED:
return (NNG_ECANCELED);
#endif
#ifdef EAI_AGAIN
case EAI_AGAIN:
return (NNG_EAGAIN);
#endif
default:
return (NNG_ESYSERR + rv);
}
}
static int
resolv_task(resolv_item *item)
{
struct addrinfo hints;
struct addrinfo *results;
struct addrinfo *probe;
int rv;
results = NULL;
// We treat these all as IP addresses. The service and the
// host part are split.
memset(&hints, 0, sizeof(hints));
#ifdef AI_ADDRCONFIG
hints.ai_flags = AI_ADDRCONFIG | AI_NUMERICSERV;
#else
hints.ai_flags = AI_NUMERICSERV;
#endif
if (item->passive) {
hints.ai_flags |= AI_PASSIVE;
}
hints.ai_protocol = item->proto;
hints.ai_family = item->family;
hints.ai_socktype = item->socktype;
// We can pass any non-zero service number, but we have to pass
// *something*, in case we are using a NULL hostname.
if ((rv = getaddrinfo(item->name, "80", &hints, &results)) != 0) {
rv = posix_gai_errno(rv);
goto done;
}
// We only take the first matching address. Presumably
// DNS load balancing is done by the resolver/server.
rv = NNG_EADDRINVAL;
for (probe = results; probe != NULL; probe = probe->ai_next) {
if ((probe->ai_addr->sa_family == AF_INET) ||
(probe->ai_addr->sa_family == AF_INET6)) {
break;
}
}
if (probe != NULL) {
struct sockaddr_in * sin;
struct sockaddr_in6 *sin6;
nng_sockaddr * sa = &item->sa;
switch (probe->ai_addr->sa_family) {
case AF_INET:
rv = 0;
sin = (void *) probe->ai_addr;
sa->s_in.sa_family = NNG_AF_INET;
sa->s_in.sa_port = item->port;
sa->s_in.sa_addr = sin->sin_addr.s_addr;
break;
case AF_INET6:
rv = 0;
sin6 = (void *) probe->ai_addr;
sa->s_in6.sa_family = NNG_AF_INET6;
sa->s_in6.sa_port = item->port;
memcpy(sa->s_in6.sa_addr, sin6->sin6_addr.s6_addr, 16);
break;
}
}
done:
if (results != NULL) {
freeaddrinfo(results);
}
return (rv);
}
static void
resolv_ip(const char *host, const char *serv, int passive, int family,
int proto, int socktype, nni_aio *aio)
{
resolv_item *item;
sa_family_t fam;
int rv;
int port;
if (nni_aio_begin(aio) != 0) {
return;
}
switch (family) {
case NNG_AF_INET:
fam = AF_INET;
break;
case NNG_AF_INET6:
fam = AF_INET6;
break;
case NNG_AF_UNSPEC:
fam = AF_UNSPEC;
break;
default:
nni_aio_finish_error(aio, NNG_ENOTSUP);
return;
}
// We can't use the resolver to look up up ports with AI_NUMERICSERV,
// because some resolver(s) is(are?) broken. For example, the
// systemd resolver takes a port number of 1000000 and just rips off
// the high order bits and lets it through!
port = 0;
if (serv != NULL) {
while (isdigit(*serv)) {
port *= 10;
port += (*serv - '0');
if (port > 0xffff) {
// Port number out of range.
nni_aio_finish_error(aio, NNG_EADDRINVAL);
return;
}
serv++;
}
if (*serv != '\0') {
nni_aio_finish_error(aio, NNG_EADDRINVAL);
return;
}
}
if ((port == 0) && (!passive)) {
nni_aio_finish_error(aio, NNG_EADDRINVAL);
return;
}
if ((item = NNI_ALLOC_STRUCT(item)) == NULL) {
nni_aio_finish_error(aio, NNG_ENOMEM);
return;
}
// NB: host and serv must remain valid until this is completed.
memset(&item->sa, 0, sizeof(item->sa));
item->name = host;
item->proto = proto;
item->aio = aio;
item->family = fam;
item->passive = passive;
item->socktype = socktype;
item->port = htons((uint16_t) port);
nni_mtx_lock(&resolv_mtx);
if (resolv_fini) {
rv = NNG_ECLOSED;
} else {
nni_aio_set_prov_extra(aio, 0, item);
rv = nni_aio_schedule(aio, resolv_cancel, item);
}
if (rv != 0) {
nni_mtx_unlock(&resolv_mtx);
NNI_FREE_STRUCT(item);
nni_aio_finish_error(aio, rv);
return;
}
nni_list_append(&resolv_aios, aio);
nni_cv_wake1(&resolv_cv);
nni_mtx_unlock(&resolv_mtx);
}
void
nni_tcp_resolv(
const char *host, const char *serv, int family, int passive, nni_aio *aio)
{
resolv_ip(host, serv, passive, family, IPPROTO_TCP, SOCK_STREAM, aio);
}
void
nni_udp_resolv(
const char *host, const char *serv, int family, int passive, nni_aio *aio)
{
resolv_ip(host, serv, passive, family, IPPROTO_UDP, SOCK_DGRAM, aio);
}
void
resolv_worker(void *notused)
{
NNI_ARG_UNUSED(notused);
nni_mtx_lock(&resolv_mtx);
for (;;) {
nni_aio * aio;
resolv_item *item;
int rv;
if ((aio = nni_list_first(&resolv_aios)) == NULL) {
if (resolv_fini) {
break;
}
nni_cv_wait(&resolv_cv);
continue;
}
item = nni_aio_get_prov_extra(aio, 0);
nni_aio_list_remove(aio);
// Now attempt to do the work. This runs synchronously.
nni_mtx_unlock(&resolv_mtx);
rv = resolv_task(item);
nni_mtx_lock(&resolv_mtx);
// Check to make sure we were not canceled.
if ((aio = item->aio) != NULL) {
nni_aio_set_prov_extra(aio, 0, NULL);
item->aio = NULL;
nni_aio_set_sockaddr(aio, &item->sa);
nni_aio_finish(aio, rv, 0);
NNI_FREE_STRUCT(item);
}
}
nni_mtx_unlock(&resolv_mtx);
}
int
nni_ntop(const nni_sockaddr *sa, char *ipstr, char *portstr)
{
const void *ap;
uint16_t port;
int af;
switch (sa->s_family) {
case NNG_AF_INET:
ap = &sa->s_in.sa_addr;
port = sa->s_in.sa_port;
af = AF_INET;
break;
case NNG_AF_INET6:
ap = &sa->s_in6.sa_addr;
port = sa->s_in6.sa_port;
af = AF_INET6;
break;
default:
return (NNG_EINVAL);
}
if (ipstr != NULL) {
if (af == AF_INET6) {
size_t l;
ipstr[0] = '[';
inet_ntop(af, ap, ipstr + 1, INET6_ADDRSTRLEN);
l = strlen(ipstr);
ipstr[l++] = ']';
ipstr[l++] = '\0';
} else {
inet_ntop(af, ap, ipstr, INET6_ADDRSTRLEN);
}
}
if (portstr != NULL) {
#ifdef NNG_LITTLE_ENDIAN
port = ((port >> 8) & 0xff) | ((port & 0xff) << 8);
#endif
snprintf(portstr, 6, "%u", port);
}
return (0);
}
int
nni_posix_resolv_sysinit(void)
{
nni_mtx_init(&resolv_mtx);
nni_cv_init(&resolv_cv, &resolv_mtx);
nni_aio_list_init(&resolv_aios);
resolv_fini = false;
for (int i = 0; i < NNG_RESOLV_CONCURRENCY; i++) {
int rv = nni_thr_init(&resolv_thrs[i], resolv_worker, NULL);
if (rv != 0) {
nni_posix_resolv_sysfini();
return (rv);
}
}
for (int i = 0; i < NNG_RESOLV_CONCURRENCY; i++) {
nni_thr_run(&resolv_thrs[i]);
}
return (0);
}
void
nni_posix_resolv_sysfini(void)
{
nni_mtx_lock(&resolv_mtx);
resolv_fini = true;
nni_cv_wake(&resolv_cv);
nni_mtx_unlock(&resolv_mtx);
for (int i = 0; i < NNG_RESOLV_CONCURRENCY; i++) {
nni_thr_fini(&resolv_thrs[i]);
}
nni_cv_fini(&resolv_cv);
nni_mtx_fini(&resolv_mtx);
}
#endif // NNG_USE_POSIX_RESOLV_GAI
|