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
|
/*
* librd - Rapid Development C library
*
* Copyright (c) 2012, Magnus Edenhill
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "rd.h"
#include "rdaddr.h"
#include "rdrand.h"
#ifdef _WIN32
#include <ws2tcpip.h>
#endif
const char *rd_sockaddr2str(const void *addr, int flags) {
const rd_sockaddr_inx_t *a = (const rd_sockaddr_inx_t *)addr;
static RD_TLS char ret[32][256];
static RD_TLS int reti = 0;
char portstr[32];
int of = 0;
int niflags = NI_NUMERICSERV;
int r;
reti = (reti + 1) % 32;
switch (a->sinx_family) {
case AF_INET:
case AF_INET6:
if (flags & RD_SOCKADDR2STR_F_FAMILY)
of += rd_snprintf(&ret[reti][of],
sizeof(ret[reti]) - of, "ipv%i#",
a->sinx_family == AF_INET ? 4 : 6);
if ((flags & RD_SOCKADDR2STR_F_PORT) &&
a->sinx_family == AF_INET6)
ret[reti][of++] = '[';
if (!(flags & RD_SOCKADDR2STR_F_RESOLVE))
niflags |= NI_NUMERICHOST;
retry:
if ((r = getnameinfo(
(const struct sockaddr *)a, RD_SOCKADDR_INX_LEN(a),
ret[reti] + of, sizeof(ret[reti]) - of,
(flags & RD_SOCKADDR2STR_F_PORT) ? portstr : NULL,
(flags & RD_SOCKADDR2STR_F_PORT) ? sizeof(portstr) : 0,
niflags))) {
if (r == EAI_AGAIN && !(niflags & NI_NUMERICHOST)) {
/* If unable to resolve name, retry without
* name resolution. */
niflags |= NI_NUMERICHOST;
goto retry;
}
break;
}
if (flags & RD_SOCKADDR2STR_F_PORT) {
size_t len = strlen(ret[reti]);
rd_snprintf(
ret[reti] + len, sizeof(ret[reti]) - len, "%s:%s",
a->sinx_family == AF_INET6 ? "]" : "", portstr);
}
return ret[reti];
}
/* Error-case */
rd_snprintf(ret[reti], sizeof(ret[reti]), "<unsupported:%s>",
rd_family2str(a->sinx_family));
return ret[reti];
}
const char *rd_addrinfo_prepare(const char *nodesvc, char **node, char **svc) {
static RD_TLS char snode[256];
static RD_TLS char ssvc[64];
const char *t;
const char *svct = NULL;
size_t nodelen = 0;
*snode = '\0';
*ssvc = '\0';
if (*nodesvc == '[') {
/* "[host]".. (enveloped node name) */
if (!(t = strchr(nodesvc, ']')))
return "Missing close-']'";
nodesvc++;
nodelen = t - nodesvc;
svct = t + 1;
} else if (*nodesvc == ':' && *(nodesvc + 1) != ':') {
/* ":".. (port only) */
nodelen = 0;
svct = nodesvc;
}
if ((svct = strrchr(svct ? svct : nodesvc, ':')) &&
(*(svct - 1) != ':') && *(++svct)) {
/* Optional ":service" definition. */
if (strlen(svct) >= sizeof(ssvc))
return "Service name too long";
strcpy(ssvc, svct);
if (!nodelen)
nodelen = svct - nodesvc - 1;
} else if (!nodelen)
nodelen = strlen(nodesvc);
if (nodelen) {
/* Truncate nodename if necessary. */
nodelen = RD_MIN(nodelen, sizeof(snode) - 1);
memcpy(snode, nodesvc, nodelen);
snode[nodelen] = '\0';
}
*node = snode;
*svc = ssvc;
return NULL;
}
rd_sockaddr_list_t *
rd_getaddrinfo(const char *nodesvc,
const char *defsvc,
int flags,
int family,
int socktype,
int protocol,
int (*resolve_cb)(const char *node,
const char *service,
const struct addrinfo *hints,
struct addrinfo **res,
void *opaque),
void *opaque,
const char **errstr) {
struct addrinfo hints;
memset(&hints, 0, sizeof(hints));
hints.ai_family = family;
hints.ai_socktype = socktype;
hints.ai_protocol = protocol;
hints.ai_flags = flags;
struct addrinfo *ais, *ai;
char *node, *svc;
int r;
int cnt = 0;
rd_sockaddr_list_t *rsal;
if ((*errstr = rd_addrinfo_prepare(nodesvc, &node, &svc))) {
errno = EINVAL;
return NULL;
}
if (*svc)
defsvc = svc;
if (resolve_cb) {
r = resolve_cb(node, defsvc, &hints, &ais, opaque);
} else {
r = getaddrinfo(node, defsvc, &hints, &ais);
}
if (r) {
#ifdef EAI_SYSTEM
if (r == EAI_SYSTEM)
#else
if (0)
#endif
*errstr = rd_strerror(errno);
else {
#ifdef _WIN32
*errstr = gai_strerrorA(r);
#else
*errstr = gai_strerror(r);
#endif
errno = EFAULT;
}
return NULL;
}
/* Count number of addresses */
for (ai = ais; ai != NULL; ai = ai->ai_next)
cnt++;
if (cnt == 0) {
/* unlikely? */
if (resolve_cb)
resolve_cb(NULL, NULL, NULL, &ais, opaque);
else
freeaddrinfo(ais);
errno = ENOENT;
*errstr = "No addresses";
return NULL;
}
rsal = rd_calloc(1, sizeof(*rsal) + (sizeof(*rsal->rsal_addr) * cnt));
for (ai = ais; ai != NULL; ai = ai->ai_next)
memcpy(&rsal->rsal_addr[rsal->rsal_cnt++], ai->ai_addr,
ai->ai_addrlen);
if (resolve_cb)
resolve_cb(NULL, NULL, NULL, &ais, opaque);
else
freeaddrinfo(ais);
/* Shuffle address list for proper round-robin */
if (!(flags & RD_AI_NOSHUFFLE))
rd_array_shuffle(rsal->rsal_addr, rsal->rsal_cnt,
sizeof(*rsal->rsal_addr));
return rsal;
}
void rd_sockaddr_list_destroy(rd_sockaddr_list_t *rsal) {
rd_free(rsal);
}
|
