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 Copyright (C) 1997-1999 Ian Jackson
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2, or (at your option)
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software Foundation,
22 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
35 static adns_query query_alloc(adns_state ads, const typeinfo *typei,
36 adns_queryflags flags, struct timeval now) {
37 /* Allocate a virgin query and return it. */
40 qu= malloc(sizeof(*qu)); if (!qu) return 0;
41 qu->answer= malloc(sizeof(*qu->answer)); if (!qu->answer) { free(qu); return 0; }
44 qu->state= query_tosend;
45 qu->back= qu->next= qu->parent= 0;
46 LIST_INIT(qu->children);
47 LINK_INIT(qu->siblings);
48 LIST_INIT(qu->allocations);
49 qu->interim_allocd= 0;
50 qu->preserved_allocd= 0;
51 qu->final_allocspace= 0;
56 adns__vbuf_init(&qu->vb);
59 qu->cname_dglen= qu->cname_begin= 0;
61 adns__vbuf_init(&qu->search_vb);
62 qu->search_origlen= qu->search_pos= qu->search_doneabs= 0;
68 qu->udpsent= qu->tcpfailed= 0;
69 timerclear(&qu->timeout);
70 qu->expires= now.tv_sec + MAXTTLBELIEVE;
72 memset(&qu->ctx,0,sizeof(qu->ctx));
74 qu->answer->status= adns_s_ok;
75 qu->answer->cname= qu->answer->owner= 0;
76 qu->answer->type= typei->type;
77 qu->answer->expires= -1;
79 qu->answer->rrs.untyped= 0;
80 qu->answer->rrsz= typei->rrsz;
85 static void query_submit(adns_state ads, adns_query qu,
86 const typeinfo *typei, vbuf *qumsg_vb, int id,
87 adns_queryflags flags, struct timeval now) {
88 /* Fills in the query message in for a previously-allocated query,
89 * and submits it. Cannot fail.
93 adns__vbuf_init(qumsg_vb);
95 qu->query_dgram= malloc(qu->vb.used);
96 if (!qu->query_dgram) { adns__query_fail(qu,adns_s_nomemory); return; }
99 qu->query_dglen= qu->vb.used;
100 memcpy(qu->query_dgram,qu->vb.buf,qu->vb.used);
102 adns__query_send(qu,now);
103 adns__autosys(ads,now);
106 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
107 const typeinfo *typei, vbuf *qumsg_vb, int id,
108 adns_queryflags flags, struct timeval now,
109 const qcontext *ctx) {
112 qu= query_alloc(ads,typei,flags,now);
113 if (!qu) { adns__vbuf_free(qumsg_vb); return adns_s_nomemory; }
116 memcpy(&qu->ctx,ctx,sizeof(qu->ctx));
117 query_submit(ads,qu, typei,qumsg_vb,id,flags,now);
122 static void query_simple(adns_state ads, adns_query qu,
123 const char *owner, int ol,
124 const typeinfo *typei, adns_queryflags flags,
125 struct timeval now) {
130 adns__vbuf_init(&vb);
132 stat= adns__mkquery(ads,&vb,&id, owner,ol, typei,flags);
133 if (stat) { adns__query_fail(qu,stat); return; }
135 query_submit(ads,qu, typei,&vb,id, flags,now);
138 void adns__search_next(adns_state ads, adns_query qu, struct timeval now) {
139 const char *nextentry;
142 if (qu->search_doneabs<0) {
144 qu->search_doneabs= 1;
146 if (qu->search_pos >= ads->nsearchlist) {
147 if (qu->search_doneabs) {
148 stat= adns_s_nxdomain; goto x_fail;
152 qu->search_doneabs= 1;
155 nextentry= ads->searchlist[qu->search_pos++];
159 qu->search_vb.used= qu->search_origlen;
161 if (!adns__vbuf_append(&qu->search_vb,".",1) ||
162 !adns__vbuf_appendstr(&qu->search_vb,nextentry)) {
163 stat= adns_s_nomemory; goto x_fail;
167 free(qu->query_dgram);
168 qu->query_dgram= 0; qu->query_dglen= 0;
170 query_simple(ads,qu, qu->search_vb.buf, qu->search_vb.used, qu->typei, qu->flags, now);
174 adns__query_fail(qu,stat);
177 static int save_owner(adns_query qu, const char *owner, int ol) {
178 /* Returns 1 if OK, otherwise there was no memory. */
184 ans->owner= adns__alloc_preserved(qu,ol+1); if (!ans->owner) return 0;
186 memcpy(ans->owner,owner,ol);
191 int adns_submit(adns_state ads,
194 adns_queryflags flags,
196 adns_query *query_r) {
199 const typeinfo *typei;
204 typei= adns__findtype(type);
205 if (!typei) return ENOSYS;
207 r= gettimeofday(&now,0); if (r) goto x_errno;
208 qu= query_alloc(ads,typei,flags,now); if (!qu) goto x_errno;
210 qu->ctx.ext= context;
212 memset(&qu->ctx.info,0,sizeof(qu->ctx.info));
217 if (!ol) { stat= adns_s_querydomaininvalid; goto x_adnsfail; }
218 if (ol>DNS_MAXDOMAIN+1) { stat= adns_s_querydomaintoolong; goto x_adnsfail; }
220 if (ol>=1 && owner[ol-1]=='.' && (ol<2 || owner[ol-2]!='\\')) {
221 flags &= ~adns_qf_search;
225 if (flags & adns_qf_search) {
226 r= adns__vbuf_append(&qu->search_vb,owner,ol);
227 if (!r) { stat= adns_s_nomemory; goto x_adnsfail; }
229 for (ndots=0, p=owner; (p= strchr(p,'.')); p++, ndots++);
230 qu->search_doneabs= (ndots >= ads->searchndots) ? -1 : 0;
231 qu->search_origlen= ol;
232 adns__search_next(ads,qu,now);
234 if (flags & adns_qf_owner) {
235 if (!save_owner(qu,owner,ol)) { stat= adns_s_nomemory; goto x_adnsfail; }
237 query_simple(ads,qu, owner,ol, typei,flags, now);
242 adns__query_fail(qu,stat);
251 int adns_synchronous(adns_state ads,
254 adns_queryflags flags,
255 adns_answer **answer_r) {
259 r= adns_submit(ads,owner,type,flags,0,&qu);
262 r= adns_wait(ads,&qu,answer_r,0);
263 if (r) adns_cancel(qu);
268 static void *alloc_common(adns_query qu, size_t sz) {
271 if (!sz) return qu; /* Any old pointer will do */
272 assert(!qu->final_allocspace);
273 an= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an)) + sz));
275 LIST_LINK_TAIL(qu->allocations,an);
276 return (byte*)an + MEM_ROUND(sizeof(*an));
279 void *adns__alloc_interim(adns_query qu, size_t sz) {
283 rv= alloc_common(qu,sz);
285 qu->interim_allocd += sz;
289 void *adns__alloc_preserved(adns_query qu, size_t sz) {
293 rv= adns__alloc_interim(qu,sz);
295 qu->preserved_allocd += sz;
299 void *adns__alloc_mine(adns_query qu, size_t sz) {
300 return alloc_common(qu,MEM_ROUND(sz));
303 void adns__transfer_interim(adns_query from, adns_query to, void *block, size_t sz) {
307 an= (void*)((byte*)block - MEM_ROUND(sizeof(*an)));
309 assert(!to->final_allocspace);
310 assert(!from->final_allocspace);
312 LIST_UNLINK(from->allocations,an);
313 LIST_LINK_TAIL(to->allocations,an);
315 from->interim_allocd -= sz;
316 to->interim_allocd += sz;
318 if (to->expires > from->expires) to->expires= from->expires;
321 void *adns__alloc_final(adns_query qu, size_t sz) {
322 /* When we're in the _final stage, we _subtract_ from interim_alloc'd
323 * each allocation, and use final_allocspace to point to the next free
329 rp= qu->final_allocspace;
331 qu->interim_allocd -= sz;
332 assert(qu->interim_allocd>=0);
333 qu->final_allocspace= (byte*)rp + sz;
337 static void cancel_children(adns_query qu) {
338 adns_query cqu, ncqu;
340 for (cqu= qu->children.head; cqu; cqu= ncqu) {
341 ncqu= cqu->siblings.next;
344 LIST_INIT(qu->children);
347 void adns__reset_preserved(adns_query qu) {
348 assert(!qu->final_allocspace);
351 qu->answer->rrs.untyped= 0;
352 qu->interim_allocd= qu->preserved_allocd;
355 static void free_query_allocs(adns_query qu) {
359 for (an= qu->allocations.head; an; an= ann) { ann= an->next; free(an); }
360 adns__vbuf_free(&qu->vb);
363 void adns_cancel(adns_query qu) {
365 case query_tosend: case query_tcpwait: case query_tcpsent:
366 LIST_UNLINK(qu->ads->timew,qu);
369 LIST_UNLINK(qu->ads->childw,qu);
372 LIST_UNLINK(qu->ads->output,qu);
377 free_query_allocs(qu);
382 void adns__update_expires(adns_query qu, unsigned long ttl, struct timeval now) {
385 assert(ttl <= MAXTTLBELIEVE);
386 max= now.tv_sec + ttl;
387 if (qu->expires < max) return;
391 static void makefinal_query(adns_query qu) {
397 if (qu->interim_allocd) {
398 ans= realloc(qu->answer, MEM_ROUND(MEM_ROUND(sizeof(*ans)) + qu->interim_allocd));
399 if (!ans) goto x_nomem;
403 qu->final_allocspace= (byte*)ans + MEM_ROUND(sizeof(*ans));
404 adns__makefinal_str(qu,&ans->cname);
405 adns__makefinal_str(qu,&ans->owner);
408 adns__makefinal_block(qu, &ans->rrs.untyped, ans->nrrs*ans->rrsz);
410 for (rrn=0; rrn<ans->nrrs; rrn++)
411 qu->typei->makefinal(qu, ans->rrs.bytes + rrn*ans->rrsz);
414 free_query_allocs(qu);
418 qu->preserved_allocd= 0;
419 qu->answer->cname= 0;
420 qu->answer->owner= 0;
421 adns__reset_preserved(qu); /* (but we just threw away the preserved stuff) */
423 qu->answer->status= adns_s_nomemory;
424 free_query_allocs(qu);
427 void adns__query_done(adns_query qu) {
436 if (qu->flags & adns_qf_owner && qu->flags & adns_qf_search &&
437 ans->status != adns_s_nomemory) {
438 if (!save_owner(qu, qu->search_vb.buf, qu->search_vb.used)) {
439 adns__query_fail(qu,adns_s_nomemory);
444 if (ans->nrrs && qu->typei->diff_needswap) {
445 if (!adns__vbuf_ensure(&qu->vb,qu->typei->rrsz)) {
446 adns__query_fail(qu,adns_s_nomemory);
449 adns__isort(ans->rrs.bytes, ans->nrrs, ans->rrsz,
451 (int(*)(void*, const void*, const void*))qu->typei->diff_needswap,
455 ans->expires= qu->expires;
458 LIST_UNLINK_PART(parent->children,qu,siblings.);
459 LIST_UNLINK(qu->ads->childw,parent);
460 qu->ctx.callback(parent,qu);
461 free_query_allocs(qu);
465 LIST_LINK_TAIL(qu->ads->output,qu);
469 void adns__query_fail(adns_query qu, adns_status stat) {
470 adns__reset_preserved(qu);
471 qu->answer->status= stat;
472 adns__query_done(qu);
475 void adns__makefinal_str(adns_query qu, char **strp) {
477 char *before, *after;
482 after= adns__alloc_final(qu,l);
483 memcpy(after,before,l);
487 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz) {
488 void *before, *after;
492 after= adns__alloc_final(qu,sz);
493 memcpy(after,before,sz);