3 * - overall query management (allocation, completion)
4 * - per-query memory management
5 * - query submission and cancellation (user-visible and internal)
9 * Copyright (C) 1997-2000 Ian Jackson <ian@davenant.greenend.org.uk>
11 * It is part of adns, which is
12 * Copyright (C) 1997-2000 Ian Jackson <ian@davenant.greenend.org.uk>
13 * Copyright (C) 1999-2000 Tony Finch <dot@dotat.at>
15 * This program is free software; you can redistribute it and/or modify
16 * it under the terms of the GNU General Public License as published by
17 * the Free Software Foundation; either version 2, or (at your option)
20 * This program is distributed in the hope that it will be useful,
21 * but WITHOUT ANY WARRANTY; without even the implied warranty of
22 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23 * GNU General Public License for more details.
25 * You should have received a copy of the GNU General Public License
26 * along with this program; if not, write to the Free Software Foundation,
27 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
40 static adns_query query_alloc(adns_state ads, const typeinfo *typei,
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= typei->type;
83 qu->answer->expires= -1;
85 qu->answer->rrs.untyped= 0;
86 qu->answer->rrsz= 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 adns__query_send(qu,now);
111 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
112 const typeinfo *typei, vbuf *qumsg_vb,
114 adns_queryflags flags, struct timeval now,
115 const qcontext *ctx) {
118 qu= query_alloc(ads,typei,flags,now);
119 if (!qu) { adns__vbuf_free(qumsg_vb); return adns_s_nomemory; }
122 memcpy(&qu->ctx,ctx,sizeof(qu->ctx));
123 query_submit(ads,qu, typei,qumsg_vb,id,flags,now);
128 static void query_simple(adns_state ads, adns_query qu,
129 const char *owner, int ol,
130 const typeinfo *typei, adns_queryflags flags,
131 struct timeval now) {
136 stat= adns__mkquery(ads,&qu->vb,&id, owner,ol, typei,flags);
138 if (stat == adns_s_querydomaintoolong && (flags & adns_qf_search)) {
139 adns__search_next(ads,qu,now);
142 adns__query_fail(qu,stat);
148 adns__vbuf_init(&qu->vb);
149 query_submit(ads,qu, typei,&vb_new,id, flags,now);
152 void adns__search_next(adns_state ads, adns_query qu, struct timeval now) {
153 const char *nextentry;
156 if (qu->search_doneabs<0) {
158 qu->search_doneabs= 1;
160 if (qu->search_pos >= ads->nsearchlist) {
161 if (qu->search_doneabs) {
162 qu->search_vb.used= qu->search_origlen;
163 stat= adns_s_nxdomain; goto x_fail;
166 qu->search_doneabs= 1;
169 nextentry= ads->searchlist[qu->search_pos++];
173 qu->search_vb.used= qu->search_origlen;
175 if (!adns__vbuf_append(&qu->search_vb,".",1) ||
176 !adns__vbuf_appendstr(&qu->search_vb,nextentry))
180 free(qu->query_dgram);
181 qu->query_dgram= 0; qu->query_dglen= 0;
183 query_simple(ads,qu, qu->search_vb.buf, qu->search_vb.used,
184 qu->typei, qu->flags, now);
188 stat= adns_s_nomemory;
190 adns__query_fail(qu,stat);
193 static int save_owner(adns_query qu, const char *owner, int ol) {
194 /* Returns 1 if OK, otherwise there was no memory. */
197 if (!(qu->flags & adns_qf_owner)) return 1;
202 ans->owner= adns__alloc_preserved(qu,ol+1); if (!ans->owner) return 0;
204 memcpy(ans->owner,owner,ol);
209 int adns_submit(adns_state ads,
212 adns_queryflags flags,
214 adns_query *query_r) {
217 const typeinfo *typei;
222 adns__consistency(ads,0,cc_entex);
224 typei= adns__findtype(type);
225 if (!typei) return ENOSYS;
227 r= gettimeofday(&now,0); if (r) goto x_errno;
228 qu= query_alloc(ads,typei,flags,now); if (!qu) goto x_errno;
230 qu->ctx.ext= context;
232 memset(&qu->ctx.info,0,sizeof(qu->ctx.info));
237 if (!ol) { stat= adns_s_querydomaininvalid; goto x_adnsfail; }
238 if (ol>DNS_MAXDOMAIN+1) { stat= adns_s_querydomaintoolong; goto x_adnsfail; }
240 if (ol>=1 && owner[ol-1]=='.' && (ol<2 || owner[ol-2]!='\\')) {
241 flags &= ~adns_qf_search;
246 if (flags & adns_qf_search) {
247 r= adns__vbuf_append(&qu->search_vb,owner,ol);
248 if (!r) { stat= adns_s_nomemory; goto x_adnsfail; }
250 for (ndots=0, p=owner; (p= strchr(p,'.')); p++, ndots++);
251 qu->search_doneabs= (ndots >= ads->searchndots) ? -1 : 0;
252 qu->search_origlen= ol;
253 adns__search_next(ads,qu,now);
255 if (flags & adns_qf_owner) {
256 if (!save_owner(qu,owner,ol)) { stat= adns_s_nomemory; goto x_adnsfail; }
258 query_simple(ads,qu, owner,ol, typei,flags, now);
260 adns__autosys(ads,now);
261 adns__consistency(ads,qu,cc_entex);
265 adns__query_fail(qu,stat);
266 adns__consistency(ads,qu,cc_entex);
272 adns__consistency(ads,0,cc_entex);
276 int adns_submit_reverse_any(adns_state ads,
277 const struct sockaddr *addr,
280 adns_queryflags flags,
282 adns_query *query_r) {
283 const unsigned char *iaddr;
284 char *buf, *buf_free;
288 flags &= ~adns_qf_search;
290 if (addr->sa_family != AF_INET) return ENOSYS;
291 iaddr= (const unsigned char*)
292 &(((const struct sockaddr_in*)addr) -> sin_addr);
294 lreq= strlen(zone) + 4*4 + 1;
295 if (lreq > sizeof(shortbuf)) {
296 buf= malloc(strlen(zone) + 4*4 + 1);
297 if (!buf) return errno;
303 sprintf(buf, "%d.%d.%d.%d.%s", iaddr[3], iaddr[2], iaddr[1], iaddr[0], zone);
305 r= adns_submit(ads,buf,type,flags,context,query_r);
310 int adns_submit_reverse(adns_state ads,
311 const struct sockaddr *addr,
313 adns_queryflags flags,
315 adns_query *query_r) {
316 if (type != adns_r_ptr && type != adns_r_ptr_raw) return EINVAL;
317 return adns_submit_reverse_any(ads,addr,"in-addr.arpa",
318 type,flags,context,query_r);
321 int adns_synchronous(adns_state ads,
324 adns_queryflags flags,
325 adns_answer **answer_r) {
329 r= adns_submit(ads,owner,type,flags,0,&qu);
332 r= adns_wait(ads,&qu,answer_r,0);
333 if (r) adns_cancel(qu);
338 static void *alloc_common(adns_query qu, size_t sz) {
341 if (!sz) return qu; /* Any old pointer will do */
342 assert(!qu->final_allocspace);
343 an= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an)) + sz));
345 LIST_LINK_TAIL(qu->allocations,an);
346 return (byte*)an + MEM_ROUND(sizeof(*an));
349 void *adns__alloc_interim(adns_query qu, size_t sz) {
353 rv= alloc_common(qu,sz);
355 qu->interim_allocd += sz;
359 void *adns__alloc_preserved(adns_query qu, size_t sz) {
363 rv= adns__alloc_interim(qu,sz);
365 qu->preserved_allocd += sz;
369 void *adns__alloc_mine(adns_query qu, size_t sz) {
370 return alloc_common(qu,MEM_ROUND(sz));
373 void adns__transfer_interim(adns_query from, adns_query to,
374 void *block, size_t sz) {
378 an= (void*)((byte*)block - MEM_ROUND(sizeof(*an)));
380 assert(!to->final_allocspace);
381 assert(!from->final_allocspace);
383 LIST_UNLINK(from->allocations,an);
384 LIST_LINK_TAIL(to->allocations,an);
387 from->interim_allocd -= sz;
388 to->interim_allocd += sz;
390 if (to->expires > from->expires) to->expires= from->expires;
393 void *adns__alloc_final(adns_query qu, size_t sz) {
394 /* When we're in the _final stage, we _subtract_ from interim_alloc'd
395 * each allocation, and use final_allocspace to point to the next free
401 rp= qu->final_allocspace;
403 qu->interim_allocd -= sz;
404 assert(qu->interim_allocd>=0);
405 qu->final_allocspace= (byte*)rp + sz;
409 static void cancel_children(adns_query qu) {
410 adns_query cqu, ncqu;
412 for (cqu= qu->children.head; cqu; cqu= ncqu) {
413 ncqu= cqu->siblings.next;
418 void adns__reset_preserved(adns_query qu) {
419 assert(!qu->final_allocspace);
422 qu->answer->rrs.untyped= 0;
423 qu->interim_allocd= qu->preserved_allocd;
426 static void free_query_allocs(adns_query qu) {
430 for (an= qu->allocations.head; an; an= ann) { ann= an->next; free(an); }
431 LIST_INIT(qu->allocations);
432 adns__vbuf_free(&qu->vb);
433 adns__vbuf_free(&qu->search_vb);
434 free(qu->query_dgram);
438 void adns_cancel(adns_query qu) {
442 adns__consistency(ads,qu,cc_entex);
443 if (qu->parent) LIST_UNLINK_PART(qu->parent->children,qu,siblings.);
446 LIST_UNLINK(ads->udpw,qu);
449 LIST_UNLINK(ads->tcpw,qu);
452 LIST_UNLINK(ads->childw,qu);
455 LIST_UNLINK(ads->output,qu);
460 free_query_allocs(qu);
463 adns__consistency(ads,0,cc_entex);
466 void adns__update_expires(adns_query qu, unsigned long ttl,
467 struct timeval now) {
470 assert(ttl <= MAXTTLBELIEVE);
471 max= now.tv_sec + ttl;
472 if (qu->expires < max) return;
476 static void makefinal_query(adns_query qu) {
482 if (qu->interim_allocd) {
483 ans= realloc(qu->answer,
484 MEM_ROUND(MEM_ROUND(sizeof(*ans)) + qu->interim_allocd));
485 if (!ans) goto x_nomem;
489 qu->final_allocspace= (byte*)ans + MEM_ROUND(sizeof(*ans));
490 adns__makefinal_str(qu,&ans->cname);
491 adns__makefinal_str(qu,&ans->owner);
494 adns__makefinal_block(qu, &ans->rrs.untyped, ans->nrrs*ans->rrsz);
496 for (rrn=0; rrn<ans->nrrs; rrn++)
497 qu->typei->makefinal(qu, ans->rrs.bytes + rrn*ans->rrsz);
500 free_query_allocs(qu);
504 qu->preserved_allocd= 0;
505 qu->answer->cname= 0;
506 qu->answer->owner= 0;
507 adns__reset_preserved(qu); /* (but we just threw away the preserved stuff) */
509 qu->answer->status= adns_s_nomemory;
510 free_query_allocs(qu);
513 void adns__query_done(adns_query qu) {
522 if (qu->flags & adns_qf_search && ans->status != adns_s_nomemory) {
523 if (!save_owner(qu, qu->search_vb.buf, qu->search_vb.used)) {
524 adns__query_fail(qu,adns_s_nomemory);
529 if (ans->nrrs && qu->typei->diff_needswap) {
530 if (!adns__vbuf_ensure(&qu->vb,qu->typei->rrsz)) {
531 adns__query_fail(qu,adns_s_nomemory);
534 adns__isort(ans->rrs.bytes, ans->nrrs, ans->rrsz,
536 (int(*)(void*, const void*, const void*))
537 qu->typei->diff_needswap,
541 ans->expires= qu->expires;
544 LIST_UNLINK_PART(parent->children,qu,siblings.);
545 LIST_UNLINK(qu->ads->childw,parent);
546 qu->ctx.callback(parent,qu);
547 free_query_allocs(qu);
552 LIST_LINK_TAIL(qu->ads->output,qu);
553 qu->state= query_done;
557 void adns__query_fail(adns_query qu, adns_status stat) {
558 adns__reset_preserved(qu);
559 qu->answer->status= stat;
560 adns__query_done(qu);
563 void adns__makefinal_str(adns_query qu, char **strp) {
565 char *before, *after;
570 after= adns__alloc_final(qu,l);
571 memcpy(after,before,l);
575 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz) {
576 void *before, *after;
580 after= adns__alloc_final(qu,sz);
581 memcpy(after,before,sz);