3 * - overall query management (allocation, completion)
4 * - per-query memory management
5 * - query submission and cancellation (user-visible and internal)
8 * This file is part of adns, which is
9 * Copyright (C) 1997-2000,2003,2006 Ian Jackson
10 * Copyright (C) 1999-2000,2003,2006 Tony Finch
11 * Copyright (C) 1991 Massachusetts Institute of Technology
12 * (See the file INSTALL for full details.)
14 * This program is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License as published by
16 * the Free Software Foundation; either version 2, or (at your option)
19 * This program is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU General Public License for more details.
24 * You should have received a copy of the GNU General Public License
25 * along with this program; if not, write to the Free Software Foundation,
26 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
39 static adns_query query_alloc(adns_state ads,
40 const typeinfo *typei, adns_rrtype type,
41 adns_queryflags flags, struct timeval now) {
42 /* Allocate a virgin query and return it. */
45 qu= malloc(sizeof(*qu)); if (!qu) return 0;
46 qu->answer= malloc(sizeof(*qu->answer));
47 if (!qu->answer) { free(qu); return 0; }
50 qu->state= query_tosend;
51 qu->back= qu->next= qu->parent= 0;
52 LIST_INIT(qu->children);
53 LINK_INIT(qu->siblings);
54 LIST_INIT(qu->allocations);
55 qu->interim_allocd= 0;
56 qu->preserved_allocd= 0;
57 qu->final_allocspace= 0;
62 adns__vbuf_init(&qu->vb);
65 qu->cname_dglen= qu->cname_begin= 0;
67 adns__vbuf_init(&qu->search_vb);
68 qu->search_origlen= qu->search_pos= qu->search_doneabs= 0;
70 qu->id= -2; /* will be overwritten with real id before we leave adns */
75 timerclear(&qu->timeout);
76 qu->expires= now.tv_sec + MAXTTLBELIEVE;
78 memset(&qu->ctx,0,sizeof(qu->ctx));
80 qu->answer->status= adns_s_ok;
81 qu->answer->cname= qu->answer->owner= 0;
82 qu->answer->type= type;
83 qu->answer->expires= -1;
85 qu->answer->rrs.untyped= 0;
86 qu->answer->rrsz= typei->getrrsz ? typei->getrrsz(type) : typei->rrsz;
91 static void query_submit(adns_state ads, adns_query qu,
92 const typeinfo *typei, vbuf *qumsg_vb, int id,
93 adns_queryflags flags, struct timeval now) {
94 /* Fills in the query message in for a previously-allocated query,
95 * and submits it. Cannot fail. Takes over the memory for qumsg_vb.
99 adns__vbuf_init(qumsg_vb);
101 qu->query_dgram= malloc(qu->vb.used);
102 if (!qu->query_dgram) { adns__query_fail(qu,adns_s_nomemory); return; }
105 qu->query_dglen= qu->vb.used;
106 memcpy(qu->query_dgram,qu->vb.buf,qu->vb.used);
108 if (typei->query_send) typei->query_send(qu,now);
109 else adns__query_send(qu, now);
112 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
113 const typeinfo *typei, adns_rrtype type,
114 vbuf *qumsg_vb, int id,
115 adns_queryflags flags, struct timeval now,
116 const qcontext *ctx) {
119 qu= query_alloc(ads,typei,type,flags,now);
120 if (!qu) { adns__vbuf_free(qumsg_vb); return adns_s_nomemory; }
123 memcpy(&qu->ctx,ctx,sizeof(qu->ctx));
124 query_submit(ads,qu, typei,qumsg_vb,id,flags,now);
129 static void query_simple(adns_state ads, adns_query qu,
130 const char *owner, int ol,
131 const typeinfo *typei, adns_queryflags flags,
132 struct timeval now) {
137 stat= adns__mkquery(ads,&qu->vb,&id, owner,ol,
138 typei,qu->answer->type, flags);
140 if (stat == adns_s_querydomaintoolong && (flags & adns_qf_search)) {
141 adns__search_next(ads,qu,now);
144 adns__query_fail(qu,stat);
150 adns__vbuf_init(&qu->vb);
151 query_submit(ads,qu, typei,&vb_new,id, flags,now);
154 void adns__search_next(adns_state ads, adns_query qu, struct timeval now) {
155 const char *nextentry;
158 if (qu->search_doneabs<0) {
160 qu->search_doneabs= 1;
162 if (qu->search_pos >= ads->nsearchlist) {
163 if (qu->search_doneabs) {
164 qu->search_vb.used= qu->search_origlen;
165 stat= adns_s_nxdomain; goto x_fail;
168 qu->search_doneabs= 1;
171 nextentry= ads->searchlist[qu->search_pos++];
175 qu->search_vb.used= qu->search_origlen;
177 if (!adns__vbuf_append(&qu->search_vb,".",1) ||
178 !adns__vbuf_appendstr(&qu->search_vb,nextentry))
182 free(qu->query_dgram);
183 qu->query_dgram= 0; qu->query_dglen= 0;
185 query_simple(ads,qu, qu->search_vb.buf, qu->search_vb.used,
186 qu->typei, qu->flags, now);
190 stat= adns_s_nomemory;
192 adns__query_fail(qu,stat);
195 static int save_owner(adns_query qu, const char *owner, int ol) {
196 /* Returns 1 if OK, otherwise there was no memory. */
199 if (!(qu->flags & adns_qf_owner)) return 1;
204 ans->owner= adns__alloc_preserved(qu,ol+1); if (!ans->owner) return 0;
206 memcpy(ans->owner,owner,ol);
211 int adns_submit(adns_state ads,
214 adns_queryflags flags,
216 adns_query *query_r) {
219 const typeinfo *typei;
224 adns__consistency(ads,0,cc_entex);
226 typei= adns__findtype(type);
227 if (!typei) return ENOSYS;
229 r= gettimeofday(&now,0); if (r) goto x_errno;
230 qu= query_alloc(ads,typei,type,flags,now); if (!qu) goto x_errno;
232 qu->ctx.ext= context;
234 memset(&qu->ctx.pinfo,0,sizeof(qu->ctx.pinfo));
235 memset(&qu->ctx.tinfo,0,sizeof(qu->ctx.tinfo));
240 if (!ol) { stat= adns_s_querydomaininvalid; goto x_adnsfail; }
241 if (ol>DNS_MAXDOMAIN+1) { stat= adns_s_querydomaintoolong; goto x_adnsfail; }
243 if (ol>=1 && owner[ol-1]=='.' && (ol<2 || owner[ol-2]!='\\')) {
244 flags &= ~adns_qf_search;
249 if (flags & adns_qf_search) {
250 r= adns__vbuf_append(&qu->search_vb,owner,ol);
251 if (!r) { stat= adns_s_nomemory; goto x_adnsfail; }
253 for (ndots=0, p=owner; (p= strchr(p,'.')); p++, ndots++);
254 qu->search_doneabs= (ndots >= ads->searchndots) ? -1 : 0;
255 qu->search_origlen= ol;
256 adns__search_next(ads,qu,now);
258 if (flags & adns_qf_owner) {
259 if (!save_owner(qu,owner,ol)) { stat= adns_s_nomemory; goto x_adnsfail; }
261 query_simple(ads,qu, owner,ol, typei,flags, now);
263 adns__autosys(ads,now);
264 adns__consistency(ads,qu,cc_entex);
268 adns__query_fail(qu,stat);
269 adns__consistency(ads,qu,cc_entex);
275 adns__consistency(ads,0,cc_entex);
279 static const char *default_zone = "<magic>";
281 int adns_submit_reverse_any(adns_state ads,
282 const struct sockaddr *addr,
285 adns_queryflags flags,
287 adns_query *query_r) {
288 char *buf, *buf_free, *p;
293 flags &= ~adns_qf_search;
295 switch (addr->sa_family) {
297 ai = &adns__inet_afinfo;
298 if (zone == default_zone) zone = "in-addr.arpa";
301 ai = &adns__inet6_afinfo;
302 if (zone == default_zone) zone = "ip6.arpa";
308 lreq= strlen(zone) + ai->nrevcomp*(ai->revcompwd + 1) + 1;
309 if (lreq > sizeof(shortbuf)) {
311 if (!buf) return errno;
318 p = ai->rev_mkname(addr, buf);
322 r= adns_submit(ads,buf,type,flags,context,query_r);
327 int adns_submit_reverse(adns_state ads,
328 const struct sockaddr *addr,
330 adns_queryflags flags,
332 adns_query *query_r) {
333 if (type != adns_r_ptr && type != adns_r_ptr_raw) return EINVAL;
334 return adns_submit_reverse_any(ads,addr,default_zone,
335 type,flags,context,query_r);
338 int adns_synchronous(adns_state ads,
341 adns_queryflags flags,
342 adns_answer **answer_r) {
346 r= adns_submit(ads,owner,type,flags,0,&qu);
349 r= adns_wait(ads,&qu,answer_r,0);
350 if (r) adns_cancel(qu);
355 static void *alloc_common(adns_query qu, size_t sz) {
358 if (!sz) return qu; /* Any old pointer will do */
359 assert(!qu->final_allocspace);
360 an= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an)) + sz));
362 LIST_LINK_TAIL(qu->allocations,an);
364 return (byte*)an + MEM_ROUND(sizeof(*an));
367 void *adns__alloc_interim(adns_query qu, size_t sz) {
371 rv= alloc_common(qu,sz);
373 qu->interim_allocd += sz;
377 void *adns__alloc_preserved(adns_query qu, size_t sz) {
381 rv= adns__alloc_interim(qu,sz);
383 qu->preserved_allocd += sz;
387 static allocnode *alloc_info(adns_query qu, void *p, size_t *sz_r)
391 if (!p || p == qu) { *sz_r = 0; return 0; }
392 an = (allocnode *)((byte *)p - MEM_ROUND(sizeof(allocnode)));
393 *sz_r = MEM_ROUND(an->sz);
397 void adns__free_interim(adns_query qu, void *p) {
399 allocnode *an = alloc_info(qu, p, &sz);
402 assert(!qu->final_allocspace);
403 LIST_UNLINK(qu->allocations, an);
405 qu->interim_allocd -= sz;
408 void *adns__alloc_mine(adns_query qu, size_t sz) {
409 return alloc_common(qu,MEM_ROUND(sz));
412 void adns__transfer_interim(adns_query from, adns_query to, void *block) {
414 allocnode *an = alloc_info(from, block, &sz);
418 assert(!to->final_allocspace);
419 assert(!from->final_allocspace);
421 LIST_UNLINK(from->allocations,an);
422 LIST_LINK_TAIL(to->allocations,an);
424 from->interim_allocd -= sz;
425 to->interim_allocd += sz;
427 if (to->expires > from->expires) to->expires= from->expires;
430 void *adns__alloc_final(adns_query qu, size_t sz) {
431 /* When we're in the _final stage, we _subtract_ from interim_alloc'd
432 * each allocation, and use final_allocspace to point to the next free
438 rp= qu->final_allocspace;
440 qu->interim_allocd -= sz;
441 assert(qu->interim_allocd>=0);
442 qu->final_allocspace= (byte*)rp + sz;
446 void adns__cancel_children(adns_query qu) {
447 adns_query cqu, ncqu;
449 for (cqu= qu->children.head; cqu; cqu= ncqu) {
450 ncqu= cqu->siblings.next;
455 void adns__reset_preserved(adns_query qu) {
456 assert(!qu->final_allocspace);
457 adns__cancel_children(qu);
459 qu->answer->rrs.untyped= 0;
460 qu->interim_allocd= qu->preserved_allocd;
463 static void free_query_allocs(adns_query qu) {
466 adns__cancel_children(qu);
467 for (an= qu->allocations.head; an; an= ann) { ann= an->next; free(an); }
468 LIST_INIT(qu->allocations);
469 adns__vbuf_free(&qu->vb);
470 adns__vbuf_free(&qu->search_vb);
471 free(qu->query_dgram);
475 void adns_cancel(adns_query qu) {
479 adns__consistency(ads,qu,cc_entex);
480 if (qu->parent) LIST_UNLINK_PART(qu->parent->children,qu,siblings.);
483 LIST_UNLINK(ads->udpw,qu);
486 LIST_UNLINK(ads->tcpw,qu);
489 LIST_UNLINK(ads->childw,qu);
492 LIST_UNLINK(ads->output,qu);
497 free_query_allocs(qu);
500 adns__consistency(ads,0,cc_entex);
503 void adns__update_expires(adns_query qu, unsigned long ttl,
504 struct timeval now) {
507 assert(ttl <= MAXTTLBELIEVE);
508 max= now.tv_sec + ttl;
509 if (qu->expires < max) return;
513 static void makefinal_query(adns_query qu) {
519 if (qu->interim_allocd) {
520 ans= realloc(qu->answer,
521 MEM_ROUND(MEM_ROUND(sizeof(*ans)) + qu->interim_allocd));
522 if (!ans) goto x_nomem;
526 qu->final_allocspace= (byte*)ans + MEM_ROUND(sizeof(*ans));
527 adns__makefinal_str(qu,&ans->cname);
528 adns__makefinal_str(qu,&ans->owner);
531 adns__makefinal_block(qu, &ans->rrs.untyped, ans->nrrs*ans->rrsz);
533 for (rrn=0; rrn<ans->nrrs; rrn++)
534 qu->typei->makefinal(qu, ans->rrs.bytes + rrn*ans->rrsz);
537 free_query_allocs(qu);
541 qu->preserved_allocd= 0;
542 qu->answer->cname= 0;
543 qu->answer->owner= 0;
544 adns__reset_preserved(qu); /* (but we just threw away the preserved stuff) */
546 qu->answer->status= adns_s_nomemory;
547 free_query_allocs(qu);
550 void adns__query_done(adns_query qu) {
554 adns__cancel_children(qu);
559 if (qu->flags & adns_qf_search && ans->status != adns_s_nomemory) {
560 if (!save_owner(qu, qu->search_vb.buf, qu->search_vb.used)) {
561 adns__query_fail(qu,adns_s_nomemory);
566 if (ans->nrrs && qu->typei->diff_needswap) {
567 if (!adns__vbuf_ensure(&qu->vb,ans->rrsz)) {
568 adns__query_fail(qu,adns_s_nomemory);
571 adns__isort(ans->rrs.bytes, ans->nrrs, ans->rrsz,
573 (int(*)(void*, const void*, const void*))
574 qu->typei->diff_needswap,
577 if (ans->nrrs && qu->typei->postsort) {
578 qu->typei->postsort(qu->ads, ans->rrs.bytes, ans->nrrs, qu->typei);
581 ans->expires= qu->expires;
584 LIST_UNLINK_PART(parent->children,qu,siblings.);
585 LIST_UNLINK(qu->ads->childw,parent);
586 qu->ctx.callback(parent,qu);
587 free_query_allocs(qu);
592 LIST_LINK_TAIL(qu->ads->output,qu);
593 qu->state= query_done;
597 void adns__query_fail(adns_query qu, adns_status stat) {
598 adns__reset_preserved(qu);
599 qu->answer->status= stat;
600 adns__query_done(qu);
603 void adns__makefinal_str(adns_query qu, char **strp) {
605 char *before, *after;
610 after= adns__alloc_final(qu,l);
611 memcpy(after,before,l);
615 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz) {
616 void *before, *after;
620 after= adns__alloc_final(qu,sz);
621 memcpy(after,before,sz);