33086f68c5350b43d7751cb83d3bd9fa2ca093bb
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 Copyright (C) 1997, 1998 Ian Jackson
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2, or (at your option)
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software Foundation,
22 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
25 #ifndef ADNS_INTERNAL_H_INCLUDED
26 #define ADNS_INTERNAL_H_INCLUDED
28 #define PRINTFFORMAT(a,b) __attribute__((format(printf,a,b)))
29 typedef unsigned char byte
;
39 /* Configuration and constants */
42 #define UDPMAXRETRIES /*15*/5
43 #define UDPRETRYMS 2000
45 #define LOCALRESOURCEMS 20
48 #define DNS_MAXUDP 512
49 #define DNS_MAXDOMAIN 255
50 #define DNS_HDRSIZE 12
51 #define DNS_CLASS_IN 1
62 /* Shared data structures */
81 void (*callback
)(adns_query parent
, adns_query child
);
83 adns_rr_hostaddr
*hostaddr
;
93 int dglen
, nsstart
, nscount
, arcount
;
103 void (*makefinal
)(adns_query qu
, void *data
);
104 /* Change memory management of *data.
105 * Previously, used alloc_interim, now use alloc_final.
108 adns_status (*convstring
)(vbuf
*vb
, const void *data
);
109 /* Converts the RR data to a string representation in vbuf.
110 * vbuf will be appended to (it must have been initialised),
111 * and will not be null-terminated by convstring.
114 adns_status (*parse
)(const parseinfo
*pai
, int cbyte
, int max
, void *store_r
);
115 /* Parse one RR, in dgram of length dglen, starting at cbyte and
116 * extending until at most max.
118 * The RR should be stored at *store_r, of length qu->typei->rrsz.
120 * If there is an overrun which might indicate truncation, it should set
121 * *rdstart to -1; otherwise it may set it to anything else positive.
123 * nsstart is the offset of the authority section.
126 int (*diff_needswap
)(const void *datap_a
, const void *datap_b
);
127 /* Returns !0 if RR a should be strictly after RR b in the sort order,
128 * 0 otherwise. Must not fail.
132 typedef struct allocnode
{
133 struct allocnode
*next
, *back
;
147 enum { query_udp
, query_tcpwait
, query_tcpsent
, query_child
, query_done
} state
;
148 adns_query back
, next
, parent
;
149 struct { adns_query head
, tail
; } children
;
150 struct { adns_query back
, next
; } siblings
;
151 struct { allocnode
*head
, *tail
; } allocations
;
153 void *final_allocspace
;
155 const typeinfo
*typei
;
160 /* General-purpose messing-about buffer.
161 * Wherever a `big' interface is crossed, this may be corrupted/changed
162 * unless otherwise specified.
166 /* This is allocated when a query is submitted, to avoid being unable
167 * to relate errors to queries if we run out of memory. During
168 * query processing status, rrs is 0. cname is set if
169 * we found a cname (this corresponds to cname_dgram in the query
170 * structure). type is set from the word go. nrrs and rrs
171 * are set together, when we find how many rrs there are.
175 int cname_dglen
, cname_begin
;
176 /* If non-0, has been allocated using . */
178 int id
, flags
, udpretries
;
180 unsigned long udpsent
, tcpfailed
; /* bitmap indexed by server */
181 struct timeval timeout
;
186 * state Queue child id nextudpserver sentudp failedtcp
188 * udp NONE null >=0 0 zero zero
189 * udp timew null >=0 any nonzero zero
190 * udp NONE null >=0 any nonzero zero
192 * tcpwait timew null >=0 irrelevant zero any
193 * tcpsent timew null >=0 irrelevant zero any
195 * child childw set >=0 irrelevant irrelevant irrelevant
196 * done output null -1 irrelevant irrelevant irrelevant
198 * +------------------------+
199 * START -----> | udp/NONE |
200 * +------------------------+
202 * too big for UDP / UDP timeout \ \ send via UDP
203 * do this ASAP! / more retries \ \ do this ASAP!
205 * +---------------+ +-----------+
206 * | tcpwait/timew | ____ | udp/timew |
207 * +---------------+ \ +-----------+
209 * TCP conn'd; | | TCP died | | |
210 * send via TCP | | more | UDP timeout | |
211 * do this ASAP! | | servers | no more | |
212 * v | to try | retries | |
213 * +---------------+ | desired | |
214 * | tcpsent/timew | ____ | | |
215 * +---------------+ \| | |
216 * \ \ TCP died | TCP | |
217 * \ \ no more | timeout / |
221 * reply \ _| +------------------+ / reply
222 * \ | done/output FAIL | /
223 * \ +------------------+ /
226 * (..... got reply ....)
228 * need child query/ies / \ no child query
231 * +--------------+ +----------------+
232 * | child/childw | ----------------> | done/output OK |
233 * +--------------+ children done +----------------+
238 adns_initflags iflags
;
240 struct { adns_query head
, tail
; } timew
, childw
, output
;
241 int nextid
, udpsocket
, tcpsocket
;
242 vbuf tcpsend
, tcprecv
;
243 int nservers
, tcpserver
;
244 enum adns__tcpstate
{ server_disconnected
, server_connecting
, server_ok
} tcpstate
;
245 struct timeval tcptimeout
;
248 } servers
[MAXSERVERS
];
253 int adns__setnonblock(adns_state ads
, int fd
); /* => errno value */
255 /* From general.c: */
257 void adns__vdiag(adns_state ads
, const char *pfx
, adns_initflags prevent
,
258 int serv
, adns_query qu
, const char *fmt
, va_list al
);
260 void adns__debug(adns_state ads
, int serv
, adns_query qu
,
261 const char *fmt
, ...) PRINTFFORMAT(4,5);
262 void adns__warn(adns_state ads
, int serv
, adns_query qu
,
263 const char *fmt
, ...) PRINTFFORMAT(4,5);
264 void adns__diag(adns_state ads
, int serv
, adns_query qu
,
265 const char *fmt
, ...) PRINTFFORMAT(4,5);
267 int adns__vbuf_ensure(vbuf
*vb
, int want
);
268 int adns__vbuf_appendstr(vbuf
*vb
, const char *data
); /* does not include nul */
269 int adns__vbuf_append(vbuf
*vb
, const byte
*data
, int len
);
270 /* 1=>success, 0=>realloc failed */
271 void adns__vbuf_appendq(vbuf
*vb
, const byte
*data
, int len
);
272 void adns__vbuf_init(vbuf
*vb
);
273 void adns__vbuf_free(vbuf
*vb
);
275 const char *adns__diag_domain(adns_state ads
, int serv
, adns_query qu
,
276 vbuf
*vb
, const byte
*dgram
, int dglen
, int cbyte
);
277 /* Unpicks a domain in a datagram and returns a string suitable for
278 * printing it as. Never fails - if an error occurs, it will
279 * return some kind of string describing the error.
281 * serv may be -1 and qu may be 0. vb must have been initialised,
282 * and will be left in an arbitrary consistent state.
284 * Returns either vb->buf, or a pointer to a string literal. Do not modify
285 * vb before using the return value.
288 void adns__isort(void *array
, int nobjs
, int sz
, void *tempbuf
,
289 int (*needswap
)(const void *a
, const void *b
));
290 /* Does an insertion sort of array which must contain nobjs objects
291 * each sz bytes long. tempbuf must point to a buffer at least
292 * sz bytes long. needswap should return !0 if a>b (strictly, ie
293 * wrong order) 0 if a<=b (ie, order is fine).
296 /* From transmit.c: */
298 adns_status
adns__mkquery(adns_state ads
, vbuf
*vb
, int *id_r
,
299 const char *owner
, int ol
,
300 const typeinfo
*typei
, adns_queryflags flags
);
301 /* Assembles a query packet in vb, and returns id at *id_r. */
303 adns_status
adns__mkquery_frdgram(adns_state ads
, vbuf
*vb
, int *id_r
,
304 const byte
*qd_dgram
, int qd_dglen
, int qd_begin
,
305 adns_rrtype type
, adns_queryflags flags
);
306 /* Same as adns__mkquery, but takes the owner domain from an existing datagram.
307 * That domain must be correct and untruncated.
310 void adns__query_tcp(adns_query qu
, struct timeval now
);
311 /* Query must be in state tcpwait/timew; it will be moved to a new state
312 * if possible and no further processing can be done on it for now.
313 * (Resulting state is one of tcpwait/timew (if server not connected),
314 * tcpsent/timew, child/childw or done/output.)
316 * adns__tcp_tryconnect should already have been called - _tcp
317 * will only use an existing connection (if there is one), which it
318 * may break. If the conn list lost then the caller is responsible for any
319 * reestablishment and retry.
322 void adns__query_udp(adns_query qu
, struct timeval now
);
323 /* Query must be in state udp/NONE; it will be moved to a new state,
324 * and no further processing can be done on it for now.
325 * (Resulting state is one of udp/timew, tcpwait/timew (if server not connected),
326 * tcpsent/timew, child/childw or done/output.)
331 int adns__internal_submit(adns_state ads
, adns_query
*query_r
,
332 const typeinfo
*typei
, vbuf
*qumsg_vb
, int id
,
333 adns_queryflags flags
, struct timeval now
,
334 adns_status failstat
, const qcontext
*ctx
);
335 /* Submits a query (for internal use, called during external submits).
337 * The new query is returned in *query_r, or we return adns_s_nomemory.
339 * The query datagram should already have been assembled in qumsg_vb;
340 * the memory for it is _taken over_ by this routine whether it
341 * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb).
343 * If failstat is nonzero then if we are successful in creating the query
344 * it is immediately failed with code failstat (but _submit still succeds).
346 * *ctx is copied byte-for-byte into the query.
349 void *adns__alloc_interim(adns_query qu
, size_t sz
);
350 /* Allocates some memory, and records which query it came from
351 * and how much there was.
353 * If an error occurs in the query, all its memory is simply freed.
355 * If the query succeeds, one large buffer will be made which is
356 * big enough for all these allocations, and then adns__alloc_final
357 * will get memory from this buffer.
359 * _alloc_interim can fail (and return 0).
360 * The caller must ensure that the query is failed.
362 * adns__alloc_interim_{only,fail}(qu,0) will not return 0,
363 * but it will not necessarily return a distinct pointer each time.
366 void adns__transfer_interim(adns_query from
, adns_query to
, void *block
, size_t sz
);
367 /* Transfers an interim allocation from one query to another, so that
368 * the `to' query will have room for the data when we get to makefinal
369 * and so that the free will happen when the `to' query is freed
370 * rather than the `from' query.
372 * It is legal to call adns__transfer_interim with a null pointer; this
376 void *adns__alloc_mine(adns_query qu
, size_t sz
);
377 /* Like _interim, but does not record the length for later
378 * copying into the answer. This just ensures that the memory
379 * will be freed when we're done with the query.
382 void *adns__alloc_final(adns_query qu
, size_t sz
);
383 /* Cannot fail, and cannot return 0.
386 void adns__makefinal_block(adns_query qu
, void **blpp
, size_t sz
);
387 void adns__makefinal_str(adns_query qu
, char **strp
);
389 void adns__reset_cnameonly(adns_query qu
);
390 /* Resets all of the memory management stuff etc. to
391 * take account of only the CNAME. Used when we find an error somewhere
392 * and want to just report the error (with perhaps CNAME info), and also
393 * when we're halfway through RRs in a datagram and discover that we
394 * need to retry the query.
397 void adns__query_done(adns_query qu
);
398 void adns__query_fail(adns_query qu
, adns_status stat
);
402 void adns__procdgram(adns_state ads
, const byte
*dgram
, int len
,
403 int serv
, struct timeval now
);
407 const typeinfo
*adns__findtype(adns_rrtype type
);
416 int dglen
, max
, cbyte
, namelen
;
420 void adns__findlabel_start(findlabel_state
*fls
, adns_state ads
,
421 int serv
, adns_query qu
,
422 const byte
*dgram
, int dglen
, int max
,
423 int dmbegin
, int *dmend_rlater
);
424 /* Finds labels in a domain in a datagram.
426 * Call this routine first.
427 * dmend_rlater may be null. ads (and of course fls) may not be.
428 * serv may be -1, qu may be null - they are for error reporting.
431 adns_status
adns__findlabel_next(findlabel_state
*fls
, int *lablen_r
, int *labstart_r
);
432 /* Then, call this one repeatedly.
434 * It will return adns_s_ok if all is well, and tell you the length
435 * and start of successive labels. labstart_r may be null, but
436 * lablen_r must not be.
438 * After the last label, it will return with *lablen_r zero.
439 * Do not then call it again; instead, just throw away the findlabel_state.
441 * *dmend_rlater will have been set to point to the next part of
442 * the datagram after the label (or after the uncompressed part,
443 * if compression was used). *namelen_rlater will have been set
444 * to the length of the domain name (total length of labels plus
445 * 1 for each intervening dot).
447 * If the datagram appears to be truncated, *lablen_r will be -1.
448 * *dmend_rlater, *labstart_r and *namelen_r may contain garbage.
449 * Do not call _next again.
451 * There may also be errors, in which case *dmend_rlater,
452 * *namelen_rlater, *lablen_r and *labstart_r may contain garbage.
453 * Do not then call findlabel_next again.
460 adns_status
adns__parse_domain(adns_state ads
, int serv
, adns_query qu
,
461 vbuf
*vb
, parsedomain_flags flags
,
462 const byte
*dgram
, int dglen
, int *cbyte_io
, int max
);
463 /* vb must already have been initialised; it will be reset if necessary.
464 * If there is truncation, vb->used will be set to 0; otherwise
465 * (if there is no error) vb will be null-terminated.
466 * If there is an error vb and *cbyte_io may be left indeterminate.
468 * serv may be -1 and qu may be 0 - they are used for error reporting only.
471 adns_status
adns__findrr(adns_query qu
, int serv
,
472 const byte
*dgram
, int dglen
, int *cbyte_io
,
473 int *type_r
, int *class_r
, int *rdlen_r
, int *rdstart_r
,
474 int *ownermatchedquery_r
);
475 /* Finds the extent and some of the contents of an RR in a datagram
476 * and does some checks. The datagram is *dgram, length dglen, and
477 * the RR starts at *cbyte_io (which is updated afterwards to point
478 * to the end of the RR).
480 * The type, class and RRdata length and start are returned iff
481 * the corresponding pointer variables are not null. type_r and
482 * class_r may not be null.
484 * If ownermatchedquery_r != 0 then the owner domain of this
485 * RR will be compared with that in the query (or, if the query
486 * has gone to a CNAME lookup, with the canonical name).
487 * In this case, *ownermatchedquery_r will be set to 0 or 1.
488 * The query datagram (or CNAME datagram) MUST be valid and not truncated.
490 * If there is truncation then *type_r will be set to -1 and
491 * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be
494 * qu must obviously be non-null.
496 * If an error is returned then *type_r will be undefined too.
499 adns_status
adns__findrr_anychk(adns_query qu
, int serv
,
500 const byte
*dgram
, int dglen
, int *cbyte_io
,
501 int *type_r
, int *class_r
, int *rdlen_r
, int *rdstart_r
,
502 const byte
*eo_dgram
, int eo_dglen
, int eo_cbyte
,
504 /* Like adns__findrr_checked, except that the datagram and
505 * owner to compare with can be specified explicitly.
507 * If the caller thinks they know what the owner of the RR ought to
508 * be they can pass in details in eo_*: this is another (or perhaps
509 * the same datagram), and a pointer to where the putative owner
510 * starts in that datagram. In this case *eo_matched_r will be set
511 * to 1 if the datagram matched or 0 if it did not. Either
512 * both eo_dgram and eo_matched_r must both be non-null, or they
513 * must both be null (in which case eo_dglen and eo_cbyte will be ignored).
514 * The eo datagram and contained owner domain MUST be valid and
518 int vbuf__append_quoted1035(vbuf
*vb
, const byte
*buf
, int len
);
522 void adns__tcp_broken(adns_state ads
, const char *what
, const char *why
);
523 void adns__tcp_tryconnect(adns_state ads
, struct timeval now
);
525 void adns__autosys(adns_state ads
, struct timeval now
);
526 /* Make all the system calls we want to if the application wants us to. */
528 /* Useful static inline functions: */
530 static inline void timevaladd(struct timeval
*tv_io
, long ms
) {
534 tmp
.tv_usec
+= (ms
%1000)*1000000;
535 tmp
.tv_sec
+= ms
/1000;
536 if (tmp
.tv_usec
>= 1000000) { tmp
.tv_sec
++; tmp
.tv_usec
-= 1000; }
540 static inline int ctype_whitespace(int c
) { return c
==' ' || c
=='\n' || c
=='\t'; }
541 static inline int ctype_digit(int c
) { return c
>='0' && c
<='9'; }
542 static inline int ctype_alpha(int c
) {
543 return (c
>= 'a' && c
<= 'z') || (c
>= 'A' || c
<= 'Z');
548 #define MEM_ROUND(sz) \
549 (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \
550 * sizeof(union maxalign) )
552 #define LIST_INIT(list) ((list).head= (list).tail= 0)
554 #define LIST_UNLINK_PART(list,node,part) \
556 if ((node)->part back) (node)->part back->part next= (node)->part next; \
557 else (list).head= (node)->part next; \
558 if ((node)->part next) (node)->part next->part back= (node)->part back; \
559 else (list).tail= (node)->part back; \
562 #define LIST_LINK_TAIL_PART(list,node,part) \
564 (node)->part next= 0; \
565 (node)->part back= (list).tail; \
566 if ((list).tail) (list).tail->part next= (node); else (list).head= (node); \
567 (list).tail= (node); \
570 #define LIST_UNLINK(list,node) LIST_UNLINK_PART(list,node,)
571 #define LIST_LINK_TAIL(list,node) LIST_LINK_TAIL_PART(list,node,)
573 #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff)
574 #define GET_B(cb,tv) ((tv)= GETIL_B((cb)))
575 #define GET_W(cb,tv) ((tv)=0, (tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv))