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 #pragma GCC visibility push(hidden)
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"
74 #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED
91 /* Shared data structures */
112 int dglen, nsstart, nscount, arcount;
116 typedef struct typeinfo {
122 void (*makefinal)(adns_query qu, void *data);
123 /* Change memory management of *data.
124 * Previously, used alloc_interim, now use alloc_final.
127 adns_status (*convstring)(vbuf *vb, const void *data);
128 /* Converts the RR data to a string representation in vbuf.
129 * vbuf will be appended to (it must have been initialised),
130 * and will not be null-terminated by convstring.
133 void (*submithook)(adns_query qu,
134 /* FIXME: Do we need to pass flags? Isn't qu->flags enough? */
135 adns_queryflags flags,
137 /* If NULL, submitting a query means to format it and send it over
138 * the wire. If non-NULL, the labels are written to qu->vb, and then
139 * this function is called. It's the hook's responsibility to submit
140 * the query, or submit some other queries and put the original on
141 * the child queue. */
143 adns_status (*parse)(const parseinfo *pai, int cbyte,
144 int max, void *store_r);
145 /* Parse one RR, in dgram of length dglen, starting at cbyte and
146 * extending until at most max.
148 * The RR should be stored at *store_r, of length qu->typei->rrsz.
150 * If there is an overrun which might indicate truncation, it should set
151 * *rdstart to -1; otherwise it may set it to anything else positive.
153 * nsstart is the offset of the authority section.
156 int (*diff_needswap)(adns_state ads,const void *datap_a,const void *datap_b);
157 /* Returns !0 if RR a should be strictly after RR b in the sort order,
158 * 0 otherwise. Must not fail.
161 adns_status (*qdparselabel)(adns_state ads,
162 const char **p_io, const char *pe, int labelnum,
163 char label_r[DNS_MAXDOMAIN], int *ll_io,
164 adns_queryflags flags,
165 const struct typeinfo *typei);
166 /* Parses one label from the query domain string. On entry, *p_io
167 * points to the next character to parse and *ll_io is the size of
168 * the buffer. pe points just after the end of the query domain
169 * string. On successful return, label_r[] and *ll_io are filled in
170 * and *p_io points to *pe or just after the label-ending `.'. */
172 void (*postsort)(adns_state ads, void *array, int nrrs,
173 const struct typeinfo *typei);
174 /* Called immediately after the RRs have been sorted, and may rearrange
175 * them. (This is really for the benefit of SRV's bizarre weighting
176 * stuff.) May be 0 to mean nothing needs to be done.
180 adns_status adns__qdpl_normal(adns_state ads,
181 const char **p_io, const char *pe, int labelnum,
182 char label_r[], int *ll_io,
183 adns_queryflags flags,
184 const typeinfo *typei);
185 /* implemented in transmit.c, used by types.c as default
186 * and as part of implementation for some fancier types */
188 typedef struct allocnode {
189 struct allocnode *next, *back;
191 /* Needed for realloc */
205 void (*callback)(adns_query parent, adns_query child);
207 adns_rr_hostaddr *hostaddr;
213 adns_rr_addr ptr_addr;
219 enum { query_tosend, query_tcpw, query_childw, query_done } state;
220 adns_query back, next, parent;
221 struct { adns_query head, tail; } children;
222 struct { adns_query back, next; } siblings;
223 struct { allocnode *head, *tail; } allocations;
224 int interim_allocd, preserved_allocd;
225 void *final_allocspace;
227 const typeinfo *typei;
232 /* General-purpose messing-about buffer.
233 * Wherever a `big' interface is crossed, this may be corrupted/changed
234 * unless otherwise specified.
238 /* This is allocated when a query is submitted, to avoid being unable
239 * to relate errors to queries if we run out of memory. During
240 * query processing status, rrs is 0. cname is set if
241 * we found a cname (this corresponds to cname_dgram in the query
242 * structure). type is set from the word go. nrrs and rrs
243 * are set together, when we find how many rrs there are.
244 * owner is set during querying unless we're doing searchlist,
245 * in which case it is set only when we find an answer.
249 int cname_dglen, cname_begin;
250 /* If non-0, has been allocated using . */
253 int search_origlen, search_pos, search_doneabs;
254 /* Used by the searching algorithm. The query domain in textual form
255 * is copied into the vbuf, and _origlen set to its length. Then
256 * we walk the searchlist, if we want to. _pos says where we are
257 * (next entry to try), and _doneabs says whether we've done the
258 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
259 * but not done yet). If flags doesn't have adns_qf_search then
260 * the vbuf is initialised but empty and everything else is zero.
264 /* -2 at allocation, -1 when done, >= 0 while the query is pending. */
268 unsigned long udpsent; /* bitmap indexed by server */
269 struct timeval timeout;
270 time_t expires; /* Earliest expiry time of any record we used. */
273 /* Information related to the parent of the query */
275 /* Extra information about this query. */
279 * state Queue child id nextudpserver udpsent tcpfailed
281 * tosend NONE null >=0 0 zero zero
282 * tosend udpw null >=0 any nonzero zero
283 * tosend NONE null >=0 any nonzero zero
285 * tcpw tcpw null >=0 irrelevant any any
287 * child childw set >=0 irrelevant irrelevant irrelevant
288 * child NONE null >=0 irrelevant irrelevant irrelevant
289 * done output null -1 irrelevant irrelevant irrelevant
291 * Queries are only not on a queue when they are actually being processed.
292 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
293 * iff the tcp connection is in state server_ok.
295 * +------------------------+
296 * START -----> | tosend/NONE |
297 * _____+------------------------+
298 * consists of __----- / |\ \
299 * child- / / UDP timeout \ \ send via UDP
300 * queries / too big for UDP/ more retries \ \
301 * only / send via TCP / desired \ \
302 * / when conn'd / | |
304 * | +-----------+ +-------------+
305 * | | tcpw/tcpw | ________ | tosend/udpw |
306 * | +-----------+ \ +-------------+
307 * | | | | UDP timeout | |
308 * | | | | no more | |
309 * | | | | retries | |
310 * | \ | TCP died | desired | |
311 * | \ \ no more | | |
312 * | \ \ servers | TCP / |
313 * | \ \ to try | timeout / |
314 * | got \ \ v |_ | got
315 * | reply \ _| +------------------+ / reply
316 * \ \ | done/output FAIL | /
317 * \ \ +------------------+ /
320 * \ (..... got reply ....)
322 * need child query/ies / \ no child query
325 * +---------------+ +----------------+
326 * | childw/childw | ----------------> | done/output OK |
327 * +---------------+ children done +----------------+
331 struct query_queue { adns_query head, tail; };
334 adns_initflags iflags;
335 adns_logcallbackfn *logfn;
338 struct query_queue udpw, tcpw, childw, output;
339 adns_query forallnext;
340 int nextid, udpsocket, tcpsocket;
341 vbuf tcpsend, tcprecv;
342 int nservers, nsortlist, nsearchlist, searchndots, tcpserver, tcprecv_skip;
343 enum adns__tcpstate {
344 server_disconnected, server_connecting,
345 server_ok, server_broken
347 struct timeval tcptimeout;
348 /* This will have tv_sec==0 if it is not valid. It will always be
349 * valid if tcpstate _connecting. When _ok, it will be nonzero if
350 * we are idle (ie, tcpw queue is empty), in which case it is the
351 * absolute time when we will close the connection.
353 struct sigaction stdsigpipe;
355 struct pollfd pollfds_buf[MAX_POLLFDS];
358 } servers[MAXSERVERS];
364 struct in6_addr inet6;
366 } sortlist[MAXSORTLIST];
368 unsigned short rand48xsubi[3];
373 int adns__setnonblock(adns_state ads, int fd); /* => errno value */
375 /* From general.c: */
377 void adns__vlprintf(adns_state ads, const char *fmt, va_list al);
378 void adns__lprintf(adns_state ads, const char *fmt,
379 ...) PRINTFFORMAT(2,3);
381 void adns__vdiag(adns_state ads, const char *pfx, adns_initflags prevent,
382 int serv, adns_query qu, const char *fmt, va_list al);
384 void adns__debug(adns_state ads, int serv, adns_query qu,
385 const char *fmt, ...) PRINTFFORMAT(4,5);
386 void adns__warn(adns_state ads, int serv, adns_query qu,
387 const char *fmt, ...) PRINTFFORMAT(4,5);
388 void adns__diag(adns_state ads, int serv, adns_query qu,
389 const char *fmt, ...) PRINTFFORMAT(4,5);
391 int adns__vbuf_ensure(vbuf *vb, int want);
392 int adns__vbuf_appendstr(vbuf *vb, const char *data); /* doesn't include nul */
393 int adns__vbuf_append(vbuf *vb, const byte *data, int len);
394 /* 1=>success, 0=>realloc failed */
395 void adns__vbuf_appendq(vbuf *vb, const byte *data, int len);
396 void adns__vbuf_init(vbuf *vb);
397 void adns__vbuf_free(vbuf *vb);
399 const char *adns__diag_domain(adns_state ads, int serv, adns_query qu,
401 const byte *dgram, int dglen, int cbyte);
402 /* Unpicks a domain in a datagram and returns a string suitable for
403 * printing it as. Never fails - if an error occurs, it will
404 * return some kind of string describing the error.
406 * serv may be -1 and qu may be 0. vb must have been initialised,
407 * and will be left in an arbitrary consistent state.
409 * Returns either vb->buf, or a pointer to a string literal. Do not modify
410 * vb before using the return value.
413 void adns__isort(void *array, int nobjs, int sz, void *tempbuf,
414 int (*needswap)(void *context, const void *a, const void *b),
416 /* Does an insertion sort of array which must contain nobjs objects
417 * each sz bytes long. tempbuf must point to a buffer at least
418 * sz bytes long. needswap should return !0 if a>b (strictly, ie
419 * wrong order) 0 if a<=b (ie, order is fine).
422 void adns__sigpipe_protect(adns_state);
423 void adns__sigpipe_unprotect(adns_state);
424 /* If SIGPIPE protection is not disabled, will block all signals except
425 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
426 * Each call to _protect must be followed by a call to _unprotect before
427 * any significant amount of code gets to run, since the old signal mask
428 * is stored in the adns structure.
431 /* From transmit.c: */
433 adns_status adns__mkquery_labels(adns_state ads, vbuf *vb,
434 const char *owner, int ol,
435 const typeinfo *typei, adns_queryflags flags);
436 /* Assembles the owner part of a query packet in vb. */
438 adns_status adns__mkquery_labels_frdgram(adns_state ads, vbuf *vb,
439 const byte *qd_dgram, int qd_dglen,
442 adns_status adns__mkquery(adns_state ads, vbuf *vb, int *id_r,
443 const char *owner, int ol,
444 const typeinfo *typei, adns_rrtype type,
445 adns_queryflags flags);
446 /* Assembles a query packet in vb. A new id is allocated and returned.
449 adns_status adns__mkquery_frlabels(adns_state ads, vbuf *vb, int *id_r,
451 adns_rrtype type, adns_queryflags flags);
452 /* Same as adns__mkquery, but with the labels preformatted. */
454 adns_status adns__mkquery_frdgram(adns_state ads, vbuf *vb, int *id_r,
455 const byte *qd_dgram, int qd_dglen,
457 adns_rrtype type, adns_queryflags flags);
458 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
459 * That domain must be correct and untruncated.
462 void adns__querysend_tcp(adns_query qu, struct timeval now);
463 /* Query must be in state tcpw/tcpw; it will be sent if possible and
464 * no further processing can be done on it for now. The connection
465 * might be broken, but no reconnect will be attempted.
468 void adns__query_send(adns_query qu, struct timeval now);
469 /* Query must be in state tosend/NONE; it will be moved to a new state,
470 * and no further processing can be done on it for now.
471 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
472 * connected), tcpsent/timew, child/childw or done/output.)
473 * __query_send may decide to use either UDP or TCP depending whether
474 * _qf_usevc is set (or has become set) and whether the query is too
480 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
481 const typeinfo *typei, vbuf *qumsg_vb,
483 adns_queryflags flags, struct timeval now,
484 const qcontext *ctx);
485 /* Submits a query (for internal use, called during external submits).
487 * The new query is returned in *query_r, or we return adns_s_nomemory.
489 * The query datagram should already have been assembled in qumsg_vb;
490 * the memory for it is _taken over_ by this routine whether it
491 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
493 * For query types with a submithook (i.e. adns_r_addr),
494 * vbuf should contain just the label, not a complete query.
496 * *ctx is copied byte-for-byte into the query.
498 * When the child query is done, ctx->callback will be called. The
499 * child will already have been taken off both the global list of
500 * queries in ads and the list of children in the parent. The child
501 * will be freed when the callback returns. The parent will have been
502 * taken off the global childw queue.
504 * The callback should either call adns__query_done, if it is
505 * complete, or adns__query_fail, if an error has occurred, in which
506 * case the other children (if any) will be cancelled. If the parent
507 * has more unfinished children (or has just submitted more) then the
508 * callback may choose to wait for them - it must then put the parent
509 * back on the childw queue.
512 void adns__search_next(adns_state ads, adns_query qu, struct timeval now);
513 /* Walks down the searchlist for a query with adns_qf_search.
514 * The query should have just had a negative response, or not had
515 * any queries sent yet, and should not be on any queue.
516 * The query_dgram if any will be freed and forgotten and a new
517 * one constructed from the search_* members of the query.
519 * Cannot fail (in case of error, calls adns__query_fail).
522 void *adns__alloc_interim(adns_query qu, size_t sz);
523 void *adns__realloc_interim(adns_query qu, void *p, size_t sz);
524 void *adns__alloc_preserved(adns_query qu, size_t sz);
525 /* Allocates some memory, and records which query it came from
526 * and how much there was.
528 * If an error occurs in the query, all the memory from _interim is
529 * simply freed. If the query succeeds, one large buffer will be made
530 * which is big enough for all these allocations, and then
531 * adns__alloc_final will get memory from this buffer.
533 * _alloc_interim can fail (and return 0).
534 * The caller must ensure that the query is failed.
536 * The memory from _preserved is is kept and transferred into the
537 * larger buffer - unless we run out of memory, in which case it too
538 * is freed. When you use _preserved you have to add code to the
539 * x_nomem error exit case in adns__makefinal_query to clear out the
540 * pointers you made to those allocations, because that's when they're
541 * thrown away; you should also make a note in the declaration of
542 * those pointer variables, to note that they are _preserved rather
543 * than _interim. If they're in the answer, note it here:
544 * answer->cname and answer->owner are _preserved.
547 void adns__transfer_interim(adns_query from, adns_query to,
548 void *block, size_t sz);
549 /* Transfers an interim allocation from one query to another, so that
550 * the `to' query will have room for the data when we get to makefinal
551 * and so that the free will happen when the `to' query is freed
552 * rather than the `from' query.
554 * It is legal to call adns__transfer_interim with a null pointer; this
557 * _transfer_interim also ensures that the expiry time of the `to' query
558 * is no later than that of the `from' query, so that child queries'
559 * TTLs get inherited by their parents.
562 void *adns__alloc_mine(adns_query qu, size_t sz);
563 /* Like _interim, but does not record the length for later
564 * copying into the answer. This just ensures that the memory
565 * will be freed when we're done with the query.
568 void *adns__alloc_final(adns_query qu, size_t sz);
569 /* Cannot fail, and cannot return 0.
572 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz);
573 void adns__makefinal_str(adns_query qu, char **strp);
575 void adns__reset_preserved(adns_query qu);
576 /* Resets all of the memory management stuff etc. to take account of
577 * only the _preserved stuff from _alloc_preserved. Used when we find
578 * an error somewhere and want to just report the error (with perhaps
579 * CNAME, owner, etc. info), and also when we're halfway through RRs
580 * in a datagram and discover that we need to retry the query.
583 void adns__query_done(adns_query qu);
584 void adns__query_fail(adns_query qu, adns_status stat);
588 void adns__procdgram(adns_state ads, const byte *dgram, int len,
589 int serv, int viatcp, struct timeval now);
590 /* This function is allowed to cause new datagrams to be constructed
591 * and sent, or even new queries to be started. However,
592 * query-sending functions are not allowed to call any general event
593 * loop functions in case they accidentally call this.
595 * Ie, receiving functions may call sending functions.
596 * Sending functions may NOT call receiving functions.
601 const typeinfo *adns__findtype(adns_rrtype type);
610 int dglen, max, cbyte, namelen;
614 void adns__findlabel_start(findlabel_state *fls, adns_state ads,
615 int serv, adns_query qu,
616 const byte *dgram, int dglen, int max,
617 int dmbegin, int *dmend_rlater);
618 /* Finds labels in a domain in a datagram.
620 * Call this routine first.
621 * dmend_rlater may be null. ads (and of course fls) may not be.
622 * serv may be -1, qu may be null - they are for error reporting.
625 adns_status adns__findlabel_next(findlabel_state *fls,
626 int *lablen_r, int *labstart_r);
627 /* Then, call this one repeatedly.
629 * It will return adns_s_ok if all is well, and tell you the length
630 * and start of successive labels. labstart_r may be null, but
631 * lablen_r must not be.
633 * After the last label, it will return with *lablen_r zero.
634 * Do not then call it again; instead, just throw away the findlabel_state.
636 * *dmend_rlater will have been set to point to the next part of
637 * the datagram after the label (or after the uncompressed part,
638 * if compression was used). *namelen_rlater will have been set
639 * to the length of the domain name (total length of labels plus
640 * 1 for each intervening dot).
642 * If the datagram appears to be truncated, *lablen_r will be -1.
643 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
644 * Do not call _next again.
646 * There may also be errors, in which case *dmend_rlater,
647 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
648 * Do not then call findlabel_next again.
655 adns_status adns__parse_domain(adns_state ads, int serv, adns_query qu,
656 vbuf *vb, parsedomain_flags flags,
657 const byte *dgram, int dglen, int *cbyte_io,
659 /* vb must already have been initialised; it will be reset if necessary.
660 * If there is truncation, vb->used will be set to 0; otherwise
661 * (if there is no error) vb will be null-terminated.
662 * If there is an error vb and *cbyte_io may be left indeterminate.
664 * serv may be -1 and qu may be 0 - they are used for error reporting only.
667 adns_status adns__parse_domain_more(findlabel_state *fls, adns_state ads,
668 adns_query qu, vbuf *vb,
669 parsedomain_flags flags,
671 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
672 * for continuing an existing domain or some such of some kind. Also, unlike
673 * _parse_domain, the domain data will be appended to vb, rather than replacing
674 * the existing contents.
677 adns_status adns__findrr(adns_query qu, int serv,
678 const byte *dgram, int dglen, int *cbyte_io,
679 int *type_r, int *class_r, unsigned long *ttl_r,
680 int *rdlen_r, int *rdstart_r,
681 int *ownermatchedquery_r);
682 /* Finds the extent and some of the contents of an RR in a datagram
683 * and does some checks. The datagram is *dgram, length dglen, and
684 * the RR starts at *cbyte_io (which is updated afterwards to point
685 * to the end of the RR).
687 * The type, class, TTL and RRdata length and start are returned iff
688 * the corresponding pointer variables are not null. type_r, class_r
689 * and ttl_r may not be null. The TTL will be capped.
691 * If ownermatchedquery_r != 0 then the owner domain of this
692 * RR will be compared with that in the query (or, if the query
693 * has gone to a CNAME lookup, with the canonical name).
694 * In this case, *ownermatchedquery_r will be set to 0 or 1.
695 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
697 * If there is truncation then *type_r will be set to -1 and
698 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
701 * qu must obviously be non-null.
703 * If an error is returned then *type_r will be undefined too.
706 adns_status adns__findrr_anychk(adns_query qu, int serv,
707 const byte *dgram, int dglen, int *cbyte_io,
708 int *type_r, int *class_r,
709 unsigned long *ttl_r,
710 int *rdlen_r, int *rdstart_r,
711 const byte *eo_dgram, int eo_dglen,
712 int eo_cbyte, int *eo_matched_r);
713 /* Like adns__findrr_checked, except that the datagram and
714 * owner to compare with can be specified explicitly.
716 * If the caller thinks they know what the owner of the RR ought to
717 * be they can pass in details in eo_*: this is another (or perhaps
718 * the same datagram), and a pointer to where the putative owner
719 * starts in that datagram. In this case *eo_matched_r will be set
720 * to 1 if the datagram matched or 0 if it did not. Either
721 * both eo_dgram and eo_matched_r must both be non-null, or they
722 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
723 * The eo datagram and contained owner domain MUST be valid and
727 void adns__update_expires(adns_query qu, unsigned long ttl,
729 /* Updates the `expires' field in the query, so that it doesn't exceed
733 int vbuf__append_quoted1035(vbuf *vb, const byte *buf, int len);
737 void adns__tcp_broken(adns_state ads, const char *what, const char *why);
738 /* what and why may be both 0, or both non-0. */
740 void adns__tcp_tryconnect(adns_state ads, struct timeval now);
742 void adns__autosys(adns_state ads, struct timeval now);
743 /* Make all the system calls we want to if the application wants us to.
744 * Must not be called from within adns internal processing functions,
745 * lest we end up in recursive descent !
748 void adns__must_gettimeofday(adns_state ads, const struct timeval **now_io,
749 struct timeval *tv_buf);
751 int adns__pollfds(adns_state ads, struct pollfd pollfds_buf[MAX_POLLFDS]);
752 void adns__fdevents(adns_state ads,
753 const struct pollfd *pollfds, int npollfds,
754 int maxfd, const fd_set *readfds,
755 const fd_set *writefds, const fd_set *exceptfds,
756 struct timeval now, int *r_r);
757 int adns__internal_check(adns_state ads,
758 adns_query *query_io,
759 adns_answer **answer,
762 void adns__timeouts(adns_state ads, int act,
763 struct timeval **tv_io, struct timeval *tvbuf,
765 /* If act is !0, then this will also deal with the TCP connection
766 * if previous events broke it or require it to be connected.
771 void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc);
773 /* Useful static inline functions: */
775 static inline int ctype_whitespace(int c) {
776 return c==' ' || c=='\n' || c=='\t';
778 static inline int ctype_digit(int c) { return c>='0' && c<='9'; }
779 static inline int ctype_alpha(int c) {
780 return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
782 static inline int ctype_822special(int c) {
783 return strchr("()<>@,;:\\\".[]",c) != 0;
785 static inline int ctype_domainunquoted(int c) {
786 return ctype_alpha(c) || ctype_digit(c) || (strchr("-_/+",c) != 0);
789 static inline int errno_resources(int e) { return e==ENOMEM || e==ENOBUFS; }
793 #define MEM_ROUND(sz) \
794 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
795 * sizeof(union maxalign) )
797 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
798 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
799 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
800 #define GET_L(cb,tv) ( (tv)=0, \
801 (tv)|=(GETIL_B((cb))<<24), \
802 (tv)|=(GETIL_B((cb))<<16), \
803 (tv)|=(GETIL_B((cb))<<8), \
807 #pragma GCC visibility pop