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 */
97 adns__qf_nosend = 0x00200000,/* don't send the query when submitting */
98 adns__qf_addr_answer= 0x01000000,/* addr query received an answer */
99 adns__qf_addr_cnhack= 0x02000000,/* addr query found cname inconsistency */
100 adns__qf_addr_cname = 0x04000000 /* addr subquery performed on cname */
103 /* Shared data structures */
124 int dglen, nsstart, nscount, arcount;
140 const void *(*sockaddr_to_inaddr)(const struct sockaddr *sa);
141 int (*sockaddr_equalp)(const struct sockaddr *sa,
142 const struct sockaddr *sb);
143 void (*prefix_mask)(int len, union gen_addr *a);
144 int (*guess_len)(const union gen_addr *a);
145 int (*matchp)(const union gen_addr *addr,
146 const union gen_addr *base, const union gen_addr *mask);
147 int (*rev_parsecomp)(const char *p, size_t n);
148 void (*rev_mkaddr)(union gen_addr *addr, const byte *ipv);
149 char *(*rev_mkname)(const struct sockaddr *sa, char *buf);
152 struct afinfo_addr { const afinfo *ai; union gen_addr addr; };
154 typedef struct typeinfo {
160 void (*makefinal)(adns_query qu, void *data);
161 /* Change memory management of *data.
162 * Previously, used alloc_interim, now use alloc_final.
165 adns_status (*convstring)(vbuf *vb, const void *data);
166 /* Converts the RR data to a string representation in vbuf.
167 * vbuf will be appended to (it must have been initialised),
168 * and will not be null-terminated by convstring.
171 adns_status (*parse)(const parseinfo *pai, int cbyte,
172 int max, void *store_r);
173 /* Parse one RR, in dgram of length dglen, starting at cbyte and
174 * extending until at most max.
176 * The RR should be stored at *store_r, of length qu->typei->rrsz.
178 * If there is an overrun which might indicate truncation, it should set
179 * *rdstart to -1; otherwise it may set it to anything else positive.
181 * nsstart is the offset of the authority section.
184 int (*diff_needswap)(adns_state ads,const void *datap_a,const void *datap_b);
185 /* Returns !0 if RR a should be strictly after RR b in the sort order,
186 * 0 otherwise. Must not fail.
189 adns_status (*qdparselabel)(adns_state ads,
190 const char **p_io, const char *pe, int labelnum,
191 char label_r[DNS_MAXDOMAIN], int *ll_io,
192 adns_queryflags flags,
193 const struct typeinfo *typei);
194 /* Parses one label from the query domain string. On entry, *p_io
195 * points to the next character to parse and *ll_io is the size of
196 * the buffer. pe points just after the end of the query domain
197 * string. On successful return, label_r[] and *ll_io are filled in
198 * and *p_io points to *pe or just after the label-ending `.'. */
200 void (*postsort)(adns_state ads, void *array, int nrrs,
201 const struct typeinfo *typei);
202 /* Called immediately after the RRs have been sorted, and may rearrange
203 * them. (This is really for the benefit of SRV's bizarre weighting
204 * stuff.) May be 0 to mean nothing needs to be done.
207 void (*query_send)(adns_query qu, struct timeval now);
208 /* Send the query to nameservers, and hook it into the appropriate queue.
209 * Normal behaviour is to call adns__query_send, but this can be overridden
210 * for special effects.
214 adns_status adns__qdpl_normal(adns_state ads,
215 const char **p_io, const char *pe, int labelnum,
216 char label_r[], int *ll_io,
217 adns_queryflags flags,
218 const typeinfo *typei);
219 /* implemented in transmit.c, used by types.c as default
220 * and as part of implementation for some fancier types */
222 typedef struct allocnode {
223 struct allocnode *next, *back;
238 void (*callback)(adns_query parent, adns_query child);
240 struct afinfo_addr ptr_parent_addr;
241 adns_rr_hostaddr *hostaddr;
247 enum { query_tosend, query_tcpw, query_childw, query_done } state;
248 adns_query back, next, parent;
249 struct { adns_query head, tail; } children;
250 struct { adns_query back, next; } siblings;
251 struct { allocnode *head, *tail; } allocations;
252 int interim_allocd, preserved_allocd;
253 void *final_allocspace;
255 const typeinfo *typei;
260 /* General-purpose messing-about buffer.
261 * Wherever a `big' interface is crossed, this may be corrupted/changed
262 * unless otherwise specified.
266 /* This is allocated when a query is submitted, to avoid being unable
267 * to relate errors to queries if we run out of memory. During
268 * query processing status, rrs is 0. cname is set if
269 * we found a cname (this corresponds to cname_dgram in the query
270 * structure). type is set from the word go. nrrs and rrs
271 * are set together, when we find how many rrs there are.
272 * owner is set during querying unless we're doing searchlist,
273 * in which case it is set only when we find an answer.
277 int cname_dglen, cname_begin;
278 /* If non-0, has been allocated using . */
281 int search_origlen, search_pos, search_doneabs;
282 /* Used by the searching algorithm. The query domain in textual form
283 * is copied into the vbuf, and _origlen set to its length. Then
284 * we walk the searchlist, if we want to. _pos says where we are
285 * (next entry to try), and _doneabs says whether we've done the
286 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
287 * but not done yet). If flags doesn't have adns_qf_search then
288 * the vbuf is initialised but empty and everything else is zero.
291 int id, flags, retries;
293 unsigned long udpsent; /* bitmap indexed by server */
294 struct timeval timeout;
295 time_t expires; /* Earliest expiry time of any record we used. */
301 * state Queue child id nextudpserver udpsent tcpfailed
303 * tosend NONE null >=0 0 zero zero
304 * tosend udpw null >=0 any nonzero zero
305 * tosend NONE null >=0 any nonzero zero
307 * tcpw tcpw null >=0 irrelevant any any
309 * child childw set >=0 irrelevant irrelevant irrelevant
310 * child NONE null >=0 irrelevant irrelevant irrelevant
311 * done output null -1 irrelevant irrelevant irrelevant
313 * Queries are only not on a queue when they are actually being processed.
314 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
315 * iff the tcp connection is in state server_ok.
317 * +------------------------+
318 * START -----> | tosend/NONE |
319 * +------------------------+
321 * too big for UDP / UDP timeout \ \ send via UDP
322 * send via TCP / more retries \ \
323 * when conn'd / desired \ \
326 * +-----------+ +-------------+
327 * | tcpw/tcpw | ________ | tosend/udpw |
328 * +-----------+ \ +-------------+
329 * | | | UDP timeout | |
332 * \ | TCP died | desired | |
334 * \ \ servers | TCP / |
335 * \ \ to try | timeout / |
337 * reply \ _| +------------------+ / reply
338 * \ | done/output FAIL | /
339 * \ +------------------+ /
342 * (..... got reply ....)
344 * need child query/ies / \ no child query
347 * +---------------+ +----------------+
348 * | childw/childw | ----------------> | done/output OK |
349 * +---------------+ children done +----------------+
353 struct query_queue { adns_query head, tail; };
358 adns_initflags iflags;
359 adns_logcallbackfn *logfn;
362 struct query_queue udpw, tcpw, childw, output;
363 adns_query forallnext;
364 int nextid, tcpsocket;
365 struct udpsocket { const afinfo *ai; int fd; } udpsocket[MAXUDP];
367 vbuf tcpsend, tcprecv;
368 int nservers, nsortlist, nsearchlist, searchndots, tcpserver, tcprecv_skip;
369 enum adns__tcpstate {
370 server_disconnected, server_connecting,
371 server_ok, server_broken
373 struct timeval tcptimeout;
374 /* This will have tv_sec==0 if it is not valid. It will always be
375 * valid if tcpstate _connecting. When _ok, it will be nonzero if
376 * we are idle (ie, tcpw queue is empty), in which case it is the
377 * absolute time when we will close the connection.
379 struct sigaction stdsigpipe;
381 struct pollfd pollfds_buf[MAX_POLLFDS];
382 adns_rr_addr servers[MAXSERVERS];
385 union gen_addr base, mask;
386 } sortlist[MAXSORTLIST];
388 unsigned short rand48xsubi[3];
391 /* From addrfam.c: */
393 extern const afinfo adns__inet_afinfo, adns__inet6_afinfo;
397 int adns__setnonblock(adns_state ads, int fd); /* => errno value */
399 /* From general.c: */
401 const char *adns__sockaddr_ntoa(struct sockaddr *sa, size_t n);
402 void adns__vlprintf(adns_state ads, const char *fmt, va_list al);
403 void adns__lprintf(adns_state ads, const char *fmt,
404 ...) PRINTFFORMAT(2,3);
406 void adns__vdiag(adns_state ads, const char *pfx, adns_initflags prevent,
407 int serv, adns_query qu, const char *fmt, va_list al);
409 void adns__debug(adns_state ads, int serv, adns_query qu,
410 const char *fmt, ...) PRINTFFORMAT(4,5);
411 void adns__warn(adns_state ads, int serv, adns_query qu,
412 const char *fmt, ...) PRINTFFORMAT(4,5);
413 void adns__diag(adns_state ads, int serv, adns_query qu,
414 const char *fmt, ...) PRINTFFORMAT(4,5);
416 int adns__vbuf_ensure(vbuf *vb, int want);
417 int adns__vbuf_appendstr(vbuf *vb, const char *data); /* doesn't include nul */
418 int adns__vbuf_append(vbuf *vb, const byte *data, int len);
419 /* 1=>success, 0=>realloc failed */
420 void adns__vbuf_appendq(vbuf *vb, const byte *data, int len);
421 void adns__vbuf_init(vbuf *vb);
422 void adns__vbuf_free(vbuf *vb);
424 const char *adns__diag_domain(adns_state ads, int serv, adns_query qu,
426 const byte *dgram, int dglen, int cbyte);
427 /* Unpicks a domain in a datagram and returns a string suitable for
428 * printing it as. Never fails - if an error occurs, it will
429 * return some kind of string describing the error.
431 * serv may be -1 and qu may be 0. vb must have been initialised,
432 * and will be left in an arbitrary consistent state.
434 * Returns either vb->buf, or a pointer to a string literal. Do not modify
435 * vb before using the return value.
438 void adns__isort(void *array, int nobjs, int sz, void *tempbuf,
439 int (*needswap)(void *context, const void *a, const void *b),
441 /* Does an insertion sort of array which must contain nobjs objects
442 * each sz bytes long. tempbuf must point to a buffer at least
443 * sz bytes long. needswap should return !0 if a>b (strictly, ie
444 * wrong order) 0 if a<=b (ie, order is fine).
447 void adns__sigpipe_protect(adns_state);
448 void adns__sigpipe_unprotect(adns_state);
449 /* If SIGPIPE protection is not disabled, will block all signals except
450 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
451 * Each call to _protect must be followed by a call to _unprotect before
452 * any significant amount of code gets to run, since the old signal mask
453 * is stored in the adns structure.
456 /* From transmit.c: */
458 adns_status adns__mkquery(adns_state ads, vbuf *vb, int *id_r,
459 const char *owner, int ol,
460 const typeinfo *typei, adns_rrtype type,
461 adns_queryflags flags);
462 /* Assembles a query packet in vb. A new id is allocated and returned.
465 adns_status adns__mkquery_frdgram(adns_state ads, vbuf *vb, int *id_r,
466 const byte *qd_dgram, int qd_dglen,
468 adns_rrtype type, adns_queryflags flags);
469 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
470 * That domain must be correct and untruncated.
473 void adns__querysend_tcp(adns_query qu, struct timeval now);
474 /* Query must be in state tcpw/tcpw; it will be sent if possible and
475 * no further processing can be done on it for now. The connection
476 * might be broken, but no reconnect will be attempted.
479 void adns__query_send(adns_query qu, struct timeval now);
480 /* Query must be in state tosend/NONE; it will be moved to a new state,
481 * and no further processing can be done on it for now.
482 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
483 * connected), tcpsent/timew, child/childw or done/output.)
484 * __query_send may decide to use either UDP or TCP depending whether
485 * _qf_usevc is set (or has become set) and whether the query is too
491 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
492 const typeinfo *typei, adns_rrtype,
493 vbuf *qumsg_vb, int id,
494 adns_queryflags flags, struct timeval now,
495 const qcontext *ctx);
496 /* Submits a query (for internal use, called during external submits).
498 * The new query is returned in *query_r, or we return adns_s_nomemory.
500 * The query datagram should already have been assembled in qumsg_vb;
501 * the memory for it is _taken over_ by this routine whether it
502 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
504 * If adns__qf_nosend is set in flags, then the query is not sent: doing
505 * whatever is necessary to send the query and link it onto the appropriate
506 * queue is left as the caller's responsibility.
508 * *ctx is copied byte-for-byte into the query.
510 * When the child query is done, ctx->callback will be called. The
511 * child will already have been taken off both the global list of
512 * queries in ads and the list of children in the parent. The child
513 * will be freed when the callback returns. The parent will have been
514 * taken off the global childw queue.
516 * The callback should either call adns__query_done, if it is
517 * complete, or adns__query_fail, if an error has occurred, in which
518 * case the other children (if any) will be cancelled. If the parent
519 * has more unfinished children (or has just submitted more) then the
520 * callback may choose to wait for them - it must then put the parent
521 * back on the childw queue.
524 void adns__search_next(adns_state ads, adns_query qu, struct timeval now);
525 /* Walks down the searchlist for a query with adns_qf_search.
526 * The query should have just had a negative response, or not had
527 * any queries sent yet, and should not be on any queue.
528 * The query_dgram if any will be freed and forgotten and a new
529 * one constructed from the search_* members of the query.
531 * Cannot fail (in case of error, calls adns__query_fail).
534 void *adns__alloc_interim(adns_query qu, size_t sz);
535 void *adns__alloc_preserved(adns_query qu, size_t sz);
536 /* Allocates some memory, and records which query it came from
537 * and how much there was.
539 * If an error occurs in the query, all the memory from _interim is
540 * simply freed. If the query succeeds, one large buffer will be made
541 * which is big enough for all these allocations, and then
542 * adns__alloc_final will get memory from this buffer.
544 * _alloc_interim can fail (and return 0).
545 * The caller must ensure that the query is failed.
547 * The memory from _preserved is is kept and transferred into the
548 * larger buffer - unless we run out of memory, in which case it too
549 * is freed. When you use _preserved you have to add code to the
550 * x_nomem error exit case in adns__makefinal_query to clear out the
551 * pointers you made to those allocations, because that's when they're
552 * thrown away; you should also make a note in the declaration of
553 * those pointer variables, to note that they are _preserved rather
554 * than _interim. If they're in the answer, note it here:
555 * answer->cname and answer->owner are _preserved.
558 void adns__transfer_interim(adns_query from, adns_query to,
559 void *block, size_t sz);
560 /* Transfers an interim allocation from one query to another, so that
561 * the `to' query will have room for the data when we get to makefinal
562 * and so that the free will happen when the `to' query is freed
563 * rather than the `from' query.
565 * It is legal to call adns__transfer_interim with a null pointer; this
568 * _transfer_interim also ensures that the expiry time of the `to' query
569 * is no later than that of the `from' query, so that child queries'
570 * TTLs get inherited by their parents.
573 void adns__free_interim(adns_query qu, void *p);
574 /* Forget about a block allocated by adns__alloc_interim.
577 void *adns__alloc_mine(adns_query qu, size_t sz);
578 /* Like _interim, but does not record the length for later
579 * copying into the answer. This just ensures that the memory
580 * will be freed when we're done with the query.
583 void *adns__alloc_final(adns_query qu, size_t sz);
584 /* Cannot fail, and cannot return 0.
587 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz);
588 void adns__makefinal_str(adns_query qu, char **strp);
590 void adns__reset_preserved(adns_query qu);
591 /* Resets all of the memory management stuff etc. to take account of
592 * only the _preserved stuff from _alloc_preserved. Used when we find
593 * an error somewhere and want to just report the error (with perhaps
594 * CNAME, owner, etc. info), and also when we're halfway through RRs
595 * in a datagram and discover that we need to retry the query.
598 void adns__query_done(adns_query qu);
599 void adns__query_fail(adns_query qu, adns_status stat);
600 void adns__cancel_children(adns_query qu);
604 void adns__procdgram(adns_state ads, const byte *dgram, int len,
605 int serv, int viatcp, struct timeval now);
606 /* This function is allowed to cause new datagrams to be constructed
607 * and sent, or even new queries to be started. However,
608 * query-sending functions are not allowed to call any general event
609 * loop functions in case they accidentally call this.
611 * Ie, receiving functions may call sending functions.
612 * Sending functions may NOT call receiving functions.
617 const typeinfo *adns__findtype(adns_rrtype type);
626 int dglen, max, cbyte, namelen;
630 void adns__findlabel_start(findlabel_state *fls, adns_state ads,
631 int serv, adns_query qu,
632 const byte *dgram, int dglen, int max,
633 int dmbegin, int *dmend_rlater);
634 /* Finds labels in a domain in a datagram.
636 * Call this routine first.
637 * dmend_rlater may be null. ads (and of course fls) may not be.
638 * serv may be -1, qu may be null - they are for error reporting.
641 adns_status adns__findlabel_next(findlabel_state *fls,
642 int *lablen_r, int *labstart_r);
643 /* Then, call this one repeatedly.
645 * It will return adns_s_ok if all is well, and tell you the length
646 * and start of successive labels. labstart_r may be null, but
647 * lablen_r must not be.
649 * After the last label, it will return with *lablen_r zero.
650 * Do not then call it again; instead, just throw away the findlabel_state.
652 * *dmend_rlater will have been set to point to the next part of
653 * the datagram after the label (or after the uncompressed part,
654 * if compression was used). *namelen_rlater will have been set
655 * to the length of the domain name (total length of labels plus
656 * 1 for each intervening dot).
658 * If the datagram appears to be truncated, *lablen_r will be -1.
659 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
660 * Do not call _next again.
662 * There may also be errors, in which case *dmend_rlater,
663 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
664 * Do not then call findlabel_next again.
671 adns_status adns__parse_domain(adns_state ads, int serv, adns_query qu,
672 vbuf *vb, parsedomain_flags flags,
673 const byte *dgram, int dglen, int *cbyte_io,
675 /* vb must already have been initialised; it will be reset if necessary.
676 * If there is truncation, vb->used will be set to 0; otherwise
677 * (if there is no error) vb will be null-terminated.
678 * If there is an error vb and *cbyte_io may be left indeterminate.
680 * serv may be -1 and qu may be 0 - they are used for error reporting only.
683 adns_status adns__parse_domain_more(findlabel_state *fls, adns_state ads,
684 adns_query qu, vbuf *vb,
685 parsedomain_flags flags,
687 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
688 * for continuing an existing domain or some such of some kind. Also, unlike
689 * _parse_domain, the domain data will be appended to vb, rather than replacing
690 * the existing contents.
693 adns_status adns__findrr(adns_query qu, int serv,
694 const byte *dgram, int dglen, int *cbyte_io,
695 int *type_r, int *class_r, unsigned long *ttl_r,
696 int *rdlen_r, int *rdstart_r,
697 int *ownermatchedquery_r);
698 /* Finds the extent and some of the contents of an RR in a datagram
699 * and does some checks. The datagram is *dgram, length dglen, and
700 * the RR starts at *cbyte_io (which is updated afterwards to point
701 * to the end of the RR).
703 * The type, class, TTL and RRdata length and start are returned iff
704 * the corresponding pointer variables are not null. type_r, class_r
705 * and ttl_r may not be null. The TTL will be capped.
707 * If ownermatchedquery_r != 0 then the owner domain of this
708 * RR will be compared with that in the query (or, if the query
709 * has gone to a CNAME lookup, with the canonical name).
710 * In this case, *ownermatchedquery_r will be set to 0 or 1.
711 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
713 * If there is truncation then *type_r will be set to -1 and
714 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
717 * qu must obviously be non-null.
719 * If an error is returned then *type_r will be undefined too.
722 adns_status adns__findrr_anychk(adns_query qu, int serv,
723 const byte *dgram, int dglen, int *cbyte_io,
724 int *type_r, int *class_r,
725 unsigned long *ttl_r,
726 int *rdlen_r, int *rdstart_r,
727 const byte *eo_dgram, int eo_dglen,
728 int eo_cbyte, int *eo_matched_r);
729 /* Like adns__findrr_checked, except that the datagram and
730 * owner to compare with can be specified explicitly.
732 * If the caller thinks they know what the owner of the RR ought to
733 * be they can pass in details in eo_*: this is another (or perhaps
734 * the same datagram), and a pointer to where the putative owner
735 * starts in that datagram. In this case *eo_matched_r will be set
736 * to 1 if the datagram matched or 0 if it did not. Either
737 * both eo_dgram and eo_matched_r must both be non-null, or they
738 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
739 * The eo datagram and contained owner domain MUST be valid and
743 void adns__update_expires(adns_query qu, unsigned long ttl,
745 /* Updates the `expires' field in the query, so that it doesn't exceed
749 int vbuf__append_quoted1035(vbuf *vb, const byte *buf, int len);
753 void adns__tcp_broken(adns_state ads, const char *what, const char *why);
754 /* what and why may be both 0, or both non-0. */
756 void adns__tcp_tryconnect(adns_state ads, struct timeval now);
758 void adns__autosys(adns_state ads, struct timeval now);
759 /* Make all the system calls we want to if the application wants us to.
760 * Must not be called from within adns internal processing functions,
761 * lest we end up in recursive descent !
764 void adns__must_gettimeofday(adns_state ads, const struct timeval **now_io,
765 struct timeval *tv_buf);
767 int adns__pollfds(adns_state ads, struct pollfd pollfds_buf[MAX_POLLFDS]);
768 void adns__fdevents(adns_state ads,
769 const struct pollfd *pollfds, int npollfds,
770 int maxfd, const fd_set *readfds,
771 const fd_set *writefds, const fd_set *exceptfds,
772 struct timeval now, int *r_r);
773 int adns__internal_check(adns_state ads,
774 adns_query *query_io,
775 adns_answer **answer,
778 void adns__timeouts(adns_state ads, int act,
779 struct timeval **tv_io, struct timeval *tvbuf,
781 /* If act is !0, then this will also deal with the TCP connection
782 * if previous events broke it or require it to be connected.
787 void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc);
789 /* Useful static inline functions: */
791 static inline int ctype_whitespace(int c) {
792 return c==' ' || c=='\n' || c=='\t';
794 static inline int ctype_digit(int c) { return c>='0' && c<='9'; }
795 static inline int ctype_alpha(int c) {
796 return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
798 static inline int ctype_822special(int c) {
799 return strchr("()<>@,;:\\\".[]",c) != 0;
801 static inline int ctype_domainunquoted(int c) {
802 return ctype_alpha(c) || ctype_digit(c) || (strchr("-_/+",c) != 0);
805 static inline int errno_resources(int e) { return e==ENOMEM || e==ENOBUFS; }
809 #define MEM_ROUND(sz) \
810 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
811 * sizeof(union maxalign) )
813 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
814 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
815 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
816 #define GET_L(cb,tv) ( (tv)=0, \
817 (tv)|=(GETIL_B((cb))<<24), \
818 (tv)|=(GETIL_B((cb))<<16), \
819 (tv)|=(GETIL_B((cb))<<8), \