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,
41 const typeinfo *typei, adns_rrtype type,
42 adns_queryflags flags, struct timeval now) {
43 /* Allocate a virgin query and return it. */
46 qu= malloc(sizeof(*qu)); if (!qu) return 0;
47 qu->answer= malloc(sizeof(*qu->answer));
48 if (!qu->answer) { free(qu); return 0; }
51 qu->state= query_tosend;
52 qu->back= qu->next= qu->parent= 0;
53 LIST_INIT(qu->children);
54 LINK_INIT(qu->siblings);
55 LIST_INIT(qu->allocations);
56 qu->interim_allocd= 0;
57 qu->preserved_allocd= 0;
58 qu->final_allocspace= 0;
63 adns__vbuf_init(&qu->vb);
66 qu->cname_dglen= qu->cname_begin= 0;
68 adns__vbuf_init(&qu->search_vb);
69 qu->search_origlen= qu->search_pos= qu->search_doneabs= 0;
71 qu->id= -2; /* will be overwritten with real id before we leave adns */
76 timerclear(&qu->timeout);
77 qu->expires= now.tv_sec + MAXTTLBELIEVE;
79 memset(&qu->ctx,0,sizeof(qu->ctx));
81 qu->answer->status= adns_s_ok;
82 qu->answer->cname= qu->answer->owner= 0;
83 qu->answer->type= type;
84 qu->answer->expires= -1;
86 qu->answer->rrs.untyped= 0;
87 qu->answer->rrsz= typei->rrsz;
92 static void query_submit(adns_state ads, adns_query qu,
93 const typeinfo *typei, vbuf *qumsg_vb, int id,
94 adns_queryflags flags, struct timeval now) {
95 /* Fills in the query message in for a previously-allocated query,
96 * and submits it. Cannot fail. Takes over the memory for qumsg_vb.
100 adns__vbuf_init(qumsg_vb);
102 qu->query_dgram= malloc(qu->vb.used);
103 if (!qu->query_dgram) { adns__query_fail(qu,adns_s_nomemory); return; }
106 qu->query_dglen= qu->vb.used;
107 memcpy(qu->query_dgram,qu->vb.buf,qu->vb.used);
109 adns__query_send(qu,now);
112 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
113 const typeinfo *typei, vbuf *qumsg_vb,
115 adns_queryflags flags, struct timeval now,
116 const qcontext *ctx) {
119 qu= query_alloc(ads,typei,typei->typekey,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.info,0,sizeof(qu->ctx.info));
239 if (!ol) { stat= adns_s_querydomaininvalid; goto x_adnsfail; }
240 if (ol>DNS_MAXDOMAIN+1) { stat= adns_s_querydomaintoolong; goto x_adnsfail; }
242 if (ol>=1 && owner[ol-1]=='.' && (ol<2 || owner[ol-2]!='\\')) {
243 flags &= ~adns_qf_search;
248 if (flags & adns_qf_search) {
249 r= adns__vbuf_append(&qu->search_vb,owner,ol);
250 if (!r) { stat= adns_s_nomemory; goto x_adnsfail; }
252 for (ndots=0, p=owner; (p= strchr(p,'.')); p++, ndots++);
253 qu->search_doneabs= (ndots >= ads->searchndots) ? -1 : 0;
254 qu->search_origlen= ol;
255 adns__search_next(ads,qu,now);
257 if (flags & adns_qf_owner) {
258 if (!save_owner(qu,owner,ol)) { stat= adns_s_nomemory; goto x_adnsfail; }
260 query_simple(ads,qu, owner,ol, typei,flags, now);
262 adns__autosys(ads,now);
263 adns__consistency(ads,qu,cc_entex);
267 adns__query_fail(qu,stat);
268 adns__consistency(ads,qu,cc_entex);
274 adns__consistency(ads,0,cc_entex);
278 int adns_submit_reverse_any(adns_state ads,
279 const struct sockaddr *addr,
282 adns_queryflags flags,
284 adns_query *query_r) {
285 const unsigned char *iaddr;
286 char *buf, *buf_free;
290 flags &= ~adns_qf_search;
292 if (addr->sa_family != AF_INET) return ENOSYS;
293 iaddr= (const unsigned char*)
294 &(((const struct sockaddr_in*)addr) -> sin_addr);
296 lreq= strlen(zone) + 4*4 + 1;
297 if (lreq > sizeof(shortbuf)) {
298 buf= malloc(strlen(zone) + 4*4 + 1);
299 if (!buf) return errno;
305 sprintf(buf, "%d.%d.%d.%d.%s", iaddr[3], iaddr[2], iaddr[1], iaddr[0], zone);
307 r= adns_submit(ads,buf,type,flags,context,query_r);
312 int adns_submit_reverse(adns_state ads,
313 const struct sockaddr *addr,
315 adns_queryflags flags,
317 adns_query *query_r) {
318 if (type != adns_r_ptr && type != adns_r_ptr_raw) return EINVAL;
319 return adns_submit_reverse_any(ads,addr,"in-addr.arpa",
320 type,flags,context,query_r);
323 int adns_synchronous(adns_state ads,
326 adns_queryflags flags,
327 adns_answer **answer_r) {
331 r= adns_submit(ads,owner,type,flags,0,&qu);
334 r= adns_wait(ads,&qu,answer_r,0);
335 if (r) adns_cancel(qu);
340 static void *alloc_common(adns_query qu, size_t sz) {
343 if (!sz) return qu; /* Any old pointer will do */
344 assert(!qu->final_allocspace);
345 an= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an)) + sz));
347 LIST_LINK_TAIL(qu->allocations,an);
348 return (byte*)an + MEM_ROUND(sizeof(*an));
351 void *adns__alloc_interim(adns_query qu, size_t sz) {
355 rv= alloc_common(qu,sz);
357 qu->interim_allocd += sz;
361 void *adns__alloc_preserved(adns_query qu, size_t sz) {
365 rv= adns__alloc_interim(qu,sz);
367 qu->preserved_allocd += sz;
371 void *adns__alloc_mine(adns_query qu, size_t sz) {
372 return alloc_common(qu,MEM_ROUND(sz));
375 void adns__transfer_interim(adns_query from, adns_query to,
376 void *block, size_t sz) {
380 an= (void*)((byte*)block - MEM_ROUND(sizeof(*an)));
382 assert(!to->final_allocspace);
383 assert(!from->final_allocspace);
385 LIST_UNLINK(from->allocations,an);
386 LIST_LINK_TAIL(to->allocations,an);
389 from->interim_allocd -= sz;
390 to->interim_allocd += sz;
392 if (to->expires > from->expires) to->expires= from->expires;
395 void *adns__alloc_final(adns_query qu, size_t sz) {
396 /* When we're in the _final stage, we _subtract_ from interim_alloc'd
397 * each allocation, and use final_allocspace to point to the next free
403 rp= qu->final_allocspace;
405 qu->interim_allocd -= sz;
406 assert(qu->interim_allocd>=0);
407 qu->final_allocspace= (byte*)rp + sz;
411 static void cancel_children(adns_query qu) {
412 adns_query cqu, ncqu;
414 for (cqu= qu->children.head; cqu; cqu= ncqu) {
415 ncqu= cqu->siblings.next;
420 void adns__reset_preserved(adns_query qu) {
421 assert(!qu->final_allocspace);
424 qu->answer->rrs.untyped= 0;
425 qu->interim_allocd= qu->preserved_allocd;
428 static void free_query_allocs(adns_query qu) {
432 for (an= qu->allocations.head; an; an= ann) { ann= an->next; free(an); }
433 LIST_INIT(qu->allocations);
434 adns__vbuf_free(&qu->vb);
435 adns__vbuf_free(&qu->search_vb);
436 free(qu->query_dgram);
440 void adns_cancel(adns_query qu) {
444 adns__consistency(ads,qu,cc_entex);
445 if (qu->parent) LIST_UNLINK_PART(qu->parent->children,qu,siblings.);
448 LIST_UNLINK(ads->udpw,qu);
451 LIST_UNLINK(ads->tcpw,qu);
454 LIST_UNLINK(ads->childw,qu);
457 LIST_UNLINK(ads->output,qu);
462 free_query_allocs(qu);
465 adns__consistency(ads,0,cc_entex);
468 void adns__update_expires(adns_query qu, unsigned long ttl,
469 struct timeval now) {
472 assert(ttl <= MAXTTLBELIEVE);
473 max= now.tv_sec + ttl;
474 if (qu->expires < max) return;
478 static void makefinal_query(adns_query qu) {
484 if (qu->interim_allocd) {
485 ans= realloc(qu->answer,
486 MEM_ROUND(MEM_ROUND(sizeof(*ans)) + qu->interim_allocd));
487 if (!ans) goto x_nomem;
491 qu->final_allocspace= (byte*)ans + MEM_ROUND(sizeof(*ans));
492 adns__makefinal_str(qu,&ans->cname);
493 adns__makefinal_str(qu,&ans->owner);
496 adns__makefinal_block(qu, &ans->rrs.untyped, ans->nrrs*ans->rrsz);
498 for (rrn=0; rrn<ans->nrrs; rrn++)
499 qu->typei->makefinal(qu, ans->rrs.bytes + rrn*ans->rrsz);
502 free_query_allocs(qu);
506 qu->preserved_allocd= 0;
507 qu->answer->cname= 0;
508 qu->answer->owner= 0;
509 adns__reset_preserved(qu); /* (but we just threw away the preserved stuff) */
511 qu->answer->status= adns_s_nomemory;
512 free_query_allocs(qu);
515 void adns__query_done(adns_query qu) {
524 if (qu->flags & adns_qf_search && ans->status != adns_s_nomemory) {
525 if (!save_owner(qu, qu->search_vb.buf, qu->search_vb.used)) {
526 adns__query_fail(qu,adns_s_nomemory);
531 if (ans->nrrs && qu->typei->diff_needswap) {
532 if (!adns__vbuf_ensure(&qu->vb,qu->typei->rrsz)) {
533 adns__query_fail(qu,adns_s_nomemory);
536 adns__isort(ans->rrs.bytes, ans->nrrs, ans->rrsz,
538 (int(*)(void*, const void*, const void*))
539 qu->typei->diff_needswap,
542 if (ans->nrrs && qu->typei->postsort) {
543 qu->typei->postsort(qu->ads, ans->rrs.bytes, ans->nrrs, qu->typei);
546 ans->expires= qu->expires;
549 LIST_UNLINK_PART(parent->children,qu,siblings.);
550 LIST_UNLINK(qu->ads->childw,parent);
551 qu->ctx.callback(parent,qu);
552 free_query_allocs(qu);
557 LIST_LINK_TAIL(qu->ads->output,qu);
558 qu->state= query_done;
562 void adns__query_fail(adns_query qu, adns_status stat) {
563 adns__reset_preserved(qu);
564 qu->answer->status= stat;
565 adns__query_done(qu);
568 void adns__makefinal_str(adns_query qu, char **strp) {
570 char *before, *after;
575 after= adns__alloc_final(qu,l);
576 memcpy(after,before,l);
580 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz) {
581 void *before, *after;
585 after= adns__alloc_final(qu,sz);
586 memcpy(after,before,sz);