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
,type
);
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 typei
->query_send(qu
,now
);
111 adns_status
adns__ckl_hostname(adns_state ads
, adns_queryflags flags
,
112 union checklabel_state
*cls
,
113 qcontext
*ctx
, int labnum
,
114 const char *label
, int lablen
)
118 if (flags
& adns_qf_quoteok_query
) return adns_s_ok
;
119 for (i
=0; i
<lablen
; i
++) {
122 if (!i
) return adns_s_querydomaininvalid
;
123 } else if (!ctype_alpha(c
) && !ctype_digit(c
)) {
124 return adns_s_querydomaininvalid
;
130 static adns_status
check_domain_name(adns_state ads
, adns_queryflags flags
,
131 qcontext
*ctx
, const typeinfo
*typei
,
132 const byte
*dgram
, int dglen
)
136 int labnum
= 0, labstart
, lablen
;
137 union checklabel_state cls
;
139 adns__findlabel_start(&fls
,ads
, -1,0, dgram
,dglen
,dglen
, DNS_HDRSIZE
,0);
141 err
= adns__findlabel_next(&fls
, &lablen
,&labstart
);
142 assert(!err
); assert(lablen
>= 0);
143 err
= typei
->checklabel(ads
,flags
, &cls
,ctx
,
144 labnum
++, dgram
+labstart
,lablen
);
150 adns_status
adns__internal_submit(adns_state ads
, adns_query
*query_r
,
151 const typeinfo
*typei
, adns_rrtype type
,
152 vbuf
*qumsg_vb
, int id
,
153 adns_queryflags flags
, struct timeval now
,
158 err
= check_domain_name(ads
, flags
,ctx
,typei
, qumsg_vb
->buf
,qumsg_vb
->used
);
160 qu
= query_alloc(ads
,typei
,type
,flags
,now
);
161 if (!qu
) { err
= adns_s_nomemory
; goto x_err
; }
164 memcpy(&qu
->ctx
,ctx
,sizeof(qu
->ctx
));
165 query_submit(ads
,qu
, typei
,qumsg_vb
,id
,flags
,now
);
170 adns__vbuf_free(qumsg_vb
);
174 static void query_simple(adns_state ads
, adns_query qu
,
175 const char *owner
, int ol
,
176 const typeinfo
*typei
, adns_queryflags flags
,
177 struct timeval now
) {
182 stat
= adns__mkquery(ads
,&qu
->vb
,&id
, owner
,ol
,
183 typei
,qu
->answer
->type
, flags
);
185 if (stat
== adns_s_querydomaintoolong
&& (flags
& adns_qf_search
)) {
186 adns__search_next(ads
,qu
,now
);
189 adns__query_fail(qu
,stat
);
194 stat
= check_domain_name(ads
, flags
,&qu
->ctx
,typei
, qu
->vb
.buf
,qu
->vb
.used
);
195 if (stat
) { adns__query_fail(qu
,stat
); return; }
198 adns__vbuf_init(&qu
->vb
);
199 query_submit(ads
,qu
, typei
,&vb_new
,id
, flags
,now
);
202 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
) {
203 const char *nextentry
;
206 if (qu
->search_doneabs
<0) {
208 qu
->search_doneabs
= 1;
210 if (qu
->search_pos
>= ads
->nsearchlist
) {
211 if (qu
->search_doneabs
) {
212 qu
->search_vb
.used
= qu
->search_origlen
;
213 stat
= adns_s_nxdomain
; goto x_fail
;
216 qu
->search_doneabs
= 1;
219 nextentry
= ads
->searchlist
[qu
->search_pos
++];
223 qu
->search_vb
.used
= qu
->search_origlen
;
225 if (!adns__vbuf_append(&qu
->search_vb
,".",1) ||
226 !adns__vbuf_appendstr(&qu
->search_vb
,nextentry
))
230 free(qu
->query_dgram
);
231 qu
->query_dgram
= 0; qu
->query_dglen
= 0;
233 query_simple(ads
,qu
, qu
->search_vb
.buf
, qu
->search_vb
.used
,
234 qu
->typei
, qu
->flags
, now
);
238 stat
= adns_s_nomemory
;
240 adns__query_fail(qu
,stat
);
243 static int save_owner(adns_query qu
, const char *owner
, int ol
) {
244 /* Returns 1 if OK, otherwise there was no memory. */
247 if (!(qu
->flags
& adns_qf_owner
)) return 1;
252 ans
->owner
= adns__alloc_preserved(qu
,ol
+1); if (!ans
->owner
) return 0;
254 memcpy(ans
->owner
,owner
,ol
);
259 int adns_submit(adns_state ads
,
262 adns_queryflags flags
,
264 adns_query
*query_r
) {
267 const typeinfo
*typei
;
272 adns__consistency(ads
,0,cc_entex
);
274 typei
= adns__findtype(type
);
275 if (!typei
) return ENOSYS
;
277 r
= gettimeofday(&now
,0); if (r
) goto x_errno
;
278 qu
= query_alloc(ads
,typei
,type
,flags
,now
); if (!qu
) goto x_errno
;
280 qu
->ctx
.ext
= context
;
282 memset(&qu
->ctx
.pinfo
,0,sizeof(qu
->ctx
.pinfo
));
283 memset(&qu
->ctx
.tinfo
,0,sizeof(qu
->ctx
.tinfo
));
288 if (!ol
) { stat
= adns_s_querydomaininvalid
; goto x_adnsfail
; }
289 if (ol
>DNS_MAXDOMAIN
+1) { stat
= adns_s_querydomaintoolong
; goto x_adnsfail
; }
291 if (ol
>=1 && owner
[ol
-1]=='.' && (ol
<2 || owner
[ol
-2]!='\\')) {
292 flags
&= ~adns_qf_search
;
297 if (flags
& adns_qf_search
) {
298 r
= adns__vbuf_append(&qu
->search_vb
,owner
,ol
);
299 if (!r
) { stat
= adns_s_nomemory
; goto x_adnsfail
; }
301 for (ndots
=0, p
=owner
; (p
= strchr(p
,'.')); p
++, ndots
++);
302 qu
->search_doneabs
= (ndots
>= ads
->searchndots
) ?
-1 : 0;
303 qu
->search_origlen
= ol
;
304 adns__search_next(ads
,qu
,now
);
306 if (flags
& adns_qf_owner
) {
307 if (!save_owner(qu
,owner
,ol
)) { stat
= adns_s_nomemory
; goto x_adnsfail
; }
309 query_simple(ads
,qu
, owner
,ol
, typei
,flags
, now
);
311 adns__autosys(ads
,now
);
312 adns__consistency(ads
,qu
,cc_entex
);
316 adns__query_fail(qu
,stat
);
317 adns__consistency(ads
,qu
,cc_entex
);
323 adns__consistency(ads
,0,cc_entex
);
327 int adns_submit_reverse_any(adns_state ads
,
328 const struct sockaddr
*addr
,
331 adns_queryflags flags
,
333 adns_query
*query_r
) {
334 char *buf
, *buf_free
= 0;
338 flags
&= ~adns_qf_search
;
341 r
= adns__make_reverse_domain(addr
,zone
, &buf
,sizeof(shortbuf
),&buf_free
);
343 r
= adns_submit(ads
,buf
,type
,flags
,context
,query_r
);
348 int adns_submit_reverse(adns_state ads
,
349 const struct sockaddr
*addr
,
351 adns_queryflags flags
,
353 adns_query
*query_r
) {
354 if (((type
^adns_r_ptr
) & adns_rrt_reprmask
) &&
355 ((type
^adns_r_ptr_raw
) & adns_rrt_reprmask
))
357 return adns_submit_reverse_any(ads
,addr
,0,type
,flags
,context
,query_r
);
360 int adns_synchronous(adns_state ads
,
363 adns_queryflags flags
,
364 adns_answer
**answer_r
) {
368 r
= adns_submit(ads
,owner
,type
,flags
,0,&qu
);
371 r
= adns_wait(ads
,&qu
,answer_r
,0);
372 if (r
) adns_cancel(qu
);
377 static void *alloc_common(adns_query qu
, size_t sz
) {
380 if (!sz
) return qu
; /* Any old pointer will do */
381 assert(!qu
->final_allocspace
);
382 an
= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an
)) + sz
));
384 LIST_LINK_TAIL(qu
->allocations
,an
);
386 return (byte
*)an
+ MEM_ROUND(sizeof(*an
));
389 void *adns__alloc_interim(adns_query qu
, size_t sz
) {
393 rv
= alloc_common(qu
,sz
);
395 qu
->interim_allocd
+= sz
;
399 void *adns__alloc_preserved(adns_query qu
, size_t sz
) {
403 rv
= adns__alloc_interim(qu
,sz
);
405 qu
->preserved_allocd
+= sz
;
409 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
,qu
->answer
->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
,
600 ans
->nrrs
,ans
->rrsz
, qu
->typei
);
603 ans
->expires
= qu
->expires
;
606 LIST_UNLINK_PART(parent
->children
,qu
,siblings
.);
607 LIST_UNLINK(qu
->ads
->childw
,parent
);
608 qu
->ctx
.callback(parent
,qu
);
609 free_query_allocs(qu
);
614 LIST_LINK_TAIL(qu
->ads
->output
,qu
);
615 qu
->state
= query_done
;
619 void adns__query_fail(adns_query qu
, adns_status stat
) {
620 adns__reset_preserved(qu
);
621 qu
->answer
->status
= stat
;
622 adns__query_done(qu
);
625 void adns__makefinal_str(adns_query qu
, char **strp
) {
627 char *before
, *after
;
632 after
= adns__alloc_final(qu
,l
);
633 memcpy(after
,before
,l
);
637 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
) {
638 void *before
, *after
;
642 after
= adns__alloc_final(qu
,sz
);
643 memcpy(after
,before
,sz
);