Commit | Line | Data |
---|---|---|
98db6da3 | 1 | /* |
2 | * internal.h | |
3 | * - declarations of private objects with external linkage (adns__*) | |
4 | * - definitons of internal macros | |
5 | * - comments regarding library data structures | |
6 | */ | |
7 | /* | |
39f45e7e | 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.) | |
d0a057ac | 13 | * |
98db6da3 | 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) | |
17 | * any later version. | |
d0a057ac | 18 | * |
98db6da3 | 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. | |
d0a057ac | 23 | * |
98db6da3 | 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, | |
d0a057ac | 26 | * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
98db6da3 | 27 | */ |
dfdbb32c | 28 | |
29 | #ifndef ADNS_INTERNAL_H_INCLUDED | |
30 | #define ADNS_INTERNAL_H_INCLUDED | |
31 | ||
b6953d1b | 32 | #include "config.h" |
d05cc330 | 33 | typedef unsigned char byte; |
34 | ||
35 | #include <stdarg.h> | |
36 | #include <assert.h> | |
37 | #include <unistd.h> | |
87e46054 | 38 | #include <signal.h> |
74c94831 | 39 | #include <errno.h> |
0872e289 | 40 | #include <string.h> |
cebf6f2b | 41 | #include <stdlib.h> |
d05cc330 | 42 | |
dfdbb32c | 43 | #include <sys/time.h> |
44 | ||
5f8085b7 | 45 | #define ADNS_FEATURE_MANYAF |
dfdbb32c | 46 | #include "adns.h" |
ab898cf4 | 47 | #include "dlist.h" |
dfdbb32c | 48 | |
09aee00b | 49 | #ifdef ADNS_REGRESS_TEST |
50 | # include "hredirect.h" | |
51 | #endif | |
52 | ||
dfdbb32c | 53 | /* Configuration and constants */ |
54 | ||
55 | #define MAXSERVERS 5 | |
8c3aa944 | 56 | #define MAXSORTLIST 15 |
59fbb06a | 57 | #define UDPMAXRETRIES 15 |
dfdbb32c | 58 | #define UDPRETRYMS 2000 |
d0a057ac | 59 | #define TCPWAITMS 30000 |
60 | #define TCPCONNMS 14000 | |
61 | #define TCPIDLEMS 30000 | |
2c7b101b | 62 | #define MAXTTLBELIEVE (7*86400) /* any TTL > 7 days is capped */ |
54ed1d64 | 63 | |
5c596e4d | 64 | #define DNS_PORT 53 |
54ed1d64 | 65 | #define DNS_MAXUDP 512 |
3d75057b | 66 | #define DNS_MAXLABEL 63 |
54ed1d64 | 67 | #define DNS_MAXDOMAIN 255 |
68 | #define DNS_HDRSIZE 12 | |
7e6a84a1 | 69 | #define DNS_IDOFFSET 0 |
54ed1d64 | 70 | #define DNS_CLASS_IN 1 |
dfdbb32c | 71 | |
cd1bde2f | 72 | #define DNS_INADDR_ARPA "in-addr", "arpa" |
8a53cf7f | 73 | #define DNS_IP6_ARPA "ip6", "arpa" |
cd1bde2f | 74 | |
88518143 MW |
75 | #define ADDR_MAXRRTYPES 2 |
76 | ||
705b9b15 MW |
77 | #define STRINGIFY(x) REALLY_STRINGIFY(x) |
78 | #define REALLY_STRINGIFY(x) #x | |
79 | ||
74c94831 | 80 | #define MAX_POLLFDS ADNS_POLLFDS_RECOMMENDED |
81 | ||
1389dc72 | 82 | typedef enum { |
83 | cc_user, | |
84 | cc_entex, | |
85 | cc_freq | |
86 | } consistency_checks; | |
87 | ||
5c596e4d | 88 | typedef enum { |
89 | rcode_noerror, | |
90 | rcode_formaterror, | |
91 | rcode_servfail, | |
92 | rcode_nxdomain, | |
93 | rcode_notimp, | |
94 | rcode_refused | |
95 | } dns_rcode; | |
96 | ||
5f8085b7 | 97 | enum { |
bcfd6f13 | 98 | adns__qf_senddirect = 0x00100000,/* don't call the `query_send' type hook */ |
0aa4a357 MW |
99 | adns__qf_nosend = 0x00200000,/* don't send the query when submitting */ |
100 | adns__qf_addr_answer= 0x01000000,/* addr query received an answer */ | |
96818a13 | 101 | adns__qf_addr_cname = 0x02000000 /* addr subquery performed on cname */ |
5f8085b7 MW |
102 | }; |
103 | ||
dfdbb32c | 104 | /* Shared data structures */ |
105 | ||
d05cc330 | 106 | typedef union { |
dfdbb32c | 107 | adns_status status; |
108 | char *cp; | |
109 | adns_rrtype type; | |
d05cc330 | 110 | int i; |
dfdbb32c | 111 | struct in_addr ia; |
112 | unsigned long ul; | |
d05cc330 | 113 | } rr_align; |
114 | ||
115 | typedef struct { | |
116 | int used, avail; | |
117 | byte *buf; | |
118 | } vbuf; | |
119 | ||
a1d2d0ed | 120 | typedef struct { |
26eb6bdc | 121 | adns_state ads; |
a1d2d0ed | 122 | adns_query qu; |
26eb6bdc | 123 | int serv; |
a1d2d0ed | 124 | const byte *dgram; |
26eb6bdc | 125 | int dglen, nsstart, nscount, arcount; |
ba1ddf08 | 126 | struct timeval now; |
a1d2d0ed | 127 | } parseinfo; |
128 | ||
9136cf0c MW |
129 | union gen_addr { |
130 | struct in_addr v4; | |
131 | struct in6_addr v6; | |
132 | }; | |
133 | ||
134 | typedef struct { | |
135 | int af; | |
136 | int width; | |
137 | int delim; | |
8a53cf7f MW |
138 | int nrevcomp; |
139 | int revcompwd; | |
140 | adns_rrtype rrtype; | |
bcfd6f13 | 141 | const void *(*sockaddr_to_inaddr)(const struct sockaddr *sa); |
705b9b15 MW |
142 | int (*sockaddr_equalp)(const struct sockaddr *sa, |
143 | const struct sockaddr *sb); | |
9136cf0c MW |
144 | void (*prefix_mask)(int len, union gen_addr *a); |
145 | int (*guess_len)(const union gen_addr *a); | |
146 | int (*matchp)(const union gen_addr *addr, | |
147 | const union gen_addr *base, const union gen_addr *mask); | |
8a53cf7f MW |
148 | int (*rev_parsecomp)(const char *p, size_t n); |
149 | void (*rev_mkaddr)(union gen_addr *addr, const byte *ipv); | |
705b9b15 | 150 | char *(*rev_mkname)(const struct sockaddr *sa, char *buf); |
9136cf0c MW |
151 | } afinfo; |
152 | ||
8a53cf7f MW |
153 | struct afinfo_addr { const afinfo *ai; union gen_addr addr; }; |
154 | ||
bddb4c18 | 155 | typedef struct typeinfo { |
7d0aaee4 | 156 | adns_rrtype typekey; |
1e9efa71 | 157 | const char *rrtname; |
158 | const char *fmtname; | |
5c596e4d | 159 | int rrsz; |
965c9782 | 160 | |
1e9efa71 | 161 | void (*makefinal)(adns_query qu, void *data); |
162 | /* Change memory management of *data. | |
163 | * Previously, used alloc_interim, now use alloc_final. | |
164 | */ | |
165 | ||
166 | adns_status (*convstring)(vbuf *vb, const void *data); | |
167 | /* Converts the RR data to a string representation in vbuf. | |
168 | * vbuf will be appended to (it must have been initialised), | |
169 | * and will not be null-terminated by convstring. | |
170 | */ | |
171 | ||
9c344a42 | 172 | adns_status (*parse)(const parseinfo *pai, int cbyte, |
173 | int max, void *store_r); | |
7f702335 | 174 | /* Parse one RR, in dgram of length dglen, starting at cbyte and |
175 | * extending until at most max. | |
176 | * | |
177 | * The RR should be stored at *store_r, of length qu->typei->rrsz. | |
178 | * | |
179 | * If there is an overrun which might indicate truncation, it should set | |
180 | * *rdstart to -1; otherwise it may set it to anything else positive. | |
f318f883 | 181 | * |
a1d2d0ed | 182 | * nsstart is the offset of the authority section. |
965c9782 | 183 | */ |
f2ad23ee | 184 | |
9c344a42 | 185 | int (*diff_needswap)(adns_state ads,const void *datap_a,const void *datap_b); |
f318f883 | 186 | /* Returns !0 if RR a should be strictly after RR b in the sort order, |
f2ad23ee | 187 | * 0 otherwise. Must not fail. |
188 | */ | |
bddb4c18 | 189 | |
190 | adns_status (*qdparselabel)(adns_state ads, | |
191 | const char **p_io, const char *pe, int labelnum, | |
192 | char label_r[DNS_MAXDOMAIN], int *ll_io, | |
193 | adns_queryflags flags, | |
194 | const struct typeinfo *typei); | |
195 | /* Parses one label from the query domain string. On entry, *p_io | |
196 | * points to the next character to parse and *ll_io is the size of | |
197 | * the buffer. pe points just after the end of the query domain | |
198 | * string. On successful return, label_r[] and *ll_io are filled in | |
199 | * and *p_io points to *pe or just after the label-ending `.'. */ | |
200 | ||
375c6c48 | 201 | void (*postsort)(adns_state ads, void *array, int nrrs, |
59d05d1c | 202 | const struct typeinfo *typei); |
203 | /* Called immediately after the RRs have been sorted, and may rearrange | |
204 | * them. (This is really for the benefit of SRV's bizarre weighting | |
205 | * stuff.) May be 0 to mean nothing needs to be done. | |
206 | */ | |
5f8085b7 MW |
207 | |
208 | void (*query_send)(adns_query qu, struct timeval now); | |
209 | /* Send the query to nameservers, and hook it into the appropriate queue. | |
210 | * Normal behaviour is to call adns__query_send, but this can be overridden | |
211 | * for special effects. | |
212 | */ | |
8312a1c2 | 213 | } typeinfo; |
214 | ||
bddb4c18 | 215 | adns_status adns__qdpl_normal(adns_state ads, |
216 | const char **p_io, const char *pe, int labelnum, | |
217 | char label_r[], int *ll_io, | |
218 | adns_queryflags flags, | |
219 | const typeinfo *typei); | |
220 | /* implemented in transmit.c, used by types.c as default | |
221 | * and as part of implementation for some fancier types */ | |
222 | ||
965c9782 | 223 | typedef struct allocnode { |
bc01473e | 224 | struct allocnode *next, *back; |
5f8085b7 | 225 | size_t sz; |
965c9782 | 226 | } allocnode; |
227 | ||
228 | union maxalign { | |
229 | byte d[1]; | |
230 | struct in_addr ia; | |
231 | long l; | |
232 | void *p; | |
233 | void (*fp)(void); | |
234 | union maxalign *up; | |
235 | } data; | |
236 | ||
cd1bde2f | 237 | typedef struct { |
238 | void *ext; | |
239 | void (*callback)(adns_query parent, adns_query child); | |
240 | union { | |
8a53cf7f | 241 | struct afinfo_addr ptr_parent_addr; |
cd1bde2f | 242 | adns_rr_hostaddr *hostaddr; |
243 | } info; | |
244 | } qcontext; | |
245 | ||
dfdbb32c | 246 | struct adns__query { |
11c8bf9b | 247 | adns_state ads; |
d0a057ac | 248 | enum { query_tosend, query_tcpw, query_childw, query_done } state; |
d05cc330 | 249 | adns_query back, next, parent; |
dfdbb32c | 250 | struct { adns_query head, tail; } children; |
251 | struct { adns_query back, next; } siblings; | |
bc01473e | 252 | struct { allocnode *head, *tail; } allocations; |
1be24aef | 253 | int interim_allocd, preserved_allocd; |
ae41e040 | 254 | void *final_allocspace; |
8f2aa812 | 255 | |
8312a1c2 | 256 | const typeinfo *typei; |
f2ad23ee | 257 | byte *query_dgram; |
965c9782 | 258 | int query_dglen; |
d0a057ac | 259 | |
965c9782 | 260 | vbuf vb; |
261 | /* General-purpose messing-about buffer. | |
262 | * Wherever a `big' interface is crossed, this may be corrupted/changed | |
263 | * unless otherwise specified. | |
264 | */ | |
265 | ||
266 | adns_answer *answer; | |
267 | /* This is allocated when a query is submitted, to avoid being unable | |
268 | * to relate errors to queries if we run out of memory. During | |
269 | * query processing status, rrs is 0. cname is set if | |
270 | * we found a cname (this corresponds to cname_dgram in the query | |
271 | * structure). type is set from the word go. nrrs and rrs | |
272 | * are set together, when we find how many rrs there are. | |
b2988d3e | 273 | * owner is set during querying unless we're doing searchlist, |
274 | * in which case it is set only when we find an answer. | |
965c9782 | 275 | */ |
d0a057ac | 276 | |
7f702335 | 277 | byte *cname_dgram; |
278 | int cname_dglen, cname_begin; | |
11c8bf9b | 279 | /* If non-0, has been allocated using . */ |
11f553d9 | 280 | |
281 | vbuf search_vb; | |
282 | int search_origlen, search_pos, search_doneabs; | |
283 | /* Used by the searching algorithm. The query domain in textual form | |
284 | * is copied into the vbuf, and _origlen set to its length. Then | |
285 | * we walk the searchlist, if we want to. _pos says where we are | |
286 | * (next entry to try), and _doneabs says whether we've done the | |
7e6a84a1 | 287 | * absolute query yet (0=not yet, 1=done, -1=must do straight away, |
288 | * but not done yet). If flags doesn't have adns_qf_search then | |
11f553d9 | 289 | * the vbuf is initialised but empty and everything else is zero. |
11f553d9 | 290 | */ |
d0a057ac | 291 | |
292 | int id, flags, retries; | |
d05cc330 | 293 | int udpnextserver; |
d0a057ac | 294 | unsigned long udpsent; /* bitmap indexed by server */ |
dfdbb32c | 295 | struct timeval timeout; |
2c7b101b | 296 | time_t expires; /* Earliest expiry time of any record we used. */ |
cd1bde2f | 297 | |
88518143 MW |
298 | union { |
299 | struct { | |
300 | size_t nrrty, onrrty; | |
301 | adns_rrtype rrty[ADDR_MAXRRTYPES]; | |
302 | } addr; | |
303 | } t; /* type-specific state */ | |
304 | ||
cd1bde2f | 305 | qcontext ctx; |
96e79df5 | 306 | |
dfdbb32c | 307 | /* Possible states: |
96e79df5 | 308 | * |
1389dc72 | 309 | * state Queue child id nextudpserver udpsent tcpfailed |
d0a057ac | 310 | * |
24d52b13 | 311 | * tosend NONE null >=0 0 zero zero |
d0a057ac | 312 | * tosend udpw null >=0 any nonzero zero |
24d52b13 | 313 | * tosend NONE null >=0 any nonzero zero |
d0a057ac | 314 | * |
315 | * tcpw tcpw null >=0 irrelevant any any | |
316 | * | |
965c9782 | 317 | * child childw set >=0 irrelevant irrelevant irrelevant |
d861b9b7 | 318 | * child NONE null >=0 irrelevant irrelevant irrelevant |
965c9782 | 319 | * done output null -1 irrelevant irrelevant irrelevant |
96e79df5 | 320 | * |
d861b9b7 | 321 | * Queries are only not on a queue when they are actually being processed. |
d0a057ac | 322 | * Queries in state tcpw/tcpw have been sent (or are in the to-send buffer) |
323 | * iff the tcp connection is in state server_ok. | |
d861b9b7 | 324 | * |
96e79df5 | 325 | * +------------------------+ |
d0a057ac | 326 | * START -----> | tosend/NONE | |
96e79df5 | 327 | * +------------------------+ |
328 | * / |\ \ | |
329 | * too big for UDP / UDP timeout \ \ send via UDP | |
d0a057ac | 330 | * send via TCP / more retries \ \ |
331 | * when conn'd / desired \ \ | |
332 | * | | | | |
333 | * v | v | |
334 | * +-----------+ +-------------+ | |
335 | * | tcpw/tcpw | ________ | tosend/udpw | | |
336 | * +-----------+ \ +-------------+ | |
337 | * | | | UDP timeout | | | |
338 | * | | | no more | | | |
339 | * | | | retries | | | |
340 | * \ | TCP died | desired | | | |
341 | * \ \ no more | | | | |
342 | * \ \ servers | TCP / | | |
343 | * \ \ to try | timeout / | | |
344 | * got \ \ v |_ | got | |
96e79df5 | 345 | * reply \ _| +------------------+ / reply |
346 | * \ | done/output FAIL | / | |
347 | * \ +------------------+ / | |
348 | * \ / | |
349 | * _| |_ | |
350 | * (..... got reply ....) | |
351 | * / \ | |
352 | * need child query/ies / \ no child query | |
353 | * / \ | |
354 | * |_ _| | |
d0a057ac | 355 | * +---------------+ +----------------+ |
356 | * | childw/childw | ----------------> | done/output OK | | |
357 | * +---------------+ children done +----------------+ | |
dfdbb32c | 358 | */ |
359 | }; | |
360 | ||
d0a057ac | 361 | struct query_queue { adns_query head, tail; }; |
362 | ||
705b9b15 MW |
363 | #define MAXUDP 2 |
364 | ||
dfdbb32c | 365 | struct adns__state { |
dfdbb32c | 366 | adns_initflags iflags; |
86ea5e62 | 367 | adns_logcallbackfn *logfn; |
368 | void *logfndata; | |
d6b271ae | 369 | int configerrno; |
d0a057ac | 370 | struct query_queue udpw, tcpw, childw, output; |
8f2aa812 | 371 | adns_query forallnext; |
705b9b15 MW |
372 | int nextid, tcpsocket; |
373 | struct udpsocket { const afinfo *ai; int fd; } udpsocket[MAXUDP]; | |
374 | int nudp; | |
965c9782 | 375 | vbuf tcpsend, tcprecv; |
ab898cf4 | 376 | int nservers, nsortlist, nsearchlist, searchndots, tcpserver, tcprecv_skip; |
d0a057ac | 377 | enum adns__tcpstate { |
378 | server_disconnected, server_connecting, | |
379 | server_ok, server_broken | |
380 | } tcpstate; | |
dfdbb32c | 381 | struct timeval tcptimeout; |
8744cce8 | 382 | /* This will have tv_sec==0 if it is not valid. It will always be |
383 | * valid if tcpstate _connecting. When _ok, it will be nonzero if | |
384 | * we are idle (ie, tcpw queue is empty), in which case it is the | |
385 | * absolute time when we will close the connection. | |
d0a057ac | 386 | */ |
87e46054 | 387 | struct sigaction stdsigpipe; |
388 | sigset_t stdsigmask; | |
74c94831 | 389 | struct pollfd pollfds_buf[MAX_POLLFDS]; |
705b9b15 | 390 | adns_rr_addr servers[MAXSERVERS]; |
8c3aa944 | 391 | struct sortlist { |
9136cf0c MW |
392 | const afinfo *ai; |
393 | union gen_addr base, mask; | |
8c3aa944 | 394 | } sortlist[MAXSORTLIST]; |
11f553d9 | 395 | char **searchlist; |
375c6c48 | 396 | unsigned short rand48xsubi[3]; |
dfdbb32c | 397 | }; |
398 | ||
9136cf0c MW |
399 | /* From addrfam.c: */ |
400 | ||
401 | extern const afinfo adns__inet_afinfo, adns__inet6_afinfo; | |
402 | ||
dfdbb32c | 403 | /* From setup.c: */ |
404 | ||
98db6da3 | 405 | int adns__setnonblock(adns_state ads, int fd); /* => errno value */ |
406 | ||
407 | /* From general.c: */ | |
408 | ||
705b9b15 | 409 | const char *adns__sockaddr_ntoa(struct sockaddr *sa, size_t n); |
86ea5e62 | 410 | void adns__vlprintf(adns_state ads, const char *fmt, va_list al); |
411 | void adns__lprintf(adns_state ads, const char *fmt, | |
412 | ...) PRINTFFORMAT(2,3); | |
413 | ||
d05cc330 | 414 | void adns__vdiag(adns_state ads, const char *pfx, adns_initflags prevent, |
ae41e040 | 415 | int serv, adns_query qu, const char *fmt, va_list al); |
7f702335 | 416 | |
417 | void adns__debug(adns_state ads, int serv, adns_query qu, | |
ae41e040 | 418 | const char *fmt, ...) PRINTFFORMAT(4,5); |
7f702335 | 419 | void adns__warn(adns_state ads, int serv, adns_query qu, |
ae41e040 | 420 | const char *fmt, ...) PRINTFFORMAT(4,5); |
7f702335 | 421 | void adns__diag(adns_state ads, int serv, adns_query qu, |
ae41e040 | 422 | const char *fmt, ...) PRINTFFORMAT(4,5); |
dfdbb32c | 423 | |
d05cc330 | 424 | int adns__vbuf_ensure(vbuf *vb, int want); |
9c344a42 | 425 | int adns__vbuf_appendstr(vbuf *vb, const char *data); /* doesn't include nul */ |
d05cc330 | 426 | int adns__vbuf_append(vbuf *vb, const byte *data, int len); |
96e79df5 | 427 | /* 1=>success, 0=>realloc failed */ |
d05cc330 | 428 | void adns__vbuf_appendq(vbuf *vb, const byte *data, int len); |
429 | void adns__vbuf_init(vbuf *vb); | |
965c9782 | 430 | void adns__vbuf_free(vbuf *vb); |
d05cc330 | 431 | |
cd363ffd | 432 | const char *adns__diag_domain(adns_state ads, int serv, adns_query qu, |
9c344a42 | 433 | vbuf *vb, |
434 | const byte *dgram, int dglen, int cbyte); | |
98db6da3 | 435 | /* Unpicks a domain in a datagram and returns a string suitable for |
436 | * printing it as. Never fails - if an error occurs, it will | |
437 | * return some kind of string describing the error. | |
438 | * | |
11c8bf9b | 439 | * serv may be -1 and qu may be 0. vb must have been initialised, |
98db6da3 | 440 | * and will be left in an arbitrary consistent state. |
441 | * | |
442 | * Returns either vb->buf, or a pointer to a string literal. Do not modify | |
443 | * vb before using the return value. | |
444 | */ | |
d0a057ac | 445 | |
f318f883 | 446 | void adns__isort(void *array, int nobjs, int sz, void *tempbuf, |
8c3aa944 | 447 | int (*needswap)(void *context, const void *a, const void *b), |
448 | void *context); | |
f318f883 | 449 | /* Does an insertion sort of array which must contain nobjs objects |
450 | * each sz bytes long. tempbuf must point to a buffer at least | |
451 | * sz bytes long. needswap should return !0 if a>b (strictly, ie | |
452 | * wrong order) 0 if a<=b (ie, order is fine). | |
453 | */ | |
87e46054 | 454 | |
455 | void adns__sigpipe_protect(adns_state); | |
456 | void adns__sigpipe_unprotect(adns_state); | |
457 | /* If SIGPIPE protection is not disabled, will block all signals except | |
458 | * SIGPIPE, and set SIGPIPE's disposition to SIG_IGN. (And then restore.) | |
459 | * Each call to _protect must be followed by a call to _unprotect before | |
a225dda5 | 460 | * any significant amount of code gets to run, since the old signal mask |
461 | * is stored in the adns structure. | |
87e46054 | 462 | */ |
463 | ||
98db6da3 | 464 | /* From transmit.c: */ |
96e79df5 | 465 | |
11c8bf9b | 466 | adns_status adns__mkquery(adns_state ads, vbuf *vb, int *id_r, |
467 | const char *owner, int ol, | |
7d0aaee4 | 468 | const typeinfo *typei, adns_rrtype type, |
469 | adns_queryflags flags); | |
7e6a84a1 | 470 | /* Assembles a query packet in vb. A new id is allocated and returned. |
471 | */ | |
98db6da3 | 472 | |
f2ad23ee | 473 | adns_status adns__mkquery_frdgram(adns_state ads, vbuf *vb, int *id_r, |
9c344a42 | 474 | const byte *qd_dgram, int qd_dglen, |
475 | int qd_begin, | |
f2ad23ee | 476 | adns_rrtype type, adns_queryflags flags); |
477 | /* Same as adns__mkquery, but takes the owner domain from an existing datagram. | |
478 | * That domain must be correct and untruncated. | |
479 | */ | |
480 | ||
d0a057ac | 481 | void adns__querysend_tcp(adns_query qu, struct timeval now); |
482 | /* Query must be in state tcpw/tcpw; it will be sent if possible and | |
483 | * no further processing can be done on it for now. The connection | |
484 | * might be broken, but no reconnect will be attempted. | |
98db6da3 | 485 | */ |
486 | ||
24d52b13 | 487 | void adns__query_send(adns_query qu, struct timeval now); |
488 | /* Query must be in state tosend/NONE; it will be moved to a new state, | |
98db6da3 | 489 | * and no further processing can be done on it for now. |
9c344a42 | 490 | * (Resulting state is one of udp/timew, tcpwait/timew (if server not |
491 | * connected), tcpsent/timew, child/childw or done/output.) | |
24d52b13 | 492 | * __query_send may decide to use either UDP or TCP depending whether |
493 | * _qf_usevc is set (or has become set) and whether the query is too | |
494 | * large. | |
98db6da3 | 495 | */ |
496 | ||
497 | /* From query.c: */ | |
dfdbb32c | 498 | |
7e6a84a1 | 499 | adns_status adns__internal_submit(adns_state ads, adns_query *query_r, |
5f8085b7 MW |
500 | const typeinfo *typei, adns_rrtype, |
501 | vbuf *qumsg_vb, int id, | |
7e6a84a1 | 502 | adns_queryflags flags, struct timeval now, |
503 | const qcontext *ctx); | |
965c9782 | 504 | /* Submits a query (for internal use, called during external submits). |
505 | * | |
506 | * The new query is returned in *query_r, or we return adns_s_nomemory. | |
507 | * | |
ae41e040 | 508 | * The query datagram should already have been assembled in qumsg_vb; |
509 | * the memory for it is _taken over_ by this routine whether it | |
510 | * succeeds or fails (if it succeeds, the vbuf is reused for qu->vb). | |
965c9782 | 511 | * |
bcfd6f13 MW |
512 | * If adns__qf_nosend is set in flags, then the query is not sent: doing |
513 | * whatever is necessary to send the query and link it onto the appropriate | |
514 | * queue is left as the caller's responsibility. | |
515 | * | |
ba1ddf08 | 516 | * *ctx is copied byte-for-byte into the query. |
d861b9b7 | 517 | * |
518 | * When the child query is done, ctx->callback will be called. The | |
519 | * child will already have been taken off both the global list of | |
520 | * queries in ads and the list of children in the parent. The child | |
521 | * will be freed when the callback returns. The parent will have been | |
cb32030b | 522 | * taken off the global childw queue. |
523 | * | |
524 | * The callback should either call adns__query_done, if it is | |
525 | * complete, or adns__query_fail, if an error has occurred, in which | |
526 | * case the other children (if any) will be cancelled. If the parent | |
527 | * has more unfinished children (or has just submitted more) then the | |
528 | * callback may choose to wait for them - it must then put the parent | |
529 | * back on the childw queue. | |
965c9782 | 530 | */ |
531 | ||
7e6a84a1 | 532 | void adns__search_next(adns_state ads, adns_query qu, struct timeval now); |
533 | /* Walks down the searchlist for a query with adns_qf_search. | |
534 | * The query should have just had a negative response, or not had | |
535 | * any queries sent yet, and should not be on any queue. | |
536 | * The query_dgram if any will be freed and forgotten and a new | |
537 | * one constructed from the search_* members of the query. | |
538 | * | |
539 | * Cannot fail (in case of error, calls adns__query_fail). | |
540 | */ | |
541 | ||
965c9782 | 542 | void *adns__alloc_interim(adns_query qu, size_t sz); |
1be24aef | 543 | void *adns__alloc_preserved(adns_query qu, size_t sz); |
965c9782 | 544 | /* Allocates some memory, and records which query it came from |
545 | * and how much there was. | |
546 | * | |
1be24aef | 547 | * If an error occurs in the query, all the memory from _interim is |
548 | * simply freed. If the query succeeds, one large buffer will be made | |
549 | * which is big enough for all these allocations, and then | |
550 | * adns__alloc_final will get memory from this buffer. | |
965c9782 | 551 | * |
f2ad23ee | 552 | * _alloc_interim can fail (and return 0). |
553 | * The caller must ensure that the query is failed. | |
f47cdeec | 554 | * |
1be24aef | 555 | * The memory from _preserved is is kept and transferred into the |
556 | * larger buffer - unless we run out of memory, in which case it too | |
557 | * is freed. When you use _preserved you have to add code to the | |
558 | * x_nomem error exit case in adns__makefinal_query to clear out the | |
559 | * pointers you made to those allocations, because that's when they're | |
560 | * thrown away; you should also make a note in the declaration of | |
561 | * those pointer variables, to note that they are _preserved rather | |
562 | * than _interim. If they're in the answer, note it here: | |
563 | * answer->cname and answer->owner are _preserved. | |
965c9782 | 564 | */ |
565 | ||
96818a13 | 566 | void adns__transfer_interim(adns_query from, adns_query to, void *block); |
bc01473e | 567 | /* Transfers an interim allocation from one query to another, so that |
568 | * the `to' query will have room for the data when we get to makefinal | |
569 | * and so that the free will happen when the `to' query is freed | |
570 | * rather than the `from' query. | |
571 | * | |
572 | * It is legal to call adns__transfer_interim with a null pointer; this | |
573 | * has no effect. | |
2c7b101b | 574 | * |
575 | * _transfer_interim also ensures that the expiry time of the `to' query | |
576 | * is no later than that of the `from' query, so that child queries' | |
577 | * TTLs get inherited by their parents. | |
bc01473e | 578 | */ |
579 | ||
5f8085b7 MW |
580 | void adns__free_interim(adns_query qu, void *p); |
581 | /* Forget about a block allocated by adns__alloc_interim. | |
582 | */ | |
583 | ||
11c8bf9b | 584 | void *adns__alloc_mine(adns_query qu, size_t sz); |
585 | /* Like _interim, but does not record the length for later | |
586 | * copying into the answer. This just ensures that the memory | |
587 | * will be freed when we're done with the query. | |
588 | */ | |
589 | ||
965c9782 | 590 | void *adns__alloc_final(adns_query qu, size_t sz); |
f47cdeec | 591 | /* Cannot fail, and cannot return 0. |
965c9782 | 592 | */ |
dfdbb32c | 593 | |
ae41e040 | 594 | void adns__makefinal_block(adns_query qu, void **blpp, size_t sz); |
595 | void adns__makefinal_str(adns_query qu, char **strp); | |
596 | ||
1be24aef | 597 | void adns__reset_preserved(adns_query qu); |
598 | /* Resets all of the memory management stuff etc. to take account of | |
599 | * only the _preserved stuff from _alloc_preserved. Used when we find | |
600 | * an error somewhere and want to just report the error (with perhaps | |
601 | * CNAME, owner, etc. info), and also when we're halfway through RRs | |
602 | * in a datagram and discover that we need to retry the query. | |
ae41e040 | 603 | */ |
98db6da3 | 604 | |
11c8bf9b | 605 | void adns__query_done(adns_query qu); |
606 | void adns__query_fail(adns_query qu, adns_status stat); | |
5f8085b7 | 607 | void adns__cancel_children(adns_query qu); |
d0a057ac | 608 | |
d05cc330 | 609 | /* From reply.c: */ |
610 | ||
5c596e4d | 611 | void adns__procdgram(adns_state ads, const byte *dgram, int len, |
c84b7355 | 612 | int serv, int viatcp, struct timeval now); |
a225dda5 | 613 | /* This function is allowed to cause new datagrams to be constructed |
614 | * and sent, or even new queries to be started. However, | |
615 | * query-sending functions are not allowed to call any general event | |
616 | * loop functions in case they accidentally call this. | |
d0a057ac | 617 | * |
618 | * Ie, receiving functions may call sending functions. | |
619 | * Sending functions may NOT call receiving functions. | |
a225dda5 | 620 | */ |
5c596e4d | 621 | |
622 | /* From types.c: */ | |
623 | ||
624 | const typeinfo *adns__findtype(adns_rrtype type); | |
625 | ||
626 | /* From parse.c: */ | |
627 | ||
403fa0e0 | 628 | typedef struct { |
ae41e040 | 629 | adns_state ads; |
11c8bf9b | 630 | adns_query qu; |
ae41e040 | 631 | int serv; |
403fa0e0 | 632 | const byte *dgram; |
633 | int dglen, max, cbyte, namelen; | |
11c8bf9b | 634 | int *dmend_r; |
403fa0e0 | 635 | } findlabel_state; |
636 | ||
11c8bf9b | 637 | void adns__findlabel_start(findlabel_state *fls, adns_state ads, |
638 | int serv, adns_query qu, | |
403fa0e0 | 639 | const byte *dgram, int dglen, int max, |
640 | int dmbegin, int *dmend_rlater); | |
641 | /* Finds labels in a domain in a datagram. | |
642 | * | |
643 | * Call this routine first. | |
11c8bf9b | 644 | * dmend_rlater may be null. ads (and of course fls) may not be. |
645 | * serv may be -1, qu may be null - they are for error reporting. | |
403fa0e0 | 646 | */ |
647 | ||
9c344a42 | 648 | adns_status adns__findlabel_next(findlabel_state *fls, |
649 | int *lablen_r, int *labstart_r); | |
403fa0e0 | 650 | /* Then, call this one repeatedly. |
651 | * | |
652 | * It will return adns_s_ok if all is well, and tell you the length | |
653 | * and start of successive labels. labstart_r may be null, but | |
654 | * lablen_r must not be. | |
655 | * | |
656 | * After the last label, it will return with *lablen_r zero. | |
657 | * Do not then call it again; instead, just throw away the findlabel_state. | |
658 | * | |
659 | * *dmend_rlater will have been set to point to the next part of | |
660 | * the datagram after the label (or after the uncompressed part, | |
661 | * if compression was used). *namelen_rlater will have been set | |
662 | * to the length of the domain name (total length of labels plus | |
663 | * 1 for each intervening dot). | |
664 | * | |
665 | * If the datagram appears to be truncated, *lablen_r will be -1. | |
666 | * *dmend_rlater, *labstart_r and *namelen_r may contain garbage. | |
667 | * Do not call _next again. | |
668 | * | |
669 | * There may also be errors, in which case *dmend_rlater, | |
670 | * *namelen_rlater, *lablen_r and *labstart_r may contain garbage. | |
671 | * Do not then call findlabel_next again. | |
672 | */ | |
673 | ||
cd363ffd | 674 | typedef enum { |
675 | pdf_quoteok= 0x001 | |
676 | } parsedomain_flags; | |
677 | ||
11c8bf9b | 678 | adns_status adns__parse_domain(adns_state ads, int serv, adns_query qu, |
cd363ffd | 679 | vbuf *vb, parsedomain_flags flags, |
9c344a42 | 680 | const byte *dgram, int dglen, int *cbyte_io, |
681 | int max); | |
403fa0e0 | 682 | /* vb must already have been initialised; it will be reset if necessary. |
683 | * If there is truncation, vb->used will be set to 0; otherwise | |
684 | * (if there is no error) vb will be null-terminated. | |
685 | * If there is an error vb and *cbyte_io may be left indeterminate. | |
11c8bf9b | 686 | * |
687 | * serv may be -1 and qu may be 0 - they are used for error reporting only. | |
403fa0e0 | 688 | */ |
689 | ||
6f2c243f | 690 | adns_status adns__parse_domain_more(findlabel_state *fls, adns_state ads, |
9c344a42 | 691 | adns_query qu, vbuf *vb, |
692 | parsedomain_flags flags, | |
6f2c243f | 693 | const byte *dgram); |
694 | /* Like adns__parse_domain, but you pass it a pre-initialised findlabel_state, | |
695 | * for continuing an existing domain or some such of some kind. Also, unlike | |
696 | * _parse_domain, the domain data will be appended to vb, rather than replacing | |
697 | * the existing contents. | |
698 | */ | |
699 | ||
11c8bf9b | 700 | adns_status adns__findrr(adns_query qu, int serv, |
403fa0e0 | 701 | const byte *dgram, int dglen, int *cbyte_io, |
2c7b101b | 702 | int *type_r, int *class_r, unsigned long *ttl_r, |
703 | int *rdlen_r, int *rdstart_r, | |
11c8bf9b | 704 | int *ownermatchedquery_r); |
a1d2d0ed | 705 | /* Finds the extent and some of the contents of an RR in a datagram |
706 | * and does some checks. The datagram is *dgram, length dglen, and | |
707 | * the RR starts at *cbyte_io (which is updated afterwards to point | |
708 | * to the end of the RR). | |
709 | * | |
2c7b101b | 710 | * The type, class, TTL and RRdata length and start are returned iff |
711 | * the corresponding pointer variables are not null. type_r, class_r | |
712 | * and ttl_r may not be null. The TTL will be capped. | |
a1d2d0ed | 713 | * |
714 | * If ownermatchedquery_r != 0 then the owner domain of this | |
715 | * RR will be compared with that in the query (or, if the query | |
716 | * has gone to a CNAME lookup, with the canonical name). | |
717 | * In this case, *ownermatchedquery_r will be set to 0 or 1. | |
718 | * The query datagram (or CNAME datagram) MUST be valid and not truncated. | |
719 | * | |
720 | * If there is truncation then *type_r will be set to -1 and | |
721 | * *cbyte_io, *class_r, *rdlen_r, *rdstart_r and *eo_matched_r will be | |
722 | * undefined. | |
723 | * | |
724 | * qu must obviously be non-null. | |
725 | * | |
726 | * If an error is returned then *type_r will be undefined too. | |
727 | */ | |
728 | ||
26eb6bdc | 729 | adns_status adns__findrr_anychk(adns_query qu, int serv, |
730 | const byte *dgram, int dglen, int *cbyte_io, | |
9c344a42 | 731 | int *type_r, int *class_r, |
732 | unsigned long *ttl_r, | |
2c7b101b | 733 | int *rdlen_r, int *rdstart_r, |
9c344a42 | 734 | const byte *eo_dgram, int eo_dglen, |
735 | int eo_cbyte, int *eo_matched_r); | |
a1d2d0ed | 736 | /* Like adns__findrr_checked, except that the datagram and |
737 | * owner to compare with can be specified explicitly. | |
738 | * | |
739 | * If the caller thinks they know what the owner of the RR ought to | |
740 | * be they can pass in details in eo_*: this is another (or perhaps | |
741 | * the same datagram), and a pointer to where the putative owner | |
742 | * starts in that datagram. In this case *eo_matched_r will be set | |
743 | * to 1 if the datagram matched or 0 if it did not. Either | |
744 | * both eo_dgram and eo_matched_r must both be non-null, or they | |
745 | * must both be null (in which case eo_dglen and eo_cbyte will be ignored). | |
746 | * The eo datagram and contained owner domain MUST be valid and | |
747 | * untruncated. | |
748 | */ | |
5c596e4d | 749 | |
9c344a42 | 750 | void adns__update_expires(adns_query qu, unsigned long ttl, |
751 | struct timeval now); | |
2c7b101b | 752 | /* Updates the `expires' field in the query, so that it doesn't exceed |
753 | * now + ttl. | |
754 | */ | |
755 | ||
403fa0e0 | 756 | int vbuf__append_quoted1035(vbuf *vb, const byte *buf, int len); |
71324651 | 757 | |
758 | /* From event.c: */ | |
d05cc330 | 759 | |
71324651 | 760 | void adns__tcp_broken(adns_state ads, const char *what, const char *why); |
d0a057ac | 761 | /* what and why may be both 0, or both non-0. */ |
762 | ||
d05cc330 | 763 | void adns__tcp_tryconnect(adns_state ads, struct timeval now); |
98db6da3 | 764 | |
d05cc330 | 765 | void adns__autosys(adns_state ads, struct timeval now); |
ab898cf4 | 766 | /* Make all the system calls we want to if the application wants us to. |
767 | * Must not be called from within adns internal processing functions, | |
768 | * lest we end up in recursive descent ! | |
769 | */ | |
dfdbb32c | 770 | |
74c94831 | 771 | void adns__must_gettimeofday(adns_state ads, const struct timeval **now_io, |
772 | struct timeval *tv_buf); | |
d0a057ac | 773 | |
74c94831 | 774 | int adns__pollfds(adns_state ads, struct pollfd pollfds_buf[MAX_POLLFDS]); |
775 | void adns__fdevents(adns_state ads, | |
776 | const struct pollfd *pollfds, int npollfds, | |
777 | int maxfd, const fd_set *readfds, | |
778 | const fd_set *writefds, const fd_set *exceptfds, | |
779 | struct timeval now, int *r_r); | |
ef20fccf | 780 | int adns__internal_check(adns_state ads, |
781 | adns_query *query_io, | |
782 | adns_answer **answer, | |
783 | void **context_r); | |
74c94831 | 784 | |
d0a057ac | 785 | void adns__timeouts(adns_state ads, int act, |
786 | struct timeval **tv_io, struct timeval *tvbuf, | |
787 | struct timeval now); | |
788 | /* If act is !0, then this will also deal with the TCP connection | |
789 | * if previous events broke it or require it to be connected. | |
790 | */ | |
791 | ||
1389dc72 | 792 | /* From check.c: */ |
793 | ||
2ac463bf | 794 | void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc); |
1389dc72 | 795 | |
dfdbb32c | 796 | /* Useful static inline functions: */ |
797 | ||
9c344a42 | 798 | static inline int ctype_whitespace(int c) { |
799 | return c==' ' || c=='\n' || c=='\t'; | |
800 | } | |
dfdbb32c | 801 | static inline int ctype_digit(int c) { return c>='0' && c<='9'; } |
5c596e4d | 802 | static inline int ctype_alpha(int c) { |
c2875680 | 803 | return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'); |
5c596e4d | 804 | } |
9c344a42 | 805 | static inline int ctype_822special(int c) { |
806 | return strchr("()<>@,;:\\\".[]",c) != 0; | |
807 | } | |
996e3b68 | 808 | static inline int ctype_domainunquoted(int c) { |
809 | return ctype_alpha(c) || ctype_digit(c) || (strchr("-_/+",c) != 0); | |
810 | } | |
dfdbb32c | 811 | |
74c94831 | 812 | static inline int errno_resources(int e) { return e==ENOMEM || e==ENOBUFS; } |
813 | ||
dfdbb32c | 814 | /* Useful macros */ |
815 | ||
9c344a42 | 816 | #define MEM_ROUND(sz) \ |
817 | (( ((sz)+sizeof(union maxalign)-1) / sizeof(union maxalign) ) \ | |
965c9782 | 818 | * sizeof(union maxalign) ) |
819 | ||
1e9efa71 | 820 | #define GETIL_B(cb) (((dgram)[(cb)++]) & 0x0ff) |
5c596e4d | 821 | #define GET_B(cb,tv) ((tv)= GETIL_B((cb))) |
9c344a42 | 822 | #define GET_W(cb,tv) ((tv)=0,(tv)|=(GETIL_B((cb))<<8), (tv)|=GETIL_B(cb), (tv)) |
823 | #define GET_L(cb,tv) ( (tv)=0, \ | |
824 | (tv)|=(GETIL_B((cb))<<24), \ | |
825 | (tv)|=(GETIL_B((cb))<<16), \ | |
826 | (tv)|=(GETIL_B((cb))<<8), \ | |
827 | (tv)|=GETIL_B(cb), \ | |
2c7b101b | 828 | (tv) ) |
5c596e4d | 829 | |
dfdbb32c | 830 | #endif |