X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ianmdlvl/git?p=secnet.git;a=blobdiff_plain;f=resolver.c;h=06aa7c3db6da43616a2a47a5ef6c4bc2e535798b;hp=d104c363f775de7dcb3e40e1829de2e54c42ce46;hb=ce53e0ea9aad729511e8b315dcbed7122272c2a1;hpb=08b62a6c691fe0e772c74de9d60803afcb7d2aa9 diff --git a/resolver.c b/resolver.c index d104c36..06aa7c3 100644 --- a/resolver.c +++ b/resolver.c @@ -1,3 +1,21 @@ +/* + * This file is part of secnet. + * See README for full list of copyright holders. + * + * secnet is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version d of the License, or + * (at your option) any later version. + * + * secnet is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * version 3 along with secnet; if not, see + * https://www.gnu.org/licenses/gpl.html. + */ /* Name resolution using adns */ #include @@ -20,6 +38,7 @@ struct adns { struct query { void *cst; + const char *name; int port; struct comm_if *comm; resolve_answer_fn *answer; @@ -34,8 +53,13 @@ static bool_t resolve_request(void *sst, cstring_t name, struct adns *st=sst; struct query *q; int rv; - const int maxlitlen=50; - + const int maxlitlen= +#ifdef CONFIG_IPV6 + ADNS_ADDR2TEXT_BUFLEN*2 +#else + 50 +#endif + ; ssize_t l=strlen(name); if (name[0]=='[' && l2 && name[l-1]==']') { char trimmed[maxlitlen+1]; @@ -44,19 +68,36 @@ static bool_t resolve_request(void *sst, cstring_t name, struct comm_addr ca; ca.comm=comm; ca.ix=-1; +#ifdef CONFIG_IPV6 + socklen_t salen=sizeof(ca.ia); + rv=adns_text2addr(trimmed, port, adns_qf_addrlit_ipv4_quadonly, + &ca.ia.sa, &salen); + assert(rv!=ENOSPC); + if (rv) { + char msg[250]; + snprintf(msg,sizeof(msg),"invalid address literal: %s", + strerror(rv)); + msg[sizeof(msg)-1]=0; + cb(cst,0,0,0,name,msg); + } else { + cb(cst,&ca,1,1,name,0); + } +#else ca.ia.sin.sin_family=AF_INET; ca.ia.sin.sin_port=htons(port); if (inet_aton(trimmed,&ca.ia.sin.sin_addr)) - cb(cst,&ca,1,1); + cb(cst,&ca,1,1,name,0); else - cb(cst,0,0,0); + cb(cst,0,0,0,name,"invalid IP address"); +#endif return True; } - q=safe_malloc(sizeof *q,"resolve_request"); + NEW(q); q->cst=cst; q->comm=comm; q->port=port; + q->name=name; q->answer=cb; rv=adns_submit(st->ast, name, adns_r_addr, 0, q, &q->query); @@ -95,7 +136,7 @@ static void resolver_afterpoll(void *sst, struct pollfd *fds, int nfds) if (rv==0) { q=qp; if (ans->status!=adns_s_ok) { - q->answer(q->cst,NULL,0,0); /* Failure */ + q->answer(q->cst,NULL,0,0,q->name,adns_strerror(ans->status)); free(q); free(ans); } else { @@ -111,18 +152,26 @@ static void resolver_afterpoll(void *sst, struct pollfd *fds, int nfds) struct comm_addr *ca=&ca_buf[wslot]; ca->comm=q->comm; ca->ix=-1; + assert(ra->len <= (int)sizeof(ca->ia)); + memcpy(&ca->ia,&ra->addr,ra->len); switch (ra->addr.sa.sa_family) { case AF_INET: assert(ra->len == sizeof(ca->ia.sin)); + ca->ia.sin.sin_port=htons(q->port); break; +#ifdef CONFIG_IPV6 + case AF_INET6: + assert(ra->len == sizeof(ca->ia.sin6)); + ca->ia.sin6.sin6_port=htons(q->port); + break; +#endif /*CONFIG_IPV6*/ default: /* silently skip unexpected AFs from adns */ continue; } - memcpy(&ca->ia,&ra->addr,ra->len); wslot++; } - q->answer(q->cst,ca_buf,wslot,total); + q->answer(q->cst,ca_buf,wslot,total,q->name,0); free(q); free(ans); } @@ -145,7 +194,7 @@ static list_t *adnsresolver_apply(closure_t *self, struct cloc loc, item_t *i; string_t conf; - st=safe_malloc(sizeof(*st),"adnsresolver_apply"); + NEW(st); st->cl.description="adns"; st->cl.type=CL_RESOLVER; st->cl.apply=NULL; @@ -172,7 +221,7 @@ static list_t *adnsresolver_apply(closure_t *self, struct cloc loc, } register_for_poll(st, resolver_beforepoll, resolver_afterpoll, - ADNS_POLLFDS_RECOMMENDED+5,"resolver"); + "resolver"); return new_closure(&st->cl); }