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"
72 #define DNS_IP6_ARPA "ip6", "arpa"
74 #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED
76 /* Some preprocessor hackery */
78 #define GLUE(x, y) GLUE_(x, y)
79 #define GLUE_(x, y) x##y
81 /* C99 macro `...' must match at least one argument, so the naive definition
82 * `#define CAR(car, ...) car' won't work. But it's easy to arrange for the
83 * tail to be nonempty if we're just going to discard it anyway. */
84 #define CAR(...) CAR_(__VA_ARGS__, _)
85 #define CAR_(car, ...) car
87 /* Extracting the tail of an argument list is rather more difficult. The
88 * following trick is based on one by Laurent Deniau to count the number of
89 * arguments to a macro, simplified in two ways: (a) it only handles up to
90 * eight arguments, and (b) it only needs to distinguish the one-argument
91 * case from many arguments. */
92 #define CDR(...) CDR_(__VA_ARGS__, m, m, m, m, m, m, m, 1, _)(__VA_ARGS__)
93 #define CDR_(_1, _2, _3, _4, _5, _6, _7, _8, n, ...) CDR_##n
95 #define CDR_m(_, ...) __VA_ARGS__
101 } consistency_checks
;
112 /* Shared data structures */
124 int dglen
, nsstart
, nscount
, arcount
;
133 struct af_addr
{ int af
; union gen_addr addr
; };
135 #define NREVDOMAINS 2 /* keep in sync with addrfam! */
136 struct revparse_state
{
137 unsigned map
; /* which domains are still live */
138 byte ipv
[NREVDOMAINS
][32]; /* address components so far */
141 union checklabel_state
{
142 struct revparse_state ptr
;
147 void (*callback
)(adns_query parent
, adns_query child
);
151 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 *label
, int lablen
);
200 /* Check a label from the query domain string. The label is not
201 * necessarily null-terminated. The hook can refuse the query's submission
202 * by returning a nonzero status. State can be stored in *cls between
203 * calls, and useful information can be stashed in ctx->tinfo, to be stored
204 * with the query (e.g., it will be available to the parse hook). This
205 * hook can detect a first call because labnum is zero, and a final call
206 * because lablen is zero.
209 void (*postsort
)(adns_state ads
, void *array
, int nrrs
,int rrsz
,
210 const struct typeinfo
*typei
);
211 /* Called immediately after the RRs have been sorted, and may rearrange
212 * them. (This is really for the benefit of SRV's bizarre weighting
213 * stuff.) May be 0 to mean nothing needs to be done.
216 int (*getrrsz
)(const struct typeinfo
*typei
, adns_rrtype type
);
217 /* Return the output resource-record element size; if this is null, then
218 * the rrsz member can be used.
222 adns_status
adns__ckl_hostname(adns_state ads
, adns_queryflags flags
,
223 union checklabel_state
*cls
,
224 qcontext
*ctx
, int labnum
,
225 const char *label
, int lablen
);
226 /* implemented in query.c, used by types.c as default
227 * and as part of implementation for some fancier types
228 * doesn't require any state */
230 typedef struct allocnode
{
231 struct allocnode
*next
, *back
;
245 enum { query_tosend
, query_tcpw
, query_childw
, query_done
} state
;
246 adns_query back
, next
, parent
;
247 struct { adns_query head
, tail
; } children
;
248 struct { adns_query back
, next
; } siblings
;
249 struct { allocnode
*head
, *tail
; } allocations
;
250 int interim_allocd
, preserved_allocd
;
251 void *final_allocspace
;
253 const typeinfo
*typei
;
258 /* General-purpose messing-about buffer.
259 * Wherever a `big' interface is crossed, this may be corrupted/changed
260 * unless otherwise specified.
264 /* This is allocated when a query is submitted, to avoid being unable
265 * to relate errors to queries if we run out of memory. During
266 * query processing status, rrs is 0. cname is set if
267 * we found a cname (this corresponds to cname_dgram in the query
268 * structure). type is set from the word go. nrrs and rrs
269 * are set together, when we find how many rrs there are.
270 * owner is set during querying unless we're doing searchlist,
271 * in which case it is set only when we find an answer.
275 int cname_dglen
, cname_begin
;
276 /* If non-0, has been allocated using . */
279 int search_origlen
, search_pos
, search_doneabs
;
280 /* Used by the searching algorithm. The query domain in textual form
281 * is copied into the vbuf, and _origlen set to its length. Then
282 * we walk the searchlist, if we want to. _pos says where we are
283 * (next entry to try), and _doneabs says whether we've done the
284 * absolute query yet (0=not yet, 1=done, -1=must do straight away,
285 * but not done yet). If flags doesn't have adns_qf_search then
286 * the vbuf is initialised but empty and everything else is zero.
289 int id
, flags
, retries
;
291 unsigned long udpsent
; /* bitmap indexed by server */
292 struct timeval timeout
;
293 time_t expires
; /* Earliest expiry time of any record we used. */
299 * state Queue child id nextudpserver udpsent tcpfailed
301 * tosend NONE null >=0 0 zero zero
302 * tosend udpw null >=0 any nonzero zero
303 * tosend NONE null >=0 any nonzero zero
305 * tcpw tcpw null >=0 irrelevant any any
307 * child childw set >=0 irrelevant irrelevant irrelevant
308 * child NONE null >=0 irrelevant irrelevant irrelevant
309 * done output null -1 irrelevant irrelevant irrelevant
311 * Queries are only not on a queue when they are actually being processed.
312 * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer)
313 * iff the tcp connection is in state server_ok.
315 * +------------------------+
316 * START -----> | tosend/NONE |
317 * +------------------------+
319 * too big for UDP / UDP timeout \ \ send via UDP
320 * send via TCP / more retries \ \
321 * when conn'd / desired \ \
324 * +-----------+ +-------------+
325 * | tcpw/tcpw | ________ | tosend/udpw |
326 * +-----------+ \ +-------------+
327 * | | | UDP timeout | |
330 * \ | TCP died | desired | |
332 * \ \ servers | TCP / |
333 * \ \ to try | timeout / |
335 * reply \ _| +------------------+ / reply
336 * \ | done/output FAIL | /
337 * \ +------------------+ /
340 * (..... got reply ....)
342 * need child query/ies / \ no child query
345 * +---------------+ +----------------+
346 * | childw/childw | ----------------> | done/output OK |
347 * +---------------+ children done +----------------+
351 struct query_queue
{ adns_query head
, tail
; };
354 adns_initflags iflags
;
355 adns_logcallbackfn
*logfn
;
358 struct query_queue udpw
, tcpw
, childw
, output
;
359 adns_query forallnext
;
360 int nextid
, udpsocket
, tcpsocket
;
361 vbuf tcpsend
, tcprecv
;
362 int nservers
, nsortlist
, nsearchlist
, searchndots
, tcpserver
, tcprecv_skip
;
363 enum adns__tcpstate
{
364 server_disconnected
, server_connecting
,
365 server_ok
, server_broken
367 struct timeval tcptimeout
;
368 /* This will have tv_sec==0 if it is not valid. It will always be
369 * valid if tcpstate _connecting. When _ok, it will be nonzero if
370 * we are idle (ie, tcpw queue is empty), in which case it is the
371 * absolute time when we will close the connection.
373 struct sigaction stdsigpipe
;
375 struct pollfd pollfds_buf
[MAX_POLLFDS
];
376 adns_rr_addr servers
[MAXSERVERS
];
379 union gen_addr base
, mask
;
380 } sortlist
[MAXSORTLIST
];
382 unsigned short rand48xsubi
[3];
385 /* From addrfam.c: */
387 extern int adns__af_supported_p(int af
);
388 /* Return nonzero if the address family af known to the library and supported
389 * by the other addrfam operations. Note that the other operations will
390 * abort on an unrecognized address family rather than returning an error
394 extern int adns__genaddr_equal_p(int af
, const union gen_addr
*a
,
395 int bf
, const void *b
);
396 /* b should point to a `struct in_addr' or equivalent for the address family
397 * bf. Returns nonzero if the two addresses are equal.
400 extern int adns__sockaddr_equal_p(const struct sockaddr
*sa
,
401 const struct sockaddr
*sb
);
402 /* Return nonzero if the two socket addresses are equal (in all significant
406 extern int adns__addr_width(int af
);
407 /* Return the width of addresses of family af, in bits. */
409 extern void adns__prefix_mask(int af
, int len
, union gen_addr
*mask_r
);
410 /* Store in mask_r an address mask for address family af, whose first len
411 * bits are set and the remainder are clear. This is what you want for
412 * converting a prefix length into a netmask.
415 extern int adns__guess_prefix_length(int af
, const union gen_addr
*addr
);
416 /* Given a network base address, guess the appropriate prefix length based on
417 * the appropriate rules for the address family (e.g., for IPv4, this uses
418 * the old address classes).
421 extern int adns__addr_match_p(int addraf
, const union gen_addr
*addr
,
422 int netaf
, const union gen_addr
*base
,
423 const union gen_addr
*mask
);
424 /* Given an address af (with family addraf) and a network (with family netaf,
425 * base address base, and netmask mask), return nonzero if the address lies
426 * within the network.
429 extern void adns__sockaddr_extract(const struct sockaddr
*sa
,
430 union gen_addr
*a_r
, int *port_r
);
431 /* Extract fields from the socket address, filling in *a_r and *port_r with
432 * the address and (integer, host byte-order) port number, respectively.
433 * Either (or, pointlessly, both) of a_r and port_r may be null to mean
437 extern void adns__sockaddr_inject(const union gen_addr
*a
, int port
,
438 struct sockaddr
*sa
);
439 /* Inject fields into the socket adress sa. If a is not null, copy the
440 * address in; if port is not -1, then copy the port (converting from host
441 * byte-order). Assumes that sa->sa_family is already set correctly.
444 char *adns__sockaddr_ntoa(const struct sockaddr
*sa
, char *buf
);
445 /* Convert sa to a string, and write it to buf, which must be at least
446 * ADNS_ADDR2TEXT_BUFLEN bytes long (unchecked). Return buf; can't fail.
449 extern int adns__make_reverse_domain(const struct sockaddr
*sa
,
451 char **buf_io
, size_t bufsz
,
453 /* Construct a reverse domain string, given a socket address and a parent
454 * zone. If zone is null, then use the standard reverse-lookup zone for the
455 * address family. If the length of the resulting string is no larger than
456 * bufsz, then the result is stored starting at *buf_io; otherwise a new
457 * buffer is allocated is used, and a pointer to it is stored in both *buf_io
458 * and *buf_free_r (the latter of which should be null on entry). If
459 * something goes wrong, then an errno value is returned: ENOSYS if the
460 * address family of sa isn't recognized, or ENOMEM if the attempt to
461 * allocate an output buffer failed.
464 extern int adns__revparse_label(struct revparse_state
*rps
, int labnum
,
465 const char *label
, int lablen
);
466 /* Parse a label in a reverse-domain name, given its index labnum (starting
467 * from zero), a pointer to its contents (which need not be null-terminated),
468 * and its length. The state in *rps is initialized implicitly when labnum
471 * Returns zero if the parse was successful, nonzero if the domain name is
472 * definitely invalid and the parse must be abandoned.
475 extern int adns__revparse_done(struct revparse_state
*rps
, int nlabels
,
476 adns_rrtype
*rrtype_r
, struct af_addr
*addr_r
);
477 /* Finishes parsing a reverse-domain name, given the total number of labels
478 * in the name. On success, fills in the address in *addr_r, and the forward
479 * query type in *rrtype_r (because that turns out to be useful). Returns
480 * nonzero if the parse must be abandoned.
485 int adns__setnonblock(adns_state ads
, int fd
); /* => errno value */
487 /* From general.c: */
489 void adns__vlprintf(adns_state ads
, const char *fmt
, va_list al
);
490 void adns__lprintf(adns_state ads
, const char *fmt
,
491 ...) PRINTFFORMAT(2,3);
493 void adns__vdiag(adns_state ads
, const char *pfx
, adns_initflags prevent
,
494 int serv
, adns_query qu
, const char *fmt
, va_list al
);
496 void adns__debug(adns_state ads
, int serv
, adns_query qu
,
497 const char *fmt
, ...) PRINTFFORMAT(4,5);
498 void adns__warn(adns_state ads
, int serv
, adns_query qu
,
499 const char *fmt
, ...) PRINTFFORMAT(4,5);
500 void adns__diag(adns_state ads
, int serv
, adns_query qu
,
501 const char *fmt
, ...) PRINTFFORMAT(4,5);
503 int adns__vbuf_ensure(vbuf
*vb
, int want
);
504 int adns__vbuf_appendstr(vbuf
*vb
, const char *data
); /* doesn't include nul */
505 int adns__vbuf_append(vbuf
*vb
, const byte
*data
, int len
);
506 /* 1=>success, 0=>realloc failed */
507 void adns__vbuf_appendq(vbuf
*vb
, const byte
*data
, int len
);
508 void adns__vbuf_init(vbuf
*vb
);
509 void adns__vbuf_free(vbuf
*vb
);
511 const char *adns__diag_domain(adns_state ads
, int serv
, adns_query qu
,
513 const byte
*dgram
, int dglen
, int cbyte
);
514 /* Unpicks a domain in a datagram and returns a string suitable for
515 * printing it as. Never fails - if an error occurs, it will
516 * return some kind of string describing the error.
518 * serv may be -1 and qu may be 0. vb must have been initialised,
519 * and will be left in an arbitrary consistent state.
521 * Returns either vb->buf, or a pointer to a string literal. Do not modify
522 * vb before using the return value.
525 int adns__getrrsz_default(const typeinfo
*typei
, adns_rrtype type
);
526 /* Default function for the `getrrsz' type hook; returns the `fixed_rrsz'
527 * value from the typeinfo entry.
530 void adns__isort(void *array
, int nobjs
, int sz
, void *tempbuf
,
531 int (*needswap
)(void *context
, const void *a
, const void *b
),
533 /* Does an insertion sort of array which must contain nobjs objects
534 * each sz bytes long. tempbuf must point to a buffer at least
535 * sz bytes long. needswap should return !0 if a>b (strictly, ie
536 * wrong order) 0 if a<=b (ie, order is fine).
539 void adns__sigpipe_protect(adns_state
);
540 void adns__sigpipe_unprotect(adns_state
);
541 /* If SIGPIPE protection is not disabled, will block all signals except
542 * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.)
543 * Each call to _protect must be followed by a call to _unprotect before
544 * any significant amount of code gets to run, since the old signal mask
545 * is stored in the adns structure.
548 /* From transmit.c: */
550 adns_status
adns__mkquery(adns_state ads
, vbuf
*vb
, int *id_r
,
551 const char *owner
, int ol
,
552 const typeinfo
*typei
, adns_rrtype type
,
553 adns_queryflags flags
);
554 /* Assembles a query packet in vb. A new id is allocated and returned.
557 adns_status
adns__mkquery_frdgram(adns_state ads
, vbuf
*vb
, int *id_r
,
558 const byte
*qd_dgram
, int qd_dglen
,
560 adns_rrtype type
, adns_queryflags flags
);
561 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
562 * That domain must be correct and untruncated.
565 void adns__querysend_tcp(adns_query qu
, struct timeval now
);
566 /* Query must be in state tcpw/tcpw; it will be sent if possible and
567 * no further processing can be done on it for now. The connection
568 * might be broken, but no reconnect will be attempted.
571 void adns__query_send(adns_query qu
, struct timeval now
);
572 /* Query must be in state tosend/NONE; it will be moved to a new state,
573 * and no further processing can be done on it for now.
574 * (Resulting state is one of udp/timew, tcpwait/timew (if server not
575 * connected), tcpsent/timew, child/childw or done/output.)
576 * __query_send may decide to use either UDP or TCP depending whether
577 * _qf_usevc is set (or has become set) and whether the query is too
583 adns_status
adns__internal_submit(adns_state ads
, adns_query
*query_r
,
584 const typeinfo
*typei
, adns_rrtype type
,
585 vbuf
*qumsg_vb
, int id
,
586 adns_queryflags flags
, struct timeval now
,
588 /* Submits a query (for internal use, called during external submits).
590 * The new query is returned in *query_r, or we return adns_s_nomemory.
592 * The query datagram should already have been assembled in qumsg_vb;
593 * the memory for it is _taken over_ by this routine whether it
594 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
596 * *ctx is copied byte-for-byte into the query. Before doing this, its tinfo
597 * field may be modified by type hooks.
599 * When the child query is done, ctx->callback will be called. The
600 * child will already have been taken off both the global list of
601 * queries in ads and the list of children in the parent. The child
602 * will be freed when the callback returns. The parent will have been
603 * taken off the global childw queue.
605 * The callback should either call adns__query_done, if it is
606 * complete, or adns__query_fail, if an error has occurred, in which
607 * case the other children (if any) will be cancelled. If the parent
608 * has more unfinished children (or has just submitted more) then the
609 * callback may choose to wait for them - it must then put the parent
610 * back on the childw queue.
613 void adns__search_next(adns_state ads
, adns_query qu
, struct timeval now
);
614 /* Walks down the searchlist for a query with adns_qf_search.
615 * The query should have just had a negative response, or not had
616 * any queries sent yet, and should not be on any queue.
617 * The query_dgram if any will be freed and forgotten and a new
618 * one constructed from the search_* members of the query.
620 * Cannot fail (in case of error, calls adns__query_fail).
623 void *adns__alloc_interim(adns_query qu
, size_t sz
);
624 void *adns__alloc_preserved(adns_query qu
, size_t sz
);
625 /* Allocates some memory, and records which query it came from
626 * and how much there was.
628 * If an error occurs in the query, all the memory from _interim is
629 * simply freed. If the query succeeds, one large buffer will be made
630 * which is big enough for all these allocations, and then
631 * adns__alloc_final will get memory from this buffer.
633 * _alloc_interim can fail (and return 0).
634 * The caller must ensure that the query is failed.
636 * The memory from _preserved is is kept and transferred into the
637 * larger buffer - unless we run out of memory, in which case it too
638 * is freed. When you use _preserved you have to add code to the
639 * x_nomem error exit case in adns__makefinal_query to clear out the
640 * pointers you made to those allocations, because that's when they're
641 * thrown away; you should also make a note in the declaration of
642 * those pointer variables, to note that they are _preserved rather
643 * than _interim. If they're in the answer, note it here:
644 * answer->cname and answer->owner are _preserved.
647 void adns__transfer_interim(adns_query from
, adns_query to
,
648 void *block
, size_t sz
);
649 /* Transfers an interim allocation from one query to another, so that
650 * the `to' query will have room for the data when we get to makefinal
651 * and so that the free will happen when the `to' query is freed
652 * rather than the `from' query.
654 * It is legal to call adns__transfer_interim with a null pointer; this
657 * _transfer_interim also ensures that the expiry time of the `to' query
658 * is no later than that of the `from' query, so that child queries'
659 * TTLs get inherited by their parents.
662 void *adns__alloc_mine(adns_query qu
, size_t sz
);
663 /* Like _interim, but does not record the length for later
664 * copying into the answer. This just ensures that the memory
665 * will be freed when we're done with the query.
668 void *adns__alloc_final(adns_query qu
, size_t sz
);
669 /* Cannot fail, and cannot return 0.
672 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
);
673 void adns__makefinal_str(adns_query qu
, char **strp
);
675 void adns__reset_preserved(adns_query qu
);
676 /* Resets all of the memory management stuff etc. to take account of
677 * only the _preserved stuff from _alloc_preserved. Used when we find
678 * an error somewhere and want to just report the error (with perhaps
679 * CNAME, owner, etc. info), and also when we're halfway through RRs
680 * in a datagram and discover that we need to retry the query.
683 void adns__query_done(adns_query qu
);
684 void adns__query_fail(adns_query qu
, adns_status stat
);
688 void adns__procdgram(adns_state ads
, const byte
*dgram
, int len
,
689 int serv
, int viatcp
, struct timeval now
);
690 /* This function is allowed to cause new datagrams to be constructed
691 * and sent, or even new queries to be started. However,
692 * query-sending functions are not allowed to call any general event
693 * loop functions in case they accidentally call this.
695 * Ie, receiving functions may call sending functions.
696 * Sending functions may NOT call receiving functions.
701 const typeinfo
*adns__findtype(adns_rrtype type
);
710 int dglen
, max
, cbyte
, namelen
;
714 void adns__findlabel_start(findlabel_state
*fls
, adns_state ads
,
715 int serv
, adns_query qu
,
716 const byte
*dgram
, int dglen
, int max
,
717 int dmbegin
, int *dmend_rlater
);
718 /* Finds labels in a domain in a datagram.
720 * Call this routine first.
721 * dmend_rlater may be null. ads (and of course fls) may not be.
722 * serv may be -1, qu may be null - they are for error reporting.
725 adns_status
adns__findlabel_next(findlabel_state
*fls
,
726 int *lablen_r
, int *labstart_r
);
727 /* Then, call this one repeatedly.
729 * It will return adns_s_ok if all is well, and tell you the length
730 * and start of successive labels. labstart_r may be null, but
731 * lablen_r must not be.
733 * After the last label, it will return with *lablen_r zero.
734 * Do not then call it again; instead, just throw away the findlabel_state.
736 * *dmend_rlater will have been set to point to the next part of
737 * the datagram after the label (or after the uncompressed part,
738 * if compression was used). *namelen_rlater will have been set
739 * to the length of the domain name (total length of labels plus
740 * 1 for each intervening dot).
742 * If the datagram appears to be truncated, *lablen_r will be -1.
743 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
744 * Do not call _next again.
746 * There may also be errors, in which case *dmend_rlater,
747 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
748 * Do not then call findlabel_next again.
755 adns_status
adns__parse_domain(adns_state ads
, int serv
, adns_query qu
,
756 vbuf
*vb
, parsedomain_flags flags
,
757 const byte
*dgram
, int dglen
, int *cbyte_io
,
759 /* vb must already have been initialised; it will be reset if necessary.
760 * If there is truncation, vb->used will be set to 0; otherwise
761 * (if there is no error) vb will be null-terminated.
762 * If there is an error vb and *cbyte_io may be left indeterminate.
764 * serv may be -1 and qu may be 0 - they are used for error reporting only.
767 adns_status
adns__parse_domain_more(findlabel_state
*fls
, adns_state ads
,
768 adns_query qu
, vbuf
*vb
,
769 parsedomain_flags flags
,
771 /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state,
772 * for continuing an existing domain or some such of some kind. Also, unlike
773 * _parse_domain, the domain data will be appended to vb, rather than replacing
774 * the existing contents.
777 adns_status
adns__findrr(adns_query qu
, int serv
,
778 const byte
*dgram
, int dglen
, int *cbyte_io
,
779 int *type_r
, int *class_r
, unsigned long *ttl_r
,
780 int *rdlen_r
, int *rdstart_r
,
781 int *ownermatchedquery_r
);
782 /* Finds the extent and some of the contents of an RR in a datagram
783 * and does some checks. The datagram is *dgram, length dglen, and
784 * the RR starts at *cbyte_io (which is updated afterwards to point
785 * to the end of the RR).
787 * The type, class, TTL and RRdata length and start are returned iff
788 * the corresponding pointer variables are not null. type_r, class_r
789 * and ttl_r may not be null. The TTL will be capped.
791 * If ownermatchedquery_r != 0 then the owner domain of this
792 * RR will be compared with that in the query (or, if the query
793 * has gone to a CNAME lookup, with the canonical name).
794 * In this case, *ownermatchedquery_r will be set to 0 or 1.
795 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
797 * If there is truncation then *type_r will be set to -1 and
798 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
801 * qu must obviously be non-null.
803 * If an error is returned then *type_r will be undefined too.
806 adns_status
adns__findrr_anychk(adns_query qu
, int serv
,
807 const byte
*dgram
, int dglen
, int *cbyte_io
,
808 int *type_r
, int *class_r
,
809 unsigned long *ttl_r
,
810 int *rdlen_r
, int *rdstart_r
,
811 const byte
*eo_dgram
, int eo_dglen
,
812 int eo_cbyte
, int *eo_matched_r
);
813 /* Like adns__findrr_checked, except that the datagram and
814 * owner to compare with can be specified explicitly.
816 * If the caller thinks they know what the owner of the RR ought to
817 * be they can pass in details in eo_*: this is another (or perhaps
818 * the same datagram), and a pointer to where the putative owner
819 * starts in that datagram. In this case *eo_matched_r will be set
820 * to 1 if the datagram matched or 0 if it did not. Either
821 * both eo_dgram and eo_matched_r must both be non-null, or they
822 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
823 * The eo datagram and contained owner domain MUST be valid and
827 void adns__update_expires(adns_query qu
, unsigned long ttl
,
829 /* Updates the `expires' field in the query, so that it doesn't exceed
833 int vbuf__append_quoted1035(vbuf
*vb
, const byte
*buf
, int len
);
837 void adns__tcp_broken(adns_state ads
, const char *what
, const char *why
);
838 /* what and why may be both 0, or both non-0. */
840 void adns__tcp_tryconnect(adns_state ads
, struct timeval now
);
842 void adns__autosys(adns_state ads
, struct timeval now
);
843 /* Make all the system calls we want to if the application wants us to.
844 * Must not be called from within adns internal processing functions,
845 * lest we end up in recursive descent !
848 void adns__must_gettimeofday(adns_state ads
, const struct timeval
**now_io
,
849 struct timeval
*tv_buf
);
851 int adns__pollfds(adns_state ads
, struct pollfd pollfds_buf
[MAX_POLLFDS
]);
852 void adns__fdevents(adns_state ads
,
853 const struct pollfd
*pollfds
, int npollfds
,
854 int maxfd
, const fd_set
*readfds
,
855 const fd_set
*writefds
, const fd_set
*exceptfds
,
856 struct timeval now
, int *r_r
);
857 int adns__internal_check(adns_state ads
,
858 adns_query
*query_io
,
859 adns_answer
**answer
,
862 void adns__timeouts(adns_state ads
, int act
,
863 struct timeval
**tv_io
, struct timeval
*tvbuf
,
865 /* If act is !0, then this will also deal with the TCP connection
866 * if previous events broke it or require it to be connected.
871 void adns__consistency(adns_state ads
, adns_query qu
, consistency_checks cc
);
873 /* Useful static inline functions: */
875 static inline int ctype_whitespace(int c
) {
876 return c
==' ' || c
=='\n' || c
=='\t';
878 static inline int ctype_digit(int c
) { return c
>='0' && c
<='9'; }
879 static inline int ctype_alpha(int c
) {
880 return (c
>= 'a' && c
<= 'z') || (c
>= 'A' && c
<= 'Z');
882 static inline int ctype_822special(int c
) {
883 return strchr("()<>@,;:\\\".[]",c
) != 0;
885 static inline int ctype_domainunquoted(int c
) {
886 return ctype_alpha(c
) || ctype_digit(c
) || (strchr("-_/+",c
) != 0);
889 static inline int errno_resources(int e
) { return e
==ENOMEM
|| e
==ENOBUFS
; }
893 #define MEM_ROUND(sz) \
894 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
895 * sizeof(union maxalign) )
897 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
898 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
899 #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))
900 #define GET_L(cb,tv) ( (tv)=0, \
901 (tv)|=(GETIL_B((cb))<<24), \
902 (tv)|=(GETIL_B((cb))<<16), \
903 (tv)|=(GETIL_B((cb))<<8), \