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__ckl_hostname(adns_state ads, adns_queryflags flags,
113 union checklabel_state *css,
114 qcontext *ctx, int labnum,
115 const char *label, int lablen)
119 if (flags & adns_qf_quoteok_query) return adns_s_ok;
120 for (i=0; i<lablen; i++) {
123 if (!i) return adns_s_querydomaininvalid;
124 } else if (!ctype_alpha(c) && !ctype_digit(c)) {
125 return adns_s_querydomaininvalid;
131 static adns_status check_domain_name(adns_state ads, adns_queryflags flags,
132 qcontext *ctx, const typeinfo *typei,
133 const byte *dgram, int dglen)
137 int labnum= 0, labstart, lablen;
138 union checklabel_state css;
140 adns__findlabel_start(&fls,ads, -1,0, dgram,dglen,dglen, DNS_HDRSIZE,0);
142 err= adns__findlabel_next(&fls, &lablen,&labstart);
143 assert(!err); assert(lablen >= 0);
144 err= typei->checklabel(ads,flags, &css,ctx,
145 labnum++, dgram+labstart,lablen);
151 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
152 const typeinfo *typei, adns_rrtype type,
153 vbuf *qumsg_vb, int id,
154 adns_queryflags flags, struct timeval now,
159 err= check_domain_name(ads, flags,ctx,typei, qumsg_vb->buf,qumsg_vb->used);
161 qu= query_alloc(ads,typei,type,flags,now);
162 if (!qu) { err = adns_s_nomemory; goto x_err; }
165 memcpy(&qu->ctx,ctx,sizeof(qu->ctx));
166 query_submit(ads,qu, typei,qumsg_vb,id,flags,now);
171 adns__vbuf_free(qumsg_vb);
175 static void query_simple(adns_state ads, adns_query qu,
176 const char *owner, int ol,
177 const typeinfo *typei, adns_queryflags flags,
178 struct timeval now) {
183 stat= adns__mkquery(ads,&qu->vb,&id, owner,ol,
184 typei,qu->answer->type, flags);
186 if (stat == adns_s_querydomaintoolong && (flags & adns_qf_search)) {
187 adns__search_next(ads,qu,now);
190 adns__query_fail(qu,stat);
195 stat= check_domain_name(ads, flags,&qu->ctx,typei, qu->vb.buf,qu->vb.used);
196 if (stat) { adns__query_fail(qu,stat); return; }
199 adns__vbuf_init(&qu->vb);
200 query_submit(ads,qu, typei,&vb_new,id, flags,now);
203 void adns__search_next(adns_state ads, adns_query qu, struct timeval now) {
204 const char *nextentry;
207 if (qu->search_doneabs<0) {
209 qu->search_doneabs= 1;
211 if (qu->search_pos >= ads->nsearchlist) {
212 if (qu->search_doneabs) {
213 qu->search_vb.used= qu->search_origlen;
214 stat= adns_s_nxdomain; goto x_fail;
217 qu->search_doneabs= 1;
220 nextentry= ads->searchlist[qu->search_pos++];
224 qu->search_vb.used= qu->search_origlen;
226 if (!adns__vbuf_append(&qu->search_vb,".",1) ||
227 !adns__vbuf_appendstr(&qu->search_vb,nextentry))
231 free(qu->query_dgram);
232 qu->query_dgram= 0; qu->query_dglen= 0;
234 query_simple(ads,qu, qu->search_vb.buf, qu->search_vb.used,
235 qu->typei, qu->flags, now);
239 stat= adns_s_nomemory;
241 adns__query_fail(qu,stat);
244 static int save_owner(adns_query qu, const char *owner, int ol) {
245 /* Returns 1 if OK, otherwise there was no memory. */
248 if (!(qu->flags & adns_qf_owner)) return 1;
253 ans->owner= adns__alloc_preserved(qu,ol+1); if (!ans->owner) return 0;
255 memcpy(ans->owner,owner,ol);
260 int adns_submit(adns_state ads,
263 adns_queryflags flags,
265 adns_query *query_r) {
268 const typeinfo *typei;
273 adns__consistency(ads,0,cc_entex);
275 typei= adns__findtype(type);
276 if (!typei) return ENOSYS;
278 r= gettimeofday(&now,0); if (r) goto x_errno;
279 qu= query_alloc(ads,typei,type,flags,now); if (!qu) goto x_errno;
281 qu->ctx.ext= context;
283 memset(&qu->ctx.pinfo,0,sizeof(qu->ctx.pinfo));
284 memset(&qu->ctx.tinfo,0,sizeof(qu->ctx.tinfo));
289 if (!ol) { stat= adns_s_querydomaininvalid; goto x_adnsfail; }
290 if (ol>DNS_MAXDOMAIN+1) { stat= adns_s_querydomaintoolong; goto x_adnsfail; }
292 if (ol>=1 && owner[ol-1]=='.' && (ol<2 || owner[ol-2]!='\\')) {
293 flags &= ~adns_qf_search;
298 if (flags & adns_qf_search) {
299 r= adns__vbuf_append(&qu->search_vb,owner,ol);
300 if (!r) { stat= adns_s_nomemory; goto x_adnsfail; }
302 for (ndots=0, p=owner; (p= strchr(p,'.')); p++, ndots++);
303 qu->search_doneabs= (ndots >= ads->searchndots) ? -1 : 0;
304 qu->search_origlen= ol;
305 adns__search_next(ads,qu,now);
307 if (flags & adns_qf_owner) {
308 if (!save_owner(qu,owner,ol)) { stat= adns_s_nomemory; goto x_adnsfail; }
310 query_simple(ads,qu, owner,ol, typei,flags, now);
312 adns__autosys(ads,now);
313 adns__consistency(ads,qu,cc_entex);
317 adns__query_fail(qu,stat);
318 adns__consistency(ads,qu,cc_entex);
324 adns__consistency(ads,0,cc_entex);
328 int adns_submit_reverse_any(adns_state ads,
329 const struct sockaddr *addr,
332 adns_queryflags flags,
334 adns_query *query_r) {
335 char *buf, *buf_free = 0;
339 flags &= ~adns_qf_search;
342 r= adns__make_reverse_domain(addr,zone, &buf,sizeof(shortbuf),&buf_free);
344 r= adns_submit(ads,buf,type,flags,context,query_r);
349 int adns_submit_reverse(adns_state ads,
350 const struct sockaddr *addr,
352 adns_queryflags flags,
354 adns_query *query_r) {
355 if (type != adns_r_ptr && type != adns_r_ptr_raw) return EINVAL;
356 return adns_submit_reverse_any(ads,addr,0,type,flags,context,query_r);
359 int adns_synchronous(adns_state ads,
362 adns_queryflags flags,
363 adns_answer **answer_r) {
367 r= adns_submit(ads,owner,type,flags,0,&qu);
370 r= adns_wait(ads,&qu,answer_r,0);
371 if (r) adns_cancel(qu);
376 static void *alloc_common(adns_query qu, size_t sz) {
379 if (!sz) return qu; /* Any old pointer will do */
380 assert(!qu->final_allocspace);
381 an= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an)) + sz));
383 LIST_LINK_TAIL(qu->allocations,an);
385 return (byte*)an + MEM_ROUND(sizeof(*an));
388 void *adns__alloc_interim(adns_query qu, size_t sz) {
392 rv= alloc_common(qu,sz);
394 qu->interim_allocd += sz;
398 void *adns__alloc_preserved(adns_query qu, size_t sz) {
402 rv= adns__alloc_interim(qu,sz);
404 qu->preserved_allocd += sz;
408 static allocnode *alloc_info(adns_query qu, void *p, size_t *sz_r)
412 if (!p || p == qu) { *sz_r = 0; return 0; }
413 an = (allocnode *)((byte *)p - MEM_ROUND(sizeof(allocnode)));
414 *sz_r = MEM_ROUND(an->sz);
418 void adns__free_interim(adns_query qu, void *p) {
420 allocnode *an = alloc_info(qu, p, &sz);
423 assert(!qu->final_allocspace);
424 LIST_UNLINK(qu->allocations, an);
426 qu->interim_allocd -= sz;
429 void *adns__alloc_mine(adns_query qu, size_t sz) {
430 return alloc_common(qu,MEM_ROUND(sz));
433 void adns__transfer_interim(adns_query from, adns_query to, void *block) {
435 allocnode *an = alloc_info(from, block, &sz);
439 assert(!to->final_allocspace);
440 assert(!from->final_allocspace);
442 LIST_UNLINK(from->allocations,an);
443 LIST_LINK_TAIL(to->allocations,an);
445 from->interim_allocd -= sz;
446 to->interim_allocd += sz;
448 if (to->expires > from->expires) to->expires= from->expires;
451 void *adns__alloc_final(adns_query qu, size_t sz) {
452 /* When we're in the _final stage, we _subtract_ from interim_alloc'd
453 * each allocation, and use final_allocspace to point to the next free
459 rp= qu->final_allocspace;
461 qu->interim_allocd -= sz;
462 assert(qu->interim_allocd>=0);
463 qu->final_allocspace= (byte*)rp + sz;
467 void adns__cancel_children(adns_query qu) {
468 adns_query cqu, ncqu;
470 for (cqu= qu->children.head; cqu; cqu= ncqu) {
471 ncqu= cqu->siblings.next;
476 void adns__reset_preserved(adns_query qu) {
477 assert(!qu->final_allocspace);
478 adns__cancel_children(qu);
480 qu->answer->rrs.untyped= 0;
481 qu->interim_allocd= qu->preserved_allocd;
484 static void free_query_allocs(adns_query qu) {
487 adns__cancel_children(qu);
488 for (an= qu->allocations.head; an; an= ann) { ann= an->next; free(an); }
489 LIST_INIT(qu->allocations);
490 adns__vbuf_free(&qu->vb);
491 adns__vbuf_free(&qu->search_vb);
492 free(qu->query_dgram);
496 void adns_cancel(adns_query qu) {
500 adns__consistency(ads,qu,cc_entex);
501 if (qu->parent) LIST_UNLINK_PART(qu->parent->children,qu,siblings.);
504 LIST_UNLINK(ads->udpw,qu);
507 LIST_UNLINK(ads->tcpw,qu);
510 LIST_UNLINK(ads->childw,qu);
513 LIST_UNLINK(ads->output,qu);
518 free_query_allocs(qu);
521 adns__consistency(ads,0,cc_entex);
524 void adns__update_expires(adns_query qu, unsigned long ttl,
525 struct timeval now) {
528 assert(ttl <= MAXTTLBELIEVE);
529 max= now.tv_sec + ttl;
530 if (qu->expires < max) return;
534 static void makefinal_query(adns_query qu) {
540 if (qu->interim_allocd) {
541 ans= realloc(qu->answer,
542 MEM_ROUND(MEM_ROUND(sizeof(*ans)) + qu->interim_allocd));
543 if (!ans) goto x_nomem;
547 qu->final_allocspace= (byte*)ans + MEM_ROUND(sizeof(*ans));
548 adns__makefinal_str(qu,&ans->cname);
549 adns__makefinal_str(qu,&ans->owner);
552 adns__makefinal_block(qu, &ans->rrs.untyped, ans->nrrs*ans->rrsz);
554 for (rrn=0; rrn<ans->nrrs; rrn++)
555 qu->typei->makefinal(qu, ans->rrs.bytes + rrn*ans->rrsz);
558 free_query_allocs(qu);
562 qu->preserved_allocd= 0;
563 qu->answer->cname= 0;
564 qu->answer->owner= 0;
565 adns__reset_preserved(qu); /* (but we just threw away the preserved stuff) */
567 qu->answer->status= adns_s_nomemory;
568 free_query_allocs(qu);
571 void adns__query_done(adns_query qu) {
575 adns__cancel_children(qu);
580 if (qu->flags & adns_qf_search && ans->status != adns_s_nomemory) {
581 if (!save_owner(qu, qu->search_vb.buf, qu->search_vb.used)) {
582 adns__query_fail(qu,adns_s_nomemory);
587 if (ans->nrrs && qu->typei->diff_needswap) {
588 if (!adns__vbuf_ensure(&qu->vb,ans->rrsz)) {
589 adns__query_fail(qu,adns_s_nomemory);
592 adns__isort(ans->rrs.bytes, ans->nrrs, ans->rrsz,
594 (int(*)(void*, const void*, const void*))
595 qu->typei->diff_needswap,
598 if (ans->nrrs && qu->typei->postsort) {
599 qu->typei->postsort(qu->ads, ans->rrs.bytes, ans->nrrs, qu->typei);
602 ans->expires= qu->expires;
605 LIST_UNLINK_PART(parent->children,qu,siblings.);
606 LIST_UNLINK(qu->ads->childw,parent);
607 qu->ctx.callback(parent,qu);
608 free_query_allocs(qu);
613 LIST_LINK_TAIL(qu->ads->output,qu);
614 qu->state= query_done;
618 void adns__query_fail(adns_query qu, adns_status stat) {
619 adns__reset_preserved(qu);
620 qu->answer->status= stat;
621 adns__query_done(qu);
624 void adns__makefinal_str(adns_query qu, char **strp) {
626 char *before, *after;
631 after= adns__alloc_final(qu,l);
632 memcpy(after,before,l);
636 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz) {
637 void *before, *after;
641 after= adns__alloc_final(qu,sz);
642 memcpy(after,before,sz);