1 #include <sys/socket.h>
2 #include <netinet/in.h>
15 #include "stdio_impl.h"
18 static int is_valid_hostname(const char *host)
20 const unsigned char *s;
21 if (strnlen(host, 255)-1 >= 254 || mbstowcs(0, host, 0) == -1) return 0;
22 for (s=(void *)host; *s>=0x80 || *s=='.' || *s=='-' || isalnum(*s); s++);
26 static int name_from_null(struct address buf[static 2], const char *name, int family, int flags)
30 if (flags & AI_PASSIVE) {
31 if (family != AF_INET6)
32 buf[cnt++] = (struct address){ .family = AF_INET };
33 if (family != AF_INET)
34 buf[cnt++] = (struct address){ .family = AF_INET6 };
36 if (family != AF_INET6)
37 buf[cnt++] = (struct address){ .family = AF_INET, .addr = { 127,0,0,1 } };
38 if (family != AF_INET)
39 buf[cnt++] = (struct address){ .family = AF_INET6, .addr = { [15] = 1 } };
44 static int name_from_numeric(struct address buf[static 1], const char *name, int family)
46 return __lookup_ipliteral(buf, name, family);
49 static int name_from_hosts(struct address buf[static MAXADDRS], char canon[static 256], const char *name, int family)
52 size_t l = strlen(name);
53 int cnt = 0, badfam = 0;
54 unsigned char _buf[1032];
55 FILE _f, *f = __fopen_rb_ca("/etc/hosts", &_f, _buf, sizeof _buf);
56 if (!f) switch (errno) {
64 while (fgets(line, sizeof line, f) && cnt < MAXADDRS) {
67 if ((p=strchr(line, '#'))) *p++='\n', *p=0;
68 for(p=line+1; (p=strstr(p, name)) &&
69 (!isspace(p[-1]) || !isspace(p[l])); p++);
72 /* Isolate IP address to parse */
73 for (p=line; *p && !isspace(*p); p++);
75 switch (name_from_numeric(buf+cnt, line, family)) {
86 /* Extract first name as canonical name */
87 for (; *p && isspace(*p); p++);
88 for (z=p; *z && !isspace(*z); z++);
90 if (is_valid_hostname(p)) memcpy(canon, p, z-p+1);
93 return cnt ? cnt : badfam;
97 struct address *addrs;
106 static int dns_parse_callback(void *c, int rr, const void *data, int len, const void *packet)
109 struct dpc_ctx *ctx = c;
110 if (ctx->cnt >= MAXADDRS) return -1;
113 if (len != 4) return -1;
114 ctx->addrs[ctx->cnt].family = AF_INET;
115 ctx->addrs[ctx->cnt].scopeid = 0;
116 memcpy(ctx->addrs[ctx->cnt++].addr, data, 4);
119 if (len != 16) return -1;
120 ctx->addrs[ctx->cnt].family = AF_INET6;
121 ctx->addrs[ctx->cnt].scopeid = 0;
122 memcpy(ctx->addrs[ctx->cnt++].addr, data, 16);
125 if (__dn_expand(packet, (const unsigned char *)packet + 512,
126 data, tmp, sizeof tmp) > 0 && is_valid_hostname(tmp))
127 strcpy(ctx->canon, tmp);
133 static int name_from_dns(struct address buf[static MAXADDRS], char canon[static 256], const char *name, int family, const struct resolvconf *conf)
135 unsigned char qbuf[2][280], abuf[2][512];
136 const unsigned char *qp[2] = { qbuf[0], qbuf[1] };
137 unsigned char *ap[2] = { abuf[0], abuf[1] };
138 int qlens[2], alens[2];
140 struct dpc_ctx ctx = { .addrs = buf, .canon = canon };
141 static const struct { int af; int rr; } afrr[2] = {
142 { .af = AF_INET6, .rr = RR_A },
143 { .af = AF_INET, .rr = RR_AAAA },
146 for (i=0; i<2; i++) {
147 if (family != afrr[i].af) {
148 qlens[nq] = __res_mkquery(0, name, 1, afrr[i].rr,
149 0, 0, 0, qbuf[nq], sizeof *qbuf);
152 qbuf[nq][3] = 0; /* don't need AD flag */
157 if (__res_msend_rc(nq, qp, qlens, ap, alens, sizeof *abuf, conf) < 0)
160 for (i=0; i<nq; i++) {
161 if (alens[i] < 4 || (abuf[i][3] & 15) == 2) return EAI_AGAIN;
162 if ((abuf[i][3] & 15) == 3) return 0;
163 if ((abuf[i][3] & 15) != 0) return EAI_FAIL;
167 __dns_parse(abuf[i], alens[i], dns_parse_callback, &ctx);
169 if (ctx.cnt) return ctx.cnt;
173 static int name_from_dns_search(struct address buf[static MAXADDRS], char canon[static 256], const char *name, int family)
176 struct resolvconf conf;
180 if (__get_resolv_conf(&conf, search, sizeof search) < 0) return -1;
182 /* Count dots, suppress search when >=ndots or name ends in
183 * a dot, which is an explicit request for global scope. */
184 for (dots=l=0; name[l]; l++) if (name[l]=='.') dots++;
185 if (dots >= conf.ndots || name[l-1]=='.') *search = 0;
187 /* Strip final dot for canon, fail if multiple trailing dots. */
188 if (name[l-1]=='.') l--;
189 if (!l || name[l-1]=='.') return EAI_NONAME;
191 /* This can never happen; the caller already checked length. */
192 if (l >= 256) return EAI_NONAME;
194 /* Name with search domain appended is setup in canon[]. This both
195 * provides the desired default canonical name (if the requested
196 * name is not a CNAME record) and serves as a buffer for passing
197 * the full requested name to name_from_dns. */
198 memcpy(canon, name, l);
201 for (p=search; *p; p=z) {
202 for (; isspace(*p); p++);
203 for (z=p; *z && !isspace(*z); z++);
205 if (z-p < 256 - l - 1) {
206 memcpy(canon+l+1, p, z-p);
208 int cnt = name_from_dns(buf, canon, canon, family, &conf);
214 return name_from_dns(buf, canon, name, family, &conf);
217 static const struct policy {
218 unsigned char addr[16];
219 unsigned char len, mask;
220 unsigned char prec, label;
222 { "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\1", 15, 0xff, 50, 0 },
223 { "\0\0\0\0\0\0\0\0\0\0\xff\xff", 11, 0xff, 35, 4 },
224 { "\x20\2", 1, 0xff, 30, 2 },
225 { "\x20\1", 3, 0xff, 5, 5 },
226 { "\xfc", 0, 0xfe, 3, 13 },
228 /* These are deprecated and/or returned to the address
229 * pool, so despite the RFC, treating them as special
230 * is probably wrong. */
231 { "", 11, 0xff, 1, 3 },
232 { "\xfe\xc0", 1, 0xc0, 1, 11 },
233 { "\x3f\xfe", 1, 0xff, 1, 12 },
235 /* Last rule must match all addresses to stop loop. */
239 static const struct policy *policyof(const struct in6_addr *a)
243 if (memcmp(a->s6_addr, defpolicy[i].addr, defpolicy[i].len))
245 if ((a->s6_addr[defpolicy[i].len] & defpolicy[i].mask)
246 != defpolicy[i].addr[defpolicy[i].len])
252 static int labelof(const struct in6_addr *a)
254 return policyof(a)->label;
257 static int scopeof(const struct in6_addr *a)
259 if (IN6_IS_ADDR_MULTICAST(a)) return a->s6_addr[1] & 15;
260 if (IN6_IS_ADDR_LINKLOCAL(a)) return 2;
261 if (IN6_IS_ADDR_LOOPBACK(a)) return 2;
262 if (IN6_IS_ADDR_SITELOCAL(a)) return 5;
266 static int prefixmatch(const struct in6_addr *s, const struct in6_addr *d)
268 /* FIXME: The common prefix length should be limited to no greater
269 * than the nominal length of the prefix portion of the source
270 * address. However the definition of the source prefix length is
271 * not clear and thus this limiting is not yet implemented. */
273 for (i=0; i<128 && !((s->s6_addr[i/8]^d->s6_addr[i/8])&(128>>(i%8))); i++);
277 #define DAS_USABLE 0x40000000
278 #define DAS_MATCHINGSCOPE 0x20000000
279 #define DAS_MATCHINGLABEL 0x10000000
280 #define DAS_PREC_SHIFT 20
281 #define DAS_SCOPE_SHIFT 16
282 #define DAS_PREFIX_SHIFT 8
283 #define DAS_ORDER_SHIFT 0
285 static int addrcmp(const void *_a, const void *_b)
287 const struct address *a = _a, *b = _b;
288 return b->sortkey - a->sortkey;
291 int __lookup_name(struct address buf[static MAXADDRS], char canon[static 256], const char *name, int family, int flags)
297 /* reject empty name and check len so it fits into temp bufs */
298 size_t l = strnlen(name, 255);
301 memcpy(canon, name, l+1);
304 /* Procedurally, a request for v6 addresses with the v4-mapped
305 * flag set is like a request for unspecified family, followed
306 * by filtering of the results. */
307 if (flags & AI_V4MAPPED) {
308 if (family == AF_INET6) family = AF_UNSPEC;
309 else flags -= AI_V4MAPPED;
312 /* Try each backend until there's at least one result. */
313 cnt = name_from_null(buf, name, family, flags);
314 if (!cnt) cnt = name_from_numeric(buf, name, family);
315 if (!cnt && !(flags & AI_NUMERICHOST)) {
316 cnt = name_from_hosts(buf, canon, name, family);
317 if (!cnt) cnt = name_from_dns_search(buf, canon, name, family);
319 if (cnt<=0) return cnt ? cnt : EAI_NONAME;
321 /* Filter/transform results for v4-mapped lookup, if requested. */
322 if (flags & AI_V4MAPPED) {
323 if (!(flags & AI_ALL)) {
324 /* If any v6 results exist, remove v4 results. */
325 for (i=0; i<cnt && buf[i].family != AF_INET6; i++);
327 for (j=0; i<cnt; i++) {
328 if (buf[i].family == AF_INET6)
334 /* Translate any remaining v4 results to v6 */
335 for (i=0; i<cnt; i++) {
336 if (buf[i].family != AF_INET) continue;
337 memcpy(buf[i].addr+12, buf[i].addr, 4);
338 memcpy(buf[i].addr, "\0\0\0\0\0\0\0\0\0\0\xff\xff", 12);
339 buf[i].family = AF_INET6;
343 /* No further processing is needed if there are fewer than 2
344 * results or if there are only IPv4 results. */
345 if (cnt<2 || family==AF_INET) return cnt;
346 for (i=0; i<cnt; i++) if (buf[i].family != AF_INET) break;
347 if (i==cnt) return cnt;
350 pthread_setcancelstate(PTHREAD_CANCEL_DISABLE, &cs);
352 /* The following implements a subset of RFC 3484/6724 destination
353 * address selection by generating a single 31-bit sort key for
354 * each address. Rules 3, 4, and 7 are omitted for having
355 * excessive runtime and code size cost and dubious benefit.
356 * So far the label/precedence table cannot be customized. */
357 for (i=0; i<cnt; i++) {
358 int family = buf[i].family;
360 struct sockaddr_in6 sa6 = { 0 }, da6 = {
361 .sin6_family = AF_INET6,
362 .sin6_scope_id = buf[i].scopeid,
365 struct sockaddr_in sa4 = { 0 }, da4 = {
366 .sin_family = AF_INET,
370 socklen_t salen, dalen;
371 if (family == AF_INET6) {
372 memcpy(da6.sin6_addr.s6_addr, buf[i].addr, 16);
373 da = &da6; dalen = sizeof da6;
374 sa = &sa6; salen = sizeof sa6;
376 memcpy(sa6.sin6_addr.s6_addr,
377 "\0\0\0\0\0\0\0\0\0\0\xff\xff", 12);
378 memcpy(da6.sin6_addr.s6_addr+12, buf[i].addr, 4);
379 memcpy(da6.sin6_addr.s6_addr,
380 "\0\0\0\0\0\0\0\0\0\0\xff\xff", 12);
381 memcpy(da6.sin6_addr.s6_addr+12, buf[i].addr, 4);
382 memcpy(&da4.sin_addr, buf[i].addr, 4);
383 da = &da4; dalen = sizeof da4;
384 sa = &sa4; salen = sizeof sa4;
386 const struct policy *dpolicy = policyof(&da6.sin6_addr);
387 int dscope = scopeof(&da6.sin6_addr);
388 int dlabel = dpolicy->label;
389 int dprec = dpolicy->prec;
391 int fd = socket(family, SOCK_DGRAM|SOCK_CLOEXEC, IPPROTO_UDP);
393 if (!connect(fd, da, dalen)) {
395 if (!getsockname(fd, sa, &salen)) {
396 if (family == AF_INET) memcpy(
397 sa6.sin6_addr.s6_addr+12,
399 if (dscope == scopeof(&sa6.sin6_addr))
400 key |= DAS_MATCHINGSCOPE;
401 if (dlabel == labelof(&sa6.sin6_addr))
402 key |= DAS_MATCHINGLABEL;
403 prefixlen = prefixmatch(&sa6.sin6_addr,
409 key |= dprec << DAS_PREC_SHIFT;
410 key |= (15-dscope) << DAS_SCOPE_SHIFT;
411 key |= prefixlen << DAS_PREFIX_SHIFT;
412 key |= (MAXADDRS-i) << DAS_ORDER_SHIFT;
413 buf[i].sortkey = key;
415 qsort(buf, cnt, sizeof *buf, addrcmp);
417 pthread_setcancelstate(cs, 0);