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
->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
,typei
->typekey
,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
,
137 typei
,qu
->answer
->type
, flags
);
139 if (stat
== adns_s_querydomaintoolong
&& (flags
& adns_qf_search
)) {
140 adns__search_next(ads
,qu
,now
);
143 adns__query_fail(qu
,stat
);
149 adns__vbuf_init(&qu
->vb
);
150 query_submit(ads
,qu
, typei
,&vb_new
,id
, flags
,now
);
153 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
) {
154 const char *nextentry
;
157 if (qu
->search_doneabs
<0) {
159 qu
->search_doneabs
= 1;
161 if (qu
->search_pos
>= ads
->nsearchlist
) {
162 if (qu
->search_doneabs
) {
163 qu
->search_vb
.used
= qu
->search_origlen
;
164 stat
= adns_s_nxdomain
; goto x_fail
;
167 qu
->search_doneabs
= 1;
170 nextentry
= ads
->searchlist
[qu
->search_pos
++];
174 qu
->search_vb
.used
= qu
->search_origlen
;
176 if (!adns__vbuf_append(&qu
->search_vb
,".",1) ||
177 !adns__vbuf_appendstr(&qu
->search_vb
,nextentry
))
181 free(qu
->query_dgram
);
182 qu
->query_dgram
= 0; qu
->query_dglen
= 0;
184 query_simple(ads
,qu
, qu
->search_vb
.buf
, qu
->search_vb
.used
,
185 qu
->typei
, qu
->flags
, now
);
189 stat
= adns_s_nomemory
;
191 adns__query_fail(qu
,stat
);
194 static int save_owner(adns_query qu
, const char *owner
, int ol
) {
195 /* Returns 1 if OK, otherwise there was no memory. */
198 if (!(qu
->flags
& adns_qf_owner
)) return 1;
203 ans
->owner
= adns__alloc_preserved(qu
,ol
+1); if (!ans
->owner
) return 0;
205 memcpy(ans
->owner
,owner
,ol
);
210 int adns_submit(adns_state ads
,
213 adns_queryflags flags
,
215 adns_query
*query_r
) {
218 const typeinfo
*typei
;
223 adns__consistency(ads
,0,cc_entex
);
225 typei
= adns__findtype(type
);
226 if (!typei
) return ENOSYS
;
228 r
= gettimeofday(&now
,0); if (r
) goto x_errno
;
229 qu
= query_alloc(ads
,typei
,type
,flags
,now
); if (!qu
) goto x_errno
;
231 qu
->ctx
.ext
= context
;
233 memset(&qu
->ctx
.info
,0,sizeof(qu
->ctx
.info
));
238 if (!ol
) { stat
= adns_s_querydomaininvalid
; goto x_adnsfail
; }
239 if (ol
>DNS_MAXDOMAIN
+1) { stat
= adns_s_querydomaintoolong
; goto x_adnsfail
; }
241 if (ol
>=1 && owner
[ol
-1]=='.' && (ol
<2 || owner
[ol
-2]!='\\')) {
242 flags
&= ~adns_qf_search
;
247 if (flags
& adns_qf_search
) {
248 r
= adns__vbuf_append(&qu
->search_vb
,owner
,ol
);
249 if (!r
) { stat
= adns_s_nomemory
; goto x_adnsfail
; }
251 for (ndots
=0, p
=owner
; (p
= strchr(p
,'.')); p
++, ndots
++);
252 qu
->search_doneabs
= (ndots
>= ads
->searchndots
) ?
-1 : 0;
253 qu
->search_origlen
= ol
;
254 adns__search_next(ads
,qu
,now
);
256 if (flags
& adns_qf_owner
) {
257 if (!save_owner(qu
,owner
,ol
)) { stat
= adns_s_nomemory
; goto x_adnsfail
; }
259 query_simple(ads
,qu
, owner
,ol
, typei
,flags
, now
);
261 adns__autosys(ads
,now
);
262 adns__consistency(ads
,qu
,cc_entex
);
266 adns__query_fail(qu
,stat
);
267 adns__consistency(ads
,qu
,cc_entex
);
273 adns__consistency(ads
,0,cc_entex
);
277 int adns_submit_reverse_any(adns_state ads
,
278 const struct sockaddr
*addr
,
281 adns_queryflags flags
,
283 adns_query
*query_r
) {
284 const unsigned char *iaddr
;
285 char *buf
, *buf_free
;
289 flags
&= ~adns_qf_search
;
291 if (addr
->sa_family
!= AF_INET
) return ENOSYS
;
292 iaddr
= (const unsigned char*)
293 &(((const struct sockaddr_in
*)addr
) -> sin_addr
);
295 lreq
= strlen(zone
) + 4*4 + 1;
296 if (lreq
> sizeof(shortbuf
)) {
297 buf
= malloc(strlen(zone
) + 4*4 + 1);
298 if (!buf
) return errno
;
304 sprintf(buf
, "%d.%d.%d.%d.%s", iaddr
[3], iaddr
[2], iaddr
[1], iaddr
[0], zone
);
306 r
= adns_submit(ads
,buf
,type
,flags
,context
,query_r
);
311 int adns_submit_reverse(adns_state ads
,
312 const struct sockaddr
*addr
,
314 adns_queryflags flags
,
316 adns_query
*query_r
) {
317 if (type
!= adns_r_ptr
&& type
!= adns_r_ptr_raw
) return EINVAL
;
318 return adns_submit_reverse_any(ads
,addr
,"in-addr.arpa",
319 type
,flags
,context
,query_r
);
322 int adns_synchronous(adns_state ads
,
325 adns_queryflags flags
,
326 adns_answer
**answer_r
) {
330 r
= adns_submit(ads
,owner
,type
,flags
,0,&qu
);
333 r
= adns_wait(ads
,&qu
,answer_r
,0);
334 if (r
) adns_cancel(qu
);
339 static void *alloc_common(adns_query qu
, size_t sz
) {
342 if (!sz
) return qu
; /* Any old pointer will do */
343 assert(!qu
->final_allocspace
);
344 an
= malloc(MEM_ROUND(MEM_ROUND(sizeof(*an
)) + sz
));
346 LIST_LINK_TAIL(qu
->allocations
,an
);
347 return (byte
*)an
+ MEM_ROUND(sizeof(*an
));
350 void *adns__alloc_interim(adns_query qu
, size_t sz
) {
354 rv
= alloc_common(qu
,sz
);
356 qu
->interim_allocd
+= sz
;
360 void *adns__alloc_preserved(adns_query qu
, size_t sz
) {
364 rv
= adns__alloc_interim(qu
,sz
);
366 qu
->preserved_allocd
+= sz
;
370 void *adns__alloc_mine(adns_query qu
, size_t sz
) {
371 return alloc_common(qu
,MEM_ROUND(sz
));
374 void adns__transfer_interim(adns_query from
, adns_query to
,
375 void *block
, size_t sz
) {
379 an
= (void*)((byte
*)block
- MEM_ROUND(sizeof(*an
)));
381 assert(!to
->final_allocspace
);
382 assert(!from
->final_allocspace
);
384 LIST_UNLINK(from
->allocations
,an
);
385 LIST_LINK_TAIL(to
->allocations
,an
);
388 from
->interim_allocd
-= sz
;
389 to
->interim_allocd
+= sz
;
391 if (to
->expires
> from
->expires
) to
->expires
= from
->expires
;
394 void *adns__alloc_final(adns_query qu
, size_t sz
) {
395 /* When we're in the _final stage, we _subtract_ from interim_alloc'd
396 * each allocation, and use final_allocspace to point to the next free
402 rp
= qu
->final_allocspace
;
404 qu
->interim_allocd
-= sz
;
405 assert(qu
->interim_allocd
>=0);
406 qu
->final_allocspace
= (byte
*)rp
+ sz
;
410 static void cancel_children(adns_query qu
) {
411 adns_query cqu
, ncqu
;
413 for (cqu
= qu
->children
.head
; cqu
; cqu
= ncqu
) {
414 ncqu
= cqu
->siblings
.next
;
419 void adns__reset_preserved(adns_query qu
) {
420 assert(!qu
->final_allocspace
);
423 qu
->answer
->rrs
.untyped
= 0;
424 qu
->interim_allocd
= qu
->preserved_allocd
;
427 static void free_query_allocs(adns_query qu
) {
431 for (an
= qu
->allocations
.head
; an
; an
= ann
) { ann
= an
->next
; free(an
); }
432 LIST_INIT(qu
->allocations
);
433 adns__vbuf_free(&qu
->vb
);
434 adns__vbuf_free(&qu
->search_vb
);
435 free(qu
->query_dgram
);
439 void adns_cancel(adns_query qu
) {
443 adns__consistency(ads
,qu
,cc_entex
);
444 if (qu
->parent
) LIST_UNLINK_PART(qu
->parent
->children
,qu
,siblings
.);
447 LIST_UNLINK(ads
->udpw
,qu
);
450 LIST_UNLINK(ads
->tcpw
,qu
);
453 LIST_UNLINK(ads
->childw
,qu
);
456 LIST_UNLINK(ads
->output
,qu
);
461 free_query_allocs(qu
);
464 adns__consistency(ads
,0,cc_entex
);
467 void adns__update_expires(adns_query qu
, unsigned long ttl
,
468 struct timeval now
) {
471 assert(ttl
<= MAXTTLBELIEVE
);
472 max
= now
.tv_sec
+ ttl
;
473 if (qu
->expires
< max
) return;
477 static void makefinal_query(adns_query qu
) {
483 if (qu
->interim_allocd
) {
484 ans
= realloc(qu
->answer
,
485 MEM_ROUND(MEM_ROUND(sizeof(*ans
)) + qu
->interim_allocd
));
486 if (!ans
) goto x_nomem
;
490 qu
->final_allocspace
= (byte
*)ans
+ MEM_ROUND(sizeof(*ans
));
491 adns__makefinal_str(qu
,&ans
->cname
);
492 adns__makefinal_str(qu
,&ans
->owner
);
495 adns__makefinal_block(qu
, &ans
->rrs
.untyped
, ans
->nrrs
*ans
->rrsz
);
497 for (rrn
=0; rrn
<ans
->nrrs
; rrn
++)
498 qu
->typei
->makefinal(qu
, ans
->rrs
.bytes
+ rrn
*ans
->rrsz
);
501 free_query_allocs(qu
);
505 qu
->preserved_allocd
= 0;
506 qu
->answer
->cname
= 0;
507 qu
->answer
->owner
= 0;
508 adns__reset_preserved(qu
); /* (but we just threw away the preserved stuff) */
510 qu
->answer
->status
= adns_s_nomemory
;
511 free_query_allocs(qu
);
514 void adns__query_done(adns_query qu
) {
523 if (qu
->flags
& adns_qf_search
&& ans
->status
!= adns_s_nomemory
) {
524 if (!save_owner(qu
, qu
->search_vb
.buf
, qu
->search_vb
.used
)) {
525 adns__query_fail(qu
,adns_s_nomemory
);
530 if (ans
->nrrs
&& qu
->typei
->diff_needswap
) {
531 if (!adns__vbuf_ensure(&qu
->vb
,qu
->typei
->rrsz
)) {
532 adns__query_fail(qu
,adns_s_nomemory
);
535 adns__isort(ans
->rrs
.bytes
, ans
->nrrs
, ans
->rrsz
,
537 (int(*)(void*, const void*, const void*))
538 qu
->typei
->diff_needswap
,
541 if (ans
->nrrs
&& qu
->typei
->postsort
) {
542 qu
->typei
->postsort(qu
->ads
, ans
->rrs
.bytes
, ans
->nrrs
, qu
->typei
);
545 ans
->expires
= qu
->expires
;
548 LIST_UNLINK_PART(parent
->children
,qu
,siblings
.);
549 LIST_UNLINK(qu
->ads
->childw
,parent
);
550 qu
->ctx
.callback(parent
,qu
);
551 free_query_allocs(qu
);
556 LIST_LINK_TAIL(qu
->ads
->output
,qu
);
557 qu
->state
= query_done
;
561 void adns__query_fail(adns_query qu
, adns_status stat
) {
562 adns__reset_preserved(qu
);
563 qu
->answer
->status
= stat
;
564 adns__query_done(qu
);
567 void adns__makefinal_str(adns_query qu
, char **strp
) {
569 char *before
, *after
;
574 after
= adns__alloc_final(qu
,l
);
575 memcpy(after
,before
,l
);
579 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
) {
580 void *before
, *after
;
584 after
= adns__alloc_final(qu
,sz
);
585 memcpy(after
,before
,sz
);