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
;
48 #ifdef ADNS_REGRESS_TEST
49 # include "hredirect.h"
52 /* Configuration and constants */
55 #define MAXSORTLIST 15
56 #define UDPMAXRETRIES 15
57 #define UDPRETRYMS 2000
58 #define TCPWAITMS 30000
59 #define TCPCONNMS 14000
60 #define TCPIDLEMS 30000
61 #define MAXTTLBELIEVE (7*86400) /* any TTL > 7 days is capped */
64 #define DNS_MAXUDP 512
65 #define DNS_MAXLABEL 63
66 #define DNS_MAXDOMAIN 255
67 #define DNS_HDRSIZE 12
68 #define DNS_IDOFFSET 0
69 #define DNS_CLASS_IN 1
71 #define DNS_INADDR_ARPA "in-addr", "arpa"
72 #define DNS_IP6_ARPA "ip6", "arpa"
74 #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED
91 /* Shared data structures */
112 int dglen
, nsstart
, nscount
, arcount
;
128 void *(*sockaddr_to_inaddr
)(struct sockaddr
*sa
);
129 void (*prefix_mask
)(int len
, union gen_addr
*a
);
130 int (*guess_len
)(const union gen_addr
*a
);
131 int (*matchp
)(const union gen_addr
*addr
,
132 const union gen_addr
*base
, const union gen_addr
*mask
);
133 int (*rev_parsecomp
)(const char *p
, size_t n
);
134 void (*rev_mkaddr
)(union gen_addr
*addr
, const byte
*ipv
);
135 char *(*rev_mkname
)(struct sockaddr
*sa
, char *buf
);
138 struct afinfo_addr
{ const afinfo
*ai
; union gen_addr addr
; };
140 typedef struct typeinfo
{
146 void (*makefinal
)(adns_query qu
, void *data
);
147 /* Change memory management of *data.
148 * Previously, used alloc_interim, now use alloc_final.
151 adns_status (*convstring
)(vbuf
*vb
, const void *data
);
152 /* Converts the RR data to a string representation in vbuf.
153 * vbuf will be appended to (it must have been initialised),
154 * and will not be null-terminated by convstring.
157 adns_status (*parse
)(const parseinfo
*pai
, int cbyte
,
158 int max
, void *store_r
);
159 /* Parse one RR, in dgram of length dglen, starting at cbyte and
160 * extending until at most max.
162 * The RR should be stored at *store_r, of length qu->typei->rrsz.
164 * If there is an overrun which might indicate truncation, it should set
165 * *rdstart to -1; otherwise it may set it to anything else positive.
167 * nsstart is the offset of the authority section.
170 int (*diff_needswap
)(adns_state ads
,const void *datap_a
,const void *datap_b
);
171 /* Returns !0 if RR a should be strictly after RR b in the sort order,
172 * 0 otherwise. Must not fail.
175 adns_status (*qdparselabel
)(adns_state ads
,
176 const char **p_io
, const char *pe
, int labelnum
,
177 char label_r
[DNS_MAXDOMAIN
], int *ll_io
,
178 adns_queryflags flags
,
179 const struct typeinfo
*typei
);
180 /* Parses one label from the query domain string. On entry, *p_io
181 * points to the next character to parse and *ll_io is the size of
182 * the buffer. pe points just after the end of the query domain
183 * string. On successful return, label_r[] and *ll_io are filled in
184 * and *p_io points to *pe or just after the label-ending `.'. */
186 void (*postsort
)(adns_state ads
, void *array
, int nrrs
,
187 const struct typeinfo
*typei
);
188 /* Called immediately after the RRs have been sorted, and may rearrange
189 * them. (This is really for the benefit of SRV's bizarre weighting
190 * stuff.) May be 0 to mean nothing needs to be done.
194 adns_status
adns__qdpl_normal(adns_state ads
,
195 const char **p_io
, const char *pe
, int labelnum
,
196 char label_r
[], int *ll_io
,
197 adns_queryflags flags
,
198 const typeinfo
*typei
);
199 /* implemented in transmit.c, used by types.c as default
200 * and as part of implementation for some fancier types */
202 typedef struct allocnode
{
203 struct allocnode
*next
, *back
;
217 void (*callback
)(adns_query parent
, adns_query child
);
219 struct afinfo_addr ptr_parent_addr
;
220 adns_rr_hostaddr
*hostaddr
;
226 enum { query_tosend
, query_tcpw
, query_childw
, query_done
} state
;
227 adns_query back
, next
, parent
;
228 struct { adns_query head
, tail
; } children
;
229 struct { adns_query back
, next
; } siblings
;
230 struct { allocnode
*head
, *tail
; } allocations
;
231 int interim_allocd
, preserved_allocd
;
232 void *final_allocspace
;
234 const typeinfo
*typei
;
239 /* General-purpose messing-about buffer.
240 * Wherever a `big' interface is crossed, this may be corrupted/changed
241 * unless otherwise specified.
245 /* This is allocated when a query is submitted, to avoid being unable
246 * to relate errors to queries if we run out of memory. During
247 * query processing status, rrs is 0. cname is set if
248 * we found a cname (this corresponds to cname_dgram in the query
249 * structure). type is set from the word go. nrrs and rrs
250 * are set together, when we find how many rrs there are.
251 * owner is set during querying unless we're doing searchlist,
252 * in which case it is set only when we find an answer.
256 int cname_dglen
, cname_begin
;
257 /* If non-0, has been allocated using . */
260 int search_origlen
, search_pos
, search_doneabs
;
261 /* Used by the searching algorithm. The query domain in textual form
262 * is copied into the vbuf, and _origlen set to its length. Then
263 * we walk the searchlist, if we want to. _pos says where we are
264 * (next entry to try), and _doneabs says whether we've done the
265 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
266 * but not done yet). If flags doesn't have adns_qf_search then
267 * the vbuf is initialised but empty and everything else is zero.
270 int id
, flags
, retries
;
272 unsigned long udpsent
; /* bitmap indexed by server */
273 struct timeval timeout
;
274 time_t expires
; /* Earliest expiry time of any record we used. */
280 * state Queue child id nextudpserver udpsent tcpfailed
282 * tosend NONE null >=0 0 zero zero
283 * tosend udpw null >=0 any nonzero zero
284 * tosend NONE null >=0 any nonzero zero
286 * tcpw tcpw null >=0 irrelevant any any
288 * child childw set >=0 irrelevant irrelevant irrelevant
289 * child NONE null >=0 irrelevant irrelevant irrelevant
290 * done output null -1 irrelevant irrelevant irrelevant
292 * Queries are only not on a queue when they are actually being processed.
293 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
294 * iff the tcp connection is in state server_ok.
296 * +------------------------+
297 * START -----> | tosend/NONE |
298 * +------------------------+
300 * too big for UDP / UDP timeout \ \ send via UDP
301 * send via TCP / more retries \ \
302 * when conn'd / desired \ \
305 * +-----------+ +-------------+
306 * | tcpw/tcpw | ________ | tosend/udpw |
307 * +-----------+ \ +-------------+
308 * | | | UDP timeout | |
311 * \ | TCP died | desired | |
313 * \ \ servers | TCP / |
314 * \ \ to try | timeout / |
316 * reply \ _| +------------------+ / reply
317 * \ | done/output FAIL | /
318 * \ +------------------+ /
321 * (..... got reply ....)
323 * need child query/ies / \ no child query
326 * +---------------+ +----------------+
327 * | childw/childw | ----------------> | done/output OK |
328 * +---------------+ children done +----------------+
332 struct query_queue
{ adns_query head
, tail
; };
335 adns_initflags iflags
;
336 adns_logcallbackfn
*logfn
;
339 struct query_queue udpw
, tcpw
, childw
, output
;
340 adns_query forallnext
;
341 int nextid
, udpsocket
, tcpsocket
;
342 vbuf tcpsend
, tcprecv
;
343 int nservers
, nsortlist
, nsearchlist
, searchndots
, tcpserver
, tcprecv_skip
;
344 enum adns__tcpstate
{
345 server_disconnected
, server_connecting
,
346 server_ok
, server_broken
348 struct timeval tcptimeout
;
349 /* This will have tv_sec==0 if it is not valid. It will always be
350 * valid if tcpstate _connecting. When _ok, it will be nonzero if
351 * we are idle (ie, tcpw queue is empty), in which case it is the
352 * absolute time when we will close the connection.
354 struct sigaction stdsigpipe
;
356 struct pollfd pollfds_buf
[MAX_POLLFDS
];
359 } servers
[MAXSERVERS
];
362 union gen_addr base
, mask
;
363 } sortlist
[MAXSORTLIST
];
365 unsigned short rand48xsubi
[3];
368 /* From addrfam.c: */
370 extern const afinfo adns__inet_afinfo
, adns__inet6_afinfo
;
374 int adns__setnonblock(adns_state ads
, int fd
); /* => errno value */
376 /* From general.c: */
378 void adns__vlprintf(adns_state ads
, const char *fmt
, va_list al
);
379 void adns__lprintf(adns_state ads
, const char *fmt
,
380 ...) PRINTFFORMAT(2,3);
382 void adns__vdiag(adns_state ads
, const char *pfx
, adns_initflags prevent
,
383 int serv
, adns_query qu
, const char *fmt
, va_list al
);
385 void adns__debug(adns_state ads
, int serv
, adns_query qu
,
386 const char *fmt
, ...) PRINTFFORMAT(4,5);
387 void adns__warn(adns_state ads
, int serv
, adns_query qu
,
388 const char *fmt
, ...) PRINTFFORMAT(4,5);
389 void adns__diag(adns_state ads
, int serv
, adns_query qu
,
390 const char *fmt
, ...) PRINTFFORMAT(4,5);
392 int adns__vbuf_ensure(vbuf
*vb
, int want
);
393 int adns__vbuf_appendstr(vbuf
*vb
, const char *data
); /* doesn't include nul */
394 int adns__vbuf_append(vbuf
*vb
, const byte
*data
, int len
);
395 /* 1=>success, 0=>realloc failed */
396 void adns__vbuf_appendq(vbuf
*vb
, const byte
*data
, int len
);
397 void adns__vbuf_init(vbuf
*vb
);
398 void adns__vbuf_free(vbuf
*vb
);
400 const char *adns__diag_domain(adns_state ads
, int serv
, adns_query qu
,
402 const byte
*dgram
, int dglen
, int cbyte
);
403 /* Unpicks a domain in a datagram and returns a string suitable for
404 * printing it as. Never fails - if an error occurs, it will
405 * return some kind of string describing the error.
407 * serv may be -1 and qu may be 0. vb must have been initialised,
408 * and will be left in an arbitrary consistent state.
410 * Returns either vb->buf, or a pointer to a string literal. Do not modify
411 * vb before using the return value.
414 void adns__isort(void *array
, int nobjs
, int sz
, void *tempbuf
,
415 int (*needswap
)(void *context
, const void *a
, const void *b
),
417 /* Does an insertion sort of array which must contain nobjs objects
418 * each sz bytes long. tempbuf must point to a buffer at least
419 * sz bytes long. needswap should return !0 if a>b (strictly, ie
420 * wrong order) 0 if a<=b (ie, order is fine).
423 void adns__sigpipe_protect(adns_state
);
424 void adns__sigpipe_unprotect(adns_state
);
425 /* If SIGPIPE protection is not disabled, will block all signals except
426 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
427 * Each call to _protect must be followed by a call to _unprotect before
428 * any significant amount of code gets to run, since the old signal mask
429 * is stored in the adns structure.
432 /* From transmit.c: */
434 adns_status
adns__mkquery(adns_state ads
, vbuf
*vb
, int *id_r
,
435 const char *owner
, int ol
,
436 const typeinfo
*typei
, adns_rrtype type
,
437 adns_queryflags flags
);
438 /* Assembles a query packet in vb. A new id is allocated and returned.
441 adns_status
adns__mkquery_frdgram(adns_state ads
, vbuf
*vb
, int *id_r
,
442 const byte
*qd_dgram
, int qd_dglen
,
444 adns_rrtype type
, adns_queryflags flags
);
445 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
446 * That domain must be correct and untruncated.
449 void adns__querysend_tcp(adns_query qu
, struct timeval now
);
450 /* Query must be in state tcpw/tcpw; it will be sent if possible and
451 * no further processing can be done on it for now. The connection
452 * might be broken, but no reconnect will be attempted.
455 void adns__query_send(adns_query qu
, struct timeval now
);
456 /* Query must be in state tosend/NONE; it will be moved to a new state,
457 * and no further processing can be done on it for now.
458 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
459 * connected), tcpsent/timew, child/childw or done/output.)
460 * __query_send may decide to use either UDP or TCP depending whether
461 * _qf_usevc is set (or has become set) and whether the query is too
467 adns_status
adns__internal_submit(adns_state ads
, adns_query
*query_r
,
468 const typeinfo
*typei
, vbuf
*qumsg_vb
,
470 adns_queryflags flags
, struct timeval now
,
471 const qcontext
*ctx
);
472 /* Submits a query (for internal use, called during external submits).
474 * The new query is returned in *query_r, or we return adns_s_nomemory.
476 * The query datagram should already have been assembled in qumsg_vb;
477 * the memory for it is _taken over_ by this routine whether it
478 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
480 * *ctx is copied byte-for-byte into the query.
482 * When the child query is done, ctx->callback will be called. The
483 * child will already have been taken off both the global list of
484 * queries in ads and the list of children in the parent. The child
485 * will be freed when the callback returns. The parent will have been
486 * taken off the global childw queue.
488 * The callback should either call adns__query_done, if it is
489 * complete, or adns__query_fail, if an error has occurred, in which
490 * case the other children (if any) will be cancelled. If the parent
491 * has more unfinished children (or has just submitted more) then the
492 * callback may choose to wait for them - it must then put the parent
493 * back on the childw queue.
496 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
);
497 /* Walks down the searchlist for a query with adns_qf_search.
498 * The query should have just had a negative response, or not had
499 * any queries sent yet, and should not be on any queue.
500 * The query_dgram if any will be freed and forgotten and a new
501 * one constructed from the search_* members of the query.
503 * Cannot fail (in case of error, calls adns__query_fail).
506 void *adns__alloc_interim(adns_query qu
, size_t sz
);
507 void *adns__alloc_preserved(adns_query qu
, size_t sz
);
508 /* Allocates some memory, and records which query it came from
509 * and how much there was.
511 * If an error occurs in the query, all the memory from _interim is
512 * simply freed. If the query succeeds, one large buffer will be made
513 * which is big enough for all these allocations, and then
514 * adns__alloc_final will get memory from this buffer.
516 * _alloc_interim can fail (and return 0).
517 * The caller must ensure that the query is failed.
519 * The memory from _preserved is is kept and transferred into the
520 * larger buffer - unless we run out of memory, in which case it too
521 * is freed. When you use _preserved you have to add code to the
522 * x_nomem error exit case in adns__makefinal_query to clear out the
523 * pointers you made to those allocations, because that's when they're
524 * thrown away; you should also make a note in the declaration of
525 * those pointer variables, to note that they are _preserved rather
526 * than _interim. If they're in the answer, note it here:
527 * answer->cname and answer->owner are _preserved.
530 void adns__transfer_interim(adns_query from
, adns_query to
,
531 void *block
, size_t sz
);
532 /* Transfers an interim allocation from one query to another, so that
533 * the `to' query will have room for the data when we get to makefinal
534 * and so that the free will happen when the `to' query is freed
535 * rather than the `from' query.
537 * It is legal to call adns__transfer_interim with a null pointer; this
540 * _transfer_interim also ensures that the expiry time of the `to' query
541 * is no later than that of the `from' query, so that child queries'
542 * TTLs get inherited by their parents.
545 void *adns__alloc_mine(adns_query qu
, size_t sz
);
546 /* Like _interim, but does not record the length for later
547 * copying into the answer. This just ensures that the memory
548 * will be freed when we're done with the query.
551 void *adns__alloc_final(adns_query qu
, size_t sz
);
552 /* Cannot fail, and cannot return 0.
555 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
);
556 void adns__makefinal_str(adns_query qu
, char **strp
);
558 void adns__reset_preserved(adns_query qu
);
559 /* Resets all of the memory management stuff etc. to take account of
560 * only the _preserved stuff from _alloc_preserved. Used when we find
561 * an error somewhere and want to just report the error (with perhaps
562 * CNAME, owner, etc. info), and also when we're halfway through RRs
563 * in a datagram and discover that we need to retry the query.
566 void adns__query_done(adns_query qu
);
567 void adns__query_fail(adns_query qu
, adns_status stat
);
571 void adns__procdgram(adns_state ads
, const byte
*dgram
, int len
,
572 int serv
, int viatcp
, struct timeval now
);
573 /* This function is allowed to cause new datagrams to be constructed
574 * and sent, or even new queries to be started. However,
575 * query-sending functions are not allowed to call any general event
576 * loop functions in case they accidentally call this.
578 * Ie, receiving functions may call sending functions.
579 * Sending functions may NOT call receiving functions.
584 const typeinfo
*adns__findtype(adns_rrtype type
);
593 int dglen
, max
, cbyte
, namelen
;
597 void adns__findlabel_start(findlabel_state
*fls
, adns_state ads
,
598 int serv
, adns_query qu
,
599 const byte
*dgram
, int dglen
, int max
,
600 int dmbegin
, int *dmend_rlater
);
601 /* Finds labels in a domain in a datagram.
603 * Call this routine first.
604 * dmend_rlater may be null. ads (and of course fls) may not be.
605 * serv may be -1, qu may be null - they are for error reporting.
608 adns_status
adns__findlabel_next(findlabel_state
*fls
,
609 int *lablen_r
, int *labstart_r
);
610 /* Then, call this one repeatedly.
612 * It will return adns_s_ok if all is well, and tell you the length
613 * and start of successive labels. labstart_r may be null, but
614 * lablen_r must not be.
616 * After the last label, it will return with *lablen_r zero.
617 * Do not then call it again; instead, just throw away the findlabel_state.
619 * *dmend_rlater will have been set to point to the next part of
620 * the datagram after the label (or after the uncompressed part,
621 * if compression was used). *namelen_rlater will have been set
622 * to the length of the domain name (total length of labels plus
623 * 1 for each intervening dot).
625 * If the datagram appears to be truncated, *lablen_r will be -1.
626 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
627 * Do not call _next again.
629 * There may also be errors, in which case *dmend_rlater,
630 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
631 * Do not then call findlabel_next again.
638 adns_status
adns__parse_domain(adns_state ads
, int serv
, adns_query qu
,
639 vbuf
*vb
, parsedomain_flags flags
,
640 const byte
*dgram
, int dglen
, int *cbyte_io
,
642 /* vb must already have been initialised; it will be reset if necessary.
643 * If there is truncation, vb->used will be set to 0; otherwise
644 * (if there is no error) vb will be null-terminated.
645 * If there is an error vb and *cbyte_io may be left indeterminate.
647 * serv may be -1 and qu may be 0 - they are used for error reporting only.
650 adns_status
adns__parse_domain_more(findlabel_state
*fls
, adns_state ads
,
651 adns_query qu
, vbuf
*vb
,
652 parsedomain_flags flags
,
654 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
655 * for continuing an existing domain or some such of some kind. Also, unlike
656 * _parse_domain, the domain data will be appended to vb, rather than replacing
657 * the existing contents.
660 adns_status
adns__findrr(adns_query qu
, int serv
,
661 const byte
*dgram
, int dglen
, int *cbyte_io
,
662 int *type_r
, int *class_r
, unsigned long *ttl_r
,
663 int *rdlen_r
, int *rdstart_r
,
664 int *ownermatchedquery_r
);
665 /* Finds the extent and some of the contents of an RR in a datagram
666 * and does some checks. The datagram is *dgram, length dglen, and
667 * the RR starts at *cbyte_io (which is updated afterwards to point
668 * to the end of the RR).
670 * The type, class, TTL and RRdata length and start are returned iff
671 * the corresponding pointer variables are not null. type_r, class_r
672 * and ttl_r may not be null. The TTL will be capped.
674 * If ownermatchedquery_r != 0 then the owner domain of this
675 * RR will be compared with that in the query (or, if the query
676 * has gone to a CNAME lookup, with the canonical name).
677 * In this case, *ownermatchedquery_r will be set to 0 or 1.
678 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
680 * If there is truncation then *type_r will be set to -1 and
681 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
684 * qu must obviously be non-null.
686 * If an error is returned then *type_r will be undefined too.
689 adns_status
adns__findrr_anychk(adns_query qu
, int serv
,
690 const byte
*dgram
, int dglen
, int *cbyte_io
,
691 int *type_r
, int *class_r
,
692 unsigned long *ttl_r
,
693 int *rdlen_r
, int *rdstart_r
,
694 const byte
*eo_dgram
, int eo_dglen
,
695 int eo_cbyte
, int *eo_matched_r
);
696 /* Like adns__findrr_checked, except that the datagram and
697 * owner to compare with can be specified explicitly.
699 * If the caller thinks they know what the owner of the RR ought to
700 * be they can pass in details in eo_*: this is another (or perhaps
701 * the same datagram), and a pointer to where the putative owner
702 * starts in that datagram. In this case *eo_matched_r will be set
703 * to 1 if the datagram matched or 0 if it did not. Either
704 * both eo_dgram and eo_matched_r must both be non-null, or they
705 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
706 * The eo datagram and contained owner domain MUST be valid and
710 void adns__update_expires(adns_query qu
, unsigned long ttl
,
712 /* Updates the `expires' field in the query, so that it doesn't exceed
716 int vbuf__append_quoted1035(vbuf
*vb
, const byte
*buf
, int len
);
720 void adns__tcp_broken(adns_state ads
, const char *what
, const char *why
);
721 /* what and why may be both 0, or both non-0. */
723 void adns__tcp_tryconnect(adns_state ads
, struct timeval now
);
725 void adns__autosys(adns_state ads
, struct timeval now
);
726 /* Make all the system calls we want to if the application wants us to.
727 * Must not be called from within adns internal processing functions,
728 * lest we end up in recursive descent !
731 void adns__must_gettimeofday(adns_state ads
, const struct timeval
**now_io
,
732 struct timeval
*tv_buf
);
734 int adns__pollfds(adns_state ads
, struct pollfd pollfds_buf
[MAX_POLLFDS
]);
735 void adns__fdevents(adns_state ads
,
736 const struct pollfd
*pollfds
, int npollfds
,
737 int maxfd
, const fd_set
*readfds
,
738 const fd_set
*writefds
, const fd_set
*exceptfds
,
739 struct timeval now
, int *r_r
);
740 int adns__internal_check(adns_state ads
,
741 adns_query
*query_io
,
742 adns_answer
**answer
,
745 void adns__timeouts(adns_state ads
, int act
,
746 struct timeval
**tv_io
, struct timeval
*tvbuf
,
748 /* If act is !0, then this will also deal with the TCP connection
749 * if previous events broke it or require it to be connected.
754 void adns__consistency(adns_state ads
, adns_query qu
, consistency_checks cc
);
756 /* Useful static inline functions: */
758 static inline int ctype_whitespace(int c
) {
759 return c
==' ' || c
=='\n' || c
=='\t';
761 static inline int ctype_digit(int c
) { return c
>='0' && c
<='9'; }
762 static inline int ctype_alpha(int c
) {
763 return (c
>= 'a' && c
<= 'z') || (c
>= 'A' && c
<= 'Z');
765 static inline int ctype_822special(int c
) {
766 return strchr("()<>@,;:\\\".[]",c
) != 0;
768 static inline int ctype_domainunquoted(int c
) {
769 return ctype_alpha(c
) || ctype_digit(c
) || (strchr("-_/+",c
) != 0);
772 static inline int errno_resources(int e
) { return e
==ENOMEM
|| e
==ENOBUFS
; }
776 #define MEM_ROUND(sz) \
777 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
778 * sizeof(union maxalign) )
780 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
781 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
782 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
783 #define GET_L(cb,tv) ( (tv)=0, \
784 (tv)|=(GETIL_B((cb))<<24), \
785 (tv)|=(GETIL_B((cb))<<16), \
786 (tv)|=(GETIL_B((cb))<<8), \