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;
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 * +------------------------+
324 * START -----> | tosend/NONE |
325 * +------------------------+
327 * too big for UDP / UDP timeout \ \ send via UDP
328 * send via TCP / more retries \ \
329 * when conn'd / desired \ \
332 * +-----------+ +-------------+
333 * | tcpw/tcpw | ________ | tosend/udpw |
334 * +-----------+ \ +-------------+
335 * | | | UDP timeout | |
338 * \ | TCP died | desired | |
340 * \ \ servers | TCP / |
341 * \ \ to try | timeout / |
343 * reply \ _| +------------------+ / reply
344 * \ | done/output FAIL | /
345 * \ +------------------+ /
348 * (..... got reply ....)
350 * need child query/ies / \ no child query
353 * +---------------+ +----------------+
354 * | childw/childw | ----------------> | done/output OK |
355 * +---------------+ children done +----------------+
359 struct query_queue { adns_query head, tail; };
364 adns_initflags iflags;
365 adns_logcallbackfn *logfn;
368 struct query_queue udpw, tcpw, childw, output;
369 adns_query forallnext;
370 int nextid, tcpsocket;
371 struct udpsocket { int af; int fd; } udpsocket[MAXUDP];
373 vbuf tcpsend, tcprecv;
374 int nservers, nsortlist, nsearchlist, searchndots, tcpserver, tcprecv_skip;
375 enum adns__tcpstate {
376 server_disconnected, server_connecting,
377 server_ok, server_broken
379 struct timeval tcptimeout;
380 /* This will have tv_sec==0 if it is not valid. It will always be
381 * valid if tcpstate _connecting. When _ok, it will be nonzero if
382 * we are idle (ie, tcpw queue is empty), in which case it is the
383 * absolute time when we will close the connection.
385 struct sigaction stdsigpipe;
387 struct pollfd pollfds_buf[MAX_POLLFDS];
388 adns_rr_addr servers[MAXSERVERS];
390 adns_sockaddr base, mask;
391 } sortlist[MAXSORTLIST];
393 unsigned short rand48xsubi[3];
396 /* From addrfam.c: */
398 extern int adns__addrs_equal_raw(const struct sockaddr *a,
399 int bf, const void *b);
400 /* Returns nonzero a's family is bf and a's protocol address field
401 * refers to the same protocol address as that stored at ba.
404 extern int adns__addrs_equal(const adns_sockaddr *a,
405 const adns_sockaddr *b);
406 /* Returns nonzero if the two refer to the same protocol address
407 * (disregarding port, IPv6 scope, etc).
410 extern int adns__sockaddrs_equal(const struct sockaddr *sa,
411 const struct sockaddr *sb);
412 /* Return nonzero if the two socket addresses are equal (in all significant
416 extern int adns__addr_width(int af);
417 /* Return the width of addresses of family af, in bits. */
419 extern void adns__prefix_mask(adns_sockaddr *sa, int len);
420 /* Stores in sa's protocol address field an address mask for address
421 * family af, whose first len bits are set and the remainder are
422 * clear. On entry, sa's af field must be set. This is what you want
423 * for converting a prefix length into a netmask.
426 extern int adns__guess_prefix_length(const adns_sockaddr *addr);
427 /* Given a network base address, guess the appropriate prefix length based on
428 * the appropriate rules for the address family (e.g., for IPv4, this uses
429 * the old address classes).
432 extern int adns__addr_matches(int af, const void *addr,
433 const adns_sockaddr *base,
434 const adns_sockaddr *mask);
435 /* Return nonzero if the protocol address specified by af and addr
436 * lies within the network specified by base and mask.
439 extern void adns__addr_inject(const void *a, adns_sockaddr *sa);
440 /* Injects the protocol address *a into the socket adress sa. Assumes
441 * that sa->sa_family is already set correctly.
444 extern const void *adns__sockaddr_addr(const struct sockaddr *sa);
445 /* Returns the address of the protocol address field in sa.
448 char *adns__sockaddr_ntoa(const struct sockaddr *sa, char *buf);
449 /* Convert sa to a string, and write it to buf, which must be at least
450 * ADNS_ADDR2TEXT_BUFLEN bytes long (unchecked). Return buf; can't fail.
453 extern int adns__make_reverse_domain(const struct sockaddr *sa,
455 char **buf_io, size_t bufsz,
457 /* Construct a reverse domain string, given a socket address and a parent
458 * zone. If zone is null, then use the standard reverse-lookup zone for the
459 * address family. If the length of the resulting string is no larger than
460 * bufsz, then the result is stored starting at *buf_io; otherwise a new
461 * buffer is allocated is used, and a pointer to it is stored in both *buf_io
462 * and *buf_free_r (the latter of which should be null on entry). If
463 * something goes wrong, then an errno value is returned: ENOSYS if the
464 * address family of sa isn't recognized, or ENOMEM if the attempt to
465 * allocate an output buffer failed.
468 extern bool adns__revparse_label(struct revparse_state *rps, int labnum,
470 int labstart, int lablen);
471 /* Parse a label in a reverse-domain name, given its index labnum (starting
472 * from zero), a pointer to its contents (which need not be null-terminated),
473 * and its length. The state in *rps is initialized implicitly when labnum
476 * Returns 1 if the parse is proceeding successfully, 0 if the domain
477 * name is definitely invalid and the parse must be abandoned.
480 extern bool adns__revparse_done(struct revparse_state *rps,
481 const char *dgram, int nlabels,
482 adns_rrtype *rrtype_r, adns_sockaddr *addr_r);
483 /* Finishes parsing a reverse-domain name, given the total number of
484 * labels in the name. On success, fills in the af and protocol
485 * address in *addr_r, and the forward query type in *rrtype_r
486 * (because that turns out to be useful). Returns 1 if the parse
492 int adns__setnonblock(adns_state ads, int fd); /* => errno value */
494 /* From general.c: */
496 void adns__vlprintf(adns_state ads, const char *fmt, va_list al);
497 void adns__lprintf(adns_state ads, const char *fmt,
498 ...) PRINTFFORMAT(2,3);
500 void adns__vdiag(adns_state ads, const char *pfx, adns_initflags prevent,
501 int serv, adns_query qu, const char *fmt, va_list al);
503 void adns__debug(adns_state ads, int serv, adns_query qu,
504 const char *fmt, ...) PRINTFFORMAT(4,5);
505 void adns__warn(adns_state ads, int serv, adns_query qu,
506 const char *fmt, ...) PRINTFFORMAT(4,5);
507 void adns__diag(adns_state ads, int serv, adns_query qu,
508 const char *fmt, ...) PRINTFFORMAT(4,5);
510 int adns__vbuf_ensure(vbuf *vb, int want);
511 int adns__vbuf_appendstr(vbuf *vb, const char *data); /* doesn't include nul */
512 int adns__vbuf_append(vbuf *vb, const byte *data, int len);
513 /* 1=>success, 0=>realloc failed */
514 void adns__vbuf_appendq(vbuf *vb, const byte *data, int len);
515 void adns__vbuf_init(vbuf *vb);
516 void adns__vbuf_free(vbuf *vb);
518 const char *adns__diag_domain(adns_state ads, int serv, adns_query qu,
520 const byte *dgram, int dglen, int cbyte);
521 /* Unpicks a domain in a datagram and returns a string suitable for
522 * printing it as. Never fails - if an error occurs, it will
523 * return some kind of string describing the error.
525 * serv may be -1 and qu may be 0. vb must have been initialised,
526 * and will be left in an arbitrary consistent state.
528 * Returns either vb->buf, or a pointer to a string literal. Do not modify
529 * vb before using the return value.
532 int adns__getrrsz_default(const typeinfo *typei, adns_rrtype type);
533 /* Default function for the `getrrsz' type hook; returns the `fixed_rrsz'
534 * value from the typeinfo entry.
537 void adns__isort(void *array, int nobjs, int sz, void *tempbuf,
538 int (*needswap)(void *context, const void *a, const void *b),
540 /* Does an insertion sort of array which must contain nobjs objects
541 * each sz bytes long. tempbuf must point to a buffer at least
542 * sz bytes long. needswap should return !0 if a>b (strictly, ie
543 * wrong order) 0 if a<=b (ie, order is fine).
546 void adns__sigpipe_protect(adns_state);
547 void adns__sigpipe_unprotect(adns_state);
548 /* If SIGPIPE protection is not disabled, will block all signals except
549 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
550 * Each call to _protect must be followed by a call to _unprotect before
551 * any significant amount of code gets to run, since the old signal mask
552 * is stored in the adns structure.
555 /* From transmit.c: */
557 adns_status adns__mkquery(adns_state ads, vbuf *vb, int *id_r,
558 const char *owner, int ol,
559 const typeinfo *typei, adns_rrtype type,
560 adns_queryflags flags);
561 /* Assembles a query packet in vb. A new id is allocated and returned.
564 adns_status adns__mkquery_frdgram(adns_state ads, vbuf *vb, int *id_r,
565 const byte *qd_dgram, int qd_dglen,
567 adns_rrtype type, adns_queryflags flags);
568 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
569 * That domain must be correct and untruncated.
572 void adns__querysend_tcp(adns_query qu, struct timeval now);
573 /* Query must be in state tcpw/tcpw; it will be sent if possible and
574 * no further processing can be done on it for now. The connection
575 * might be broken, but no reconnect will be attempted.
578 struct udpsocket *adns__udpsocket_by_af(adns_state ads, int af);
579 /* Find the UDP socket structure in ads which has the given address family.
580 * Return null if there isn't one.
582 * This is used during initialization, so ads is only partially filled in.
583 * The requirements are that nudp is set, and that udpsocket[i].af are
584 * defined for 0<=i<nudp.
587 void adns__query_send(adns_query qu, struct timeval now);
588 /* Query must be in state tosend/NONE; it will be moved to a new state,
589 * and no further processing can be done on it for now.
590 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
591 * connected), tcpsent/timew, child/childw or done/output.)
592 * __query_send may decide to use either UDP or TCP depending whether
593 * _qf_usevc is set (or has become set) and whether the query is too
599 adns_status adns__internal_submit(adns_state ads, adns_query *query_r,
600 const typeinfo *typei, adns_rrtype type,
601 vbuf *qumsg_vb, int id,
602 adns_queryflags flags, struct timeval now,
604 /* Submits a query (for internal use, called during external submits).
606 * The new query is returned in *query_r, or we return adns_s_nomemory.
608 * The query datagram should already have been assembled in qumsg_vb;
609 * the memory for it is _taken over_ by this routine whether it
610 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
612 * *ctx is copied byte-for-byte into the query. Before doing this, its tinfo
613 * field may be modified by type hooks.
615 * When the child query is done, ctx->callback will be called. The
616 * child will already have been taken off both the global list of
617 * queries in ads and the list of children in the parent. The child
618 * will be freed when the callback returns. The parent will have been
619 * taken off the global childw queue.
621 * The callback should either call adns__query_done, if it is
622 * complete, or adns__query_fail, if an error has occurred, in which
623 * case the other children (if any) will be cancelled. If the parent
624 * has more unfinished children (or has just submitted more) then the
625 * callback may choose to wait for them - it must then put the parent
626 * back on the childw queue.
629 void adns__search_next(adns_state ads, adns_query qu, struct timeval now);
630 /* Walks down the searchlist for a query with adns_qf_search.
631 * The query should have just had a negative response, or not had
632 * any queries sent yet, and should not be on any queue.
633 * The query_dgram if any will be freed and forgotten and a new
634 * one constructed from the search_* members of the query.
636 * Cannot fail (in case of error, calls adns__query_fail).
639 void *adns__alloc_interim(adns_query qu, size_t sz);
640 void *adns__alloc_preserved(adns_query qu, size_t sz);
641 /* Allocates some memory, and records which query it came from
642 * and how much there was.
644 * If an error occurs in the query, all the memory from _interim is
645 * simply freed. If the query succeeds, one large buffer will be made
646 * which is big enough for all these allocations, and then
647 * adns__alloc_final will get memory from this buffer.
649 * _alloc_interim can fail (and return 0).
650 * The caller must ensure that the query is failed.
652 * The memory from _preserved is is kept and transferred into the
653 * larger buffer - unless we run out of memory, in which case it too
654 * is freed. When you use _preserved you have to add code to the
655 * x_nomem error exit case in adns__makefinal_query to clear out the
656 * pointers you made to those allocations, because that's when they're
657 * thrown away; you should also make a note in the declaration of
658 * those pointer variables, to note that they are _preserved rather
659 * than _interim. If they're in the answer, note it here:
660 * answer->cname and answer->owner are _preserved.
663 void adns__transfer_interim(adns_query from, adns_query to, void *block);
664 /* Transfers an interim allocation from one query to another, so that
665 * the `to' query will have room for the data when we get to makefinal
666 * and so that the free will happen when the `to' query is freed
667 * rather than the `from' query.
669 * It is legal to call adns__transfer_interim with a null pointer; this
672 * _transfer_interim also ensures that the expiry time of the `to' query
673 * is no later than that of the `from' query, so that child queries'
674 * TTLs get inherited by their parents.
677 void adns__free_interim(adns_query qu, void *p);
678 /* Forget about a block allocated by adns__alloc_interim.
681 void *adns__alloc_mine(adns_query qu, size_t sz);
682 /* Like _interim, but does not record the length for later
683 * copying into the answer. This just ensures that the memory
684 * will be freed when we're done with the query.
687 void *adns__alloc_final(adns_query qu, size_t sz);
688 /* Cannot fail, and cannot return 0.
691 void adns__makefinal_block(adns_query qu, void **blpp, size_t sz);
692 void adns__makefinal_str(adns_query qu, char **strp);
694 void adns__reset_preserved(adns_query qu);
695 /* Resets all of the memory management stuff etc. to take account of
696 * only the _preserved stuff from _alloc_preserved. Used when we find
697 * an error somewhere and want to just report the error (with perhaps
698 * CNAME, owner, etc. info), and also when we're halfway through RRs
699 * in a datagram and discover that we need to retry the query.
702 void adns__query_done(adns_query qu);
703 void adns__query_fail(adns_query qu, adns_status stat);
704 void adns__cancel_children(adns_query qu);
708 void adns__procdgram(adns_state ads, const byte *dgram, int len,
709 int serv, int viatcp, struct timeval now);
710 /* This function is allowed to cause new datagrams to be constructed
711 * and sent, or even new queries to be started. However,
712 * query-sending functions are not allowed to call any general event
713 * loop functions in case they accidentally call this.
715 * Ie, receiving functions may call sending functions.
716 * Sending functions may NOT call receiving functions.
721 const typeinfo *adns__findtype(adns_rrtype type);
730 int dglen, max, cbyte, namelen;
734 void adns__findlabel_start(findlabel_state *fls, adns_state ads,
735 int serv, adns_query qu,
736 const byte *dgram, int dglen, int max,
737 int dmbegin, int *dmend_rlater);
738 /* Finds labels in a domain in a datagram.
740 * Call this routine first.
741 * dmend_rlater may be null. ads (and of course fls) may not be.
742 * serv may be -1, qu may be null - they are for error reporting.
745 adns_status adns__findlabel_next(findlabel_state *fls,
746 int *lablen_r, int *labstart_r);
747 /* Then, call this one repeatedly.
749 * It will return adns_s_ok if all is well, and tell you the length
750 * and start of successive labels. labstart_r may be null, but
751 * lablen_r must not be.
753 * After the last label, it will return with *lablen_r zero.
754 * Do not then call it again; instead, just throw away the findlabel_state.
756 * *dmend_rlater will have been set to point to the next part of
757 * the datagram after the label (or after the uncompressed part,
758 * if compression was used). *namelen_rlater will have been set
759 * to the length of the domain name (total length of labels plus
760 * 1 for each intervening dot).
762 * If the datagram appears to be truncated, *lablen_r will be -1.
763 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
764 * Do not call _next again.
766 * There may also be errors, in which case *dmend_rlater,
767 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
768 * Do not then call findlabel_next again.
775 adns_status adns__parse_domain(adns_state ads, int serv, adns_query qu,
776 vbuf *vb, parsedomain_flags flags,
777 const byte *dgram, int dglen, int *cbyte_io,
779 /* vb must already have been initialised; it will be reset if necessary.
780 * If there is truncation, vb->used will be set to 0; otherwise
781 * (if there is no error) vb will be null-terminated.
782 * If there is an error vb and *cbyte_io may be left indeterminate.
784 * serv may be -1 and qu may be 0 - they are used for error reporting only.
787 adns_status adns__parse_domain_more(findlabel_state *fls, adns_state ads,
788 adns_query qu, vbuf *vb,
789 parsedomain_flags flags,
791 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
792 * for continuing an existing domain or some such of some kind. Also, unlike
793 * _parse_domain, the domain data will be appended to vb, rather than replacing
794 * the existing contents.
797 adns_status adns__findrr(adns_query qu, int serv,
798 const byte *dgram, int dglen, int *cbyte_io,
799 int *type_r, int *class_r, unsigned long *ttl_r,
800 int *rdlen_r, int *rdstart_r,
801 int *ownermatchedquery_r);
802 /* Finds the extent and some of the contents of an RR in a datagram
803 * and does some checks. The datagram is *dgram, length dglen, and
804 * the RR starts at *cbyte_io (which is updated afterwards to point
805 * to the end of the RR).
807 * The type, class, TTL and RRdata length and start are returned iff
808 * the corresponding pointer variables are not null. type_r, class_r
809 * and ttl_r may not be null. The TTL will be capped.
811 * If ownermatchedquery_r != 0 then the owner domain of this
812 * RR will be compared with that in the query (or, if the query
813 * has gone to a CNAME lookup, with the canonical name).
814 * In this case, *ownermatchedquery_r will be set to 0 or 1.
815 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
817 * If there is truncation then *type_r will be set to -1 and
818 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
821 * qu must obviously be non-null.
823 * If an error is returned then *type_r will be undefined too.
826 adns_status adns__findrr_anychk(adns_query qu, int serv,
827 const byte *dgram, int dglen, int *cbyte_io,
828 int *type_r, int *class_r,
829 unsigned long *ttl_r,
830 int *rdlen_r, int *rdstart_r,
831 const byte *eo_dgram, int eo_dglen,
832 int eo_cbyte, int *eo_matched_r);
833 /* Like adns__findrr_checked, except that the datagram and
834 * owner to compare with can be specified explicitly.
836 * If the caller thinks they know what the owner of the RR ought to
837 * be they can pass in details in eo_*: this is another (or perhaps
838 * the same datagram), and a pointer to where the putative owner
839 * starts in that datagram. In this case *eo_matched_r will be set
840 * to 1 if the datagram matched or 0 if it did not. Either
841 * both eo_dgram and eo_matched_r must both be non-null, or they
842 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
843 * The eo datagram and contained owner domain MUST be valid and
847 void adns__update_expires(adns_query qu, unsigned long ttl,
849 /* Updates the `expires' field in the query, so that it doesn't exceed
853 int vbuf__append_quoted1035(vbuf *vb, const byte *buf, int len);
855 bool adns__labels_equal(const byte *a, int al, const byte *b, int bl);
859 void adns__tcp_broken(adns_state ads, const char *what, const char *why);
860 /* what and why may be both 0, or both non-0. */
862 void adns__tcp_tryconnect(adns_state ads, struct timeval now);
864 void adns__autosys(adns_state ads, struct timeval now);
865 /* Make all the system calls we want to if the application wants us to.
866 * Must not be called from within adns internal processing functions,
867 * lest we end up in recursive descent !
870 void adns__must_gettimeofday(adns_state ads, const struct timeval **now_io,
871 struct timeval *tv_buf);
873 int adns__pollfds(adns_state ads, struct pollfd pollfds_buf[MAX_POLLFDS]);
874 void adns__fdevents(adns_state ads,
875 const struct pollfd *pollfds, int npollfds,
876 int maxfd, const fd_set *readfds,
877 const fd_set *writefds, const fd_set *exceptfds,
878 struct timeval now, int *r_r);
879 int adns__internal_check(adns_state ads,
880 adns_query *query_io,
881 adns_answer **answer,
884 void adns__timeouts(adns_state ads, int act,
885 struct timeval **tv_io, struct timeval *tvbuf,
887 /* If act is !0, then this will also deal with the TCP connection
888 * if previous events broke it or require it to be connected.
893 void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc);
895 /* Useful static inline functions: */
897 static inline int ctype_whitespace(int c) {
898 return c==' ' || c=='\n' || c=='\t';
900 static inline int ctype_digit(int c) { return c>='0' && c<='9'; }
901 static inline int ctype_alpha(int c) {
902 return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
904 static inline int ctype_toupper(int c) {
905 return ctype_alpha(c) ? (c & ~32) : c;
907 static inline int ctype_822special(int c) {
908 return strchr("()<>@,;:\\\".[]",c) != 0;
910 static inline int ctype_domainunquoted(int c) {
911 return ctype_alpha(c) || ctype_digit(c) || (strchr("-_/+",c) != 0);
914 static inline int errno_resources(int e) { return e==ENOMEM || e==ENOBUFS; }
918 #define MEM_ROUND(sz) \
919 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
920 * sizeof(union maxalign) )
922 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
923 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
924 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
925 #define GET_L(cb,tv) ( (tv)=0, \
926 (tv)|=(GETIL_B((cb))<<24), \
927 (tv)|=(GETIL_B((cb))<<16), \
928 (tv)|=(GETIL_B((cb))<<8), \