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 STRINGIFY(x) REALLY_STRINGIFY(x)
76 #define REALLY_STRINGIFY(x) #x
78 #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED
96 adns__qf_senddirect = 0x00100000 /* don't call the `query_send' type hook */
99 /* Shared data structures */
120 int dglen, nsstart, nscount, arcount;
136 void *(*sockaddr_to_inaddr)(struct sockaddr *sa);
137 int (*sockaddr_equalp)(const struct sockaddr *sa,
138 const struct sockaddr *sb);
139 void (*prefix_mask)(int len, union gen_addr *a);
140 int (*guess_len)(const union gen_addr *a);
141 int (*matchp)(const union gen_addr *addr,
142 const union gen_addr *base, const union gen_addr *mask);
143 int (*rev_parsecomp)(const char *p, size_t n);
144 void (*rev_mkaddr)(union gen_addr *addr, const byte *ipv);
145 char *(*rev_mkname)(const struct sockaddr *sa, char *buf);
148 struct afinfo_addr { const afinfo *ai; union gen_addr addr; };
150 typedef struct typeinfo {
156 void (*makefinal)(adns_query qu, void *data);
157 /* Change memory management of *data.
158 * Previously, used alloc_interim, now use alloc_final.
161 adns_status (*convstring)(vbuf *vb, const void *data);
162 /* Converts the RR data to a string representation in vbuf.
163 * vbuf will be appended to (it must have been initialised),
164 * and will not be null-terminated by convstring.
167 adns_status (*parse)(const parseinfo *pai, int cbyte,
168 int max, void *store_r);
169 /* Parse one RR, in dgram of length dglen, starting at cbyte and
170 * extending until at most max.
172 * The RR should be stored at *store_r, of length qu->typei->rrsz.
174 * If there is an overrun which might indicate truncation, it should set
175 * *rdstart to -1; otherwise it may set it to anything else positive.
177 * nsstart is the offset of the authority section.
180 int (*diff_needswap)(adns_state ads,const void *datap_a,const void *datap_b);
181 /* Returns !0 if RR a should be strictly after RR b in the sort order,
182 * 0 otherwise. Must not fail.
185 adns_status (*qdparselabel)(adns_state ads,
186 const char **p_io, const char *pe, int labelnum,
187 char label_r[DNS_MAXDOMAIN], int *ll_io,
188 adns_queryflags flags,
189 const struct typeinfo *typei);
190 /* Parses one label from the query domain string. On entry, *p_io
191 * points to the next character to parse and *ll_io is the size of
192 * the buffer. pe points just after the end of the query domain
193 * string. On successful return, label_r[] and *ll_io are filled in
194 * and *p_io points to *pe or just after the label-ending `.'. */
196 void (*postsort)(adns_state ads, void *array, int nrrs,
197 const struct typeinfo *typei);
198 /* Called immediately after the RRs have been sorted, and may rearrange
199 * them. (This is really for the benefit of SRV's bizarre weighting
200 * stuff.) May be 0 to mean nothing needs to be done.
203 void (*query_send)(adns_query qu, struct timeval now);
204 /* Send the query to nameservers, and hook it into the appropriate queue.
205 * Normal behaviour is to call adns__query_send, but this can be overridden
206 * for special effects.
210 adns_status adns__qdpl_normal(adns_state ads,
211 const char **p_io, const char *pe, int labelnum,
212 char label_r[], int *ll_io,
213 adns_queryflags flags,
214 const typeinfo *typei);
215 /* implemented in transmit.c, used by types.c as default
216 * and as part of implementation for some fancier types */
218 typedef struct allocnode {
219 struct allocnode *next, *back;
234 void (*callback)(adns_query parent, adns_query child);
236 struct afinfo_addr ptr_parent_addr;
237 adns_rr_hostaddr *hostaddr;
243 enum { query_tosend, query_tcpw, query_childw, query_done } state;
244 adns_query back, next, parent;
245 struct { adns_query head, tail; } children;
246 struct { adns_query back, next; } siblings;
247 struct { allocnode *head, *tail; } allocations;
248 int interim_allocd, preserved_allocd;
249 void *final_allocspace;
251 const typeinfo *typei;
256 /* General-purpose messing-about buffer.
257 * Wherever a `big' interface is crossed, this may be corrupted/changed
258 * unless otherwise specified.
262 /* This is allocated when a query is submitted, to avoid being unable
263 * to relate errors to queries if we run out of memory. During
264 * query processing status, rrs is 0. cname is set if
265 * we found a cname (this corresponds to cname_dgram in the query
266 * structure). type is set from the word go. nrrs and rrs
267 * are set together, when we find how many rrs there are.
268 * owner is set during querying unless we're doing searchlist,
269 * in which case it is set only when we find an answer.
273 int cname_dglen, cname_begin;
274 /* If non-0, has been allocated using . */
277 int search_origlen, search_pos, search_doneabs;
278 /* Used by the searching algorithm. The query domain in textual form
279 * is copied into the vbuf, and _origlen set to its length. Then
280 * we walk the searchlist, if we want to. _pos says where we are
281 * (next entry to try), and _doneabs says whether we've done the
282 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
283 * but not done yet). If flags doesn't have adns_qf_search then
284 * the vbuf is initialised but empty and everything else is zero.
287 int id, flags, retries;
289 unsigned long udpsent; /* bitmap indexed by server */
290 struct timeval timeout;
291 time_t expires; /* Earliest expiry time of any record we used. */
297 * state Queue child id nextudpserver udpsent tcpfailed
299 * tosend NONE null >=0 0 zero zero
300 * tosend udpw null >=0 any nonzero zero
301 * tosend NONE null >=0 any nonzero zero
303 * tcpw tcpw null >=0 irrelevant any any
305 * child childw set >=0 irrelevant irrelevant irrelevant
306 * child NONE null >=0 irrelevant irrelevant irrelevant
307 * done output null -1 irrelevant irrelevant irrelevant
309 * Queries are only not on a queue when they are actually being processed.
310 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
311 * iff the tcp connection is in state server_ok.
313 * +------------------------+
314 * START -----> | tosend/NONE |
315 * +------------------------+
317 * too big for UDP / UDP timeout \ \ send via UDP
318 * send via TCP / more retries \ \
319 * when conn'd / desired \ \
322 * +-----------+ +-------------+
323 * | tcpw/tcpw | ________ | tosend/udpw |
324 * +-----------+ \ +-------------+
325 * | | | UDP timeout | |
328 * \ | TCP died | desired | |
330 * \ \ servers | TCP / |
331 * \ \ to try | timeout / |
333 * reply \ _| +------------------+ / reply
334 * \ | done/output FAIL | /
335 * \ +------------------+ /
338 * (..... got reply ....)
340 * need child query/ies / \ no child query
343 * +---------------+ +----------------+
344 * | childw/childw | ----------------> | done/output OK |
345 * +---------------+ children done +----------------+
349 struct query_queue { adns_query head, tail; };
354 adns_initflags iflags;
355 adns_logcallbackfn *logfn;
358 struct query_queue udpw, tcpw, childw, output;
359 adns_query forallnext;
360 int nextid, tcpsocket;
361 struct udpsocket { const afinfo *ai; int fd; } udpsocket[MAXUDP];
363 vbuf tcpsend, tcprecv;
364 int nservers, nsortlist, nsearchlist, searchndots, tcpserver, tcprecv_skip;
365 enum adns__tcpstate {
366 server_disconnected, server_connecting,
367 server_ok, server_broken
369 struct timeval tcptimeout;
370 /* This will have tv_sec==0 if it is not valid. It will always be
371 * valid if tcpstate _connecting. When _ok, it will be nonzero if
372 * we are idle (ie, tcpw queue is empty), in which case it is the
373 * absolute time when we will close the connection.
375 struct sigaction stdsigpipe;
377 struct pollfd pollfds_buf[MAX_POLLFDS];
378 adns_rr_addr servers[MAXSERVERS];
381 union gen_addr base, mask;
382 } sortlist[MAXSORTLIST];
384 unsigned short rand48xsubi[3];
387 /* From addrfam.c: */
389 extern const afinfo adns__inet_afinfo, adns__inet6_afinfo;
393 int adns__setnonblock(adns_state ads, int fd); /* => errno value */
395 /* From general.c: */
397 const char *adns__sockaddr_ntoa(struct sockaddr *sa, size_t n);
398 void adns__vlprintf(adns_state ads, const char *fmt, va_list al);
399 void adns__lprintf(adns_state ads, const char *fmt,
400 ...) PRINTFFORMAT(2,3);
402 void adns__vdiag(adns_state ads, const char *pfx, adns_initflags prevent,
403 int serv, adns_query qu, const char *fmt, va_list al);
405 void adns__debug(adns_state ads, int serv, adns_query qu,
406 const char *fmt, ...) PRINTFFORMAT(4,5);
407 void adns__warn(adns_state ads, int serv, adns_query qu,
408 const char *fmt, ...) PRINTFFORMAT(4,5);
409 void adns__diag(adns_state ads, int serv, adns_query qu,
410 const char *fmt, ...) PRINTFFORMAT(4,5);
412 int adns__vbuf_ensure(vbuf *vb, int want);
413 int adns__vbuf_appendstr(vbuf *vb, const char *data); /* doesn't include nul */
414 int adns__vbuf_append(vbuf *vb, const byte *data, int len);
415 /* 1=>success, 0=>realloc failed */
416 void adns__vbuf_appendq(vbuf *vb, const byte *data, int len);
417 void adns__vbuf_init(vbuf *vb);
418 void adns__vbuf_free(vbuf *vb);
420 const char *adns__diag_domain(adns_state ads, int serv, adns_query qu,
422 const byte *dgram, int dglen, int cbyte);
423 /* Unpicks a domain in a datagram and returns a string suitable for
424 * printing it as. Never fails - if an error occurs, it will
425 * return some kind of string describing the error.
427 * serv may be -1 and qu may be 0. vb must have been initialised,
428 * and will be left in an arbitrary consistent state.
430 * Returns either vb->buf, or a pointer to a string literal. Do not modify
431 * vb before using the return value.
434 void adns__isort(void *array, int nobjs, int sz, void *tempbuf,
435 int (*needswap)(void *context, const void *a, const void *b),
437 /* Does an insertion sort of array which must contain nobjs objects
438 * each sz bytes long. tempbuf must point to a buffer at least
439 * sz bytes long. needswap should return !0 if a>b (strictly, ie
440 * wrong order) 0 if a<=b (ie, order is fine).
443 void adns__sigpipe_protect(adns_state);
444 void adns__sigpipe_unprotect(adns_state);
445 /* If SIGPIPE protection is not disabled, will block all signals except
446 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
447 * Each call to _protect must be followed by a call to _unprotect before
448 * any significant amount of code gets to run, since the old signal mask
449 * is stored in the adns structure.
452 /* From transmit.c: */
454 adns_status adns__mkquery(adns_state ads, vbuf *vb, int *id_r,
455 const char *owner, int ol,
456 const typeinfo *typei, adns_rrtype type,
457 adns_queryflags flags);
458 /* Assembles a query packet in vb. A new id is allocated and returned.
461 adns_status adns__mkquery_frdgram(adns_state ads, vbuf *vb, int *id_r,
462 const byte *qd_dgram, int qd_dglen,
464 adns_rrtype type, adns_queryflags flags);
465 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
466 * That domain must be correct and untruncated.
469 void adns__querysend_tcp(adns_query qu, struct timeval now);
470 /* Query must be in state tcpw/tcpw; it will be sent if possible and
471 * no further processing can be done on it for now. The connection
472 * might be broken, but no reconnect will be attempted.
475 void adns__query_send(adns_query qu, struct timeval now);
476 /* Query must be in state tosend/NONE; it will be moved to a new state,
477 * and no further processing can be done on it for now.
478 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
479 * connected), tcpsent/timew, child/childw or done/output.)
480 * __query_send may decide to use either UDP or TCP depending whether
481 * _qf_usevc is set (or has become set) and whether the query is too
487 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
488 const typeinfo *typei, adns_rrtype,
489 vbuf *qumsg_vb, int id,
490 adns_queryflags flags, struct timeval now,
491 const qcontext *ctx);
492 /* Submits a query (for internal use, called during external submits).
494 * The new query is returned in *query_r, or we return adns_s_nomemory.
496 * The query datagram should already have been assembled in qumsg_vb;
497 * the memory for it is _taken over_ by this routine whether it
498 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
500 * *ctx is copied byte-for-byte into the query.
502 * When the child query is done, ctx->callback will be called. The
503 * child will already have been taken off both the global list of
504 * queries in ads and the list of children in the parent. The child
505 * will be freed when the callback returns. The parent will have been
506 * taken off the global childw queue.
508 * The callback should either call adns__query_done, if it is
509 * complete, or adns__query_fail, if an error has occurred, in which
510 * case the other children (if any) will be cancelled. If the parent
511 * has more unfinished children (or has just submitted more) then the
512 * callback may choose to wait for them - it must then put the parent
513 * back on the childw queue.
516 void adns__search_next(adns_state ads, adns_query qu, struct timeval now);
517 /* Walks down the searchlist for a query with adns_qf_search.
518 * The query should have just had a negative response, or not had
519 * any queries sent yet, and should not be on any queue.
520 * The query_dgram if any will be freed and forgotten and a new
521 * one constructed from the search_* members of the query.
523 * Cannot fail (in case of error, calls adns__query_fail).
526 void *adns__alloc_interim(adns_query qu, size_t sz);
527 void *adns__alloc_preserved(adns_query qu, size_t sz);
528 /* Allocates some memory, and records which query it came from
529 * and how much there was.
531 * If an error occurs in the query, all the memory from _interim is
532 * simply freed. If the query succeeds, one large buffer will be made
533 * which is big enough for all these allocations, and then
534 * adns__alloc_final will get memory from this buffer.
536 * _alloc_interim can fail (and return 0).
537 * The caller must ensure that the query is failed.
539 * The memory from _preserved is is kept and transferred into the
540 * larger buffer - unless we run out of memory, in which case it too
541 * is freed. When you use _preserved you have to add code to the
542 * x_nomem error exit case in adns__makefinal_query to clear out the
543 * pointers you made to those allocations, because that's when they're
544 * thrown away; you should also make a note in the declaration of
545 * those pointer variables, to note that they are _preserved rather
546 * than _interim. If they're in the answer, note it here:
547 * answer->cname and answer->owner are _preserved.
550 void adns__transfer_interim(adns_query from, adns_query to,
551 void *block, size_t sz);
552 /* Transfers an interim allocation from one query to another, so that
553 * the `to' query will have room for the data when we get to makefinal
554 * and so that the free will happen when the `to' query is freed
555 * rather than the `from' query.
557 * It is legal to call adns__transfer_interim with a null pointer; this
560 * _transfer_interim also ensures that the expiry time of the `to' query
561 * is no later than that of the `from' query, so that child queries'
562 * TTLs get inherited by their parents.
565 void adns__free_interim(adns_query qu, void *p);
566 /* Forget about a block allocated by adns__alloc_interim.
569 void *adns__alloc_mine(adns_query qu, size_t sz);
570 /* Like _interim, but does not record the length for later
571 * copying into the answer. This just ensures that the memory
572 * will be freed when we're done with the query.
575 void *adns__alloc_final(adns_query qu, size_t sz);
576 /* Cannot fail, and cannot return 0.
579 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz);
580 void adns__makefinal_str(adns_query qu, char **strp);
582 void adns__reset_preserved(adns_query qu);
583 /* Resets all of the memory management stuff etc. to take account of
584 * only the _preserved stuff from _alloc_preserved. Used when we find
585 * an error somewhere and want to just report the error (with perhaps
586 * CNAME, owner, etc. info), and also when we're halfway through RRs
587 * in a datagram and discover that we need to retry the query.
590 void adns__query_done(adns_query qu);
591 void adns__query_fail(adns_query qu, adns_status stat);
592 void adns__cancel_children(adns_query qu);
596 void adns__procdgram(adns_state ads, const byte *dgram, int len,
597 int serv, int viatcp, struct timeval now);
598 /* This function is allowed to cause new datagrams to be constructed
599 * and sent, or even new queries to be started. However,
600 * query-sending functions are not allowed to call any general event
601 * loop functions in case they accidentally call this.
603 * Ie, receiving functions may call sending functions.
604 * Sending functions may NOT call receiving functions.
609 const typeinfo *adns__findtype(adns_rrtype type);
618 int dglen, max, cbyte, namelen;
622 void adns__findlabel_start(findlabel_state *fls, adns_state ads,
623 int serv, adns_query qu,
624 const byte *dgram, int dglen, int max,
625 int dmbegin, int *dmend_rlater);
626 /* Finds labels in a domain in a datagram.
628 * Call this routine first.
629 * dmend_rlater may be null. ads (and of course fls) may not be.
630 * serv may be -1, qu may be null - they are for error reporting.
633 adns_status adns__findlabel_next(findlabel_state *fls,
634 int *lablen_r, int *labstart_r);
635 /* Then, call this one repeatedly.
637 * It will return adns_s_ok if all is well, and tell you the length
638 * and start of successive labels. labstart_r may be null, but
639 * lablen_r must not be.
641 * After the last label, it will return with *lablen_r zero.
642 * Do not then call it again; instead, just throw away the findlabel_state.
644 * *dmend_rlater will have been set to point to the next part of
645 * the datagram after the label (or after the uncompressed part,
646 * if compression was used). *namelen_rlater will have been set
647 * to the length of the domain name (total length of labels plus
648 * 1 for each intervening dot).
650 * If the datagram appears to be truncated, *lablen_r will be -1.
651 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
652 * Do not call _next again.
654 * There may also be errors, in which case *dmend_rlater,
655 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
656 * Do not then call findlabel_next again.
663 adns_status adns__parse_domain(adns_state ads, int serv, adns_query qu,
664 vbuf *vb, parsedomain_flags flags,
665 const byte *dgram, int dglen, int *cbyte_io,
667 /* vb must already have been initialised; it will be reset if necessary.
668 * If there is truncation, vb->used will be set to 0; otherwise
669 * (if there is no error) vb will be null-terminated.
670 * If there is an error vb and *cbyte_io may be left indeterminate.
672 * serv may be -1 and qu may be 0 - they are used for error reporting only.
675 adns_status adns__parse_domain_more(findlabel_state *fls, adns_state ads,
676 adns_query qu, vbuf *vb,
677 parsedomain_flags flags,
679 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
680 * for continuing an existing domain or some such of some kind. Also, unlike
681 * _parse_domain, the domain data will be appended to vb, rather than replacing
682 * the existing contents.
685 adns_status adns__findrr(adns_query qu, int serv,
686 const byte *dgram, int dglen, int *cbyte_io,
687 int *type_r, int *class_r, unsigned long *ttl_r,
688 int *rdlen_r, int *rdstart_r,
689 int *ownermatchedquery_r);
690 /* Finds the extent and some of the contents of an RR in a datagram
691 * and does some checks. The datagram is *dgram, length dglen, and
692 * the RR starts at *cbyte_io (which is updated afterwards to point
693 * to the end of the RR).
695 * The type, class, TTL and RRdata length and start are returned iff
696 * the corresponding pointer variables are not null. type_r, class_r
697 * and ttl_r may not be null. The TTL will be capped.
699 * If ownermatchedquery_r != 0 then the owner domain of this
700 * RR will be compared with that in the query (or, if the query
701 * has gone to a CNAME lookup, with the canonical name).
702 * In this case, *ownermatchedquery_r will be set to 0 or 1.
703 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
705 * If there is truncation then *type_r will be set to -1 and
706 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
709 * qu must obviously be non-null.
711 * If an error is returned then *type_r will be undefined too.
714 adns_status adns__findrr_anychk(adns_query qu, int serv,
715 const byte *dgram, int dglen, int *cbyte_io,
716 int *type_r, int *class_r,
717 unsigned long *ttl_r,
718 int *rdlen_r, int *rdstart_r,
719 const byte *eo_dgram, int eo_dglen,
720 int eo_cbyte, int *eo_matched_r);
721 /* Like adns__findrr_checked, except that the datagram and
722 * owner to compare with can be specified explicitly.
724 * If the caller thinks they know what the owner of the RR ought to
725 * be they can pass in details in eo_*: this is another (or perhaps
726 * the same datagram), and a pointer to where the putative owner
727 * starts in that datagram. In this case *eo_matched_r will be set
728 * to 1 if the datagram matched or 0 if it did not. Either
729 * both eo_dgram and eo_matched_r must both be non-null, or they
730 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
731 * The eo datagram and contained owner domain MUST be valid and
735 void adns__update_expires(adns_query qu, unsigned long ttl,
737 /* Updates the `expires' field in the query, so that it doesn't exceed
741 int vbuf__append_quoted1035(vbuf *vb, const byte *buf, int len);
745 void adns__tcp_broken(adns_state ads, const char *what, const char *why);
746 /* what and why may be both 0, or both non-0. */
748 void adns__tcp_tryconnect(adns_state ads, struct timeval now);
750 void adns__autosys(adns_state ads, struct timeval now);
751 /* Make all the system calls we want to if the application wants us to.
752 * Must not be called from within adns internal processing functions,
753 * lest we end up in recursive descent !
756 void adns__must_gettimeofday(adns_state ads, const struct timeval **now_io,
757 struct timeval *tv_buf);
759 int adns__pollfds(adns_state ads, struct pollfd pollfds_buf[MAX_POLLFDS]);
760 void adns__fdevents(adns_state ads,
761 const struct pollfd *pollfds, int npollfds,
762 int maxfd, const fd_set *readfds,
763 const fd_set *writefds, const fd_set *exceptfds,
764 struct timeval now, int *r_r);
765 int adns__internal_check(adns_state ads,
766 adns_query *query_io,
767 adns_answer **answer,
770 void adns__timeouts(adns_state ads, int act,
771 struct timeval **tv_io, struct timeval *tvbuf,
773 /* If act is !0, then this will also deal with the TCP connection
774 * if previous events broke it or require it to be connected.
779 void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc);
781 /* Useful static inline functions: */
783 static inline int ctype_whitespace(int c) {
784 return c==' ' || c=='\n' || c=='\t';
786 static inline int ctype_digit(int c) { return c>='0' && c<='9'; }
787 static inline int ctype_alpha(int c) {
788 return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
790 static inline int ctype_822special(int c) {
791 return strchr("()<>@,;:\\\".[]",c) != 0;
793 static inline int ctype_domainunquoted(int c) {
794 return ctype_alpha(c) || ctype_digit(c) || (strchr("-_/+",c) != 0);
797 static inline int errno_resources(int e) { return e==ENOMEM || e==ENOBUFS; }
801 #define MEM_ROUND(sz) \
802 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
803 * sizeof(union maxalign) )
805 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
806 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
807 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
808 #define GET_L(cb,tv) ( (tv)=0, \
809 (tv)|=(GETIL_B((cb))<<24), \
810 (tv)|=(GETIL_B((cb))<<16), \
811 (tv)|=(GETIL_B((cb))<<8), \