97af49ec620ed7752445a7f11624b19365af9bef
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"
73 #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED
75 /* Some preprocessor hackery */
77 #define GLUE(x, y) GLUE_(x, y)
78 #define GLUE_(x, y) x##y
80 /* C99 macro `...' must match at least one argument, so the naive definition
81 * `#define CAR(car, ...) car' won't work. But it's easy to arrange for the
82 * tail to be nonempty if we're just going to discard it anyway. */
83 #define CAR(...) CAR_(__VA_ARGS__, _)
84 #define CAR_(car, ...) car
86 /* Extracting the tail of an argument list is rather more difficult. The
87 * following trick is based on one by Laurent Deniau to count the number of
88 * arguments to a macro, simplified in two ways: (a) it only handles up to
89 * eight arguments, and (b) it only needs to distinguish the one-argument
90 * case from many arguments. */
91 #define CDR(...) CDR_(__VA_ARGS__, m, m, m, m, m, m, m, 1, _)(__VA_ARGS__)
92 #define CDR_(_1, _2, _3, _4, _5, _6, _7, _8, n, ...) CDR_##n
94 #define CDR_m(_, ...) __VA_ARGS__
100 } consistency_checks
;
111 /* Shared data structures */
123 int dglen
, nsstart
, nscount
, arcount
;
132 struct af_addr
{ int af
; union gen_addr addr
; };
134 union checklabel_state
{
135 struct { byte ipv
[4]; } ptr
;
140 void (*callback
)(adns_query parent
, adns_query child
);
146 } tinfo
; /* type-specific state for the query itself: zero-init if you
147 * don't know better. */
150 adns_rr_hostaddr
*hostaddr
;
151 } pinfo
; /* state for use by parent's callback function */
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->getrrsz().
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 (*checklabel
)(adns_state ads
, adns_queryflags flags
,
190 union checklabel_state
*cls
, qcontext
*ctx
,
191 int labnum
, const char *label
, int lablen
);
192 /* Check a label from the query domain string. The label is not
193 * necessarily null-terminated. The hook can refuse the query's submission
194 * by returning a nonzero status. State can be stored in *cls between
195 * calls, and useful information can be stashed in ctx->tinfo, to be stored
196 * with the query (e.g., it will be available to the parse hook). This
197 * hook can detect a first call because labnum is zero, and a final call
198 * because lablen is zero.
201 void (*postsort
)(adns_state ads
, void *array
, int nrrs
,int rrsz
,
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
)(const struct typeinfo
*typei
, adns_rrtype type
);
209 /* Return the output resource-record element size; if this is null, then
210 * the rrsz member can be used.
214 adns_status
adns__ckl_hostname(adns_state ads
, adns_queryflags flags
,
215 union checklabel_state
*cls
,
216 qcontext
*ctx
, int labnum
,
217 const char *label
, int lablen
);
218 /* implemented in query.c, used by types.c as default
219 * and as part of implementation for some fancier types
220 * doesn't require any state */
222 typedef struct allocnode
{
223 struct allocnode
*next
, *back
;
237 enum { query_tosend
, query_tcpw
, query_childw
, query_done
} state
;
238 adns_query back
, next
, parent
;
239 struct { adns_query head
, tail
; } children
;
240 struct { adns_query back
, next
; } siblings
;
241 struct { allocnode
*head
, *tail
; } allocations
;
242 int interim_allocd
, preserved_allocd
;
243 void *final_allocspace
;
245 const typeinfo
*typei
;
250 /* General-purpose messing-about buffer.
251 * Wherever a `big' interface is crossed, this may be corrupted/changed
252 * unless otherwise specified.
256 /* This is allocated when a query is submitted, to avoid being unable
257 * to relate errors to queries if we run out of memory. During
258 * query processing status, rrs is 0. cname is set if
259 * we found a cname (this corresponds to cname_dgram in the query
260 * structure). type is set from the word go. nrrs and rrs
261 * are set together, when we find how many rrs there are.
262 * owner is set during querying unless we're doing searchlist,
263 * in which case it is set only when we find an answer.
267 int cname_dglen
, cname_begin
;
268 /* If non-0, has been allocated using . */
271 int search_origlen
, search_pos
, search_doneabs
;
272 /* Used by the searching algorithm. The query domain in textual form
273 * is copied into the vbuf, and _origlen set to its length. Then
274 * we walk the searchlist, if we want to. _pos says where we are
275 * (next entry to try), and _doneabs says whether we've done the
276 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
277 * but not done yet). If flags doesn't have adns_qf_search then
278 * the vbuf is initialised but empty and everything else is zero.
281 int id
, flags
, retries
;
283 unsigned long udpsent
; /* bitmap indexed by server */
284 struct timeval timeout
;
285 time_t expires
; /* Earliest expiry time of any record we used. */
291 * state Queue child id nextudpserver udpsent tcpfailed
293 * tosend NONE null >=0 0 zero zero
294 * tosend udpw null >=0 any nonzero zero
295 * tosend NONE null >=0 any nonzero zero
297 * tcpw tcpw null >=0 irrelevant any any
299 * child childw set >=0 irrelevant irrelevant irrelevant
300 * child NONE null >=0 irrelevant irrelevant irrelevant
301 * done output null -1 irrelevant irrelevant irrelevant
303 * Queries are only not on a queue when they are actually being processed.
304 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
305 * iff the tcp connection is in state server_ok.
307 * +------------------------+
308 * START -----> | tosend/NONE |
309 * +------------------------+
311 * too big for UDP / UDP timeout \ \ send via UDP
312 * send via TCP / more retries \ \
313 * when conn'd / desired \ \
316 * +-----------+ +-------------+
317 * | tcpw/tcpw | ________ | tosend/udpw |
318 * +-----------+ \ +-------------+
319 * | | | UDP timeout | |
322 * \ | TCP died | desired | |
324 * \ \ servers | TCP / |
325 * \ \ to try | timeout / |
327 * reply \ _| +------------------+ / reply
328 * \ | done/output FAIL | /
329 * \ +------------------+ /
332 * (..... got reply ....)
334 * need child query/ies / \ no child query
337 * +---------------+ +----------------+
338 * | childw/childw | ----------------> | done/output OK |
339 * +---------------+ children done +----------------+
343 struct query_queue
{ adns_query head
, tail
; };
346 adns_initflags iflags
;
347 adns_logcallbackfn
*logfn
;
350 struct query_queue udpw
, tcpw
, childw
, output
;
351 adns_query forallnext
;
352 int nextid
, udpsocket
, tcpsocket
;
353 vbuf tcpsend
, tcprecv
;
354 int nservers
, nsortlist
, nsearchlist
, searchndots
, tcpserver
, tcprecv_skip
;
355 enum adns__tcpstate
{
356 server_disconnected
, server_connecting
,
357 server_ok
, server_broken
359 struct timeval tcptimeout
;
360 /* This will have tv_sec==0 if it is not valid. It will always be
361 * valid if tcpstate _connecting. When _ok, it will be nonzero if
362 * we are idle (ie, tcpw queue is empty), in which case it is the
363 * absolute time when we will close the connection.
365 struct sigaction stdsigpipe
;
367 struct pollfd pollfds_buf
[MAX_POLLFDS
];
368 adns_rr_addr servers
[MAXSERVERS
];
371 union gen_addr base
, mask
;
372 } sortlist
[MAXSORTLIST
];
374 unsigned short rand48xsubi
[3];
379 int adns__setnonblock(adns_state ads
, int fd
); /* => errno value */
381 /* From general.c: */
383 void adns__vlprintf(adns_state ads
, const char *fmt
, va_list al
);
384 void adns__lprintf(adns_state ads
, const char *fmt
,
385 ...) PRINTFFORMAT(2,3);
387 void adns__vdiag(adns_state ads
, const char *pfx
, adns_initflags prevent
,
388 int serv
, adns_query qu
, const char *fmt
, va_list al
);
390 void adns__debug(adns_state ads
, int serv
, adns_query qu
,
391 const char *fmt
, ...) PRINTFFORMAT(4,5);
392 void adns__warn(adns_state ads
, int serv
, adns_query qu
,
393 const char *fmt
, ...) PRINTFFORMAT(4,5);
394 void adns__diag(adns_state ads
, int serv
, adns_query qu
,
395 const char *fmt
, ...) PRINTFFORMAT(4,5);
397 int adns__vbuf_ensure(vbuf
*vb
, int want
);
398 int adns__vbuf_appendstr(vbuf
*vb
, const char *data
); /* doesn't include nul */
399 int adns__vbuf_append(vbuf
*vb
, const byte
*data
, int len
);
400 /* 1=>success, 0=>realloc failed */
401 void adns__vbuf_appendq(vbuf
*vb
, const byte
*data
, int len
);
402 void adns__vbuf_init(vbuf
*vb
);
403 void adns__vbuf_free(vbuf
*vb
);
405 const char *adns__diag_domain(adns_state ads
, int serv
, adns_query qu
,
407 const byte
*dgram
, int dglen
, int cbyte
);
408 /* Unpicks a domain in a datagram and returns a string suitable for
409 * printing it as. Never fails - if an error occurs, it will
410 * return some kind of string describing the error.
412 * serv may be -1 and qu may be 0. vb must have been initialised,
413 * and will be left in an arbitrary consistent state.
415 * Returns either vb->buf, or a pointer to a string literal. Do not modify
416 * vb before using the return value.
419 int adns__getrrsz_default(const typeinfo
*typei
, adns_rrtype type
);
420 /* Default function for the `getrrsz' type hook; returns the `fixed_rrsz'
421 * value from the typeinfo entry.
424 void adns__isort(void *array
, int nobjs
, int sz
, void *tempbuf
,
425 int (*needswap
)(void *context
, const void *a
, const void *b
),
427 /* Does an insertion sort of array which must contain nobjs objects
428 * each sz bytes long. tempbuf must point to a buffer at least
429 * sz bytes long. needswap should return !0 if a>b (strictly, ie
430 * wrong order) 0 if a<=b (ie, order is fine).
433 void adns__sigpipe_protect(adns_state
);
434 void adns__sigpipe_unprotect(adns_state
);
435 /* If SIGPIPE protection is not disabled, will block all signals except
436 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
437 * Each call to _protect must be followed by a call to _unprotect before
438 * any significant amount of code gets to run, since the old signal mask
439 * is stored in the adns structure.
442 /* From transmit.c: */
444 adns_status
adns__mkquery(adns_state ads
, vbuf
*vb
, int *id_r
,
445 const char *owner
, int ol
,
446 const typeinfo
*typei
, adns_rrtype type
,
447 adns_queryflags flags
);
448 /* Assembles a query packet in vb. A new id is allocated and returned.
451 adns_status
adns__mkquery_frdgram(adns_state ads
, vbuf
*vb
, int *id_r
,
452 const byte
*qd_dgram
, int qd_dglen
,
454 adns_rrtype type
, adns_queryflags flags
);
455 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
456 * That domain must be correct and untruncated.
459 void adns__querysend_tcp(adns_query qu
, struct timeval now
);
460 /* Query must be in state tcpw/tcpw; it will be sent if possible and
461 * no further processing can be done on it for now. The connection
462 * might be broken, but no reconnect will be attempted.
465 void adns__query_send(adns_query qu
, struct timeval now
);
466 /* Query must be in state tosend/NONE; it will be moved to a new state,
467 * and no further processing can be done on it for now.
468 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
469 * connected), tcpsent/timew, child/childw or done/output.)
470 * __query_send may decide to use either UDP or TCP depending whether
471 * _qf_usevc is set (or has become set) and whether the query is too
477 adns_status
adns__internal_submit(adns_state ads
, adns_query
*query_r
,
478 const typeinfo
*typei
, adns_rrtype type
,
479 vbuf
*qumsg_vb
, int id
,
480 adns_queryflags flags
, struct timeval now
,
482 /* Submits a query (for internal use, called during external submits).
484 * The new query is returned in *query_r, or we return adns_s_nomemory.
486 * The query datagram should already have been assembled in qumsg_vb;
487 * the memory for it is _taken over_ by this routine whether it
488 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
490 * *ctx is copied byte-for-byte into the query. Before doing this, its tinfo
491 * field may be modified by type hooks.
493 * When the child query is done, ctx->callback will be called. The
494 * child will already have been taken off both the global list of
495 * queries in ads and the list of children in the parent. The child
496 * will be freed when the callback returns. The parent will have been
497 * taken off the global childw queue.
499 * The callback should either call adns__query_done, if it is
500 * complete, or adns__query_fail, if an error has occurred, in which
501 * case the other children (if any) will be cancelled. If the parent
502 * has more unfinished children (or has just submitted more) then the
503 * callback may choose to wait for them - it must then put the parent
504 * back on the childw queue.
507 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
);
508 /* Walks down the searchlist for a query with adns_qf_search.
509 * The query should have just had a negative response, or not had
510 * any queries sent yet, and should not be on any queue.
511 * The query_dgram if any will be freed and forgotten and a new
512 * one constructed from the search_* members of the query.
514 * Cannot fail (in case of error, calls adns__query_fail).
517 void *adns__alloc_interim(adns_query qu
, size_t sz
);
518 void *adns__alloc_preserved(adns_query qu
, size_t sz
);
519 /* Allocates some memory, and records which query it came from
520 * and how much there was.
522 * If an error occurs in the query, all the memory from _interim is
523 * simply freed. If the query succeeds, one large buffer will be made
524 * which is big enough for all these allocations, and then
525 * adns__alloc_final will get memory from this buffer.
527 * _alloc_interim can fail (and return 0).
528 * The caller must ensure that the query is failed.
530 * The memory from _preserved is is kept and transferred into the
531 * larger buffer - unless we run out of memory, in which case it too
532 * is freed. When you use _preserved you have to add code to the
533 * x_nomem error exit case in adns__makefinal_query to clear out the
534 * pointers you made to those allocations, because that's when they're
535 * thrown away; you should also make a note in the declaration of
536 * those pointer variables, to note that they are _preserved rather
537 * than _interim. If they're in the answer, note it here:
538 * answer->cname and answer->owner are _preserved.
541 void adns__transfer_interim(adns_query from
, adns_query to
,
542 void *block
, size_t sz
);
543 /* Transfers an interim allocation from one query to another, so that
544 * the `to' query will have room for the data when we get to makefinal
545 * and so that the free will happen when the `to' query is freed
546 * rather than the `from' query.
548 * It is legal to call adns__transfer_interim with a null pointer; this
551 * _transfer_interim also ensures that the expiry time of the `to' query
552 * is no later than that of the `from' query, so that child queries'
553 * TTLs get inherited by their parents.
556 void *adns__alloc_mine(adns_query qu
, size_t sz
);
557 /* Like _interim, but does not record the length for later
558 * copying into the answer. This just ensures that the memory
559 * will be freed when we're done with the query.
562 void *adns__alloc_final(adns_query qu
, size_t sz
);
563 /* Cannot fail, and cannot return 0.
566 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
);
567 void adns__makefinal_str(adns_query qu
, char **strp
);
569 void adns__reset_preserved(adns_query qu
);
570 /* Resets all of the memory management stuff etc. to take account of
571 * only the _preserved stuff from _alloc_preserved. Used when we find
572 * an error somewhere and want to just report the error (with perhaps
573 * CNAME, owner, etc. info), and also when we're halfway through RRs
574 * in a datagram and discover that we need to retry the query.
577 void adns__query_done(adns_query qu
);
578 void adns__query_fail(adns_query qu
, adns_status stat
);
582 void adns__procdgram(adns_state ads
, const byte
*dgram
, int len
,
583 int serv
, int viatcp
, struct timeval now
);
584 /* This function is allowed to cause new datagrams to be constructed
585 * and sent, or even new queries to be started. However,
586 * query-sending functions are not allowed to call any general event
587 * loop functions in case they accidentally call this.
589 * Ie, receiving functions may call sending functions.
590 * Sending functions may NOT call receiving functions.
595 const typeinfo
*adns__findtype(adns_rrtype type
);
604 int dglen
, max
, cbyte
, namelen
;
608 void adns__findlabel_start(findlabel_state
*fls
, adns_state ads
,
609 int serv
, adns_query qu
,
610 const byte
*dgram
, int dglen
, int max
,
611 int dmbegin
, int *dmend_rlater
);
612 /* Finds labels in a domain in a datagram.
614 * Call this routine first.
615 * dmend_rlater may be null. ads (and of course fls) may not be.
616 * serv may be -1, qu may be null - they are for error reporting.
619 adns_status
adns__findlabel_next(findlabel_state
*fls
,
620 int *lablen_r
, int *labstart_r
);
621 /* Then, call this one repeatedly.
623 * It will return adns_s_ok if all is well, and tell you the length
624 * and start of successive labels. labstart_r may be null, but
625 * lablen_r must not be.
627 * After the last label, it will return with *lablen_r zero.
628 * Do not then call it again; instead, just throw away the findlabel_state.
630 * *dmend_rlater will have been set to point to the next part of
631 * the datagram after the label (or after the uncompressed part,
632 * if compression was used). *namelen_rlater will have been set
633 * to the length of the domain name (total length of labels plus
634 * 1 for each intervening dot).
636 * If the datagram appears to be truncated, *lablen_r will be -1.
637 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
638 * Do not call _next again.
640 * There may also be errors, in which case *dmend_rlater,
641 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
642 * Do not then call findlabel_next again.
649 adns_status
adns__parse_domain(adns_state ads
, int serv
, adns_query qu
,
650 vbuf
*vb
, parsedomain_flags flags
,
651 const byte
*dgram
, int dglen
, int *cbyte_io
,
653 /* vb must already have been initialised; it will be reset if necessary.
654 * If there is truncation, vb->used will be set to 0; otherwise
655 * (if there is no error) vb will be null-terminated.
656 * If there is an error vb and *cbyte_io may be left indeterminate.
658 * serv may be -1 and qu may be 0 - they are used for error reporting only.
661 adns_status
adns__parse_domain_more(findlabel_state
*fls
, adns_state ads
,
662 adns_query qu
, vbuf
*vb
,
663 parsedomain_flags flags
,
665 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
666 * for continuing an existing domain or some such of some kind. Also, unlike
667 * _parse_domain, the domain data will be appended to vb, rather than replacing
668 * the existing contents.
671 adns_status
adns__findrr(adns_query qu
, int serv
,
672 const byte
*dgram
, int dglen
, int *cbyte_io
,
673 int *type_r
, int *class_r
, unsigned long *ttl_r
,
674 int *rdlen_r
, int *rdstart_r
,
675 int *ownermatchedquery_r
);
676 /* Finds the extent and some of the contents of an RR in a datagram
677 * and does some checks. The datagram is *dgram, length dglen, and
678 * the RR starts at *cbyte_io (which is updated afterwards to point
679 * to the end of the RR).
681 * The type, class, TTL and RRdata length and start are returned iff
682 * the corresponding pointer variables are not null. type_r, class_r
683 * and ttl_r may not be null. The TTL will be capped.
685 * If ownermatchedquery_r != 0 then the owner domain of this
686 * RR will be compared with that in the query (or, if the query
687 * has gone to a CNAME lookup, with the canonical name).
688 * In this case, *ownermatchedquery_r will be set to 0 or 1.
689 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
691 * If there is truncation then *type_r will be set to -1 and
692 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
695 * qu must obviously be non-null.
697 * If an error is returned then *type_r will be undefined too.
700 adns_status
adns__findrr_anychk(adns_query qu
, int serv
,
701 const byte
*dgram
, int dglen
, int *cbyte_io
,
702 int *type_r
, int *class_r
,
703 unsigned long *ttl_r
,
704 int *rdlen_r
, int *rdstart_r
,
705 const byte
*eo_dgram
, int eo_dglen
,
706 int eo_cbyte
, int *eo_matched_r
);
707 /* Like adns__findrr_checked, except that the datagram and
708 * owner to compare with can be specified explicitly.
710 * If the caller thinks they know what the owner of the RR ought to
711 * be they can pass in details in eo_*: this is another (or perhaps
712 * the same datagram), and a pointer to where the putative owner
713 * starts in that datagram. In this case *eo_matched_r will be set
714 * to 1 if the datagram matched or 0 if it did not. Either
715 * both eo_dgram and eo_matched_r must both be non-null, or they
716 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
717 * The eo datagram and contained owner domain MUST be valid and
721 void adns__update_expires(adns_query qu
, unsigned long ttl
,
723 /* Updates the `expires' field in the query, so that it doesn't exceed
727 int vbuf__append_quoted1035(vbuf
*vb
, const byte
*buf
, int len
);
731 void adns__tcp_broken(adns_state ads
, const char *what
, const char *why
);
732 /* what and why may be both 0, or both non-0. */
734 void adns__tcp_tryconnect(adns_state ads
, struct timeval now
);
736 void adns__autosys(adns_state ads
, struct timeval now
);
737 /* Make all the system calls we want to if the application wants us to.
738 * Must not be called from within adns internal processing functions,
739 * lest we end up in recursive descent !
742 void adns__must_gettimeofday(adns_state ads
, const struct timeval
**now_io
,
743 struct timeval
*tv_buf
);
745 int adns__pollfds(adns_state ads
, struct pollfd pollfds_buf
[MAX_POLLFDS
]);
746 void adns__fdevents(adns_state ads
,
747 const struct pollfd
*pollfds
, int npollfds
,
748 int maxfd
, const fd_set
*readfds
,
749 const fd_set
*writefds
, const fd_set
*exceptfds
,
750 struct timeval now
, int *r_r
);
751 int adns__internal_check(adns_state ads
,
752 adns_query
*query_io
,
753 adns_answer
**answer
,
756 void adns__timeouts(adns_state ads
, int act
,
757 struct timeval
**tv_io
, struct timeval
*tvbuf
,
759 /* If act is !0, then this will also deal with the TCP connection
760 * if previous events broke it or require it to be connected.
765 void adns__consistency(adns_state ads
, adns_query qu
, consistency_checks cc
);
767 /* Useful static inline functions: */
769 static inline int ctype_whitespace(int c
) {
770 return c
==' ' || c
=='\n' || c
=='\t';
772 static inline int ctype_digit(int c
) { return c
>='0' && c
<='9'; }
773 static inline int ctype_alpha(int c
) {
774 return (c
>= 'a' && c
<= 'z') || (c
>= 'A' && c
<= 'Z');
776 static inline int ctype_822special(int c
) {
777 return strchr("()<>@,;:\\\".[]",c
) != 0;
779 static inline int ctype_domainunquoted(int c
) {
780 return ctype_alpha(c
) || ctype_digit(c
) || (strchr("-_/+",c
) != 0);
783 static inline int errno_resources(int e
) { return e
==ENOMEM
|| e
==ENOBUFS
; }
787 #define MEM_ROUND(sz) \
788 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
789 * sizeof(union maxalign) )
791 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
792 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
793 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
794 #define GET_L(cb,tv) ( (tv)=0, \
795 (tv)|=(GETIL_B((cb))<<24), \
796 (tv)|=(GETIL_B((cb))<<16), \
797 (tv)|=(GETIL_B((cb))<<8), \