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
;
127 union checklabel_state
{
133 void (*callback
)(adns_query parent
, adns_query child
);
136 adns_rr_addr ptr_addr
;
137 } tinfo
; /* type-specific state for the query itself: zero-init if you
138 * don't know better. */
141 adns_rr_hostaddr
*hostaddr
;
142 } pinfo
; /* state for use by parent's callback function */
145 typedef struct typeinfo
{
151 void (*makefinal
)(adns_query qu
, void *data
);
152 /* Change memory management of *data.
153 * Previously, used alloc_interim, now use alloc_final.
156 adns_status (*convstring
)(vbuf
*vb
, const void *data
);
157 /* Converts the RR data to a string representation in vbuf.
158 * vbuf will be appended to (it must have been initialised),
159 * and will not be null-terminated by convstring.
162 adns_status (*parse
)(const parseinfo
*pai
, int cbyte
,
163 int max
, void *store_r
);
164 /* Parse one RR, in dgram of length dglen, starting at cbyte and
165 * extending until at most max.
167 * The RR should be stored at *store_r, of length qu->typei->rrsz.
169 * If there is an overrun which might indicate truncation, it should set
170 * *rdstart to -1; otherwise it may set it to anything else positive.
172 * nsstart is the offset of the authority section.
175 int (*diff_needswap
)(adns_state ads
,const void *datap_a
,const void *datap_b
);
176 /* Returns !0 if RR a should be strictly after RR b in the sort order,
177 * 0 otherwise. Must not fail.
180 adns_status (*checklabel
)(adns_state ads
, adns_queryflags flags
,
181 union checklabel_state
*cls
, qcontext
*ctx
,
182 int labnum
, const char *label
, int lablen
);
183 /* Check a label from the query domain string. The label is not
184 * necessarily null-terminated. The hook can refuse the query's submission
185 * by returning a nonzero status. State can be stored in *cls between
186 * calls, and useful information can be stashed in ctx->tinfo, to be stored
187 * with the query (e.g., it will be available to the parse hook). This
188 * hook can detect a first call because labnum is zero, and a final call
189 * because lablen is zero.
192 void (*postsort
)(adns_state ads
, void *array
, int nrrs
,
193 const struct typeinfo
*typei
);
194 /* Called immediately after the RRs have been sorted, and may rearrange
195 * them. (This is really for the benefit of SRV's bizarre weighting
196 * stuff.) May be 0 to mean nothing needs to be done.
200 adns_status
adns__ckl_hostname(adns_state ads
, adns_queryflags flags
,
201 union checklabel_state
*cls
,
202 qcontext
*ctx
, int labnum
,
203 const char *label
, int lablen
);
204 /* implemented in query.c, used by types.c as default
205 * and as part of implementation for some fancier types
206 * doesn't require any state */
208 typedef struct allocnode
{
209 struct allocnode
*next
, *back
;
223 enum { query_tosend
, query_tcpw
, query_childw
, query_done
} state
;
224 adns_query back
, next
, parent
;
225 struct { adns_query head
, tail
; } children
;
226 struct { adns_query back
, next
; } siblings
;
227 struct { allocnode
*head
, *tail
; } allocations
;
228 int interim_allocd
, preserved_allocd
;
229 void *final_allocspace
;
231 const typeinfo
*typei
;
236 /* General-purpose messing-about buffer.
237 * Wherever a `big' interface is crossed, this may be corrupted/changed
238 * unless otherwise specified.
242 /* This is allocated when a query is submitted, to avoid being unable
243 * to relate errors to queries if we run out of memory. During
244 * query processing status, rrs is 0. cname is set if
245 * we found a cname (this corresponds to cname_dgram in the query
246 * structure). type is set from the word go. nrrs and rrs
247 * are set together, when we find how many rrs there are.
248 * owner is set during querying unless we're doing searchlist,
249 * in which case it is set only when we find an answer.
253 int cname_dglen
, cname_begin
;
254 /* If non-0, has been allocated using . */
257 int search_origlen
, search_pos
, search_doneabs
;
258 /* Used by the searching algorithm. The query domain in textual form
259 * is copied into the vbuf, and _origlen set to its length. Then
260 * we walk the searchlist, if we want to. _pos says where we are
261 * (next entry to try), and _doneabs says whether we've done the
262 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
263 * but not done yet). If flags doesn't have adns_qf_search then
264 * the vbuf is initialised but empty and everything else is zero.
267 int id
, flags
, retries
;
269 unsigned long udpsent
; /* bitmap indexed by server */
270 struct timeval timeout
;
271 time_t expires
; /* Earliest expiry time of any record we used. */
277 * state Queue child id nextudpserver udpsent tcpfailed
279 * tosend NONE null >=0 0 zero zero
280 * tosend udpw null >=0 any nonzero zero
281 * tosend NONE null >=0 any nonzero zero
283 * tcpw tcpw null >=0 irrelevant any any
285 * child childw set >=0 irrelevant irrelevant irrelevant
286 * child NONE null >=0 irrelevant irrelevant irrelevant
287 * done output null -1 irrelevant irrelevant irrelevant
289 * Queries are only not on a queue when they are actually being processed.
290 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
291 * iff the tcp connection is in state server_ok.
293 * +------------------------+
294 * START -----> | tosend/NONE |
295 * +------------------------+
297 * too big for UDP / UDP timeout \ \ send via UDP
298 * send via TCP / more retries \ \
299 * when conn'd / desired \ \
302 * +-----------+ +-------------+
303 * | tcpw/tcpw | ________ | tosend/udpw |
304 * +-----------+ \ +-------------+
305 * | | | UDP timeout | |
308 * \ | TCP died | desired | |
310 * \ \ servers | TCP / |
311 * \ \ to try | timeout / |
313 * reply \ _| +------------------+ / reply
314 * \ | done/output FAIL | /
315 * \ +------------------+ /
318 * (..... got reply ....)
320 * need child query/ies / \ no child query
323 * +---------------+ +----------------+
324 * | childw/childw | ----------------> | done/output OK |
325 * +---------------+ children done +----------------+
329 struct query_queue
{ adns_query head
, tail
; };
332 adns_initflags iflags
;
333 adns_logcallbackfn
*logfn
;
336 struct query_queue udpw
, tcpw
, childw
, output
;
337 adns_query forallnext
;
338 int nextid
, udpsocket
, tcpsocket
;
339 vbuf tcpsend
, tcprecv
;
340 int nservers
, nsortlist
, nsearchlist
, searchndots
, tcpserver
, tcprecv_skip
;
341 enum adns__tcpstate
{
342 server_disconnected
, server_connecting
,
343 server_ok
, server_broken
345 struct timeval tcptimeout
;
346 /* This will have tv_sec==0 if it is not valid. It will always be
347 * valid if tcpstate _connecting. When _ok, it will be nonzero if
348 * we are idle (ie, tcpw queue is empty), in which case it is the
349 * absolute time when we will close the connection.
351 struct sigaction stdsigpipe
;
353 struct pollfd pollfds_buf
[MAX_POLLFDS
];
356 } servers
[MAXSERVERS
];
358 struct in_addr base
, mask
;
359 } sortlist
[MAXSORTLIST
];
361 unsigned short rand48xsubi
[3];
366 int adns__setnonblock(adns_state ads
, int fd
); /* => errno value */
368 /* From general.c: */
370 void adns__vlprintf(adns_state ads
, const char *fmt
, va_list al
);
371 void adns__lprintf(adns_state ads
, const char *fmt
,
372 ...) PRINTFFORMAT(2,3);
374 void adns__vdiag(adns_state ads
, const char *pfx
, adns_initflags prevent
,
375 int serv
, adns_query qu
, const char *fmt
, va_list al
);
377 void adns__debug(adns_state ads
, int serv
, adns_query qu
,
378 const char *fmt
, ...) PRINTFFORMAT(4,5);
379 void adns__warn(adns_state ads
, int serv
, adns_query qu
,
380 const char *fmt
, ...) PRINTFFORMAT(4,5);
381 void adns__diag(adns_state ads
, int serv
, adns_query qu
,
382 const char *fmt
, ...) PRINTFFORMAT(4,5);
384 int adns__vbuf_ensure(vbuf
*vb
, int want
);
385 int adns__vbuf_appendstr(vbuf
*vb
, const char *data
); /* doesn't include nul */
386 int adns__vbuf_append(vbuf
*vb
, const byte
*data
, int len
);
387 /* 1=>success, 0=>realloc failed */
388 void adns__vbuf_appendq(vbuf
*vb
, const byte
*data
, int len
);
389 void adns__vbuf_init(vbuf
*vb
);
390 void adns__vbuf_free(vbuf
*vb
);
392 const char *adns__diag_domain(adns_state ads
, int serv
, adns_query qu
,
394 const byte
*dgram
, int dglen
, int cbyte
);
395 /* Unpicks a domain in a datagram and returns a string suitable for
396 * printing it as. Never fails - if an error occurs, it will
397 * return some kind of string describing the error.
399 * serv may be -1 and qu may be 0. vb must have been initialised,
400 * and will be left in an arbitrary consistent state.
402 * Returns either vb->buf, or a pointer to a string literal. Do not modify
403 * vb before using the return value.
406 void adns__isort(void *array
, int nobjs
, int sz
, void *tempbuf
,
407 int (*needswap
)(void *context
, const void *a
, const void *b
),
409 /* Does an insertion sort of array which must contain nobjs objects
410 * each sz bytes long. tempbuf must point to a buffer at least
411 * sz bytes long. needswap should return !0 if a>b (strictly, ie
412 * wrong order) 0 if a<=b (ie, order is fine).
415 void adns__sigpipe_protect(adns_state
);
416 void adns__sigpipe_unprotect(adns_state
);
417 /* If SIGPIPE protection is not disabled, will block all signals except
418 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
419 * Each call to _protect must be followed by a call to _unprotect before
420 * any significant amount of code gets to run, since the old signal mask
421 * is stored in the adns structure.
424 /* From transmit.c: */
426 adns_status
adns__mkquery(adns_state ads
, vbuf
*vb
, int *id_r
,
427 const char *owner
, int ol
,
428 const typeinfo
*typei
, adns_rrtype type
,
429 adns_queryflags flags
);
430 /* Assembles a query packet in vb. A new id is allocated and returned.
433 adns_status
adns__mkquery_frdgram(adns_state ads
, vbuf
*vb
, int *id_r
,
434 const byte
*qd_dgram
, int qd_dglen
,
436 adns_rrtype type
, adns_queryflags flags
);
437 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
438 * That domain must be correct and untruncated.
441 void adns__querysend_tcp(adns_query qu
, struct timeval now
);
442 /* Query must be in state tcpw/tcpw; it will be sent if possible and
443 * no further processing can be done on it for now. The connection
444 * might be broken, but no reconnect will be attempted.
447 void adns__query_send(adns_query qu
, struct timeval now
);
448 /* Query must be in state tosend/NONE; it will be moved to a new state,
449 * and no further processing can be done on it for now.
450 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
451 * connected), tcpsent/timew, child/childw or done/output.)
452 * __query_send may decide to use either UDP or TCP depending whether
453 * _qf_usevc is set (or has become set) and whether the query is too
459 adns_status
adns__internal_submit(adns_state ads
, adns_query
*query_r
,
460 const typeinfo
*typei
, vbuf
*qumsg_vb
,
462 adns_queryflags flags
, struct timeval now
,
464 /* Submits a query (for internal use, called during external submits).
466 * The new query is returned in *query_r, or we return adns_s_nomemory.
468 * The query datagram should already have been assembled in qumsg_vb;
469 * the memory for it is _taken over_ by this routine whether it
470 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
472 * *ctx is copied byte-for-byte into the query. Before doing this, its tinfo
473 * field may be modified by type hooks.
475 * When the child query is done, ctx->callback will be called. The
476 * child will already have been taken off both the global list of
477 * queries in ads and the list of children in the parent. The child
478 * will be freed when the callback returns. The parent will have been
479 * taken off the global childw queue.
481 * The callback should either call adns__query_done, if it is
482 * complete, or adns__query_fail, if an error has occurred, in which
483 * case the other children (if any) will be cancelled. If the parent
484 * has more unfinished children (or has just submitted more) then the
485 * callback may choose to wait for them - it must then put the parent
486 * back on the childw queue.
489 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
);
490 /* Walks down the searchlist for a query with adns_qf_search.
491 * The query should have just had a negative response, or not had
492 * any queries sent yet, and should not be on any queue.
493 * The query_dgram if any will be freed and forgotten and a new
494 * one constructed from the search_* members of the query.
496 * Cannot fail (in case of error, calls adns__query_fail).
499 void *adns__alloc_interim(adns_query qu
, size_t sz
);
500 void *adns__alloc_preserved(adns_query qu
, size_t sz
);
501 /* Allocates some memory, and records which query it came from
502 * and how much there was.
504 * If an error occurs in the query, all the memory from _interim is
505 * simply freed. If the query succeeds, one large buffer will be made
506 * which is big enough for all these allocations, and then
507 * adns__alloc_final will get memory from this buffer.
509 * _alloc_interim can fail (and return 0).
510 * The caller must ensure that the query is failed.
512 * The memory from _preserved is is kept and transferred into the
513 * larger buffer - unless we run out of memory, in which case it too
514 * is freed. When you use _preserved you have to add code to the
515 * x_nomem error exit case in adns__makefinal_query to clear out the
516 * pointers you made to those allocations, because that's when they're
517 * thrown away; you should also make a note in the declaration of
518 * those pointer variables, to note that they are _preserved rather
519 * than _interim. If they're in the answer, note it here:
520 * answer->cname and answer->owner are _preserved.
523 void adns__transfer_interim(adns_query from
, adns_query to
,
524 void *block
, size_t sz
);
525 /* Transfers an interim allocation from one query to another, so that
526 * the `to' query will have room for the data when we get to makefinal
527 * and so that the free will happen when the `to' query is freed
528 * rather than the `from' query.
530 * It is legal to call adns__transfer_interim with a null pointer; this
533 * _transfer_interim also ensures that the expiry time of the `to' query
534 * is no later than that of the `from' query, so that child queries'
535 * TTLs get inherited by their parents.
538 void *adns__alloc_mine(adns_query qu
, size_t sz
);
539 /* Like _interim, but does not record the length for later
540 * copying into the answer. This just ensures that the memory
541 * will be freed when we're done with the query.
544 void *adns__alloc_final(adns_query qu
, size_t sz
);
545 /* Cannot fail, and cannot return 0.
548 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
);
549 void adns__makefinal_str(adns_query qu
, char **strp
);
551 void adns__reset_preserved(adns_query qu
);
552 /* Resets all of the memory management stuff etc. to take account of
553 * only the _preserved stuff from _alloc_preserved. Used when we find
554 * an error somewhere and want to just report the error (with perhaps
555 * CNAME, owner, etc. info), and also when we're halfway through RRs
556 * in a datagram and discover that we need to retry the query.
559 void adns__query_done(adns_query qu
);
560 void adns__query_fail(adns_query qu
, adns_status stat
);
564 void adns__procdgram(adns_state ads
, const byte
*dgram
, int len
,
565 int serv
, int viatcp
, struct timeval now
);
566 /* This function is allowed to cause new datagrams to be constructed
567 * and sent, or even new queries to be started. However,
568 * query-sending functions are not allowed to call any general event
569 * loop functions in case they accidentally call this.
571 * Ie, receiving functions may call sending functions.
572 * Sending functions may NOT call receiving functions.
577 const typeinfo
*adns__findtype(adns_rrtype type
);
586 int dglen
, max
, cbyte
, namelen
;
590 void adns__findlabel_start(findlabel_state
*fls
, adns_state ads
,
591 int serv
, adns_query qu
,
592 const byte
*dgram
, int dglen
, int max
,
593 int dmbegin
, int *dmend_rlater
);
594 /* Finds labels in a domain in a datagram.
596 * Call this routine first.
597 * dmend_rlater may be null. ads (and of course fls) may not be.
598 * serv may be -1, qu may be null - they are for error reporting.
601 adns_status
adns__findlabel_next(findlabel_state
*fls
,
602 int *lablen_r
, int *labstart_r
);
603 /* Then, call this one repeatedly.
605 * It will return adns_s_ok if all is well, and tell you the length
606 * and start of successive labels. labstart_r may be null, but
607 * lablen_r must not be.
609 * After the last label, it will return with *lablen_r zero.
610 * Do not then call it again; instead, just throw away the findlabel_state.
612 * *dmend_rlater will have been set to point to the next part of
613 * the datagram after the label (or after the uncompressed part,
614 * if compression was used). *namelen_rlater will have been set
615 * to the length of the domain name (total length of labels plus
616 * 1 for each intervening dot).
618 * If the datagram appears to be truncated, *lablen_r will be -1.
619 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
620 * Do not call _next again.
622 * There may also be errors, in which case *dmend_rlater,
623 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
624 * Do not then call findlabel_next again.
631 adns_status
adns__parse_domain(adns_state ads
, int serv
, adns_query qu
,
632 vbuf
*vb
, parsedomain_flags flags
,
633 const byte
*dgram
, int dglen
, int *cbyte_io
,
635 /* vb must already have been initialised; it will be reset if necessary.
636 * If there is truncation, vb->used will be set to 0; otherwise
637 * (if there is no error) vb will be null-terminated.
638 * If there is an error vb and *cbyte_io may be left indeterminate.
640 * serv may be -1 and qu may be 0 - they are used for error reporting only.
643 adns_status
adns__parse_domain_more(findlabel_state
*fls
, adns_state ads
,
644 adns_query qu
, vbuf
*vb
,
645 parsedomain_flags flags
,
647 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
648 * for continuing an existing domain or some such of some kind. Also, unlike
649 * _parse_domain, the domain data will be appended to vb, rather than replacing
650 * the existing contents.
653 adns_status
adns__findrr(adns_query qu
, int serv
,
654 const byte
*dgram
, int dglen
, int *cbyte_io
,
655 int *type_r
, int *class_r
, unsigned long *ttl_r
,
656 int *rdlen_r
, int *rdstart_r
,
657 int *ownermatchedquery_r
);
658 /* Finds the extent and some of the contents of an RR in a datagram
659 * and does some checks. The datagram is *dgram, length dglen, and
660 * the RR starts at *cbyte_io (which is updated afterwards to point
661 * to the end of the RR).
663 * The type, class, TTL and RRdata length and start are returned iff
664 * the corresponding pointer variables are not null. type_r, class_r
665 * and ttl_r may not be null. The TTL will be capped.
667 * If ownermatchedquery_r != 0 then the owner domain of this
668 * RR will be compared with that in the query (or, if the query
669 * has gone to a CNAME lookup, with the canonical name).
670 * In this case, *ownermatchedquery_r will be set to 0 or 1.
671 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
673 * If there is truncation then *type_r will be set to -1 and
674 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
677 * qu must obviously be non-null.
679 * If an error is returned then *type_r will be undefined too.
682 adns_status
adns__findrr_anychk(adns_query qu
, int serv
,
683 const byte
*dgram
, int dglen
, int *cbyte_io
,
684 int *type_r
, int *class_r
,
685 unsigned long *ttl_r
,
686 int *rdlen_r
, int *rdstart_r
,
687 const byte
*eo_dgram
, int eo_dglen
,
688 int eo_cbyte
, int *eo_matched_r
);
689 /* Like adns__findrr_checked, except that the datagram and
690 * owner to compare with can be specified explicitly.
692 * If the caller thinks they know what the owner of the RR ought to
693 * be they can pass in details in eo_*: this is another (or perhaps
694 * the same datagram), and a pointer to where the putative owner
695 * starts in that datagram. In this case *eo_matched_r will be set
696 * to 1 if the datagram matched or 0 if it did not. Either
697 * both eo_dgram and eo_matched_r must both be non-null, or they
698 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
699 * The eo datagram and contained owner domain MUST be valid and
703 void adns__update_expires(adns_query qu
, unsigned long ttl
,
705 /* Updates the `expires' field in the query, so that it doesn't exceed
709 int vbuf__append_quoted1035(vbuf
*vb
, const byte
*buf
, int len
);
713 void adns__tcp_broken(adns_state ads
, const char *what
, const char *why
);
714 /* what and why may be both 0, or both non-0. */
716 void adns__tcp_tryconnect(adns_state ads
, struct timeval now
);
718 void adns__autosys(adns_state ads
, struct timeval now
);
719 /* Make all the system calls we want to if the application wants us to.
720 * Must not be called from within adns internal processing functions,
721 * lest we end up in recursive descent !
724 void adns__must_gettimeofday(adns_state ads
, const struct timeval
**now_io
,
725 struct timeval
*tv_buf
);
727 int adns__pollfds(adns_state ads
, struct pollfd pollfds_buf
[MAX_POLLFDS
]);
728 void adns__fdevents(adns_state ads
,
729 const struct pollfd
*pollfds
, int npollfds
,
730 int maxfd
, const fd_set
*readfds
,
731 const fd_set
*writefds
, const fd_set
*exceptfds
,
732 struct timeval now
, int *r_r
);
733 int adns__internal_check(adns_state ads
,
734 adns_query
*query_io
,
735 adns_answer
**answer
,
738 void adns__timeouts(adns_state ads
, int act
,
739 struct timeval
**tv_io
, struct timeval
*tvbuf
,
741 /* If act is !0, then this will also deal with the TCP connection
742 * if previous events broke it or require it to be connected.
747 void adns__consistency(adns_state ads
, adns_query qu
, consistency_checks cc
);
749 /* Useful static inline functions: */
751 static inline int ctype_whitespace(int c
) {
752 return c
==' ' || c
=='\n' || c
=='\t';
754 static inline int ctype_digit(int c
) { return c
>='0' && c
<='9'; }
755 static inline int ctype_alpha(int c
) {
756 return (c
>= 'a' && c
<= 'z') || (c
>= 'A' && c
<= 'Z');
758 static inline int ctype_822special(int c
) {
759 return strchr("()<>@,;:\\\".[]",c
) != 0;
761 static inline int ctype_domainunquoted(int c
) {
762 return ctype_alpha(c
) || ctype_digit(c
) || (strchr("-_/+",c
) != 0);
765 static inline int errno_resources(int e
) { return e
==ENOMEM
|| e
==ENOBUFS
; }
769 #define MEM_ROUND(sz) \
770 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
771 * sizeof(union maxalign) )
773 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
774 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
775 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
776 #define GET_L(cb,tv) ( (tv)=0, \
777 (tv)|=(GETIL_B((cb))<<24), \
778 (tv)|=(GETIL_B((cb))<<16), \
779 (tv)|=(GETIL_B((cb))<<8), \