3 * - declarations of private objects with external linkage (adns__*)
4 * - definitons of internal macros
5 * - comments regarding library data structures
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.
29 #ifndef ADNS_INTERNAL_H_INCLUDED
30 #define ADNS_INTERNAL_H_INCLUDED
33 typedef unsigned char byte
;
45 #define ADNS_FEATURE_MANYAF
49 #ifdef ADNS_REGRESS_TEST
50 # include "hredirect.h"
53 /* Configuration and constants */
56 #define MAXSORTLIST 15
57 #define UDPMAXRETRIES 15
58 #define UDPRETRYMS 2000
59 #define TCPWAITMS 30000
60 #define TCPCONNMS 14000
61 #define TCPIDLEMS 30000
62 #define MAXTTLBELIEVE (7*86400) /* any TTL > 7 days is capped */
65 #define DNS_MAXUDP 512
66 #define DNS_MAXLABEL 63
67 #define DNS_MAXDOMAIN 255
68 #define DNS_HDRSIZE 12
69 #define DNS_IDOFFSET 0
70 #define DNS_CLASS_IN 1
72 #define DNS_INADDR_ARPA "in-addr", "arpa"
73 #define DNS_IP6_ARPA "ip6", "arpa"
75 #define ADDR_MAXRRTYPES 2
77 #define STRINGIFY(x) REALLY_STRINGIFY(x)
78 #define REALLY_STRINGIFY(x) #x
80 #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED
98 adns__qf_senddirect
= 0x00100000,/* don't call the `query_send' type hook */
99 adns__qf_nosend
= 0x00200000,/* don't send the query when submitting */
100 adns__qf_addr_answer
= 0x01000000,/* addr query received an answer */
101 adns__qf_addr_cname
= 0x02000000 /* addr subquery performed on cname */
104 /* Shared data structures */
125 int dglen
, nsstart
, nscount
, arcount
;
141 const void *(*sockaddr_to_inaddr
)(const struct sockaddr
*sa
);
142 int (*sockaddr_equalp
)(const struct sockaddr
*sa
,
143 const struct sockaddr
*sb
);
144 void (*prefix_mask
)(int len
, union gen_addr
*a
);
145 int (*guess_len
)(const union gen_addr
*a
);
146 int (*matchp
)(const union gen_addr
*addr
,
147 const union gen_addr
*base
, const union gen_addr
*mask
);
148 int (*rev_parsecomp
)(const char *p
, size_t n
);
149 void (*rev_mkaddr
)(union gen_addr
*addr
, const byte
*ipv
);
150 char *(*rev_mkname
)(const struct sockaddr
*sa
, char *buf
);
153 struct afinfo_addr
{ const afinfo
*ai
; union gen_addr addr
; };
155 typedef struct typeinfo
{
161 void (*makefinal
)(adns_query qu
, void *data
);
162 /* Change memory management of *data.
163 * Previously, used alloc_interim, now use alloc_final.
166 adns_status (*convstring
)(vbuf
*vb
, const void *data
);
167 /* Converts the RR data to a string representation in vbuf.
168 * vbuf will be appended to (it must have been initialised),
169 * and will not be null-terminated by convstring.
172 adns_status (*parse
)(const parseinfo
*pai
, int cbyte
,
173 int max
, void *store_r
);
174 /* Parse one RR, in dgram of length dglen, starting at cbyte and
175 * extending until at most max.
177 * The RR should be stored at *store_r, of length qu->typei->rrsz.
179 * If there is an overrun which might indicate truncation, it should set
180 * *rdstart to -1; otherwise it may set it to anything else positive.
182 * nsstart is the offset of the authority section.
185 int (*diff_needswap
)(adns_state ads
,const void *datap_a
,const void *datap_b
);
186 /* Returns !0 if RR a should be strictly after RR b in the sort order,
187 * 0 otherwise. Must not fail.
190 adns_status (*qdparselabel
)(adns_state ads
,
191 const char **p_io
, const char *pe
, int labelnum
,
192 char label_r
[DNS_MAXDOMAIN
], int *ll_io
,
193 adns_queryflags flags
,
194 const struct typeinfo
*typei
);
195 /* Parses one label from the query domain string. On entry, *p_io
196 * points to the next character to parse and *ll_io is the size of
197 * the buffer. pe points just after the end of the query domain
198 * string. On successful return, label_r[] and *ll_io are filled in
199 * and *p_io points to *pe or just after the label-ending `.'. */
201 void (*postsort
)(adns_state ads
, void *array
, int nrrs
,
202 const struct typeinfo
*typei
);
203 /* Called immediately after the RRs have been sorted, and may rearrange
204 * them. (This is really for the benefit of SRV's bizarre weighting
205 * stuff.) May be 0 to mean nothing needs to be done.
208 int (*getrrsz
)(adns_rrtype type
);
209 /* Return the output resource-record element size; if this is null, then
210 * the rrsz member can be used.
213 void (*query_send
)(adns_query qu
, struct timeval now
);
214 /* Send the query to nameservers, and hook it into the appropriate queue.
215 * Normal behaviour is to call adns__query_send, but this can be overridden
216 * for special effects.
220 adns_status
adns__qdpl_normal(adns_state ads
,
221 const char **p_io
, const char *pe
, int labelnum
,
222 char label_r
[], int *ll_io
,
223 adns_queryflags flags
,
224 const typeinfo
*typei
);
225 /* implemented in transmit.c, used by types.c as default
226 * and as part of implementation for some fancier types */
228 typedef struct allocnode
{
229 struct allocnode
*next
, *back
;
244 void (*callback
)(adns_query parent
, adns_query child
);
246 struct afinfo_addr ptr_parent_addr
;
247 adns_rr_hostaddr
*hostaddr
;
253 enum { query_tosend
, query_tcpw
, query_childw
, query_done
} state
;
254 adns_query back
, next
, parent
;
255 struct { adns_query head
, tail
; } children
;
256 struct { adns_query back
, next
; } siblings
;
257 struct { allocnode
*head
, *tail
; } allocations
;
258 int interim_allocd
, preserved_allocd
;
259 void *final_allocspace
;
261 const typeinfo
*typei
;
266 /* General-purpose messing-about buffer.
267 * Wherever a `big' interface is crossed, this may be corrupted/changed
268 * unless otherwise specified.
272 /* This is allocated when a query is submitted, to avoid being unable
273 * to relate errors to queries if we run out of memory. During
274 * query processing status, rrs is 0. cname is set if
275 * we found a cname (this corresponds to cname_dgram in the query
276 * structure). type is set from the word go. nrrs and rrs
277 * are set together, when we find how many rrs there are.
278 * owner is set during querying unless we're doing searchlist,
279 * in which case it is set only when we find an answer.
283 int cname_dglen
, cname_begin
;
284 /* If non-0, has been allocated using . */
287 int search_origlen
, search_pos
, search_doneabs
;
288 /* Used by the searching algorithm. The query domain in textual form
289 * is copied into the vbuf, and _origlen set to its length. Then
290 * we walk the searchlist, if we want to. _pos says where we are
291 * (next entry to try), and _doneabs says whether we've done the
292 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
293 * but not done yet). If flags doesn't have adns_qf_search then
294 * the vbuf is initialised but empty and everything else is zero.
297 int id
, flags
, retries
;
299 unsigned long udpsent
; /* bitmap indexed by server */
300 struct timeval timeout
;
301 time_t expires
; /* Earliest expiry time of any record we used. */
305 size_t nrrty
, onrrty
;
306 adns_rrtype rrty
[ADDR_MAXRRTYPES
];
308 } t
; /* type-specific state */
314 * state Queue child id nextudpserver udpsent tcpfailed
316 * tosend NONE null >=0 0 zero zero
317 * tosend udpw null >=0 any nonzero zero
318 * tosend NONE null >=0 any nonzero zero
320 * tcpw tcpw null >=0 irrelevant any any
322 * child childw set >=0 irrelevant irrelevant irrelevant
323 * child NONE null >=0 irrelevant irrelevant irrelevant
324 * done output null -1 irrelevant irrelevant irrelevant
326 * Queries are only not on a queue when they are actually being processed.
327 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
328 * iff the tcp connection is in state server_ok.
330 * +------------------------+
331 * START -----> | tosend/NONE |
332 * +------------------------+
334 * too big for UDP / UDP timeout \ \ send via UDP
335 * send via TCP / more retries \ \
336 * when conn'd / desired \ \
339 * +-----------+ +-------------+
340 * | tcpw/tcpw | ________ | tosend/udpw |
341 * +-----------+ \ +-------------+
342 * | | | UDP timeout | |
345 * \ | TCP died | desired | |
347 * \ \ servers | TCP / |
348 * \ \ to try | timeout / |
350 * reply \ _| +------------------+ / reply
351 * \ | done/output FAIL | /
352 * \ +------------------+ /
355 * (..... got reply ....)
357 * need child query/ies / \ no child query
360 * +---------------+ +----------------+
361 * | childw/childw | ----------------> | done/output OK |
362 * +---------------+ children done +----------------+
366 struct query_queue
{ adns_query head
, tail
; };
371 adns_initflags iflags
;
372 adns_logcallbackfn
*logfn
;
375 struct query_queue udpw
, tcpw
, childw
, output
;
376 adns_query forallnext
;
377 int nextid
, tcpsocket
;
378 struct udpsocket
{ const afinfo
*ai
; int fd
; } udpsocket
[MAXUDP
];
380 vbuf tcpsend
, tcprecv
;
381 int nservers
, nsortlist
, nsearchlist
, searchndots
, tcpserver
, tcprecv_skip
;
382 enum adns__tcpstate
{
383 server_disconnected
, server_connecting
,
384 server_ok
, server_broken
386 struct timeval tcptimeout
;
387 /* This will have tv_sec==0 if it is not valid. It will always be
388 * valid if tcpstate _connecting. When _ok, it will be nonzero if
389 * we are idle (ie, tcpw queue is empty), in which case it is the
390 * absolute time when we will close the connection.
392 struct sigaction stdsigpipe
;
394 struct pollfd pollfds_buf
[MAX_POLLFDS
];
395 adns_rr_addr servers
[MAXSERVERS
];
398 union gen_addr base
, mask
;
399 } sortlist
[MAXSORTLIST
];
401 unsigned short rand48xsubi
[3];
404 /* From addrfam.c: */
406 extern const afinfo adns__inet_afinfo
, adns__inet6_afinfo
;
410 int adns__setnonblock(adns_state ads
, int fd
); /* => errno value */
412 /* From general.c: */
414 const char *adns__sockaddr_ntoa(struct sockaddr
*sa
, size_t n
);
415 void adns__vlprintf(adns_state ads
, const char *fmt
, va_list al
);
416 void adns__lprintf(adns_state ads
, const char *fmt
,
417 ...) PRINTFFORMAT(2,3);
419 void adns__vdiag(adns_state ads
, const char *pfx
, adns_initflags prevent
,
420 int serv
, adns_query qu
, const char *fmt
, va_list al
);
422 void adns__debug(adns_state ads
, int serv
, adns_query qu
,
423 const char *fmt
, ...) PRINTFFORMAT(4,5);
424 void adns__warn(adns_state ads
, int serv
, adns_query qu
,
425 const char *fmt
, ...) PRINTFFORMAT(4,5);
426 void adns__diag(adns_state ads
, int serv
, adns_query qu
,
427 const char *fmt
, ...) PRINTFFORMAT(4,5);
429 int adns__vbuf_ensure(vbuf
*vb
, int want
);
430 int adns__vbuf_appendstr(vbuf
*vb
, const char *data
); /* doesn't include nul */
431 int adns__vbuf_append(vbuf
*vb
, const byte
*data
, int len
);
432 /* 1=>success, 0=>realloc failed */
433 void adns__vbuf_appendq(vbuf
*vb
, const byte
*data
, int len
);
434 void adns__vbuf_init(vbuf
*vb
);
435 void adns__vbuf_free(vbuf
*vb
);
437 const char *adns__diag_domain(adns_state ads
, int serv
, adns_query qu
,
439 const byte
*dgram
, int dglen
, int cbyte
);
440 /* Unpicks a domain in a datagram and returns a string suitable for
441 * printing it as. Never fails - if an error occurs, it will
442 * return some kind of string describing the error.
444 * serv may be -1 and qu may be 0. vb must have been initialised,
445 * and will be left in an arbitrary consistent state.
447 * Returns either vb->buf, or a pointer to a string literal. Do not modify
448 * vb before using the return value.
451 void adns__isort(void *array
, int nobjs
, int sz
, void *tempbuf
,
452 int (*needswap
)(void *context
, const void *a
, const void *b
),
454 /* Does an insertion sort of array which must contain nobjs objects
455 * each sz bytes long. tempbuf must point to a buffer at least
456 * sz bytes long. needswap should return !0 if a>b (strictly, ie
457 * wrong order) 0 if a<=b (ie, order is fine).
460 void adns__sigpipe_protect(adns_state
);
461 void adns__sigpipe_unprotect(adns_state
);
462 /* If SIGPIPE protection is not disabled, will block all signals except
463 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
464 * Each call to _protect must be followed by a call to _unprotect before
465 * any significant amount of code gets to run, since the old signal mask
466 * is stored in the adns structure.
469 /* From transmit.c: */
471 adns_status
adns__mkquery(adns_state ads
, vbuf
*vb
, int *id_r
,
472 const char *owner
, int ol
,
473 const typeinfo
*typei
, adns_rrtype type
,
474 adns_queryflags flags
);
475 /* Assembles a query packet in vb. A new id is allocated and returned.
478 adns_status
adns__mkquery_frdgram(adns_state ads
, vbuf
*vb
, int *id_r
,
479 const byte
*qd_dgram
, int qd_dglen
,
481 adns_rrtype type
, adns_queryflags flags
);
482 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
483 * That domain must be correct and untruncated.
486 void adns__querysend_tcp(adns_query qu
, struct timeval now
);
487 /* Query must be in state tcpw/tcpw; it will be sent if possible and
488 * no further processing can be done on it for now. The connection
489 * might be broken, but no reconnect will be attempted.
492 void adns__query_send(adns_query qu
, struct timeval now
);
493 /* Query must be in state tosend/NONE; it will be moved to a new state,
494 * and no further processing can be done on it for now.
495 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
496 * connected), tcpsent/timew, child/childw or done/output.)
497 * __query_send may decide to use either UDP or TCP depending whether
498 * _qf_usevc is set (or has become set) and whether the query is too
504 adns_status
adns__internal_submit(adns_state ads
, adns_query
*query_r
,
505 const typeinfo
*typei
, adns_rrtype
,
506 vbuf
*qumsg_vb
, int id
,
507 adns_queryflags flags
, struct timeval now
,
508 const qcontext
*ctx
);
509 /* Submits a query (for internal use, called during external submits).
511 * The new query is returned in *query_r, or we return adns_s_nomemory.
513 * The query datagram should already have been assembled in qumsg_vb;
514 * the memory for it is _taken over_ by this routine whether it
515 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
517 * If adns__qf_nosend is set in flags, then the query is not sent: doing
518 * whatever is necessary to send the query and link it onto the appropriate
519 * queue is left as the caller's responsibility.
521 * *ctx is copied byte-for-byte into the query.
523 * When the child query is done, ctx->callback will be called. The
524 * child will already have been taken off both the global list of
525 * queries in ads and the list of children in the parent. The child
526 * will be freed when the callback returns. The parent will have been
527 * taken off the global childw queue.
529 * The callback should either call adns__query_done, if it is
530 * complete, or adns__query_fail, if an error has occurred, in which
531 * case the other children (if any) will be cancelled. If the parent
532 * has more unfinished children (or has just submitted more) then the
533 * callback may choose to wait for them - it must then put the parent
534 * back on the childw queue.
537 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
);
538 /* Walks down the searchlist for a query with adns_qf_search.
539 * The query should have just had a negative response, or not had
540 * any queries sent yet, and should not be on any queue.
541 * The query_dgram if any will be freed and forgotten and a new
542 * one constructed from the search_* members of the query.
544 * Cannot fail (in case of error, calls adns__query_fail).
547 void *adns__alloc_interim(adns_query qu
, size_t sz
);
548 void *adns__alloc_preserved(adns_query qu
, size_t sz
);
549 /* Allocates some memory, and records which query it came from
550 * and how much there was.
552 * If an error occurs in the query, all the memory from _interim is
553 * simply freed. If the query succeeds, one large buffer will be made
554 * which is big enough for all these allocations, and then
555 * adns__alloc_final will get memory from this buffer.
557 * _alloc_interim can fail (and return 0).
558 * The caller must ensure that the query is failed.
560 * The memory from _preserved is is kept and transferred into the
561 * larger buffer - unless we run out of memory, in which case it too
562 * is freed. When you use _preserved you have to add code to the
563 * x_nomem error exit case in adns__makefinal_query to clear out the
564 * pointers you made to those allocations, because that's when they're
565 * thrown away; you should also make a note in the declaration of
566 * those pointer variables, to note that they are _preserved rather
567 * than _interim. If they're in the answer, note it here:
568 * answer->cname and answer->owner are _preserved.
571 void adns__transfer_interim(adns_query from
, adns_query to
, void *block
);
572 /* Transfers an interim allocation from one query to another, so that
573 * the `to' query will have room for the data when we get to makefinal
574 * and so that the free will happen when the `to' query is freed
575 * rather than the `from' query.
577 * It is legal to call adns__transfer_interim with a null pointer; this
580 * _transfer_interim also ensures that the expiry time of the `to' query
581 * is no later than that of the `from' query, so that child queries'
582 * TTLs get inherited by their parents.
585 void adns__free_interim(adns_query qu
, void *p
);
586 /* Forget about a block allocated by adns__alloc_interim.
589 void *adns__alloc_mine(adns_query qu
, size_t sz
);
590 /* Like _interim, but does not record the length for later
591 * copying into the answer. This just ensures that the memory
592 * will be freed when we're done with the query.
595 void *adns__alloc_final(adns_query qu
, size_t sz
);
596 /* Cannot fail, and cannot return 0.
599 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
);
600 void adns__makefinal_str(adns_query qu
, char **strp
);
602 void adns__reset_preserved(adns_query qu
);
603 /* Resets all of the memory management stuff etc. to take account of
604 * only the _preserved stuff from _alloc_preserved. Used when we find
605 * an error somewhere and want to just report the error (with perhaps
606 * CNAME, owner, etc. info), and also when we're halfway through RRs
607 * in a datagram and discover that we need to retry the query.
610 void adns__query_done(adns_query qu
);
611 void adns__query_fail(adns_query qu
, adns_status stat
);
612 void adns__cancel_children(adns_query qu
);
616 void adns__procdgram(adns_state ads
, const byte
*dgram
, int len
,
617 int serv
, int viatcp
, struct timeval now
);
618 /* This function is allowed to cause new datagrams to be constructed
619 * and sent, or even new queries to be started. However,
620 * query-sending functions are not allowed to call any general event
621 * loop functions in case they accidentally call this.
623 * Ie, receiving functions may call sending functions.
624 * Sending functions may NOT call receiving functions.
629 const typeinfo
*adns__findtype(adns_rrtype type
);
638 int dglen
, max
, cbyte
, namelen
;
642 void adns__findlabel_start(findlabel_state
*fls
, adns_state ads
,
643 int serv
, adns_query qu
,
644 const byte
*dgram
, int dglen
, int max
,
645 int dmbegin
, int *dmend_rlater
);
646 /* Finds labels in a domain in a datagram.
648 * Call this routine first.
649 * dmend_rlater may be null. ads (and of course fls) may not be.
650 * serv may be -1, qu may be null - they are for error reporting.
653 adns_status
adns__findlabel_next(findlabel_state
*fls
,
654 int *lablen_r
, int *labstart_r
);
655 /* Then, call this one repeatedly.
657 * It will return adns_s_ok if all is well, and tell you the length
658 * and start of successive labels. labstart_r may be null, but
659 * lablen_r must not be.
661 * After the last label, it will return with *lablen_r zero.
662 * Do not then call it again; instead, just throw away the findlabel_state.
664 * *dmend_rlater will have been set to point to the next part of
665 * the datagram after the label (or after the uncompressed part,
666 * if compression was used). *namelen_rlater will have been set
667 * to the length of the domain name (total length of labels plus
668 * 1 for each intervening dot).
670 * If the datagram appears to be truncated, *lablen_r will be -1.
671 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
672 * Do not call _next again.
674 * There may also be errors, in which case *dmend_rlater,
675 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
676 * Do not then call findlabel_next again.
683 adns_status
adns__parse_domain(adns_state ads
, int serv
, adns_query qu
,
684 vbuf
*vb
, parsedomain_flags flags
,
685 const byte
*dgram
, int dglen
, int *cbyte_io
,
687 /* vb must already have been initialised; it will be reset if necessary.
688 * If there is truncation, vb->used will be set to 0; otherwise
689 * (if there is no error) vb will be null-terminated.
690 * If there is an error vb and *cbyte_io may be left indeterminate.
692 * serv may be -1 and qu may be 0 - they are used for error reporting only.
695 adns_status
adns__parse_domain_more(findlabel_state
*fls
, adns_state ads
,
696 adns_query qu
, vbuf
*vb
,
697 parsedomain_flags flags
,
699 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
700 * for continuing an existing domain or some such of some kind. Also, unlike
701 * _parse_domain, the domain data will be appended to vb, rather than replacing
702 * the existing contents.
705 adns_status
adns__findrr(adns_query qu
, int serv
,
706 const byte
*dgram
, int dglen
, int *cbyte_io
,
707 int *type_r
, int *class_r
, unsigned long *ttl_r
,
708 int *rdlen_r
, int *rdstart_r
,
709 int *ownermatchedquery_r
);
710 /* Finds the extent and some of the contents of an RR in a datagram
711 * and does some checks. The datagram is *dgram, length dglen, and
712 * the RR starts at *cbyte_io (which is updated afterwards to point
713 * to the end of the RR).
715 * The type, class, TTL and RRdata length and start are returned iff
716 * the corresponding pointer variables are not null. type_r, class_r
717 * and ttl_r may not be null. The TTL will be capped.
719 * If ownermatchedquery_r != 0 then the owner domain of this
720 * RR will be compared with that in the query (or, if the query
721 * has gone to a CNAME lookup, with the canonical name).
722 * In this case, *ownermatchedquery_r will be set to 0 or 1.
723 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
725 * If there is truncation then *type_r will be set to -1 and
726 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
729 * qu must obviously be non-null.
731 * If an error is returned then *type_r will be undefined too.
734 adns_status
adns__findrr_anychk(adns_query qu
, int serv
,
735 const byte
*dgram
, int dglen
, int *cbyte_io
,
736 int *type_r
, int *class_r
,
737 unsigned long *ttl_r
,
738 int *rdlen_r
, int *rdstart_r
,
739 const byte
*eo_dgram
, int eo_dglen
,
740 int eo_cbyte
, int *eo_matched_r
);
741 /* Like adns__findrr_checked, except that the datagram and
742 * owner to compare with can be specified explicitly.
744 * If the caller thinks they know what the owner of the RR ought to
745 * be they can pass in details in eo_*: this is another (or perhaps
746 * the same datagram), and a pointer to where the putative owner
747 * starts in that datagram. In this case *eo_matched_r will be set
748 * to 1 if the datagram matched or 0 if it did not. Either
749 * both eo_dgram and eo_matched_r must both be non-null, or they
750 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
751 * The eo datagram and contained owner domain MUST be valid and
755 void adns__update_expires(adns_query qu
, unsigned long ttl
,
757 /* Updates the `expires' field in the query, so that it doesn't exceed
761 int vbuf__append_quoted1035(vbuf
*vb
, const byte
*buf
, int len
);
765 void adns__tcp_broken(adns_state ads
, const char *what
, const char *why
);
766 /* what and why may be both 0, or both non-0. */
768 void adns__tcp_tryconnect(adns_state ads
, struct timeval now
);
770 void adns__autosys(adns_state ads
, struct timeval now
);
771 /* Make all the system calls we want to if the application wants us to.
772 * Must not be called from within adns internal processing functions,
773 * lest we end up in recursive descent !
776 void adns__must_gettimeofday(adns_state ads
, const struct timeval
**now_io
,
777 struct timeval
*tv_buf
);
779 int adns__pollfds(adns_state ads
, struct pollfd pollfds_buf
[MAX_POLLFDS
]);
780 void adns__fdevents(adns_state ads
,
781 const struct pollfd
*pollfds
, int npollfds
,
782 int maxfd
, const fd_set
*readfds
,
783 const fd_set
*writefds
, const fd_set
*exceptfds
,
784 struct timeval now
, int *r_r
);
785 int adns__internal_check(adns_state ads
,
786 adns_query
*query_io
,
787 adns_answer
**answer
,
790 void adns__timeouts(adns_state ads
, int act
,
791 struct timeval
**tv_io
, struct timeval
*tvbuf
,
793 /* If act is !0, then this will also deal with the TCP connection
794 * if previous events broke it or require it to be connected.
799 void adns__consistency(adns_state ads
, adns_query qu
, consistency_checks cc
);
801 /* Useful static inline functions: */
803 static inline int ctype_whitespace(int c
) {
804 return c
==' ' || c
=='\n' || c
=='\t';
806 static inline int ctype_digit(int c
) { return c
>='0' && c
<='9'; }
807 static inline int ctype_alpha(int c
) {
808 return (c
>= 'a' && c
<= 'z') || (c
>= 'A' && c
<= 'Z');
810 static inline int ctype_822special(int c
) {
811 return strchr("()<>@,;:\\\".[]",c
) != 0;
813 static inline int ctype_domainunquoted(int c
) {
814 return ctype_alpha(c
) || ctype_digit(c
) || (strchr("-_/+",c
) != 0);
817 static inline int errno_resources(int e
) { return e
==ENOMEM
|| e
==ENOBUFS
; }
821 #define MEM_ROUND(sz) \
822 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
823 * sizeof(union maxalign) )
825 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
826 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
827 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
828 #define GET_L(cb,tv) ( (tv)=0, \
829 (tv)|=(GETIL_B((cb))<<24), \
830 (tv)|=(GETIL_B((cb))<<16), \
831 (tv)|=(GETIL_B((cb))<<8), \