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