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,2014 Ian Jackson
10 * Copyright (C) 2014 Mark Wooding
11 * Copyright (C) 1999-2000,2003,2006 Tony Finch
12 * Copyright (C) 1991 Massachusetts Institute of Technology
13 * (See the file INSTALL for full details.)
15 * This program is free software; you can redistribute it and/or modify
16 * it under the terms of the GNU General Public License as published by
17 * the Free Software Foundation; either version 3, or (at your option)
20 * This program is distributed in the hope that it will be useful,
21 * but WITHOUT ANY WARRANTY; without even the implied warranty of
22 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23 * GNU General Public License for more details.
25 * You should have received a copy of the GNU General Public License
26 * along with this program; if not, write to the Free Software Foundation.
29 #ifndef ADNS_INTERNAL_H_INCLUDED
30 #define ADNS_INTERNAL_H_INCLUDED
33 typedef unsigned char byte;
46 #define ADNS_FEATURE_MANYAF
50 #ifdef ADNS_REGRESS_TEST
51 # include "hredirect.h"
54 /* Configuration and constants */
57 #define MAXSORTLIST 15
58 #define UDPMAXRETRIES 15
59 #define UDPRETRYMS 2000
60 #define TCPWAITMS 30000
61 #define TCPCONNMS 14000
62 #define TCPIDLEMS 30000
63 #define MAXTTLBELIEVE (7*86400) /* any TTL > 7 days is capped */
66 #define DNS_MAXUDP 512
67 #define DNS_MAXLABEL 63
68 #define DNS_MAXDOMAIN 255
69 #define DNS_HDRSIZE 12
70 #define DNS_IDOFFSET 0
71 #define DNS_CLASS_IN 1
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;
112 adns__qf_addr_answer= 0x01000000,/* addr query received an answer */
113 adns__qf_addr_cname = 0x02000000 /* addr subquery performed on cname */
116 /* Shared data structures */
128 int dglen, nsstart, nscount, arcount;
132 #define MAXREVLABELS 34 /* keep in sync with addrfam! */
133 struct revparse_state {
134 uint16_t labstart[MAXREVLABELS];
135 uint8_t lablen[MAXREVLABELS];
138 union checklabel_state {
139 struct revparse_state ptr;
144 void (*callback)(adns_query parent, adns_query child);
148 adns_rrtype rev_rrtype;
154 } tinfo; /* type-specific state for the query itself: zero-init if you
155 * don't know better. */
158 adns_rr_hostaddr *hostaddr;
159 } pinfo; /* state for use by parent's callback function */
162 typedef struct typeinfo {
168 void (*makefinal)(adns_query qu, void *data);
169 /* Change memory management of *data.
170 * Previously, used alloc_interim, now use alloc_final.
173 adns_status (*convstring)(vbuf *vb, const void *data);
174 /* Converts the RR data to a string representation in vbuf.
175 * vbuf will be appended to (it must have been initialised),
176 * and will not be null-terminated by convstring.
179 adns_status (*parse)(const parseinfo *pai, int cbyte,
180 int max, void *store_r);
181 /* Parse one RR, in dgram of length dglen, starting at cbyte and
182 * extending until at most max.
184 * The RR should be stored at *store_r, of length qu->typei->getrrsz().
186 * If there is an overrun which might indicate truncation, it should set
187 * *rdstart to -1; otherwise it may set it to anything else positive.
189 * nsstart is the offset of the authority section.
192 int (*diff_needswap)(adns_state ads,const void *datap_a,const void *datap_b);
193 /* Returns !0 if RR a should be strictly after RR b in the sort order,
194 * 0 otherwise. Must not fail.
197 adns_status (*checklabel)(adns_state ads, adns_queryflags flags,
198 union checklabel_state *cls, qcontext *ctx,
199 int labnum, const char *dgram,
200 int labstart, int lablen);
201 /* Check a label from the query domain string. The label is not
202 * necessarily null-terminated. The hook can refuse the query's submission
203 * by returning a nonzero status. State can be stored in *cls between
204 * calls, and useful information can be stashed in ctx->tinfo, to be stored
205 * with the query (e.g., it will be available to the parse hook). This
206 * hook can detect a first call because labnum is zero, and a final call
207 * because lablen is zero.
210 void (*postsort)(adns_state ads, void *array, int nrrs, int rrsz,
211 const struct typeinfo *typei);
212 /* Called immediately after the RRs have been sorted, and may rearrange
213 * them. (This is really for the benefit of SRV's bizarre weighting
214 * stuff.) May be 0 to mean nothing needs to be done.
217 int (*getrrsz)(const struct typeinfo *typei, adns_rrtype type);
218 /* Return the output resource-record element size; if this is null, then
219 * the rrsz member can be used.
222 void (*query_send)(adns_query qu, struct timeval now);
223 /* Send the query to nameservers, and hook it into the appropriate queue.
224 * Normal behaviour is to call adns__query_send, but this can be overridden
225 * for special effects.
229 adns_status adns__ckl_hostname(adns_state ads, adns_queryflags flags,
230 union checklabel_state *cls,
231 qcontext *ctx, int labnum,
232 const char *dgram, int labstart, int lablen);
233 /* implemented in query.c, used by types.c as default
234 * and as part of implementation for some fancier types
235 * doesn't require any state */
237 typedef struct allocnode {
238 struct allocnode *next, *back;
253 enum { query_tosend, query_tcpw, query_childw, query_done } state;
254 adns_query back, next, parent;
255 struct { adns_query head, tail; } children;
256 struct { adns_query back, next; } siblings;
257 struct { allocnode *head, *tail; } allocations;
258 int interim_allocd, preserved_allocd;
259 void *final_allocspace;
261 const typeinfo *typei;
266 /* General-purpose messing-about buffer.
267 * Wherever a `big' interface is crossed, this may be corrupted/changed
268 * unless otherwise specified.
272 /* This is allocated when a query is submitted, to avoid being unable
273 * to relate errors to queries if we run out of memory. During
274 * query processing status, rrs is 0. cname is set if
275 * we found a cname (this corresponds to cname_dgram in the query
276 * structure). type is set from the word go. nrrs and rrs
277 * are set together, when we find how many rrs there are.
278 * owner is set during querying unless we're doing searchlist,
279 * in which case it is set only when we find an answer.
283 int cname_dglen, cname_begin;
284 /* If non-0, has been allocated using . */
287 int search_origlen, search_pos, search_doneabs;
288 /* Used by the searching algorithm. The query domain in textual form
289 * is copied into the vbuf, and _origlen set to its length. Then
290 * we walk the searchlist, if we want to. _pos says where we are
291 * (next entry to try), and _doneabs says whether we've done the
292 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
293 * but not done yet). If flags doesn't have adns_qf_search then
294 * the vbuf is initialised but empty and everything else is zero.
297 int id, flags, retries;
299 unsigned long udpsent; /* bitmap indexed by server */
300 struct timeval timeout;
301 time_t expires; /* Earliest expiry time of any record we used. */
307 * state Queue child id nextudpserver udpsent tcpfailed
309 * tosend NONE null >=0 0 zero zero
310 * tosend udpw null >=0 any nonzero zero
311 * tosend NONE null >=0 any nonzero zero
313 * tcpw tcpw null >=0 irrelevant any any
315 * child childw set >=0 irrelevant irrelevant irrelevant
316 * child NONE null >=0 irrelevant irrelevant irrelevant
317 * done output null -1 irrelevant irrelevant irrelevant
319 * Queries are only not on a queue when they are actually being processed.
320 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
321 * iff the tcp connection is in state server_ok.
323 * Internal queries (from adns__submit_internal) end up on intdone
324 * instead of output, and the callbacks are made on the way out of
325 * adns, to avoid reentrancy hazards.
327 * +------------------------+
328 * START -----> | tosend/NONE |
329 * +------------------------+
331 * too big for UDP / UDP timeout \ \ send via UDP
332 * send via TCP / more retries \ \
333 * when conn'd / desired \ \
336 * +-----------+ +-------------+
337 * | tcpw/tcpw | ________ | tosend/udpw |
338 * +-----------+ \ +-------------+
339 * | | | UDP timeout | |
342 * \ | TCP died | desired | |
344 * \ \ servers | TCP / |
345 * \ \ to try | timeout / |
347 * reply \ _| +------------------+ / reply
348 * \ | done/output FAIL | /
349 * \ +------------------+ /
352 * (..... got reply ....)
354 * need child query/ies / \ no child query
357 * +---------------+ +----------------+
358 * | childw/childw | ----------------> | done/output OK |
359 * +---------------+ children done +----------------+
363 struct query_queue { adns_query head, tail; };
368 adns_initflags iflags;
369 adns_logcallbackfn *logfn;
372 struct query_queue udpw, tcpw, childw, output, intdone;
373 adns_query forallnext;
374 int nextid, tcpsocket;
375 struct udpsocket { int af; int fd; } udpsockets[MAXUDP];
377 vbuf tcpsend, tcprecv;
378 int nservers, nsortlist, nsearchlist, searchndots, tcpserver, tcprecv_skip;
379 enum adns__tcpstate {
380 server_disconnected, server_connecting,
381 server_ok, server_broken
383 struct timeval tcptimeout;
384 /* This will have tv_sec==0 if it is not valid. It will always be
385 * valid if tcpstate _connecting. When _ok, it will be nonzero if
386 * we are idle (ie, tcpw queue is empty), in which case it is the
387 * absolute time when we will close the connection.
389 struct sigaction stdsigpipe;
391 struct pollfd pollfds_buf[MAX_POLLFDS];
392 adns_rr_addr servers[MAXSERVERS];
394 adns_sockaddr base, mask;
395 } sortlist[MAXSORTLIST];
397 unsigned short rand48xsubi[3];
400 /* From addrfam.c: */
402 extern int adns__addrs_equal_raw(const struct sockaddr *a,
403 int bf, const void *b);
404 /* Returns nonzero a's family is bf and a's protocol address field
405 * refers to the same protocol address as that stored at ba.
408 extern int adns__addrs_equal(const adns_sockaddr *a,
409 const adns_sockaddr *b);
410 /* Returns nonzero if the two refer to the same protocol address
411 * (disregarding port, IPv6 scope, etc).
414 extern int adns__sockaddrs_equal(const struct sockaddr *sa,
415 const struct sockaddr *sb);
416 /* Return nonzero if the two socket addresses are equal (in all significant
420 extern int adns__addr_width(int af);
421 /* Return the width of addresses of family af, in bits. */
423 extern void adns__prefix_mask(adns_sockaddr *sa, int len);
424 /* Stores in sa's protocol address field an address mask for address
425 * family af, whose first len bits are set and the remainder are
426 * clear. On entry, sa's af field must be set. This is what you want
427 * for converting a prefix length into a netmask.
430 extern int adns__guess_prefix_length(const adns_sockaddr *addr);
431 /* Given a network base address, guess the appropriate prefix length based on
432 * the appropriate rules for the address family (e.g., for IPv4, this uses
433 * the old address classes).
436 extern int adns__addr_matches(int af, const void *addr,
437 const adns_sockaddr *base,
438 const adns_sockaddr *mask);
439 /* Return nonzero if the protocol address specified by af and addr
440 * lies within the network specified by base and mask.
443 extern void adns__addr_inject(const void *a, adns_sockaddr *sa);
444 /* Injects the protocol address *a into the socket adress sa. Assumes
445 * that sa->sa_family is already set correctly.
448 extern const void *adns__sockaddr_addr(const struct sockaddr *sa);
449 /* Returns the address of the protocol address field in sa.
452 char *adns__sockaddr_ntoa(const struct sockaddr *sa, char *buf);
453 /* Converts sa to a string, and writes it to buf, which must be at
454 * least ADNS_ADDR2TEXT_BUFLEN bytes long (unchecked). Returns buf;
458 extern int adns__make_reverse_domain(const struct sockaddr *sa,
460 char **buf_io, size_t bufsz,
462 /* Construct a reverse domain string, given a socket address and a parent
463 * zone. If zone is null, then use the standard reverse-lookup zone for the
464 * address family. If the length of the resulting string is no larger than
465 * bufsz, then the result is stored starting at *buf_io; otherwise a new
466 * buffer is allocated is used, and a pointer to it is stored in both *buf_io
467 * and *buf_free_r (the latter of which should be null on entry). If
468 * something goes wrong, then an errno value is returned: ENOSYS if the
469 * address family of sa isn't recognized, or ENOMEM if the attempt to
470 * allocate an output buffer failed.
473 extern bool adns__revparse_label(struct revparse_state *rps, int labnum,
475 int labstart, int lablen);
476 /* Parse a label in a reverse-domain name, given its index labnum (starting
477 * from zero), a pointer to its contents (which need not be null-terminated),
478 * and its length. The state in *rps is initialized implicitly when labnum
481 * Returns 1 if the parse is proceeding successfully, 0 if the domain
482 * name is definitely invalid and the parse must be abandoned.
485 extern bool adns__revparse_done(struct revparse_state *rps,
486 const char *dgram, int nlabels,
487 adns_rrtype *rrtype_r, adns_sockaddr *addr_r);
488 /* Finishes parsing a reverse-domain name, given the total number of
489 * labels in the name. On success, fills in the af and protocol
490 * address in *addr_r, and the forward query type in *rrtype_r
491 * (because that turns out to be useful). Returns 1 if the parse
497 int adns__setnonblock(adns_state ads, int fd); /* => errno value */
499 /* From general.c: */
501 void adns__vlprintf(adns_state ads, const char *fmt, va_list al);
502 void adns__lprintf(adns_state ads, const char *fmt,
503 ...) PRINTFFORMAT(2,3);
505 void adns__vdiag(adns_state ads, const char *pfx, adns_initflags prevent,
506 int serv, adns_query qu, const char *fmt, va_list al);
508 void adns__debug(adns_state ads, int serv, adns_query qu,
509 const char *fmt, ...) PRINTFFORMAT(4,5);
510 void adns__warn(adns_state ads, int serv, adns_query qu,
511 const char *fmt, ...) PRINTFFORMAT(4,5);
512 void adns__diag(adns_state ads, int serv, adns_query qu,
513 const char *fmt, ...) PRINTFFORMAT(4,5);
515 int adns__vbuf_ensure(vbuf *vb, int want);
516 int adns__vbuf_appendstr(vbuf *vb, const char *data); /* doesn't include nul */
517 int adns__vbuf_append(vbuf *vb, const byte *data, int len);
518 /* 1=>success, 0=>realloc failed */
519 void adns__vbuf_appendq(vbuf *vb, const byte *data, int len);
520 void adns__vbuf_init(vbuf *vb);
521 void adns__vbuf_free(vbuf *vb);
523 const char *adns__diag_domain(adns_state ads, int serv, adns_query qu,
525 const byte *dgram, int dglen, int cbyte);
526 /* Unpicks a domain in a datagram and returns a string suitable for
527 * printing it as. Never fails - if an error occurs, it will
528 * return some kind of string describing the error.
530 * serv may be -1 and qu may be 0. vb must have been initialised,
531 * and will be left in an arbitrary consistent state.
533 * Returns either vb->buf, or a pointer to a string literal. Do not modify
534 * vb before using the return value.
537 int adns__getrrsz_default(const typeinfo *typei, adns_rrtype type);
538 /* Default function for the `getrrsz' type hook; returns the `fixed_rrsz'
539 * value from the typeinfo entry.
542 void adns__isort(void *array, int nobjs, int sz, void *tempbuf,
543 int (*needswap)(void *context, const void *a, const void *b),
545 /* Does an insertion sort of array which must contain nobjs objects
546 * each sz bytes long. tempbuf must point to a buffer at least
547 * sz bytes long. needswap should return !0 if a>b (strictly, ie
548 * wrong order) 0 if a<=b (ie, order is fine).
551 void adns__sigpipe_protect(adns_state);
552 void adns__sigpipe_unprotect(adns_state);
553 /* If SIGPIPE protection is not disabled, will block all signals except
554 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
555 * Each call to _protect must be followed by a call to _unprotect before
556 * any significant amount of code gets to run, since the old signal mask
557 * is stored in the adns structure.
560 /* From transmit.c: */
562 adns_status adns__mkquery(adns_state ads, vbuf *vb, int *id_r,
563 const char *owner, int ol,
564 const typeinfo *typei, adns_rrtype type,
565 adns_queryflags flags);
566 /* Assembles a query packet in vb. A new id is allocated and returned.
569 adns_status adns__mkquery_frdgram(adns_state ads, vbuf *vb, int *id_r,
570 const byte *qd_dgram, int qd_dglen,
572 adns_rrtype type, adns_queryflags flags);
573 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
574 * That domain must be correct and untruncated.
577 void adns__querysend_tcp(adns_query qu, struct timeval now);
578 /* Query must be in state tcpw/tcpw; it will be sent if possible and
579 * no further processing can be done on it for now. The connection
580 * might be broken, but no reconnect will be attempted.
583 struct udpsocket *adns__udpsocket_by_af(adns_state ads, int af);
584 /* Find the UDP socket structure in ads which has the given address family.
585 * Return null if there isn't one.
587 * This is used during initialization, so ads is only partially filled in.
588 * The requirements are that nudp is set, and that udpsocket[i].af are
589 * defined for 0<=i<nudp.
592 void adns__query_send(adns_query qu, struct timeval now);
593 /* Query must be in state tosend/NONE; it will be moved to a new state,
594 * and no further processing can be done on it for now.
595 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
596 * connected), tcpsent/timew, child/childw or done/output.)
597 * __query_send may decide to use either UDP or TCP depending whether
598 * _qf_usevc is set (or has become set) and whether the query is too
604 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
606 const typeinfo *typei, adns_rrtype type,
607 vbuf *qumsg_vb, int id,
608 adns_queryflags flags, struct timeval now,
610 /* Submits a query (for internal use, called during external submits).
612 * The new query is returned in *query_r, or we return adns_s_nomemory.
614 * The query datagram should already have been assembled in qumsg_vb;
615 * the memory for it is _taken over_ by this routine whether it
616 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
618 * *ctx is copied byte-for-byte into the query. Before doing this, its tinfo
619 * field may be modified by type hooks.
621 * When the child query is done, ctx->callback will be called. The
622 * child will already have been taken off both the global list of
623 * queries in ads and the list of children in the parent. The child
624 * will be freed when the callback returns. The parent will have been
625 * taken off the global childw queue.
627 * The callback should either call adns__query_done, if it is
628 * complete, or adns__query_fail, if an error has occurred, in which
629 * case the other children (if any) will be cancelled. If the parent
630 * has more unfinished children (or has just submitted more) then the
631 * callback may choose to wait for them - it must then put the parent
632 * back on the childw queue.
635 void adns__search_next(adns_state ads, adns_query qu, struct timeval now);
636 /* Walks down the searchlist for a query with adns_qf_search.
637 * The query should have just had a negative response, or not had
638 * any queries sent yet, and should not be on any queue.
639 * The query_dgram if any will be freed and forgotten and a new
640 * one constructed from the search_* members of the query.
642 * Cannot fail (in case of error, calls adns__query_fail).
645 void *adns__alloc_interim(adns_query qu, size_t sz);
646 void *adns__alloc_preserved(adns_query qu, size_t sz);
647 /* Allocates some memory, and records which query it came from
648 * and how much there was.
650 * If an error occurs in the query, all the memory from _interim is
651 * simply freed. If the query succeeds, one large buffer will be made
652 * which is big enough for all these allocations, and then
653 * adns__alloc_final will get memory from this buffer.
655 * _alloc_interim can fail (and return 0).
656 * The caller must ensure that the query is failed.
658 * The memory from _preserved is is kept and transferred into the
659 * larger buffer - unless we run out of memory, in which case it too
660 * is freed. When you use _preserved you have to add code to the
661 * x_nomem error exit case in adns__makefinal_query to clear out the
662 * pointers you made to those allocations, because that's when they're
663 * thrown away; you should also make a note in the declaration of
664 * those pointer variables, to note that they are _preserved rather
665 * than _interim. If they're in the answer, note it here:
666 * answer->cname and answer->owner are _preserved.
669 void adns__transfer_interim(adns_query from, adns_query to, void *block);
670 /* Transfers an interim allocation from one query to another, so that
671 * the `to' query will have room for the data when we get to makefinal
672 * and so that the free will happen when the `to' query is freed
673 * rather than the `from' query.
675 * It is legal to call adns__transfer_interim with a null pointer; this
678 * _transfer_interim also ensures that the expiry time of the `to' query
679 * is no later than that of the `from' query, so that child queries'
680 * TTLs get inherited by their parents.
683 void adns__free_interim(adns_query qu, void *p);
684 /* Forget about a block allocated by adns__alloc_interim.
687 void *adns__alloc_mine(adns_query qu, size_t sz);
688 /* Like _interim, but does not record the length for later
689 * copying into the answer. This just ensures that the memory
690 * will be freed when we're done with the query.
693 void *adns__alloc_final(adns_query qu, size_t sz);
694 /* Cannot fail, and cannot return 0.
697 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz);
698 void adns__makefinal_str(adns_query qu, char **strp);
700 void adns__reset_preserved(adns_query qu);
701 /* Resets all of the memory management stuff etc. to take account of
702 * only the _preserved stuff from _alloc_preserved. Used when we find
703 * an error somewhere and want to just report the error (with perhaps
704 * CNAME, owner, etc. info), and also when we're halfway through RRs
705 * in a datagram and discover that we need to retry the query.
708 void adns__cancel(adns_query qu);
709 void adns__query_done(adns_query qu);
710 void adns__query_fail(adns_query qu, adns_status st);
711 void adns__cancel_children(adns_query qu);
713 void adns__returning(adns_state ads, adns_query qu);
714 /* Must be called before returning from adns any time that we have
715 * progressed (including made, finished or destroyed) queries.
717 * Might reenter adns via internal query callbacks, so
718 * external-faciing functions which call adns__returning should
719 * normally be avoided in internal code. */
723 void adns__procdgram(adns_state ads, const byte *dgram, int len,
724 int serv, int viatcp, struct timeval now);
725 /* This function is allowed to cause new datagrams to be constructed
726 * and sent, or even new queries to be started. However,
727 * query-sending functions are not allowed to call any general event
728 * loop functions in case they accidentally call this.
730 * Ie, receiving functions may call sending functions.
731 * Sending functions may NOT call receiving functions.
736 const typeinfo *adns__findtype(adns_rrtype type);
745 int dglen, max, cbyte, namelen;
749 void adns__findlabel_start(findlabel_state *fls, adns_state ads,
750 int serv, adns_query qu,
751 const byte *dgram, int dglen, int max,
752 int dmbegin, int *dmend_rlater);
753 /* Finds labels in a domain in a datagram.
755 * Call this routine first.
756 * dmend_rlater may be null. ads (and of course fls) may not be.
757 * serv may be -1, qu may be null - they are for error reporting.
760 adns_status adns__findlabel_next(findlabel_state *fls,
761 int *lablen_r, int *labstart_r);
762 /* Then, call this one repeatedly.
764 * It will return adns_s_ok if all is well, and tell you the length
765 * and start of successive labels. labstart_r may be null, but
766 * lablen_r must not be.
768 * After the last label, it will return with *lablen_r zero.
769 * Do not then call it again; instead, just throw away the findlabel_state.
771 * *dmend_rlater will have been set to point to the next part of
772 * the datagram after the label (or after the uncompressed part,
773 * if compression was used). *namelen_rlater will have been set
774 * to the length of the domain name (total length of labels plus
775 * 1 for each intervening dot).
777 * If the datagram appears to be truncated, *lablen_r will be -1.
778 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
779 * Do not call _next again.
781 * There may also be errors, in which case *dmend_rlater,
782 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
783 * Do not then call findlabel_next again.
790 adns_status adns__parse_domain(adns_state ads, int serv, adns_query qu,
791 vbuf *vb, parsedomain_flags flags,
792 const byte *dgram, int dglen, int *cbyte_io,
794 /* vb must already have been initialised; it will be reset if necessary.
795 * If there is truncation, vb->used will be set to 0; otherwise
796 * (if there is no error) vb will be null-terminated.
797 * If there is an error vb and *cbyte_io may be left indeterminate.
799 * serv may be -1 and qu may be 0 - they are used for error reporting only.
802 adns_status adns__parse_domain_more(findlabel_state *fls, adns_state ads,
803 adns_query qu, vbuf *vb,
804 parsedomain_flags flags,
806 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
807 * for continuing an existing domain or some such of some kind. Also, unlike
808 * _parse_domain, the domain data will be appended to vb, rather than replacing
809 * the existing contents.
812 adns_status adns__findrr(adns_query qu, int serv,
813 const byte *dgram, int dglen, int *cbyte_io,
814 int *type_r, int *class_r, unsigned long *ttl_r,
815 int *rdlen_r, int *rdstart_r,
816 int *ownermatchedquery_r);
817 /* Finds the extent and some of the contents of an RR in a datagram
818 * and does some checks. The datagram is *dgram, length dglen, and
819 * the RR starts at *cbyte_io (which is updated afterwards to point
820 * to the end of the RR).
822 * The type, class, TTL and RRdata length and start are returned iff
823 * the corresponding pointer variables are not null. type_r, class_r
824 * and ttl_r may not be null. The TTL will be capped.
826 * If ownermatchedquery_r != 0 then the owner domain of this
827 * RR will be compared with that in the query (or, if the query
828 * has gone to a CNAME lookup, with the canonical name).
829 * In this case, *ownermatchedquery_r will be set to 0 or 1.
830 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
832 * If there is truncation then *type_r will be set to -1 and
833 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
836 * qu must obviously be non-null.
838 * If an error is returned then *type_r will be undefined too.
841 adns_status adns__findrr_anychk(adns_query qu, int serv,
842 const byte *dgram, int dglen, int *cbyte_io,
843 int *type_r, int *class_r,
844 unsigned long *ttl_r,
845 int *rdlen_r, int *rdstart_r,
846 const byte *eo_dgram, int eo_dglen,
847 int eo_cbyte, int *eo_matched_r);
848 /* Like adns__findrr_checked, except that the datagram and
849 * owner to compare with can be specified explicitly.
851 * If the caller thinks they know what the owner of the RR ought to
852 * be they can pass in details in eo_*: this is another (or perhaps
853 * the same datagram), and a pointer to where the putative owner
854 * starts in that datagram. In this case *eo_matched_r will be set
855 * to 1 if the datagram matched or 0 if it did not. Either
856 * both eo_dgram and eo_matched_r must both be non-null, or they
857 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
858 * The eo datagram and contained owner domain MUST be valid and
862 void adns__update_expires(adns_query qu, unsigned long ttl,
864 /* Updates the `expires' field in the query, so that it doesn't exceed
868 bool adns__labels_equal(const byte *a, int al, const byte *b, int bl);
872 void adns__tcp_broken(adns_state ads, const char *what, const char *why);
873 /* what and why may be both 0, or both non-0. */
875 void adns__tcp_tryconnect(adns_state ads, struct timeval now);
877 void adns__autosys(adns_state ads, struct timeval now);
878 /* Make all the system calls we want to if the application wants us to.
879 * Must not be called from within adns internal processing functions,
880 * lest we end up in recursive descent !
883 void adns__must_gettimeofday(adns_state ads, const struct timeval **now_io,
884 struct timeval *tv_buf);
885 /* Call with care - might reentrantly cause queries to be completed! */
887 int adns__pollfds(adns_state ads, struct pollfd pollfds_buf[MAX_POLLFDS]);
888 void adns__fdevents(adns_state ads,
889 const struct pollfd *pollfds, int npollfds,
890 int maxfd, const fd_set *readfds,
891 const fd_set *writefds, const fd_set *exceptfds,
892 struct timeval now, int *r_r);
893 int adns__internal_check(adns_state ads,
894 adns_query *query_io,
895 adns_answer **answer,
898 void adns__timeouts(adns_state ads, int act,
899 struct timeval **tv_io, struct timeval *tvbuf,
901 /* If act is !0, then this will also deal with the TCP connection
902 * if previous events broke it or require it to be connected.
907 void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc);
909 /* Useful static inline functions: */
911 static inline int ctype_whitespace(int c) {
912 return c==' ' || c=='\n' || c=='\t';
914 static inline int ctype_digit(int c) { return c>='0' && c<='9'; }
915 static inline int ctype_alpha(int c) {
916 return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
918 static inline int ctype_toupper(int c) {
919 return ctype_alpha(c) ? (c & ~32) : c;
921 static inline int ctype_822special(int c) {
922 return strchr("()<>@,;:\\\".[]",c) != 0;
924 static inline int ctype_domainunquoted(int c) {
925 return ctype_alpha(c) || ctype_digit(c) || (strchr("-_/+",c) != 0);
928 static inline int errno_resources(int e) { return e==ENOMEM || e==ENOBUFS; }
932 #define MEM_ROUND(sz) \
933 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
934 * sizeof(union maxalign) )
936 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
937 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
938 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
939 #define GET_L(cb,tv) ( (tv)=0, \
940 (tv)|=(GETIL_B((cb))<<24), \
941 (tv)|=(GETIL_B((cb))<<16), \
942 (tv)|=(GETIL_B((cb))<<8), \