|
|
@ -40,19 +40,26 @@ |
|
|
|
#include "ares_private.h" |
|
|
|
#include "ares_private.h" |
|
|
|
|
|
|
|
|
|
|
|
int ares_parse_aaaa_reply(const unsigned char *abuf, int alen, |
|
|
|
int ares_parse_aaaa_reply(const unsigned char *abuf, int alen, |
|
|
|
struct hostent **host) |
|
|
|
struct hostent **host, struct addr6ttl *addrttls, |
|
|
|
|
|
|
|
int *naddrttls) |
|
|
|
{ |
|
|
|
{ |
|
|
|
unsigned int qdcount, ancount; |
|
|
|
unsigned int qdcount, ancount; |
|
|
|
int status, i, rr_type, rr_class, rr_len, naddrs; |
|
|
|
int status, i, rr_type, rr_class, rr_len, rr_ttl, naddrs; |
|
|
|
|
|
|
|
int cname_ttl = INT_MAX; /* the TTL imposed by the CNAME chain */ |
|
|
|
int naliases; |
|
|
|
int naliases; |
|
|
|
long len; |
|
|
|
long len; |
|
|
|
const unsigned char *aptr; |
|
|
|
const unsigned char *aptr; |
|
|
|
char *hostname, *rr_name, *rr_data, **aliases; |
|
|
|
char *hostname, *rr_name, *rr_data, **aliases; |
|
|
|
struct in6_addr *addrs; |
|
|
|
struct in6_addr *addrs; |
|
|
|
struct hostent *hostent; |
|
|
|
struct hostent *hostent; |
|
|
|
|
|
|
|
const int max_addr_ttls = (addrttls && naddrttls) ? *naddrttls : 0; |
|
|
|
|
|
|
|
|
|
|
|
/* Set *host to NULL for all failure cases. */ |
|
|
|
/* Set *host to NULL for all failure cases. */ |
|
|
|
*host = NULL; |
|
|
|
if (host) |
|
|
|
|
|
|
|
*host = NULL; |
|
|
|
|
|
|
|
/* Same with *naddrttls. */ |
|
|
|
|
|
|
|
if (naddrttls) |
|
|
|
|
|
|
|
*naddrttls = 0; |
|
|
|
|
|
|
|
|
|
|
|
/* Give up if abuf doesn't have room for a header. */ |
|
|
|
/* Give up if abuf doesn't have room for a header. */ |
|
|
|
if (alen < HFIXEDSZ) |
|
|
|
if (alen < HFIXEDSZ) |
|
|
@ -77,18 +84,26 @@ int ares_parse_aaaa_reply(const unsigned char *abuf, int alen, |
|
|
|
aptr += len + QFIXEDSZ; |
|
|
|
aptr += len + QFIXEDSZ; |
|
|
|
|
|
|
|
|
|
|
|
/* Allocate addresses and aliases; ancount gives an upper bound for both. */ |
|
|
|
/* Allocate addresses and aliases; ancount gives an upper bound for both. */ |
|
|
|
addrs = malloc(ancount * sizeof(struct in6_addr)); |
|
|
|
if (host) |
|
|
|
if (!addrs) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
free(hostname); |
|
|
|
addrs = malloc(ancount * sizeof(struct in6_addr)); |
|
|
|
return ARES_ENOMEM; |
|
|
|
if (!addrs) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
free(hostname); |
|
|
|
|
|
|
|
return ARES_ENOMEM; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
aliases = malloc((ancount + 1) * sizeof(char *)); |
|
|
|
|
|
|
|
if (!aliases) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
free(hostname); |
|
|
|
|
|
|
|
free(addrs); |
|
|
|
|
|
|
|
return ARES_ENOMEM; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
aliases = malloc((ancount + 1) * sizeof(char *)); |
|
|
|
else |
|
|
|
if (!aliases) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
free(hostname); |
|
|
|
addrs = NULL; |
|
|
|
free(addrs); |
|
|
|
aliases = NULL; |
|
|
|
return ARES_ENOMEM; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
naddrs = 0; |
|
|
|
naddrs = 0; |
|
|
|
naliases = 0; |
|
|
|
naliases = 0; |
|
|
@ -109,13 +124,33 @@ int ares_parse_aaaa_reply(const unsigned char *abuf, int alen, |
|
|
|
rr_type = DNS_RR_TYPE(aptr); |
|
|
|
rr_type = DNS_RR_TYPE(aptr); |
|
|
|
rr_class = DNS_RR_CLASS(aptr); |
|
|
|
rr_class = DNS_RR_CLASS(aptr); |
|
|
|
rr_len = DNS_RR_LEN(aptr); |
|
|
|
rr_len = DNS_RR_LEN(aptr); |
|
|
|
|
|
|
|
rr_ttl = DNS_RR_TTL(aptr); |
|
|
|
aptr += RRFIXEDSZ; |
|
|
|
aptr += RRFIXEDSZ; |
|
|
|
|
|
|
|
|
|
|
|
if (rr_class == C_IN && rr_type == T_AAAA |
|
|
|
if (rr_class == C_IN && rr_type == T_AAAA |
|
|
|
&& rr_len == sizeof(struct in6_addr) |
|
|
|
&& rr_len == sizeof(struct in6_addr) |
|
|
|
&& strcasecmp(rr_name, hostname) == 0) |
|
|
|
&& strcasecmp(rr_name, hostname) == 0) |
|
|
|
{ |
|
|
|
{ |
|
|
|
memcpy(&addrs[naddrs], aptr, sizeof(struct in6_addr)); |
|
|
|
if (addrs) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
if (aptr + sizeof(struct in6_addr) > abuf + alen) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
status = ARES_EBADRESP; |
|
|
|
|
|
|
|
break; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
memcpy(&addrs[naddrs], aptr, sizeof(struct in6_addr)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (naddrs < max_addr_ttls) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
struct addr6ttl * const at = &addrttls[naddrs]; |
|
|
|
|
|
|
|
if (aptr + sizeof(struct in6_addr) > abuf + alen) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
status = ARES_EBADRESP; |
|
|
|
|
|
|
|
break; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
memcpy(&at->ip6addr, aptr, sizeof(struct in6_addr)); |
|
|
|
|
|
|
|
at->ttl = rr_ttl; |
|
|
|
|
|
|
|
} |
|
|
|
naddrs++; |
|
|
|
naddrs++; |
|
|
|
status = ARES_SUCCESS; |
|
|
|
status = ARES_SUCCESS; |
|
|
|
} |
|
|
|
} |
|
|
@ -123,7 +158,10 @@ int ares_parse_aaaa_reply(const unsigned char *abuf, int alen, |
|
|
|
if (rr_class == C_IN && rr_type == T_CNAME) |
|
|
|
if (rr_class == C_IN && rr_type == T_CNAME) |
|
|
|
{ |
|
|
|
{ |
|
|
|
/* Record the RR name as an alias. */ |
|
|
|
/* Record the RR name as an alias. */ |
|
|
|
aliases[naliases] = rr_name; |
|
|
|
if (aliases) |
|
|
|
|
|
|
|
aliases[naliases] = rr_name; |
|
|
|
|
|
|
|
else |
|
|
|
|
|
|
|
free(rr_name); |
|
|
|
naliases++; |
|
|
|
naliases++; |
|
|
|
|
|
|
|
|
|
|
|
/* Decode the RR data and replace the hostname with it. */ |
|
|
|
/* Decode the RR data and replace the hostname with it. */ |
|
|
@ -132,6 +170,10 @@ int ares_parse_aaaa_reply(const unsigned char *abuf, int alen, |
|
|
|
break; |
|
|
|
break; |
|
|
|
free(hostname); |
|
|
|
free(hostname); |
|
|
|
hostname = rr_data; |
|
|
|
hostname = rr_data; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Take the min of the TTLs we see in the CNAME chain. */ |
|
|
|
|
|
|
|
if (cname_ttl > rr_ttl) |
|
|
|
|
|
|
|
cname_ttl = rr_ttl; |
|
|
|
} |
|
|
|
} |
|
|
|
else |
|
|
|
else |
|
|
|
free(rr_name); |
|
|
|
free(rr_name); |
|
|
@ -148,28 +190,50 @@ int ares_parse_aaaa_reply(const unsigned char *abuf, int alen, |
|
|
|
status = ARES_ENODATA; |
|
|
|
status = ARES_ENODATA; |
|
|
|
if (status == ARES_SUCCESS) |
|
|
|
if (status == ARES_SUCCESS) |
|
|
|
{ |
|
|
|
{ |
|
|
|
/* We got our answer. Allocate memory to build the host entry. */ |
|
|
|
/* We got our answer. */ |
|
|
|
aliases[naliases] = NULL; |
|
|
|
if (naddrttls) |
|
|
|
hostent = malloc(sizeof(struct hostent)); |
|
|
|
|
|
|
|
if (hostent) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
hostent->h_addr_list = malloc((naddrs + 1) * sizeof(char *)); |
|
|
|
const int n = naddrs < max_addr_ttls ? naddrs : max_addr_ttls; |
|
|
|
if (hostent->h_addr_list) |
|
|
|
for (i = 0; i < n; i++) |
|
|
|
{ |
|
|
|
{ |
|
|
|
/* Fill in the hostent and return successfully. */ |
|
|
|
/* Ensure that each A TTL is no larger than the CNAME TTL. */ |
|
|
|
hostent->h_name = hostname; |
|
|
|
if (addrttls[i].ttl > cname_ttl) |
|
|
|
hostent->h_aliases = aliases; |
|
|
|
addrttls[i].ttl = cname_ttl; |
|
|
|
hostent->h_addrtype = AF_INET6; |
|
|
|
|
|
|
|
hostent->h_length = sizeof(struct in6_addr); |
|
|
|
|
|
|
|
for (i = 0; i < naddrs; i++) |
|
|
|
|
|
|
|
hostent->h_addr_list[i] = (char *) &addrs[i]; |
|
|
|
|
|
|
|
hostent->h_addr_list[naddrs] = NULL; |
|
|
|
|
|
|
|
*host = hostent; |
|
|
|
|
|
|
|
return ARES_SUCCESS; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
free(hostent); |
|
|
|
*naddrttls = n; |
|
|
|
} |
|
|
|
} |
|
|
|
status = ARES_ENOMEM; |
|
|
|
if (aliases) |
|
|
|
|
|
|
|
aliases[naliases] = NULL; |
|
|
|
|
|
|
|
if (host) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
/* Allocate memory to build the host entry. */ |
|
|
|
|
|
|
|
hostent = malloc(sizeof(struct hostent)); |
|
|
|
|
|
|
|
if (hostent) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
hostent->h_addr_list = malloc((naddrs + 1) * sizeof(char *)); |
|
|
|
|
|
|
|
if (hostent->h_addr_list) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
/* Fill in the hostent and return successfully. */ |
|
|
|
|
|
|
|
hostent->h_name = hostname; |
|
|
|
|
|
|
|
hostent->h_aliases = aliases; |
|
|
|
|
|
|
|
hostent->h_addrtype = AF_INET6; |
|
|
|
|
|
|
|
hostent->h_length = sizeof(struct in6_addr); |
|
|
|
|
|
|
|
for (i = 0; i < naddrs; i++) |
|
|
|
|
|
|
|
hostent->h_addr_list[i] = (char *) &addrs[i]; |
|
|
|
|
|
|
|
hostent->h_addr_list[naddrs] = NULL; |
|
|
|
|
|
|
|
*host = hostent; |
|
|
|
|
|
|
|
return ARES_SUCCESS; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
free(hostent); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
status = ARES_ENOMEM; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if (aliases) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
for (i = 0; i < naliases; i++) |
|
|
|
|
|
|
|
free(aliases[i]); |
|
|
|
|
|
|
|
free(aliases); |
|
|
|
} |
|
|
|
} |
|
|
|
for (i = 0; i < naliases; i++) |
|
|
|
for (i = 0; i < naliases; i++) |
|
|
|
free(aliases[i]); |
|
|
|
free(aliases[i]); |
|
|
|