Commit | Line | Data |
---|---|---|
6f0c9a4f | 1 | /* $Cambridge: exim/src/src/host.c,v 1.3 2004/11/18 11:17:33 ph10 Exp $ */ |
059ec3d9 PH |
2 | |
3 | /************************************************* | |
4 | * Exim - an Internet mail transport agent * | |
5 | *************************************************/ | |
6 | ||
7 | /* Copyright (c) University of Cambridge 1995 - 2004 */ | |
8 | /* See the file NOTICE for conditions of use and distribution. */ | |
9 | ||
10 | /* Functions for finding hosts, either by gethostbyname(), gethostbyaddr(), or | |
11 | directly via the DNS. When IPv6 is supported, getipnodebyname() and | |
12 | getipnodebyaddr() may be used instead of gethostbyname() and gethostbyaddr(), | |
13 | if the newer functions are available. This module also contains various other | |
14 | functions concerned with hosts and addresses, and a random number function, | |
15 | used for randomizing hosts with equal MXs but available for use in other parts | |
16 | of Exim. */ | |
17 | ||
18 | ||
19 | #include "exim.h" | |
20 | ||
21 | ||
22 | /* Static variable for preserving the list of interface addresses in case it is | |
23 | used more than once. */ | |
24 | ||
25 | static ip_address_item *local_interface_data = NULL; | |
26 | ||
27 | ||
28 | #ifdef USE_INET_NTOA_FIX | |
29 | /************************************************* | |
30 | * Replacement for broken inet_ntoa() * | |
31 | *************************************************/ | |
32 | ||
33 | /* On IRIX systems, gcc uses a different structure passing convention to the | |
34 | native libraries. This causes inet_ntoa() to always yield 0.0.0.0 or | |
35 | 255.255.255.255. To get round this, we provide a private version of the | |
36 | function here. It is used only if USE_INET_NTOA_FIX is set, which should happen | |
37 | only when gcc is in use on an IRIX system. Code send to me by J.T. Breitner, | |
38 | with these comments: | |
39 | ||
40 | code by Stuart Levy | |
41 | as seen in comp.sys.sgi.admin | |
42 | ||
43 | Arguments: sa an in_addr structure | |
44 | Returns: pointer to static text string | |
45 | */ | |
46 | ||
47 | char * | |
48 | inet_ntoa(struct in_addr sa) | |
49 | { | |
50 | static uschar addr[20]; | |
51 | sprintf(addr, "%d.%d.%d.%d", | |
52 | (US &sa.s_addr)[0], | |
53 | (US &sa.s_addr)[1], | |
54 | (US &sa.s_addr)[2], | |
55 | (US &sa.s_addr)[3]); | |
56 | return addr; | |
57 | } | |
58 | #endif | |
59 | ||
60 | ||
61 | ||
62 | /************************************************* | |
63 | * Random number generator * | |
64 | *************************************************/ | |
65 | ||
66 | /* This is a simple pseudo-random number generator. It does not have to be | |
67 | very good for the uses to which it is put. When running the regression tests, | |
68 | start with a fixed seed. | |
69 | ||
70 | Arguments: | |
71 | limit: one more than the largest number required | |
72 | ||
73 | Returns: a pseudo-random number in the range 0 to limit-1 | |
74 | */ | |
75 | ||
76 | int | |
77 | random_number(int limit) | |
78 | { | |
79 | if (random_seed == 0) | |
80 | { | |
81 | if (running_in_test_harness) random_seed = 42; else | |
82 | { | |
83 | int p = (int)getpid(); | |
84 | random_seed = (int)time(NULL) ^ ((p << 16) | p); | |
85 | } | |
86 | } | |
87 | random_seed = 1103515245 * random_seed + 12345; | |
88 | return (unsigned int)(random_seed >> 16) % limit; | |
89 | } | |
90 | ||
91 | ||
92 | ||
d8ef3577 PH |
93 | /************************************************* |
94 | * Sort addresses when testing * | |
95 | *************************************************/ | |
96 | ||
97 | /* This function is called only when running in the test harness. It sorts a | |
98 | number of multihomed host IP addresses into the order, so as to get | |
99 | repeatability. This doesn't have to be efficient. But don't interchange IPv4 | |
100 | and IPv6 addresses! | |
101 | ||
102 | Arguments: | |
103 | host -> the first host item | |
104 | last -> the last host item | |
105 | ||
106 | Returns: nothing | |
107 | */ | |
108 | ||
109 | static void | |
110 | sort_addresses(host_item *host, host_item *last) | |
111 | { | |
112 | BOOL done = FALSE; | |
113 | while (!done) | |
114 | { | |
115 | host_item *h; | |
116 | done = TRUE; | |
117 | for (h = host; h != last; h = h->next) | |
118 | { | |
119 | if ((Ustrchr(h->address, ':') == NULL) != | |
120 | (Ustrchr(h->next->address, ':') == NULL)) | |
121 | continue; | |
122 | if (Ustrcmp(h->address, h->next->address) > 0) | |
123 | { | |
124 | uschar *temp = h->address; | |
125 | h->address = h->next->address; | |
126 | h->next->address = temp; | |
127 | done = FALSE; | |
128 | } | |
129 | } | |
130 | } | |
131 | } | |
132 | ||
133 | ||
134 | ||
059ec3d9 PH |
135 | /************************************************* |
136 | * Build chain of host items from list * | |
137 | *************************************************/ | |
138 | ||
139 | /* This function builds a chain of host items from a textual list of host | |
140 | names. It does not do any lookups. If randomize is true, the chain is build in | |
141 | a randomized order. There may be multiple groups of independently randomized | |
142 | hosts; they are delimited by a host name consisting of just "+". | |
143 | ||
144 | Arguments: | |
145 | anchor anchor for the chain | |
146 | list text list | |
147 | randomize TRUE for randomizing | |
148 | ||
149 | Returns: nothing | |
150 | */ | |
151 | ||
152 | void | |
153 | host_build_hostlist(host_item **anchor, uschar *list, BOOL randomize) | |
154 | { | |
155 | int sep = 0; | |
156 | int fake_mx = MX_NONE; /* This value is actually -1 */ | |
157 | uschar *name; | |
158 | uschar buffer[1024]; | |
159 | ||
160 | if (list == NULL) return; | |
161 | if (randomize) fake_mx--; /* Start at -2 for randomizing */ | |
162 | ||
163 | *anchor = NULL; | |
164 | ||
165 | while ((name = string_nextinlist(&list, &sep, buffer, sizeof(buffer))) != NULL) | |
166 | { | |
167 | host_item *h; | |
168 | ||
169 | if (name[0] == '+' && name[1] == 0) /* "+" delimits a randomized group */ | |
170 | { /* ignore if not randomizing */ | |
171 | if (randomize) fake_mx--; | |
172 | continue; | |
173 | } | |
174 | ||
175 | h = store_get(sizeof(host_item)); | |
176 | h->name = string_copy(name); | |
177 | h->address = NULL; | |
178 | h->port = PORT_NONE; | |
179 | h->mx = fake_mx; | |
180 | h->sort_key = randomize? (-fake_mx)*1000 + random_number(1000) : 0; | |
181 | h->status = hstatus_unknown; | |
182 | h->why = hwhy_unknown; | |
183 | h->last_try = 0; | |
184 | ||
185 | if (*anchor == NULL) | |
186 | { | |
187 | h->next = NULL; | |
188 | *anchor = h; | |
189 | } | |
190 | else | |
191 | { | |
192 | host_item *hh = *anchor; | |
193 | if (h->sort_key < hh->sort_key) | |
194 | { | |
195 | h->next = hh; | |
196 | *anchor = h; | |
197 | } | |
198 | else | |
199 | { | |
200 | while (hh->next != NULL && h->sort_key >= (hh->next)->sort_key) | |
201 | hh = hh->next; | |
202 | h->next = hh->next; | |
203 | hh->next = h; | |
204 | } | |
205 | } | |
206 | } | |
207 | } | |
208 | ||
209 | ||
210 | ||
211 | ||
212 | ||
213 | /************************************************* | |
214 | * Extract port from address string * | |
215 | *************************************************/ | |
216 | ||
217 | /* In the spool file, and in the -oMa and -oMi options, a host plus port is | |
218 | given as an IP address followed by a dot and a port number. This function | |
219 | decodes this. | |
220 | ||
221 | An alternative format for the -oMa and -oMi options is [ip address]:port which | |
222 | is what Exim 4 uses for output, because it seems to becoming commonly used, | |
223 | whereas the dot form confuses some programs/people. So we recognize that form | |
224 | too. | |
225 | ||
226 | Argument: | |
227 | address points to the string; if there is a port, the '.' in the string | |
228 | is overwritten with zero to terminate the address; if the string | |
229 | is in the [xxx]:ppp format, the address is shifted left and the | |
230 | brackets are removed | |
231 | ||
232 | Returns: 0 if there is no port, else the port number. If there's a syntax | |
233 | error, leave the incoming address alone, and return 0. | |
234 | */ | |
235 | ||
236 | int | |
237 | host_extract_port(uschar *address) | |
238 | { | |
239 | int port = 0; | |
240 | uschar *endptr; | |
241 | ||
242 | /* Handle the "bracketed with colon on the end" format */ | |
243 | ||
244 | if (*address == '[') | |
245 | { | |
246 | uschar *rb = address + 1; | |
247 | while (*rb != 0 && *rb != ']') rb++; | |
248 | if (*rb++ == 0) return 0; /* Missing ]; leave invalid address */ | |
249 | if (*rb == ':') | |
250 | { | |
251 | port = Ustrtol(rb + 1, &endptr, 10); | |
252 | if (*endptr != 0) return 0; /* Invalid port; leave invalid address */ | |
253 | } | |
254 | else if (*rb != 0) return 0; /* Bad syntax; leave invalid address */ | |
255 | memmove(address, address + 1, rb - address - 2); | |
256 | rb[-2] = 0; | |
257 | } | |
258 | ||
259 | /* Handle the "dot on the end" format */ | |
260 | ||
261 | else | |
262 | { | |
263 | int skip = -3; /* Skip 3 dots in IPv4 addresses */ | |
264 | address--; | |
265 | while (*(++address) != 0) | |
266 | { | |
267 | int ch = *address; | |
268 | if (ch == ':') skip = 0; /* Skip 0 dots in IPv6 addresses */ | |
269 | else if (ch == '.' && skip++ >= 0) break; | |
270 | } | |
271 | if (*address == 0) return 0; | |
272 | port = Ustrtol(address + 1, &endptr, 10); | |
273 | if (*endptr != 0) return 0; /* Invalid port; leave invalid address */ | |
274 | *address = 0; | |
275 | } | |
276 | ||
277 | return port; | |
278 | } | |
279 | ||
280 | ||
281 | ||
282 | #ifndef STAND_ALONE /* Omit when standalone testing */ | |
283 | ||
284 | /************************************************* | |
285 | * Build sender_fullhost and sender_rcvhost * | |
286 | *************************************************/ | |
287 | ||
288 | /* This function is called when sender_host_name and/or sender_helo_name | |
289 | have been set. Or might have been set - for a local message read off the spool | |
290 | they won't be. In that case, do nothing. Otherwise, set up the fullhost string | |
291 | as follows: | |
292 | ||
293 | (a) No sender_host_name or sender_helo_name: "[ip address]" | |
294 | (b) Just sender_host_name: "host_name [ip address]" | |
295 | (c) Just sender_helo_name: "(helo_name) [ip address]" | |
296 | (d) The two are identical: "host_name [ip address]" | |
297 | (e) The two are different: "host_name (helo_name) [ip address]" | |
298 | ||
299 | If log_incoming_port is set, the sending host's port number is added to the IP | |
300 | address. | |
301 | ||
302 | This function also builds sender_rcvhost for use in Received: lines, whose | |
303 | syntax is a bit different. This value also includes the RFC 1413 identity. | |
304 | There wouldn't be two different variables if I had got all this right in the | |
305 | first place. | |
306 | ||
307 | Because this data may survive over more than one incoming SMTP message, it has | |
308 | to be in permanent store. | |
309 | ||
310 | Arguments: none | |
311 | Returns: nothing | |
312 | */ | |
313 | ||
314 | void | |
315 | host_build_sender_fullhost(void) | |
316 | { | |
317 | uschar *address; | |
318 | int old_pool = store_pool; | |
319 | ||
320 | if (sender_host_address == NULL) return; | |
321 | ||
322 | store_pool = POOL_PERM; | |
323 | ||
324 | /* Set up address, with or without the port. After discussion, it seems that | |
325 | the only format that doesn't cause trouble is [aaaa]:pppp. However, we can't | |
326 | use this directly as the first item for Received: because it ain't an RFC 2822 | |
327 | domain. Sigh. */ | |
328 | ||
329 | address = string_sprintf("[%s]:%d", sender_host_address, sender_host_port); | |
330 | if ((log_extra_selector & LX_incoming_port) == 0 || sender_host_port <= 0) | |
331 | *(Ustrrchr(address, ':')) = 0; | |
332 | ||
333 | /* Host name is not verified */ | |
334 | ||
335 | if (sender_host_name == NULL) | |
336 | { | |
337 | uschar *portptr = Ustrstr(address, "]:"); | |
338 | int size = 0; | |
339 | int ptr = 0; | |
340 | int adlen; /* Sun compiler doesn't like ++ in initializers */ | |
341 | ||
342 | adlen = (portptr == NULL)? Ustrlen(address) : (++portptr - address); | |
343 | sender_fullhost = (sender_helo_name == NULL)? address : | |
344 | string_sprintf("(%s) %s", sender_helo_name, address); | |
345 | ||
346 | sender_rcvhost = string_cat(NULL, &size, &ptr, address, adlen); | |
347 | ||
348 | if (sender_ident != NULL || sender_helo_name != NULL || portptr != NULL) | |
349 | { | |
350 | int firstptr; | |
351 | sender_rcvhost = string_cat(sender_rcvhost, &size, &ptr, US" (", 2); | |
352 | firstptr = ptr; | |
353 | ||
354 | if (portptr != NULL) | |
355 | sender_rcvhost = string_append(sender_rcvhost, &size, &ptr, 2, US"port=", | |
356 | portptr + 1); | |
357 | ||
358 | if (sender_helo_name != NULL) | |
359 | sender_rcvhost = string_append(sender_rcvhost, &size, &ptr, 2, | |
360 | (firstptr == ptr)? US"helo=" : US" helo=", sender_helo_name); | |
361 | ||
362 | if (sender_ident != NULL) | |
363 | sender_rcvhost = string_append(sender_rcvhost, &size, &ptr, 2, | |
364 | (firstptr == ptr)? US"ident=" : US" ident=", sender_ident); | |
365 | ||
366 | sender_rcvhost = string_cat(sender_rcvhost, &size, &ptr, US")", 1); | |
367 | } | |
368 | ||
369 | sender_rcvhost[ptr] = 0; /* string_cat() always leaves room */ | |
370 | ||
371 | /* Release store, because string_cat allocated a minimum of 100 bytes that | |
372 | are rarely completely used. */ | |
373 | ||
374 | store_reset(sender_rcvhost + ptr + 1); | |
375 | } | |
376 | ||
377 | /* Host name is known and verified. */ | |
378 | ||
379 | else | |
380 | { | |
381 | int len; | |
382 | if (sender_helo_name == NULL || | |
383 | strcmpic(sender_host_name, sender_helo_name) == 0 || | |
384 | (sender_helo_name[0] == '[' && | |
385 | sender_helo_name[(len=Ustrlen(sender_helo_name))-1] == ']' && | |
386 | strncmpic(sender_helo_name+1, sender_host_address, len - 2) == 0)) | |
387 | { | |
388 | sender_fullhost = string_sprintf("%s %s", sender_host_name, address); | |
389 | sender_rcvhost = (sender_ident == NULL)? | |
390 | string_sprintf("%s (%s)", sender_host_name, address) : | |
391 | string_sprintf("%s (%s ident=%s)", sender_host_name, address, | |
392 | sender_ident); | |
393 | } | |
394 | else | |
395 | { | |
396 | sender_fullhost = string_sprintf("%s (%s) %s", sender_host_name, | |
397 | sender_helo_name, address); | |
398 | sender_rcvhost = (sender_ident == NULL)? | |
399 | string_sprintf("%s (%s helo=%s)", sender_host_name, | |
400 | address, sender_helo_name) : | |
401 | string_sprintf("%s\n\t(%s helo=%s ident=%s)", sender_host_name, | |
402 | address, sender_helo_name, sender_ident); | |
403 | } | |
404 | } | |
405 | ||
406 | store_pool = old_pool; | |
407 | ||
408 | DEBUG(D_host_lookup) debug_printf("sender_fullhost = %s\n", sender_fullhost); | |
409 | DEBUG(D_host_lookup) debug_printf("sender_rcvhost = %s\n", sender_rcvhost); | |
410 | } | |
411 | ||
412 | ||
413 | ||
414 | /************************************************* | |
415 | * Build host+ident message * | |
416 | *************************************************/ | |
417 | ||
418 | /* Used when logging rejections and various ACL and SMTP incidents. The text | |
419 | return depends on whether sender_fullhost and sender_ident are set or not: | |
420 | ||
421 | no ident, no host => U=unknown | |
422 | no ident, host set => H=sender_fullhost | |
423 | ident set, no host => U=ident | |
424 | ident set, host set => H=sender_fullhost U=ident | |
425 | ||
426 | Arguments: | |
427 | useflag TRUE if first item to be flagged (H= or U=); if there are two | |
428 | items, the second is always flagged | |
429 | ||
430 | Returns: pointer to a string in big_buffer | |
431 | */ | |
432 | ||
433 | uschar * | |
434 | host_and_ident(BOOL useflag) | |
435 | { | |
436 | if (sender_fullhost == NULL) | |
437 | { | |
438 | (void)string_format(big_buffer, big_buffer_size, "%s%s", useflag? "U=" : "", | |
439 | (sender_ident == NULL)? US"unknown" : sender_ident); | |
440 | } | |
441 | else | |
442 | { | |
443 | uschar *flag = useflag? US"H=" : US""; | |
444 | uschar *iface = US""; | |
445 | if ((log_extra_selector & LX_incoming_interface) != 0 && | |
446 | interface_address != NULL) | |
447 | iface = string_sprintf(" I=[%s]:%d", interface_address, interface_port); | |
448 | if (sender_ident == NULL) | |
449 | (void)string_format(big_buffer, big_buffer_size, "%s%s%s", | |
450 | flag, sender_fullhost, iface); | |
451 | else | |
452 | (void)string_format(big_buffer, big_buffer_size, "%s%s%s U=%s", | |
453 | flag, sender_fullhost, iface, sender_ident); | |
454 | } | |
455 | return big_buffer; | |
456 | } | |
457 | ||
458 | #endif /* STAND_ALONE */ | |
459 | ||
460 | ||
461 | ||
462 | ||
463 | /************************************************* | |
464 | * Build list of local interfaces * | |
465 | *************************************************/ | |
466 | ||
467 | /* This function interprets the contents of the local_interfaces or | |
468 | extra_local_interfaces options, and creates an ip_address_item block for each | |
469 | item on the list. There is no special interpretation of any IP addresses; in | |
470 | particular, 0.0.0.0 and ::0 are returned without modification. If any address | |
471 | includes a port, it is set in the block. Otherwise the port value is set to | |
472 | zero. | |
473 | ||
474 | Arguments: | |
475 | list the list | |
476 | name the name of the option being expanded | |
477 | ||
478 | Returns: a chain of ip_address_items, each containing to a textual | |
479 | version of an IP address, and a port number (host order) or | |
480 | zero if no port was given with the address | |
481 | */ | |
482 | ||
483 | ip_address_item * | |
484 | host_build_ifacelist(uschar *list, uschar *name) | |
485 | { | |
486 | int sep = 0; | |
487 | uschar *s; | |
488 | uschar buffer[64]; | |
489 | ip_address_item *yield = NULL; | |
490 | ip_address_item *last = NULL; | |
491 | ip_address_item *next; | |
492 | ||
493 | while ((s = string_nextinlist(&list, &sep, buffer, sizeof(buffer))) != NULL) | |
494 | { | |
495 | int port = host_extract_port(s); /* Leaves just the IP address */ | |
496 | if (!string_is_ip_address(s, NULL)) | |
497 | log_write(0, LOG_MAIN|LOG_PANIC_DIE, "Malformed IP address \"%s\" in %s", | |
498 | s, name); | |
499 | ||
500 | /* This use of strcpy() is OK because we have checked that s is a valid IP | |
501 | address above. The field in the ip_address_item is large enough to hold an | |
502 | IPv6 address. */ | |
503 | ||
504 | next = store_get(sizeof(ip_address_item)); | |
505 | next->next = NULL; | |
506 | Ustrcpy(next->address, s); | |
507 | next->port = port; | |
508 | next->v6_include_v4 = FALSE; | |
509 | ||
510 | if (yield == NULL) yield = last = next; else | |
511 | { | |
512 | last->next = next; | |
513 | last = next; | |
514 | } | |
515 | } | |
516 | ||
517 | return yield; | |
518 | } | |
519 | ||
520 | ||
521 | ||
522 | ||
523 | ||
524 | /************************************************* | |
525 | * Find addresses on local interfaces * | |
526 | *************************************************/ | |
527 | ||
528 | /* This function finds the addresses of local IP interfaces. These are used | |
529 | when testing for routing to the local host. As the function may be called more | |
530 | than once, the list is preserved in permanent store, pointed to by a static | |
531 | variable, to save doing the work more than once per process. | |
532 | ||
533 | The generic list of interfaces is obtained by calling host_build_ifacelist() | |
534 | for local_interfaces and extra_local_interfaces. This list scanned to remove | |
535 | duplicates (which may exist with different ports - not relevant here). If | |
536 | either of the wildcard IP addresses (0.0.0.0 and ::0) are encountered, they are | |
537 | replaced by the appropriate (IPv4 or IPv6) list of actual local interfaces, | |
538 | obtained from os_find_running_interfaces(). | |
539 | ||
540 | Arguments: none | |
541 | Returns: a chain of ip_address_items, each containing to a textual | |
542 | version of an IP address; the port numbers are not relevant | |
543 | */ | |
544 | ||
545 | ||
546 | /* First, a local subfunction to add an interface to a list in permanent store, | |
547 | but only if there isn't a previous copy of that address on the list. */ | |
548 | ||
549 | static ip_address_item * | |
550 | add_unique_interface(ip_address_item *list, ip_address_item *ipa) | |
551 | { | |
552 | ip_address_item *ipa2; | |
553 | for (ipa2 = list; ipa2 != NULL; ipa2 = ipa2->next) | |
554 | if (Ustrcmp(ipa2->address, ipa->address) == 0) return list; | |
555 | ipa2 = store_get_perm(sizeof(ip_address_item)); | |
556 | *ipa2 = *ipa; | |
557 | ipa2->next = list; | |
558 | return ipa2; | |
559 | } | |
560 | ||
561 | ||
562 | /* This is the globally visible function */ | |
563 | ||
564 | ip_address_item * | |
565 | host_find_interfaces(void) | |
566 | { | |
567 | ip_address_item *running_interfaces = NULL; | |
568 | ||
569 | if (local_interface_data == NULL) | |
570 | { | |
571 | void *reset_item = store_get(0); | |
572 | ip_address_item *dlist = host_build_ifacelist(local_interfaces, | |
573 | US"local_interfaces"); | |
574 | ip_address_item *xlist = host_build_ifacelist(extra_local_interfaces, | |
575 | US"extra_local_interfaces"); | |
576 | ip_address_item *ipa; | |
577 | ||
578 | if (dlist == NULL) dlist = xlist; else | |
579 | { | |
580 | for (ipa = dlist; ipa->next != NULL; ipa = ipa->next); | |
581 | ipa->next = xlist; | |
582 | } | |
583 | ||
584 | for (ipa = dlist; ipa != NULL; ipa = ipa->next) | |
585 | { | |
586 | if (Ustrcmp(ipa->address, "0.0.0.0") == 0 || | |
587 | Ustrcmp(ipa->address, "::0") == 0) | |
588 | { | |
589 | ip_address_item *ipa2; | |
590 | BOOL ipv6 = ipa->address[0] == ':'; | |
591 | if (running_interfaces == NULL) | |
592 | running_interfaces = os_find_running_interfaces(); | |
593 | for (ipa2 = running_interfaces; ipa2 != NULL; ipa2 = ipa2->next) | |
594 | { | |
595 | if ((Ustrchr(ipa2->address, ':') != NULL) == ipv6) | |
596 | local_interface_data = add_unique_interface(local_interface_data, | |
597 | ipa2); | |
598 | } | |
599 | } | |
600 | else | |
601 | { | |
602 | local_interface_data = add_unique_interface(local_interface_data, ipa); | |
603 | DEBUG(D_interface) | |
604 | { | |
605 | debug_printf("Configured local interface: address=%s", ipa->address); | |
606 | if (ipa->port != 0) debug_printf(" port=%d", ipa->port); | |
607 | debug_printf("\n"); | |
608 | } | |
609 | } | |
610 | } | |
611 | store_reset(reset_item); | |
612 | } | |
613 | ||
614 | return local_interface_data; | |
615 | } | |
616 | ||
617 | ||
618 | ||
619 | ||
620 | ||
621 | /************************************************* | |
622 | * Convert network IP address to text * | |
623 | *************************************************/ | |
624 | ||
625 | /* Given an IPv4 or IPv6 address in binary, convert it to a text | |
626 | string and return the result in a piece of new store. The address can | |
627 | either be given directly, or passed over in a sockaddr structure. Note | |
628 | that this isn't the converse of host_aton() because of byte ordering | |
629 | differences. See host_nmtoa() below. | |
630 | ||
631 | Arguments: | |
632 | type if < 0 then arg points to a sockaddr, else | |
633 | either AF_INET or AF_INET6 | |
634 | arg points to a sockaddr if type is < 0, or | |
635 | points to an IPv4 address (32 bits), or | |
636 | points to an IPv6 address (128 bits), | |
637 | in both cases, in network byte order | |
638 | buffer if NULL, the result is returned in gotten store; | |
639 | else points to a buffer to hold the answer | |
640 | portptr points to where to put the port number, if non NULL; only | |
641 | used when type < 0 | |
642 | ||
643 | Returns: pointer to character string | |
644 | */ | |
645 | ||
646 | uschar * | |
647 | host_ntoa(int type, const void *arg, uschar *buffer, int *portptr) | |
648 | { | |
649 | uschar *yield; | |
650 | ||
651 | /* The new world. It is annoying that we have to fish out the address from | |
652 | different places in the block, depending on what kind of address it is. It | |
653 | is also a pain that inet_ntop() returns a const uschar *, whereas the IPv4 | |
654 | function inet_ntoa() returns just uschar *, and some picky compilers insist | |
655 | on warning if one assigns a const uschar * to a uschar *. Hence the casts. */ | |
656 | ||
657 | #if HAVE_IPV6 | |
658 | uschar addr_buffer[46]; | |
659 | if (type < 0) | |
660 | { | |
661 | int family = ((struct sockaddr *)arg)->sa_family; | |
662 | if (family == AF_INET6) | |
663 | { | |
664 | struct sockaddr_in6 *sk = (struct sockaddr_in6 *)arg; | |
665 | yield = (uschar *)inet_ntop(family, &(sk->sin6_addr), CS addr_buffer, | |
666 | sizeof(addr_buffer)); | |
667 | if (portptr != NULL) *portptr = ntohs(sk->sin6_port); | |
668 | } | |
669 | else | |
670 | { | |
671 | struct sockaddr_in *sk = (struct sockaddr_in *)arg; | |
672 | yield = (uschar *)inet_ntop(family, &(sk->sin_addr), CS addr_buffer, | |
673 | sizeof(addr_buffer)); | |
674 | if (portptr != NULL) *portptr = ntohs(sk->sin_port); | |
675 | } | |
676 | } | |
677 | else | |
678 | { | |
679 | yield = (uschar *)inet_ntop(type, arg, CS addr_buffer, sizeof(addr_buffer)); | |
680 | } | |
681 | ||
682 | /* If the result is a mapped IPv4 address, show it in V4 format. */ | |
683 | ||
684 | if (Ustrncmp(yield, "::ffff:", 7) == 0) yield += 7; | |
685 | ||
686 | #else /* HAVE_IPV6 */ | |
687 | ||
688 | /* The old world */ | |
689 | ||
690 | if (type < 0) | |
691 | { | |
692 | yield = US inet_ntoa(((struct sockaddr_in *)arg)->sin_addr); | |
693 | if (portptr != NULL) *portptr = ntohs(((struct sockaddr_in *)arg)->sin_port); | |
694 | } | |
695 | else | |
696 | yield = US inet_ntoa(*((struct in_addr *)arg)); | |
697 | #endif | |
698 | ||
699 | /* If there is no buffer, put the string into some new store. */ | |
700 | ||
701 | if (buffer == NULL) return string_copy(yield); | |
702 | ||
703 | /* Callers of this function with a non-NULL buffer must ensure that it is | |
704 | large enough to hold an IPv6 address, namely, at least 46 bytes. That's what | |
705 | makes this use of strcpy() OK. */ | |
706 | ||
707 | Ustrcpy(buffer, yield); | |
708 | return buffer; | |
709 | } | |
710 | ||
711 | ||
712 | ||
713 | ||
714 | /************************************************* | |
715 | * Convert address text to binary * | |
716 | *************************************************/ | |
717 | ||
718 | /* Given the textual form of an IP address, convert it to binary in an | |
719 | array of ints. IPv4 addresses occupy one int; IPv6 addresses occupy 4 ints. | |
720 | The result has the first byte in the most significant byte of the first int. In | |
721 | other words, the result is not in network byte order, but in host byte order. | |
722 | As a result, this is not the converse of host_ntoa(), which expects network | |
723 | byte order. See host_nmtoa() below. | |
724 | ||
725 | Arguments: | |
726 | address points to the textual address, checked for syntax | |
727 | bin points to an array of 4 ints | |
728 | ||
729 | Returns: the number of ints used | |
730 | */ | |
731 | ||
732 | int | |
733 | host_aton(uschar *address, int *bin) | |
734 | { | |
735 | int x[4]; | |
736 | int v4offset = 0; | |
737 | ||
738 | /* Handle IPv6 address, which may end with an IPv4 address. This code is NOT | |
739 | enclosed in #if HAVE_IPV6 in order that IPv6 addresses are recognized even if | |
740 | IPv6 is not supported. */ | |
741 | ||
742 | if (Ustrchr(address, ':') != NULL) | |
743 | { | |
744 | uschar *p = address; | |
745 | uschar *component[8]; | |
746 | BOOL ipv4_ends = FALSE; | |
747 | int ci = 0; | |
748 | int nulloffset = 0; | |
749 | int v6count = 8; | |
750 | int i; | |
751 | ||
752 | /* If the address starts with a colon, it will start with two colons. | |
753 | Just lose the first one, which will leave a null first component. */ | |
754 | ||
755 | if (*p == ':') p++; | |
756 | ||
757 | /* Split the address into components separated by colons. */ | |
758 | ||
759 | while (*p != 0) | |
760 | { | |
761 | int len = Ustrcspn(p, ":"); | |
762 | if (len == 0) nulloffset = ci; | |
763 | component[ci++] = p; | |
764 | p += len; | |
765 | if (*p == ':') p++; | |
766 | } | |
767 | ||
768 | /* If the final component contains a dot, it is a trailing v4 address. | |
769 | As the syntax is known to be checked, just set up for a trailing | |
770 | v4 address and restrict the v6 part to 6 components. */ | |
771 | ||
772 | if (Ustrchr(component[ci-1], '.') != NULL) | |
773 | { | |
774 | address = component[--ci]; | |
775 | ipv4_ends = TRUE; | |
776 | v4offset = 3; | |
777 | v6count = 6; | |
778 | } | |
779 | ||
780 | /* If there are fewer than 6 or 8 components, we have to insert some | |
781 | more empty ones in the middle. */ | |
782 | ||
783 | if (ci < v6count) | |
784 | { | |
785 | int insert_count = v6count - ci; | |
786 | for (i = v6count-1; i > nulloffset + insert_count; i--) | |
787 | component[i] = component[i - insert_count]; | |
788 | while (i > nulloffset) component[i--] = US""; | |
789 | } | |
790 | ||
791 | /* Now turn the components into binary in pairs and bung them | |
792 | into the vector of ints. */ | |
793 | ||
794 | for (i = 0; i < v6count; i += 2) | |
795 | bin[i/2] = (Ustrtol(component[i], NULL, 16) << 16) + | |
796 | Ustrtol(component[i+1], NULL, 16); | |
797 | ||
798 | /* If there was no terminating v4 component, we are done. */ | |
799 | ||
800 | if (!ipv4_ends) return 4; | |
801 | } | |
802 | ||
803 | /* Handle IPv4 address */ | |
804 | ||
805 | sscanf(CS address, "%d.%d.%d.%d", x, x+1, x+2, x+3); | |
806 | bin[v4offset] = (x[0] << 24) + (x[1] << 16) + (x[2] << 8) + x[3]; | |
807 | return v4offset+1; | |
808 | } | |
809 | ||
810 | ||
811 | /************************************************* | |
812 | * Apply mask to an IP address * | |
813 | *************************************************/ | |
814 | ||
815 | /* Mask an address held in 1 or 4 ints, with the ms bit in the ms bit of the | |
816 | first int, etc. | |
817 | ||
818 | Arguments: | |
819 | count the number of ints | |
820 | binary points to the ints to be masked | |
821 | mask the count of ms bits to leave, or -1 if no masking | |
822 | ||
823 | Returns: nothing | |
824 | */ | |
825 | ||
826 | void | |
827 | host_mask(int count, int *binary, int mask) | |
828 | { | |
829 | int i; | |
830 | if (mask < 0) mask = 99999; | |
831 | for (i = 0; i < count; i++) | |
832 | { | |
833 | int wordmask; | |
834 | if (mask == 0) wordmask = 0; | |
835 | else if (mask < 32) | |
836 | { | |
837 | wordmask = (-1) << (32 - mask); | |
838 | mask = 0; | |
839 | } | |
840 | else | |
841 | { | |
842 | wordmask = -1; | |
843 | mask -= 32; | |
844 | } | |
845 | binary[i] &= wordmask; | |
846 | } | |
847 | } | |
848 | ||
849 | ||
850 | ||
851 | ||
852 | /************************************************* | |
853 | * Convert masked IP address in ints to text * | |
854 | *************************************************/ | |
855 | ||
856 | /* We can't use host_ntoa() because it assumes the binary values are in network | |
857 | byte order, and these are the result of host_aton(), which puts them in ints in | |
858 | host byte order. Also, we really want IPv6 addresses to be in a canonical | |
6f0c9a4f PH |
859 | format, so we output them with no abbreviation. In a number of cases we can't |
860 | use the normal colon separator in them because it terminates keys in lsearch | |
861 | files, so we want to use dot instead. There's an argument that specifies what | |
862 | to use for IPv6 addresses. | |
059ec3d9 PH |
863 | |
864 | Arguments: | |
865 | count 1 or 4 (number of ints) | |
866 | binary points to the ints | |
867 | mask mask value; if < 0 don't add to result | |
868 | buffer big enough to hold the result | |
6f0c9a4f | 869 | sep component separator character for IPv6 addresses |
059ec3d9 PH |
870 | |
871 | Returns: the number of characters placed in buffer, not counting | |
872 | the final nul. | |
873 | */ | |
874 | ||
875 | int | |
6f0c9a4f | 876 | host_nmtoa(int count, int *binary, int mask, uschar *buffer, int sep) |
059ec3d9 PH |
877 | { |
878 | int i, j; | |
879 | uschar *tt = buffer; | |
880 | ||
881 | if (count == 1) | |
882 | { | |
883 | j = binary[0]; | |
884 | for (i = 24; i >= 0; i -= 8) | |
885 | { | |
886 | sprintf(CS tt, "%d.", (j >> i) & 255); | |
887 | while (*tt) tt++; | |
888 | } | |
889 | } | |
890 | else | |
891 | { | |
892 | for (i = 0; i < 4; i++) | |
893 | { | |
894 | j = binary[i]; | |
6f0c9a4f | 895 | sprintf(CS tt, "%04x%c%04x%c", (j >> 16) & 0xffff, sep, j & 0xffff, sep); |
059ec3d9 PH |
896 | while (*tt) tt++; |
897 | } | |
898 | } | |
899 | ||
6f0c9a4f | 900 | tt--; /* lose final separator */ |
059ec3d9 PH |
901 | |
902 | if (mask < 0) | |
903 | *tt = 0; | |
904 | else | |
905 | { | |
906 | sprintf(CS tt, "/%d", mask); | |
907 | while (*tt) tt++; | |
908 | } | |
909 | ||
910 | return tt - buffer; | |
911 | } | |
912 | ||
913 | ||
914 | ||
915 | /************************************************* | |
916 | * Check port for tls_on_connect * | |
917 | *************************************************/ | |
918 | ||
919 | /* This function checks whether a given incoming port is configured for tls- | |
920 | on-connect. It is called from the daemon and from inetd handling. If the global | |
921 | option tls_on_connect is already set, all ports operate this way. Otherwise, we | |
922 | check the tls_on_connect_ports option for a list of ports. | |
923 | ||
924 | Argument: a port number | |
925 | Returns: TRUE or FALSE | |
926 | */ | |
927 | ||
928 | BOOL | |
929 | host_is_tls_on_connect_port(int port) | |
930 | { | |
931 | int sep = 0; | |
932 | uschar buffer[32]; | |
933 | uschar *list = tls_on_connect_ports; | |
934 | uschar *s; | |
935 | ||
936 | if (tls_on_connect) return TRUE; | |
937 | ||
938 | while ((s = string_nextinlist(&list, &sep, buffer, sizeof(buffer))) != NULL) | |
939 | { | |
940 | uschar *end; | |
941 | int lport = Ustrtol(s, &end, 10); | |
942 | if (*end != 0) log_write(0, LOG_MAIN|LOG_PANIC_DIE, "tls_on_connect_ports " | |
943 | "contains \"%s\", which is not a port number: exim abandoned", s); | |
944 | if (lport == port) return TRUE; | |
945 | } | |
946 | ||
947 | return FALSE; | |
948 | } | |
949 | ||
950 | ||
951 | ||
952 | /************************************************* | |
953 | * Check whether host is in a network * | |
954 | *************************************************/ | |
955 | ||
956 | /* This function checks whether a given IP address matches a pattern that | |
957 | represents either a single host, or a network (using CIDR notation). The caller | |
958 | of this function must check the syntax of the arguments before calling it. | |
959 | ||
960 | Arguments: | |
961 | host string representation of the ip-address to check | |
962 | net string representation of the network, with optional CIDR mask | |
963 | maskoffset offset to the / that introduces the mask in the key | |
964 | zero if there is no mask | |
965 | ||
966 | Returns: | |
967 | TRUE the host is inside the network | |
968 | FALSE the host is NOT inside the network | |
969 | */ | |
970 | ||
971 | BOOL | |
972 | host_is_in_net(uschar *host, uschar *net, int maskoffset) | |
973 | { | |
974 | int i; | |
975 | int address[4]; | |
976 | int incoming[4]; | |
977 | int mlen; | |
978 | int size = host_aton(net, address); | |
979 | int insize; | |
980 | ||
981 | /* No mask => all bits to be checked */ | |
982 | ||
983 | if (maskoffset == 0) mlen = 99999; /* Big number */ | |
984 | else mlen = Uatoi(net + maskoffset + 1); | |
985 | ||
986 | /* Convert the incoming address to binary. */ | |
987 | ||
988 | insize = host_aton(host, incoming); | |
989 | ||
990 | /* Convert IPv4 addresses given in IPv6 compatible mode, which represent | |
991 | connections from IPv4 hosts to IPv6 hosts, that is, addresses of the form | |
992 | ::ffff:<v4address>, to IPv4 format. */ | |
993 | ||
994 | if (insize == 4 && incoming[0] == 0 && incoming[1] == 0 && | |
995 | incoming[2] == 0xffff) | |
996 | { | |
997 | insize = 1; | |
998 | incoming[0] = incoming[3]; | |
999 | } | |
1000 | ||
1001 | /* No match if the sizes don't agree. */ | |
1002 | ||
1003 | if (insize != size) return FALSE; | |
1004 | ||
1005 | /* Else do the masked comparison. */ | |
1006 | ||
1007 | for (i = 0; i < size; i++) | |
1008 | { | |
1009 | int mask; | |
1010 | if (mlen == 0) mask = 0; | |
1011 | else if (mlen < 32) | |
1012 | { | |
1013 | mask = (-1) << (32 - mlen); | |
1014 | mlen = 0; | |
1015 | } | |
1016 | else | |
1017 | { | |
1018 | mask = -1; | |
1019 | mlen -= 32; | |
1020 | } | |
1021 | if ((incoming[i] & mask) != (address[i] & mask)) return FALSE; | |
1022 | } | |
1023 | ||
1024 | return TRUE; | |
1025 | } | |
1026 | ||
1027 | ||
1028 | ||
1029 | /************************************************* | |
1030 | * Scan host list for local hosts * | |
1031 | *************************************************/ | |
1032 | ||
1033 | /* Scan through a chain of addresses and check whether any of them is the | |
1034 | address of an interface on the local machine. If so, remove that address and | |
1035 | any previous ones with the same MX value, and all subsequent ones (which will | |
1036 | have greater or equal MX values) from the chain. Note: marking them as unusable | |
1037 | is NOT the right thing to do because it causes the hosts not to be used for | |
1038 | other domains, for which they may well be correct. | |
1039 | ||
1040 | The hosts may be part of a longer chain; we only process those between the | |
1041 | initial pointer and the "last" pointer. | |
1042 | ||
1043 | There is also a list of "pseudo-local" host names which are checked against the | |
1044 | host names. Any match causes that host item to be treated the same as one which | |
1045 | matches a local IP address. | |
1046 | ||
1047 | If the very first host is a local host, then all MX records had a precedence | |
1048 | greater than or equal to that of the local host. Either there's a problem in | |
1049 | the DNS, or an apparently remote name turned out to be an abbreviation for the | |
1050 | local host. Give a specific return code, and let the caller decide what to do. | |
1051 | Otherwise, give a success code if at least one host address has been found. | |
1052 | ||
1053 | Arguments: | |
1054 | host pointer to the first host in the chain | |
1055 | lastptr pointer to pointer to the last host in the chain (may be updated) | |
1056 | removed if not NULL, set TRUE if some local addresses were removed | |
1057 | from the list | |
1058 | ||
1059 | Returns: | |
1060 | HOST_FOUND if there is at least one host with an IP address on the chain | |
1061 | and an MX value less than any MX value associated with the | |
1062 | local host | |
1063 | HOST_FOUND_LOCAL if a local host is among the lowest-numbered MX hosts; when | |
1064 | the host addresses were obtained from A records or | |
1065 | gethostbyname(), the MX values are set to -1. | |
1066 | HOST_FIND_FAILED if no valid hosts with set IP addresses were found | |
1067 | */ | |
1068 | ||
1069 | int | |
1070 | host_scan_for_local_hosts(host_item *host, host_item **lastptr, BOOL *removed) | |
1071 | { | |
1072 | int yield = HOST_FIND_FAILED; | |
1073 | host_item *last = *lastptr; | |
1074 | host_item *prev = NULL; | |
1075 | host_item *h; | |
1076 | ||
1077 | if (removed != NULL) *removed = FALSE; | |
1078 | ||
1079 | if (local_interface_data == NULL) local_interface_data = host_find_interfaces(); | |
1080 | ||
1081 | for (h = host; h != last->next; h = h->next) | |
1082 | { | |
1083 | #ifndef STAND_ALONE | |
1084 | if (hosts_treat_as_local != NULL) | |
1085 | { | |
1086 | int rc; | |
1087 | uschar *save = deliver_domain; | |
1088 | deliver_domain = h->name; /* set $domain */ | |
1089 | rc = match_isinlist(string_copylc(h->name), &hosts_treat_as_local, 0, | |
1090 | &domainlist_anchor, NULL, MCL_DOMAIN, TRUE, NULL); | |
1091 | deliver_domain = save; | |
1092 | if (rc == OK) goto FOUND_LOCAL; | |
1093 | } | |
1094 | #endif | |
1095 | ||
1096 | /* It seems that on many operating systems, 0.0.0.0 is treated as a synonym | |
1097 | for 127.0.0.1 and refers to the local host. We therefore force it always to | |
1098 | be treated as local. */ | |
1099 | ||
1100 | if (h->address != NULL) | |
1101 | { | |
1102 | ip_address_item *ip; | |
1103 | if (Ustrcmp(h->address, "0.0.0.0") == 0) goto FOUND_LOCAL; | |
1104 | for (ip = local_interface_data; ip != NULL; ip = ip->next) | |
1105 | if (Ustrcmp(h->address, ip->address) == 0) goto FOUND_LOCAL; | |
1106 | yield = HOST_FOUND; /* At least one remote address has been found */ | |
1107 | } | |
1108 | ||
1109 | /* Update prev to point to the last host item before any that have | |
1110 | the same MX value as the one we have just considered. */ | |
1111 | ||
1112 | if (h->next == NULL || h->next->mx != h->mx) prev = h; | |
1113 | } | |
1114 | ||
1115 | return yield; /* No local hosts found: return HOST_FOUND or HOST_FIND_FAILED */ | |
1116 | ||
1117 | /* A host whose IP address matches a local IP address, or whose name matches | |
1118 | something in hosts_treat_as_local has been found. */ | |
1119 | ||
1120 | FOUND_LOCAL: | |
1121 | ||
1122 | if (prev == NULL) | |
1123 | { | |
1124 | HDEBUG(D_host_lookup) debug_printf((h->mx >= 0)? | |
1125 | "local host has lowest MX\n" : | |
1126 | "local host found for non-MX address\n"); | |
1127 | return HOST_FOUND_LOCAL; | |
1128 | } | |
1129 | ||
1130 | HDEBUG(D_host_lookup) | |
1131 | { | |
1132 | debug_printf("local host in host list - removed hosts:\n"); | |
1133 | for (h = prev->next; h != last->next; h = h->next) | |
1134 | debug_printf(" %s %s %d\n", h->name, h->address, h->mx); | |
1135 | } | |
1136 | ||
1137 | if (removed != NULL) *removed = TRUE; | |
1138 | prev->next = last->next; | |
1139 | *lastptr = prev; | |
1140 | return yield; | |
1141 | } | |
1142 | ||
1143 | ||
1144 | ||
1145 | ||
1146 | /************************************************* | |
1147 | * Remove duplicate IPs in host list * | |
1148 | *************************************************/ | |
1149 | ||
1150 | /* You would think that administrators could set up their DNS records so that | |
1151 | one ended up with a list of unique IP addresses after looking up A or MX | |
1152 | records, but apparently duplication is common. So we scan such lists and | |
1153 | remove the later duplicates. Note that we may get lists in which some host | |
1154 | addresses are not set. | |
1155 | ||
1156 | Arguments: | |
1157 | host pointer to the first host in the chain | |
1158 | lastptr pointer to pointer to the last host in the chain (may be updated) | |
1159 | ||
1160 | Returns: nothing | |
1161 | */ | |
1162 | ||
1163 | static void | |
1164 | host_remove_duplicates(host_item *host, host_item **lastptr) | |
1165 | { | |
1166 | while (host != *lastptr) | |
1167 | { | |
1168 | if (host->address != NULL) | |
1169 | { | |
1170 | host_item *h = host; | |
1171 | while (h != *lastptr) | |
1172 | { | |
1173 | if (h->next->address != NULL && | |
1174 | Ustrcmp(h->next->address, host->address) == 0) | |
1175 | { | |
1176 | DEBUG(D_host_lookup) debug_printf("duplicate IP address %s (MX=%d) " | |
1177 | "removed\n", host->address, h->next->mx); | |
1178 | if (h->next == *lastptr) *lastptr = h; | |
1179 | h->next = h->next->next; | |
1180 | } | |
1181 | else h = h->next; | |
1182 | } | |
1183 | } | |
1184 | /* If the last item was removed, host may have become == *lastptr */ | |
1185 | if (host != *lastptr) host = host->next; | |
1186 | } | |
1187 | } | |
1188 | ||
1189 | ||
1190 | ||
1191 | ||
1192 | /************************************************* | |
1193 | * Find sender host name by gethostbyaddr() * | |
1194 | *************************************************/ | |
1195 | ||
1196 | /* This used to be the only way it was done, but it turns out that not all | |
1197 | systems give aliases for calls to gethostbyaddr() - or one of the modern | |
1198 | equivalents like getipnodebyaddr(). Fortunately, multiple PTR records are rare, | |
1199 | but they can still exist. This function is now used only when a DNS lookup of | |
1200 | the IP address fails, in order to give access to /etc/hosts. | |
1201 | ||
1202 | Arguments: none | |
1203 | Returns: OK, DEFER, FAIL | |
1204 | */ | |
1205 | ||
1206 | static int | |
1207 | host_name_lookup_byaddr(void) | |
1208 | { | |
1209 | int len; | |
1210 | uschar *s, *t; | |
1211 | struct hostent *hosts; | |
1212 | struct in_addr addr; | |
1213 | ||
1214 | /* Lookup on IPv6 system */ | |
1215 | ||
1216 | #if HAVE_IPV6 | |
1217 | if (Ustrchr(sender_host_address, ':') != NULL) | |
1218 | { | |
1219 | struct in6_addr addr6; | |
1220 | if (inet_pton(AF_INET6, CS sender_host_address, &addr6) != 1) | |
1221 | log_write(0, LOG_MAIN|LOG_PANIC_DIE, "unable to parse \"%s\" as an " | |
1222 | "IPv6 address", sender_host_address); | |
1223 | #if HAVE_GETIPNODEBYADDR | |
1224 | hosts = getipnodebyaddr(CS &addr6, sizeof(addr6), AF_INET6, &h_errno); | |
1225 | #else | |
1226 | hosts = gethostbyaddr(CS &addr6, sizeof(addr6), AF_INET6); | |
1227 | #endif | |
1228 | } | |
1229 | else | |
1230 | { | |
1231 | if (inet_pton(AF_INET, CS sender_host_address, &addr) != 1) | |
1232 | log_write(0, LOG_MAIN|LOG_PANIC_DIE, "unable to parse \"%s\" as an " | |
1233 | "IPv4 address", sender_host_address); | |
1234 | #if HAVE_GETIPNODEBYADDR | |
1235 | hosts = getipnodebyaddr(CS &addr, sizeof(addr), AF_INET, &h_errno); | |
1236 | #else | |
1237 | hosts = gethostbyaddr(CS &addr, sizeof(addr), AF_INET); | |
1238 | #endif | |
1239 | } | |
1240 | ||
1241 | /* Do lookup on IPv4 system */ | |
1242 | ||
1243 | #else | |
1244 | addr.s_addr = (S_ADDR_TYPE)inet_addr(CS sender_host_address); | |
1245 | hosts = gethostbyaddr(CS(&addr), sizeof(addr), AF_INET); | |
1246 | #endif | |
1247 | ||
1248 | /* Failed to look up the host. */ | |
1249 | ||
1250 | if (hosts == NULL) | |
1251 | { | |
1252 | HDEBUG(D_host_lookup) debug_printf("IP address lookup failed: h_errno=%d\n", | |
1253 | h_errno); | |
1254 | return (h_errno == TRY_AGAIN || h_errno == NO_RECOVERY) ? DEFER : FAIL; | |
1255 | } | |
1256 | ||
1257 | /* It seems there are some records in the DNS that yield an empty name. We | |
1258 | treat this as non-existent. In some operating systems, this is returned as an | |
1259 | empty string; in others as a single dot. */ | |
1260 | ||
1261 | if (hosts->h_name[0] == 0 || hosts->h_name[0] == '.') | |
1262 | { | |
1263 | HDEBUG(D_host_lookup) debug_printf("IP address lookup yielded an empty name: " | |
1264 | "treated as non-existent host name\n"); | |
1265 | return FAIL; | |
1266 | } | |
1267 | ||
1268 | /* Copy and lowercase the name, which is in static storage in many systems. | |
1269 | Put it in permanent memory. */ | |
1270 | ||
1271 | s = (uschar *)hosts->h_name; | |
1272 | len = Ustrlen(s) + 1; | |
1273 | t = sender_host_name = store_get_perm(len); | |
1274 | while (*s != 0) *t++ = tolower(*s++); | |
1275 | *t = 0; | |
1276 | ||
1277 | /* If the host has aliases, build a copy of the alias list */ | |
1278 | ||
1279 | if (hosts->h_aliases != NULL) | |
1280 | { | |
1281 | int count = 1; | |
1282 | uschar **aliases, **ptr; | |
1283 | for (aliases = USS hosts->h_aliases; *aliases != NULL; aliases++) count++; | |
1284 | ptr = sender_host_aliases = store_get_perm(count * sizeof(uschar *)); | |
1285 | for (aliases = USS hosts->h_aliases; *aliases != NULL; aliases++) | |
1286 | { | |
1287 | uschar *s = *aliases; | |
1288 | int len = Ustrlen(s) + 1; | |
1289 | uschar *t = *ptr++ = store_get_perm(len); | |
1290 | while (*s != 0) *t++ = tolower(*s++); | |
1291 | *t = 0; | |
1292 | } | |
1293 | *ptr = NULL; | |
1294 | } | |
1295 | ||
1296 | return OK; | |
1297 | } | |
1298 | ||
1299 | ||
1300 | ||
1301 | /************************************************* | |
1302 | * Find host name for incoming call * | |
1303 | *************************************************/ | |
1304 | ||
1305 | /* Put the name in permanent store, pointed to by sender_host_name. We also set | |
1306 | up a list of alias names, pointed to by sender_host_alias. The list is | |
1307 | NULL-terminated. The incoming address is in sender_host_address, either in | |
1308 | dotted-quad form for IPv4 or in colon-separated form for IPv6. | |
1309 | ||
1310 | This function does a thorough check that the names it finds point back to the | |
1311 | incoming IP address. Any that do not are discarded. Note that this is relied on | |
1312 | by the ACL reverse_host_lookup check. | |
1313 | ||
1314 | On some systems, get{host,ipnode}byaddr() appears to do this internally, but | |
1315 | this it not universally true. Also, for release 4.30, this function was changed | |
1316 | to do a direct DNS lookup first, by default[1], because it turns out that that | |
1317 | is the only guaranteed way to find all the aliases on some systems. My | |
1318 | experiments indicate that Solaris gethostbyaddr() gives the aliases for but | |
1319 | Linux does not. | |
1320 | ||
1321 | [1] The actual order is controlled by the host_lookup_order option. | |
1322 | ||
1323 | Arguments: none | |
1324 | Returns: OK on success, the answer being placed in the global variable | |
1325 | sender_host_name, with any aliases in a list hung off | |
1326 | sender_host_aliases | |
1327 | FAIL if no host name can be found | |
1328 | DEFER if a temporary error was encountered | |
1329 | ||
1330 | The variable host_lookup_msg is set to an empty string on sucess, or to a | |
1331 | reason for the failure otherwise, in a form suitable for tagging onto an error | |
1332 | message, and also host_lookup_failed is set TRUE if the lookup failed. Any | |
1333 | dynamically constructed string for host_lookup_msg must be in permanent store, | |
1334 | because it might be used for several incoming messages on the same SMTP | |
1335 | connection. */ | |
1336 | ||
1337 | int | |
1338 | host_name_lookup(void) | |
1339 | { | |
1340 | int old_pool, rc; | |
1341 | int sep = 0; | |
1342 | uschar *hname, *save_hostname; | |
1343 | uschar **aliases; | |
1344 | uschar buffer[256]; | |
1345 | uschar *ordername; | |
1346 | uschar *list = host_lookup_order; | |
1347 | dns_record *rr; | |
1348 | dns_answer dnsa; | |
1349 | dns_scan dnss; | |
1350 | ||
1351 | HDEBUG(D_host_lookup) | |
1352 | debug_printf("looking up host name for %s\n", sender_host_address); | |
1353 | ||
1354 | /* For testing the case when a lookup does not complete, we have a special | |
1355 | reserved IP address. */ | |
1356 | ||
1357 | if (running_in_test_harness && | |
1358 | Ustrcmp(sender_host_address, "99.99.99.99") == 0) | |
1359 | { | |
1360 | HDEBUG(D_host_lookup) | |
1361 | debug_printf("Test harness: host name lookup returns DEFER\n"); | |
1362 | return DEFER; | |
1363 | } | |
1364 | ||
1365 | /* Do lookups directly in the DNS or via gethostbyaddr() (or equivalent), in | |
1366 | the order specified by the host_lookup_order option. */ | |
1367 | ||
1368 | while ((ordername = string_nextinlist(&list, &sep, buffer, sizeof(buffer))) | |
1369 | != NULL) | |
1370 | { | |
1371 | if (strcmpic(ordername, US"bydns") == 0) | |
1372 | { | |
1373 | dns_init(FALSE, FALSE); | |
1374 | dns_build_reverse(sender_host_address, buffer); | |
1375 | rc = dns_lookup(&dnsa, buffer, T_PTR, NULL); | |
1376 | ||
1377 | /* The first record we come across is used for the name; others are | |
1378 | considered to be aliases. We have to scan twice, in order to find out the | |
1379 | number of aliases. However, if all the names are empty, we will behave as | |
1380 | if failure. (PTR records that yield empty names have been encountered in | |
1381 | the DNS.) */ | |
1382 | ||
1383 | if (rc == DNS_SUCCEED) | |
1384 | { | |
1385 | uschar **aptr = NULL; | |
1386 | int ssize = 264; | |
1387 | int count = 0; | |
1388 | int old_pool = store_pool; | |
1389 | ||
1390 | store_pool = POOL_PERM; /* Save names in permanent storage */ | |
1391 | ||
1392 | for (rr = dns_next_rr(&dnsa, &dnss, RESET_ANSWERS); | |
1393 | rr != NULL; | |
1394 | rr = dns_next_rr(&dnsa, &dnss, RESET_NEXT)) | |
1395 | { | |
1396 | if (rr->type == T_PTR) count++; | |
1397 | } | |
1398 | ||
1399 | /* Get store for the list of aliases. For compatibility with | |
1400 | gethostbyaddr, we make an empty list if there are none. */ | |
1401 | ||
1402 | aptr = sender_host_aliases = store_get(count * sizeof(uschar *)); | |
1403 | ||
1404 | /* Re-scan and extract the names */ | |
1405 | ||
1406 | for (rr = dns_next_rr(&dnsa, &dnss, RESET_ANSWERS); | |
1407 | rr != NULL; | |
1408 | rr = dns_next_rr(&dnsa, &dnss, RESET_NEXT)) | |
1409 | { | |
1410 | uschar *s = NULL; | |
1411 | if (rr->type != T_PTR) continue; | |
1412 | s = store_get(ssize); | |
1413 | ||
1414 | /* If an overlong response was received, the data will have been | |
1415 | truncated and dn_expand may fail. */ | |
1416 | ||
1417 | if (dn_expand(dnsa.answer, dnsa.answer + dnsa.answerlen, | |
1418 | (uschar *)(rr->data), (DN_EXPAND_ARG4_TYPE)(s), ssize) < 0) | |
1419 | { | |
1420 | log_write(0, LOG_MAIN, "host name alias list truncated for %s", | |
1421 | sender_host_address); | |
1422 | break; | |
1423 | } | |
1424 | ||
1425 | store_reset(s + Ustrlen(s) + 1); | |
1426 | if (s[0] == 0) | |
1427 | { | |
1428 | HDEBUG(D_host_lookup) debug_printf("IP address lookup yielded an " | |
1429 | "empty name: treated as non-existent host name\n"); | |
1430 | continue; | |
1431 | } | |
1432 | if (sender_host_name == NULL) sender_host_name = s; | |
1433 | else *aptr++ = s; | |
1434 | while (*s != 0) { *s = tolower(*s); s++; } | |
1435 | } | |
1436 | ||
1437 | *aptr = NULL; /* End of alias list */ | |
1438 | store_pool = old_pool; /* Reset store pool */ | |
1439 | ||
1440 | /* If we've found a names, break out of the "order" loop */ | |
1441 | ||
1442 | if (sender_host_name != NULL) break; | |
1443 | } | |
1444 | ||
1445 | /* If the DNS lookup deferred, we must also defer. */ | |
1446 | ||
1447 | if (rc == DNS_AGAIN) | |
1448 | { | |
1449 | HDEBUG(D_host_lookup) | |
1450 | debug_printf("IP address PTR lookup gave temporary error\n"); | |
1451 | return DEFER; | |
1452 | } | |
1453 | } | |
1454 | ||
1455 | /* Do a lookup using gethostbyaddr() - or equivalent */ | |
1456 | ||
1457 | else if (strcmpic(ordername, US"byaddr") == 0) | |
1458 | { | |
1459 | HDEBUG(D_host_lookup) | |
1460 | debug_printf("IP address lookup using gethostbyaddr()\n"); | |
1461 | ||
1462 | rc = host_name_lookup_byaddr(); | |
1463 | if (rc == DEFER) return rc; /* Can't carry on */ | |
1464 | if (rc == OK) break; /* Found a name */ | |
1465 | } | |
1466 | } /* Loop for bydns/byaddr scanning */ | |
1467 | ||
1468 | /* If we have failed to find a name, return FAIL and log when required. | |
1469 | NB host_lookup_msg must be in permanent store. */ | |
1470 | ||
1471 | if (sender_host_name == NULL) | |
1472 | { | |
1473 | if (host_checking || !log_testing_mode) | |
1474 | log_write(L_host_lookup_failed, LOG_MAIN, "no host name found for IP " | |
1475 | "address %s", sender_host_address); | |
1476 | host_lookup_msg = US" (failed to find host name from IP address)"; | |
1477 | ||
1478 | host_lookup_failed = TRUE; | |
1479 | return FAIL; | |
1480 | } | |
1481 | ||
1482 | /* We have a host name. If we are running in the test harness, we want the host | |
1483 | name and its alias to appear always the same way round. There are only ever two | |
1484 | names in these tests. If one of them contains "alias", make sure it is second; | |
1485 | otherwise put them in alphabetical order. */ | |
1486 | ||
1487 | if (running_in_test_harness && *sender_host_aliases != NULL && | |
1488 | ( | |
1489 | Ustrstr(sender_host_name, "alias") != NULL || | |
1490 | ( | |
1491 | Ustrstr(*sender_host_aliases, "alias") == NULL && | |
1492 | Ustrcmp(sender_host_name, *sender_host_aliases) > 0 | |
1493 | ) | |
1494 | )) | |
1495 | { | |
1496 | uschar *temp = sender_host_name; | |
1497 | sender_host_name = *sender_host_aliases; | |
1498 | *sender_host_aliases = temp; | |
1499 | } | |
1500 | ||
1501 | /* Debug output what was found, after test harness swapping, for consistency */ | |
1502 | ||
1503 | HDEBUG(D_host_lookup) | |
1504 | { | |
1505 | uschar **aliases = sender_host_aliases; | |
1506 | debug_printf("IP address lookup yielded %s\n", sender_host_name); | |
1507 | while (*aliases != NULL) debug_printf(" alias %s\n", *aliases++); | |
1508 | } | |
1509 | ||
1510 | /* We need to verify that a forward lookup on the name we found does indeed | |
1511 | correspond to the address. This is for security: in principle a malefactor who | |
1512 | happened to own a reverse zone could set it to point to any names at all. | |
1513 | ||
1514 | This code was present in versions of Exim before 3.20. At that point I took it | |
1515 | out because I thought that gethostbyaddr() did the check anyway. It turns out | |
1516 | that this isn't always the case, so it's coming back in at 4.01. This version | |
1517 | is actually better, because it also checks aliases. | |
1518 | ||
1519 | The code was made more robust at release 4.21. Prior to that, it accepted all | |
1520 | the names if any of them had the correct IP address. Now the code checks all | |
1521 | the names, and accepts only those that have the correct IP address. */ | |
1522 | ||
1523 | save_hostname = sender_host_name; /* Save for error messages */ | |
1524 | aliases = sender_host_aliases; | |
1525 | for (hname = sender_host_name; hname != NULL; hname = *aliases++) | |
1526 | { | |
1527 | int rc; | |
1528 | BOOL ok = FALSE; | |
1529 | host_item h; | |
1530 | h.next = NULL; | |
1531 | h.name = hname; | |
1532 | h.mx = MX_NONE; | |
1533 | h.address = NULL; | |
1534 | ||
1535 | /* When called with the 5th argument FALSE, host_find_byname() won't return | |
1536 | HOST_FOUND_LOCAL. If the incoming address is an IPv4 address expressed in | |
1537 | IPv6 format, we must compare the IPv4 part to any IPv4 addresses. */ | |
1538 | ||
1539 | if ((rc = host_find_byname(&h, NULL, NULL, FALSE)) == HOST_FOUND) | |
1540 | { | |
1541 | host_item *hh; | |
1542 | uschar *address_ipv4 = (Ustrncmp(sender_host_address, "::ffff:", 7) == 0)? | |
1543 | sender_host_address + 7 : sender_host_address; | |
1544 | HDEBUG(D_host_lookup) debug_printf("checking addresses for %s\n", hname); | |
1545 | for (hh = &h; hh != NULL; hh = hh->next) | |
1546 | { | |
1547 | if ((Ustrcmp(hh->address, (Ustrchr(hh->address, ':') == NULL)? | |
1548 | address_ipv4 : sender_host_address)) == 0) | |
1549 | { | |
1550 | HDEBUG(D_host_lookup) debug_printf(" %s OK\n", hh->address); | |
1551 | ok = TRUE; | |
1552 | break; | |
1553 | } | |
1554 | else | |
1555 | { | |
1556 | HDEBUG(D_host_lookup) debug_printf(" %s\n", hh->address); | |
1557 | } | |
1558 | } | |
1559 | if (!ok) HDEBUG(D_host_lookup) | |
1560 | debug_printf("no IP address for %s matched %s\n", hname, | |
1561 | sender_host_address); | |
1562 | } | |
1563 | else if (rc == HOST_FIND_AGAIN) | |
1564 | { | |
1565 | HDEBUG(D_host_lookup) debug_printf("temporary error for host name lookup\n"); | |
1566 | return DEFER; | |
1567 | } | |
1568 | else | |
1569 | { | |
1570 | HDEBUG(D_host_lookup) debug_printf("no IP addresses found for %s\n", hname); | |
1571 | } | |
1572 | ||
1573 | /* If this name is no good, and it's the sender name, set it null pro tem; | |
1574 | if it's an alias, just remove it from the list. */ | |
1575 | ||
1576 | if (!ok) | |
1577 | { | |
1578 | if (hname == sender_host_name) sender_host_name = NULL; else | |
1579 | { | |
1580 | uschar **a; /* Don't amalgamate - some */ | |
1581 | a = --aliases; /* compilers grumble */ | |
1582 | while (*a != NULL) { *a = a[1]; a++; } | |
1583 | } | |
1584 | } | |
1585 | } | |
1586 | ||
1587 | /* If sender_host_name == NULL, it means we didn't like the name. Replace | |
1588 | it with the first alias, if there is one. */ | |
1589 | ||
1590 | if (sender_host_name == NULL && *sender_host_aliases != NULL) | |
1591 | sender_host_name = *sender_host_aliases++; | |
1592 | ||
1593 | /* If we now have a main name, all is well. */ | |
1594 | ||
1595 | if (sender_host_name != NULL) return OK; | |
1596 | ||
1597 | /* We have failed to find an address that matches. */ | |
1598 | ||
1599 | HDEBUG(D_host_lookup) | |
1600 | debug_printf("%s does not match any IP address for %s\n", | |
1601 | sender_host_address, save_hostname); | |
1602 | ||
1603 | /* This message must be in permanent store */ | |
1604 | ||
1605 | old_pool = store_pool; | |
1606 | store_pool = POOL_PERM; | |
1607 | host_lookup_msg = string_sprintf(" (%s does not match any IP address for %s)", | |
1608 | sender_host_address, save_hostname); | |
1609 | store_pool = old_pool; | |
1610 | ||
1611 | host_lookup_failed = TRUE; | |
1612 | return FAIL; | |
1613 | } | |
1614 | ||
1615 | ||
1616 | ||
1617 | ||
1618 | /************************************************* | |
1619 | * Find IP address(es) for host by name * | |
1620 | *************************************************/ | |
1621 | ||
1622 | /* The input is a host_item structure with the name filled in and the address | |
1623 | field set to NULL. We use gethostbyname(). Of course, gethostbyname() may use | |
1624 | the DNS, but it doesn't do MX processing. If more than one address is given, | |
1625 | chain on additional host items, with other relevant fields copied. | |
1626 | ||
1627 | The second argument provides a host list (usually an IP list) of hosts to | |
1628 | ignore. This makes it possible to ignore IPv6 link-local addresses or loopback | |
1629 | addresses in unreasonable places. | |
1630 | ||
1631 | The lookup may result in a change of name. For compatibility with the dns | |
1632 | lookup, return this via fully_qualified_name as well as updating the host item. | |
1633 | The lookup may also yield more than one IP address, in which case chain on | |
1634 | subsequent host_item structures. | |
1635 | ||
1636 | Arguments: | |
1637 | host a host item with the name and MX filled in; | |
1638 | the address is to be filled in; | |
1639 | multiple IP addresses cause other host items to be | |
1640 | chained on. | |
1641 | ignore_target_hosts a list of hosts to ignore | |
1642 | fully_qualified_name if not NULL, set to point to host name for | |
1643 | compatibility with host_find_bydns | |
1644 | local_host_check TRUE if a check for the local host is wanted | |
1645 | ||
1646 | Returns: HOST_FIND_FAILED Failed to find the host or domain | |
1647 | HOST_FIND_AGAIN Try again later | |
1648 | HOST_FOUND Host found - data filled in | |
1649 | HOST_FOUND_LOCAL Host found and is the local host | |
1650 | */ | |
1651 | ||
1652 | int | |
1653 | host_find_byname(host_item *host, uschar *ignore_target_hosts, | |
1654 | uschar **fully_qualified_name, BOOL local_host_check) | |
1655 | { | |
1656 | int i, yield, times; | |
1657 | uschar **addrlist; | |
1658 | host_item *last = NULL; | |
1659 | BOOL temp_error = FALSE; | |
1660 | ||
1661 | /* In an IPv6 world, we need to scan for both kinds of address, so go round the | |
1662 | loop twice. Note that we have ensured that AF_INET6 is defined even in an IPv4 | |
1663 | world, which makes for slightly tidier code. However, if dns_ipv4_lookup | |
1664 | matches the domain, we also just do IPv4 lookups here (except when testing | |
1665 | standalone). */ | |
1666 | ||
1667 | #if HAVE_IPV6 | |
1668 | int af; | |
1669 | ||
1670 | #ifndef STAND_ALONE | |
1671 | if (dns_ipv4_lookup != NULL && | |
1672 | match_isinlist(host->name, &dns_ipv4_lookup, 0, NULL, NULL, MCL_DOMAIN, | |
1673 | TRUE, NULL) == OK) | |
1674 | { af = AF_INET; times = 1; } | |
1675 | else | |
1676 | #endif /* STAND_ALONE */ | |
1677 | ||
1678 | { af = AF_INET6; times = 2; } | |
1679 | ||
1680 | /* No IPv6 support */ | |
1681 | ||
1682 | #else /* HAVE_IPV6 */ | |
1683 | times = 1; | |
1684 | #endif /* HAVE_IPV6 */ | |
1685 | ||
1686 | /* Initialize the flag that gets set for DNS syntax check errors, so that the | |
1687 | interface to this function can be similar to host_find_bydns. */ | |
1688 | ||
1689 | host_find_failed_syntax = FALSE; | |
1690 | ||
1691 | /* Loop to look up both kinds of address in an IPv6 world */ | |
1692 | ||
1693 | for (i = 1; i <= times; | |
1694 | #if HAVE_IPV6 | |
1695 | af = AF_INET, /* If 2 passes, IPv4 on the second */ | |
1696 | #endif | |
1697 | i++) | |
1698 | { | |
1699 | BOOL ipv4_addr; | |
1700 | int error_num; | |
1701 | struct hostent *hostdata; | |
1702 | ||
1703 | #if HAVE_IPV6 | |
1704 | #if HAVE_GETIPNODEBYNAME | |
1705 | hostdata = getipnodebyname(CS host->name, af, 0, &error_num); | |
1706 | #else | |
1707 | hostdata = gethostbyname2(CS host->name, af); | |
1708 | error_num = h_errno; | |
1709 | #endif | |
1710 | #else | |
1711 | hostdata = gethostbyname(CS host->name); | |
1712 | error_num = h_errno; | |
1713 | #endif | |
1714 | ||
1715 | if (hostdata == NULL) | |
1716 | { | |
1717 | uschar *error; | |
1718 | switch (error_num) | |
1719 | { | |
1720 | case HOST_NOT_FOUND: error = US"HOST_NOT_FOUND"; break; | |
1721 | case TRY_AGAIN: error = US"TRY_AGAIN"; break; | |
1722 | case NO_RECOVERY: error = US"NO_RECOVERY"; break; | |
1723 | case NO_DATA: error = US"NO_DATA"; break; | |
1724 | #if NO_DATA != NO_ADDRESS | |
1725 | case NO_ADDRESS: error = US"NO_ADDRESS"; break; | |
1726 | #endif | |
1727 | default: error = US"?"; break; | |
1728 | } | |
1729 | ||
1730 | DEBUG(D_host_lookup) debug_printf("%s returned %d (%s)\n", | |
1731 | #if HAVE_IPV6 | |
1732 | #if HAVE_GETIPNODEBYNAME | |
1733 | (af == AF_INET6)? "getipnodebyname(af=inet6)" : "getipnodebyname(af=inet)", | |
1734 | #else | |
1735 | (af == AF_INET6)? "gethostbyname2(af=inet6)" : "gethostbyname2(af=inet)", | |
1736 | #endif | |
1737 | #else | |
1738 | "gethostbyname", | |
1739 | #endif | |
1740 | error_num, error); | |
1741 | ||
1742 | if (error_num == TRY_AGAIN || error_num == NO_RECOVERY) temp_error = TRUE; | |
1743 | continue; | |
1744 | } | |
1745 | if ((hostdata->h_addr_list)[0] == NULL) continue; | |
1746 | ||
1747 | /* Replace the name with the fully qualified one if necessary, and fill in | |
1748 | the fully_qualified_name pointer. */ | |
1749 | ||
1750 | if (hostdata->h_name[0] != 0 && | |
1751 | Ustrcmp(host->name, hostdata->h_name) != 0) | |
1752 | host->name = string_copy_dnsdomain((uschar *)hostdata->h_name); | |
1753 | if (fully_qualified_name != NULL) *fully_qualified_name = host->name; | |
1754 | ||
1755 | /* Get the list of addresses. IPv4 and IPv6 addresses can be distinguished | |
1756 | by their different lengths. Scan the list, ignoring any that are to be | |
1757 | ignored, and build a chain from the rest. */ | |
1758 | ||
1759 | ipv4_addr = hostdata->h_length == sizeof(struct in_addr); | |
1760 | ||
1761 | for (addrlist = USS hostdata->h_addr_list; *addrlist != NULL; addrlist++) | |
1762 | { | |
1763 | uschar *text_address = | |
1764 | host_ntoa(ipv4_addr? AF_INET:AF_INET6, *addrlist, NULL, NULL); | |
1765 | ||
1766 | #ifndef STAND_ALONE | |
1767 | if (ignore_target_hosts != NULL && | |
1768 | verify_check_this_host(&ignore_target_hosts, NULL, host->name, | |
1769 | text_address, NULL) == OK) | |
1770 | { | |
1771 | DEBUG(D_host_lookup) | |
1772 | debug_printf("ignored host %s [%s]\n", host->name, text_address); | |
1773 | continue; | |
1774 | } | |
1775 | #endif | |
1776 | ||
1777 | /* If this is the first address, last == NULL and we put the data in the | |
1778 | original block. */ | |
1779 | ||
1780 | if (last == NULL) | |
1781 | { | |
1782 | host->address = text_address; | |
1783 | host->port = PORT_NONE; | |
1784 | host->status = hstatus_unknown; | |
1785 | host->why = hwhy_unknown; | |
1786 | last = host; | |
1787 | } | |
1788 | ||
1789 | /* Else add further host item blocks for any other addresses, keeping | |
1790 | the order. */ | |
1791 | ||
1792 | else | |
1793 | { | |
1794 | host_item *next = store_get(sizeof(host_item)); | |
1795 | next->name = host->name; | |
1796 | next->mx = host->mx; | |
1797 | next->address = text_address; | |
1798 | next->port = PORT_NONE; | |
1799 | next->status = hstatus_unknown; | |
1800 | next->why = hwhy_unknown; | |
1801 | next->last_try = 0; | |
1802 | next->next = last->next; | |
1803 | last->next = next; | |
1804 | last = next; | |
1805 | } | |
1806 | } | |
1807 | } | |
1808 | ||
1809 | /* If no hosts were found, the address field in the original host block will be | |
1810 | NULL. If temp_error is set, at least one of the lookups gave a temporary error, | |
1811 | so we pass that back. */ | |
1812 | ||
1813 | if (host->address == NULL) | |
1814 | { | |
1815 | uschar *msg = | |
1816 | #ifndef STAND_ALONE | |
1817 | (message_id[0] == 0 && smtp_in != NULL)? | |
1818 | string_sprintf("no IP address found for host %s (during %s)", host->name, | |
1819 | smtp_get_connection_info()) : | |
1820 | #endif | |
1821 | string_sprintf("no IP address found for host %s", host->name); | |
1822 | ||
1823 | HDEBUG(D_host_lookup) debug_printf("%s\n", msg); | |
1824 | if (temp_error) return HOST_FIND_AGAIN; | |
1825 | if (host_checking || !log_testing_mode) | |
1826 | log_write(L_host_lookup_failed, LOG_MAIN, "%s", msg); | |
1827 | return HOST_FIND_FAILED; | |
1828 | } | |
1829 | ||
1830 | /* Remove any duplicate IP addresses, then check to see if this is the local | |
1831 | host if required. */ | |
1832 | ||
1833 | host_remove_duplicates(host, &last); | |
1834 | yield = local_host_check? | |
1835 | host_scan_for_local_hosts(host, &last, NULL) : HOST_FOUND; | |
1836 | ||
1837 | /* When running in the test harness, sort into the order of addresses so as to | |
d8ef3577 | 1838 | get repeatability. */ |
059ec3d9 | 1839 | |
d8ef3577 | 1840 | if (running_in_test_harness) sort_addresses(host, last); |
059ec3d9 PH |
1841 | |
1842 | HDEBUG(D_host_lookup) | |
1843 | { | |
1844 | host_item *h; | |
1845 | if (fully_qualified_name != NULL) | |
1846 | debug_printf("fully qualified name = %s\n", *fully_qualified_name); | |
1847 | debug_printf("%s looked up these IP addresses:\n", | |
1848 | #if HAVE_IPV6 | |
1849 | #if HAVE_GETIPNODEBYNAME | |
1850 | "getipnodebyname" | |
1851 | #else | |
1852 | "gethostbyname2" | |
1853 | #endif | |
1854 | #else | |
1855 | "gethostbyname" | |
1856 | #endif | |
1857 | ); | |
1858 | for (h = host; h != last->next; h = h->next) | |
1859 | debug_printf(" name=%s address=%s\n", h->name, | |
1860 | (h->address == NULL)? US"<null>" : h->address); | |
1861 | } | |
1862 | ||
1863 | /* Return the found status. */ | |
1864 | ||
1865 | return yield; | |
1866 | } | |
1867 | ||
1868 | ||
1869 | ||
1870 | /************************************************* | |
1871 | * Fill in a host address from the DNS * | |
1872 | *************************************************/ | |
1873 | ||
1874 | /* Given a host item, with its name and mx fields set, and its address field | |
1875 | set to NULL, fill in its IP address from the DNS. If it is multi-homed, create | |
1876 | additional host items for the additional addresses, copying all the other | |
1877 | fields, and randomizing the order. | |
1878 | ||
1879 | On IPv6 systems, A6 records are sought first (but only if support for A6 is | |
1880 | configured - they may never become mainstream), then AAAA records are sought, | |
1881 | and finally A records are sought as well. | |
1882 | ||
1883 | The host name may be changed if the DNS returns a different name - e.g. fully | |
1884 | qualified or changed via CNAME. If fully_qualified_name is not NULL, dns_lookup | |
1885 | ensures that it points to the fully qualified name. However, this is the fully | |
1886 | qualified version of the original name; if a CNAME is involved, the actual | |
1887 | canonical host name may be different again, and so we get it directly from the | |
1888 | relevant RR. Note that we do NOT change the mx field of the host item in this | |
1889 | function as it may be called to set the addresses of hosts taken from MX | |
1890 | records. | |
1891 | ||
1892 | Arguments: | |
1893 | host points to the host item we're filling in | |
1894 | lastptr points to pointer to last host item in a chain of | |
1895 | host items (may be updated if host is last and gets | |
1896 | extended because multihomed) | |
1897 | ignore_target_hosts list of hosts to ignore | |
1898 | allow_ip if TRUE, recognize an IP address and return it | |
1899 | fully_qualified_name if not NULL, return fully qualified name here if | |
1900 | the contents are different (i.e. it must be preset | |
1901 | to something) | |
1902 | ||
1903 | Returns: HOST_FIND_FAILED couldn't find A record | |
1904 | HOST_FIND_AGAIN try again later | |
1905 | HOST_FOUND found AAAA and/or A record(s) | |
1906 | HOST_IGNORED found, but all IPs ignored | |
1907 | */ | |
1908 | ||
1909 | static int | |
1910 | set_address_from_dns(host_item *host, host_item **lastptr, | |
1911 | uschar *ignore_target_hosts, BOOL allow_ip, uschar **fully_qualified_name) | |
1912 | { | |
1913 | dns_record *rr; | |
1914 | host_item *thishostlast = NULL; /* Indicates not yet filled in anything */ | |
1915 | BOOL v6_find_again = FALSE; | |
1916 | int i; | |
1917 | ||
1918 | /* If allow_ip is set, a name which is an IP address returns that value | |
1919 | as its address. This is used for MX records when allow_mx_to_ip is set, for | |
1920 | those sites that feel they have to flaunt the RFC rules. */ | |
1921 | ||
1922 | if (allow_ip && string_is_ip_address(host->name, NULL) != 0) | |
1923 | { | |
1924 | #ifndef STAND_ALONE | |
1925 | if (ignore_target_hosts != NULL && | |
1926 | verify_check_this_host(&ignore_target_hosts, NULL, host->name, | |
1927 | host->name, NULL) == OK) | |
1928 | return HOST_IGNORED; | |
1929 | #endif | |
1930 | ||
1931 | host->address = host->name; | |
1932 | host->port = PORT_NONE; | |
1933 | return HOST_FOUND; | |
1934 | } | |
1935 | ||
1936 | /* On an IPv6 system, go round the loop up to three times, looking for A6 and | |
1937 | AAAA records the first two times. However, unless doing standalone testing, we | |
1938 | force an IPv4 lookup if the domain matches dns_ipv4_lookup is set. Since A6 | |
1939 | records look like being abandoned, support them only if explicitly configured | |
1940 | to do so. On an IPv4 system, go round the loop once only, looking only for A | |
1941 | records. */ | |
1942 | ||
1943 | #if HAVE_IPV6 | |
1944 | ||
1945 | #ifndef STAND_ALONE | |
1946 | if (dns_ipv4_lookup != NULL && | |
1947 | match_isinlist(host->name, &dns_ipv4_lookup, 0, NULL, NULL, MCL_DOMAIN, | |
1948 | TRUE, NULL) == OK) | |
1949 | i = 0; /* look up A records only */ | |
1950 | else | |
1951 | #endif /* STAND_ALONE */ | |
1952 | ||
1953 | #ifdef SUPPORT_A6 | |
1954 | i = 2; /* look up A6 and AAAA and A records */ | |
1955 | #else | |
1956 | i = 1; /* look up AAAA and A records */ | |
1957 | #endif /* SUPPORT_A6 */ | |
1958 | ||
1959 | /* The IPv4 world */ | |
1960 | ||
1961 | #else /* HAVE_IPV6 */ | |
1962 | i = 0; /* look up A records only */ | |
1963 | #endif /* HAVE_IPV6 */ | |
1964 | ||
1965 | for (; i >= 0; i--) | |
1966 | { | |
1967 | static int types[] = { T_A, T_AAAA, T_A6 }; | |
1968 | int type = types[i]; | |
1969 | int randoffset = (i == 0)? 500 : 0; /* Ensures v6 sorts before v4 */ | |
1970 | dns_answer dnsa; | |
1971 | dns_scan dnss; | |
1972 | ||
1973 | int rc = dns_lookup(&dnsa, host->name, type, fully_qualified_name); | |
1974 | ||
1975 | /* We want to return HOST_FIND_AGAIN if one of the A, A6, or AAAA lookups | |
1976 | fails or times out, but not if another one succeeds. (In the early | |
1977 | IPv6 days there are name servers that always fail on AAAA, but are happy | |
1978 | to give out an A record. We want to proceed with that A record.) */ | |
d8ef3577 | 1979 | |
059ec3d9 PH |
1980 | if (rc != DNS_SUCCEED) |
1981 | { | |
1982 | if (i == 0) /* Just tried for an A record, i.e. end of loop */ | |
1983 | { | |
1984 | if (host->address != NULL) return HOST_FOUND; /* A6 or AAAA was found */ | |
1985 | if (rc == DNS_AGAIN || rc == DNS_FAIL || v6_find_again) | |
1986 | return HOST_FIND_AGAIN; | |
1987 | return HOST_FIND_FAILED; /* DNS_NOMATCH or DNS_NODATA */ | |
1988 | } | |
1989 | ||
1990 | /* Tried for an A6 or AAAA record: remember if this was a temporary | |
1991 | error, and look for the next record type. */ | |
1992 | ||
1993 | if (rc != DNS_NOMATCH && rc != DNS_NODATA) v6_find_again = TRUE; | |
1994 | continue; | |
1995 | } | |
1996 | ||
1997 | /* Lookup succeeded: fill in the given host item with the first non-ignored | |
1998 | address found; create additional items for any others. A single A6 record | |
1999 | may generate more than one address. */ | |
2000 | ||
2001 | for (rr = dns_next_rr(&dnsa, &dnss, RESET_ANSWERS); | |
2002 | rr != NULL; | |
2003 | rr = dns_next_rr(&dnsa, &dnss, RESET_NEXT)) | |
2004 | { | |
2005 | if (rr->type == type) | |
2006 | { | |
2007 | /* dns_address *da = dns_address_from_rr(&dnsa, rr); */ | |
2008 | ||
2009 | dns_address *da; | |
2010 | da = dns_address_from_rr(&dnsa, rr); | |
2011 | ||
2012 | DEBUG(D_host_lookup) | |
2013 | { | |
2014 | if (da == NULL) | |
2015 | debug_printf("no addresses extracted from A6 RR for %s\n", | |
2016 | host->name); | |
2017 | } | |
2018 | ||
2019 | /* This loop runs only once for A and AAAA records, but may run | |
2020 | several times for an A6 record that generated multiple addresses. */ | |
2021 | ||
2022 | for (; da != NULL; da = da->next) | |
2023 | { | |
2024 | #ifndef STAND_ALONE | |
2025 | if (ignore_target_hosts != NULL && | |
2026 | verify_check_this_host(&ignore_target_hosts, NULL, | |
2027 | host->name, da->address, NULL) == OK) | |
2028 | { | |
2029 | DEBUG(D_host_lookup) | |
2030 | debug_printf("ignored host %s [%s]\n", host->name, da->address); | |
2031 | continue; | |
2032 | } | |
2033 | #endif | |
2034 | ||
2035 | /* If this is the first address, stick it in the given host block, | |
2036 | and change the name if the returned RR has a different name. */ | |
2037 | ||
2038 | if (thishostlast == NULL) | |
2039 | { | |
2040 | if (strcmpic(host->name, rr->name) != 0) | |
2041 | host->name = string_copy_dnsdomain(rr->name); | |
2042 | host->address = da->address; | |
2043 | host->port = PORT_NONE; | |
2044 | host->sort_key = host->mx * 1000 + random_number(500) + randoffset; | |
2045 | host->status = hstatus_unknown; | |
2046 | host->why = hwhy_unknown; | |
2047 | thishostlast = host; | |
2048 | } | |
2049 | ||
2050 | /* Not the first address. Check for, and ignore, duplicates. Then | |
2051 | insert in the chain at a random point. */ | |
2052 | ||
2053 | else | |
2054 | { | |
2055 | int new_sort_key; | |
2056 | host_item *next; | |
2057 | ||
2058 | /* End of our local chain is specified by "thishostlast". */ | |
2059 | ||
2060 | for (next = host;; next = next->next) | |
2061 | { | |
2062 | if (Ustrcmp(CS da->address, next->address) == 0) break; | |
2063 | if (next == thishostlast) { next = NULL; break; } | |
2064 | } | |
2065 | if (next != NULL) continue; /* With loop for next address */ | |
2066 | ||
2067 | /* Not a duplicate */ | |
2068 | ||
2069 | new_sort_key = host->mx * 1000 + random_number(500) + randoffset; | |
2070 | next = store_get(sizeof(host_item)); | |
2071 | ||
2072 | /* New address goes first: insert the new block after the first one | |
2073 | (so as not to disturb the original pointer) but put the new address | |
2074 | in the original block. */ | |
2075 | ||
2076 | if (new_sort_key < host->sort_key) | |
2077 | { | |
2078 | *next = *host; | |
2079 | host->next = next; | |
2080 | host->address = da->address; | |
2081 | host->port = PORT_NONE; | |
2082 | host->sort_key = new_sort_key; | |
2083 | if (thishostlast == host) thishostlast = next; /* Local last */ | |
2084 | if (*lastptr == host) *lastptr = next; /* Global last */ | |
2085 | } | |
2086 | ||
2087 | /* Otherwise scan down the addresses for this host to find the | |
2088 | one to insert after. */ | |
2089 | ||
2090 | else | |
2091 | { | |
2092 | host_item *h = host; | |
2093 | while (h != thishostlast) | |
2094 | { | |
2095 | if (new_sort_key < h->next->sort_key) break; | |
2096 | h = h->next; | |
2097 | } | |
2098 | *next = *h; | |
2099 | h->next = next; | |
2100 | next->address = da->address; | |
2101 | next->port = PORT_NONE; | |
2102 | next->sort_key = new_sort_key; | |
2103 | if (h == thishostlast) thishostlast = next; /* Local last */ | |
2104 | if (h == *lastptr) *lastptr = next; /* Global last */ | |
2105 | } | |
2106 | } | |
2107 | } | |
2108 | } | |
2109 | } | |
2110 | } | |
2111 | ||
2112 | /* Control gets here only if the third lookup (the A record) succeeded. | |
2113 | However, the address may not be filled in if it was ignored. */ | |
2114 | ||
2115 | return (host->address == NULL)? HOST_IGNORED : HOST_FOUND; | |
2116 | } | |
2117 | ||
2118 | ||
2119 | ||
2120 | ||
2121 | /************************************************* | |
2122 | * Find IP addresses and names for host via DNS * | |
2123 | *************************************************/ | |
2124 | ||
2125 | /* The input is a host_item structure with the name filled in and the address | |
2126 | field set to NULL. This may be in a chain of other host items. The lookup may | |
2127 | result in more than one IP address, in which case we must created new host | |
2128 | blocks for the additional addresses, and insert them into the chain. The | |
2129 | original name may not be fully qualified. Use the fully_qualified_name argument | |
2130 | to return the official name, as returned by the resolver. | |
2131 | ||
2132 | Arguments: | |
2133 | host point to initial host item | |
2134 | ignore_target_hosts a list of hosts to ignore | |
2135 | whichrrs flags indicating which RRs to look for: | |
2136 | HOST_FIND_BY_SRV => look for SRV | |
2137 | HOST_FIND_BY_MX => look for MX | |
2138 | HOST_FIND_BY_A => look for A or AAAA | |
2139 | also flags indicating how the lookup is done | |
2140 | HOST_FIND_QUALIFY_SINGLE ) passed to the | |
2141 | HOST_FIND_SEARCH_PARENTS ) resolver | |
2142 | srv_service when SRV used, the service name | |
2143 | srv_fail_domains DNS errors for these domains => assume nonexist | |
2144 | mx_fail_domains DNS errors for these domains => assume nonexist | |
2145 | fully_qualified_name if not NULL, return fully-qualified name | |
2146 | removed set TRUE if local host was removed from the list | |
2147 | ||
2148 | Returns: HOST_FIND_FAILED Failed to find the host or domain; | |
2149 | if there was a syntax error, | |
2150 | host_find_failed_syntax is set. | |
2151 | HOST_FIND_AGAIN Could not resolve at this time | |
2152 | HOST_FOUND Host found | |
2153 | HOST_FOUND_LOCAL The lowest MX record points to this | |
2154 | machine, if MX records were found, or | |
2155 | an A record that was found contains | |
2156 | an address of the local host | |
2157 | */ | |
2158 | ||
2159 | int | |
2160 | host_find_bydns(host_item *host, uschar *ignore_target_hosts, int whichrrs, | |
2161 | uschar *srv_service, uschar *srv_fail_domains, uschar *mx_fail_domains, | |
2162 | uschar **fully_qualified_name, BOOL *removed) | |
2163 | { | |
2164 | host_item *h, *last; | |
2165 | dns_record *rr; | |
2166 | int rc = DNS_FAIL; | |
2167 | int ind_type = 0; | |
2168 | int yield; | |
2169 | dns_answer dnsa; | |
2170 | dns_scan dnss; | |
2171 | ||
2172 | /* Set the default fully qualified name to the incoming name, initialize the | |
2173 | resolver if necessary, set up the relevant options, and initialize the flag | |
2174 | that gets set for DNS syntax check errors. */ | |
2175 | ||
2176 | if (fully_qualified_name != NULL) *fully_qualified_name = host->name; | |
2177 | dns_init((whichrrs & HOST_FIND_QUALIFY_SINGLE) != 0, | |
2178 | (whichrrs & HOST_FIND_SEARCH_PARENTS) != 0); | |
2179 | host_find_failed_syntax = FALSE; | |
2180 | ||
2181 | /* First, if requested, look for SRV records. The service name is given; we | |
2182 | assume TCP progocol. DNS domain names are constrained to a maximum of 256 | |
2183 | characters, so the code below should be safe. */ | |
2184 | ||
2185 | if ((whichrrs & HOST_FIND_BY_SRV) != 0) | |
2186 | { | |
2187 | uschar buffer[300]; | |
2188 | uschar *temp_fully_qualified_name = buffer; | |
2189 | int prefix_length; | |
2190 | ||
2191 | (void)sprintf(CS buffer, "_%s._tcp.%n%.256s", srv_service, &prefix_length, | |
2192 | host->name); | |
2193 | ind_type = T_SRV; | |
2194 | ||
2195 | /* Search for SRV records. If the fully qualified name is different to | |
2196 | the input name, pass back the new original domain, without the prepended | |
2197 | magic. */ | |
2198 | ||
2199 | rc = dns_lookup(&dnsa, buffer, ind_type, &temp_fully_qualified_name); | |
2200 | if (temp_fully_qualified_name != buffer && fully_qualified_name != NULL) | |
2201 | *fully_qualified_name = temp_fully_qualified_name + prefix_length; | |
2202 | ||
2203 | /* On DNS failures, we give the "try again" error unless the domain is | |
2204 | listed as one for which we continue. */ | |
2205 | ||
2206 | if (rc == DNS_FAIL || rc == DNS_AGAIN) | |
2207 | { | |
2208 | if (match_isinlist(host->name, &srv_fail_domains, 0, NULL, NULL, MCL_DOMAIN, | |
2209 | TRUE, NULL) != OK) | |
2210 | return HOST_FIND_AGAIN; | |
2211 | DEBUG(D_host_lookup) debug_printf("DNS_%s treated as DNS_NODATA " | |
2212 | "(domain in srv_fail_domains)\n", (rc == DNS_FAIL)? "FAIL":"AGAIN"); | |
2213 | } | |
2214 | } | |
2215 | ||
2216 | /* If we did not find any SRV records, search the DNS for MX records, if | |
2217 | requested to do so. If the result is DNS_NOMATCH, it means there is no such | |
2218 | domain, and there's no point in going on to look for address records with the | |
2219 | same domain. The result will be DNS_NODATA if the domain exists but has no MX | |
2220 | records. On DNS failures, we give the "try again" error unless the domain is | |
2221 | listed as one for which we continue. */ | |
2222 | ||
2223 | if (rc != DNS_SUCCEED && (whichrrs & HOST_FIND_BY_MX) != 0) | |
2224 | { | |
2225 | ind_type = T_MX; | |
2226 | rc = dns_lookup(&dnsa, host->name, ind_type, fully_qualified_name); | |
2227 | if (rc == DNS_NOMATCH) return HOST_FIND_FAILED; | |
2228 | if (rc == DNS_FAIL || rc == DNS_AGAIN) | |
2229 | { | |
2230 | if (match_isinlist(host->name, &mx_fail_domains, 0, NULL, NULL, MCL_DOMAIN, | |
2231 | TRUE, NULL) != OK) | |
2232 | return HOST_FIND_AGAIN; | |
2233 | DEBUG(D_host_lookup) debug_printf("DNS_%s treated as DNS_NODATA " | |
2234 | "(domain in mx_fail_domains)\n", (rc == DNS_FAIL)? "FAIL":"AGAIN"); | |
2235 | } | |
2236 | } | |
2237 | ||
2238 | /* If we haven't found anything yet, and we are requested to do so, try for an | |
2239 | A or AAAA record. If we find it (or them) check to see that it isn't the local | |
2240 | host. */ | |
2241 | ||
2242 | if (rc != DNS_SUCCEED) | |
2243 | { | |
2244 | if ((whichrrs & HOST_FIND_BY_A) == 0) | |
2245 | { | |
2246 | DEBUG(D_host_lookup) debug_printf("Address records are not being sought\n"); | |
2247 | return HOST_FIND_FAILED; | |
2248 | } | |
2249 | ||
2250 | last = host; /* End of local chainlet */ | |
2251 | host->mx = MX_NONE; | |
2252 | host->port = PORT_NONE; | |
2253 | rc = set_address_from_dns(host, &last, ignore_target_hosts, FALSE, | |
2254 | fully_qualified_name); | |
2255 | ||
2256 | /* If one or more address records have been found, check that none of them | |
2257 | are local. Since we know the host items all have their IP addresses | |
2258 | inserted, host_scan_for_local_hosts() can only return HOST_FOUND or | |
2259 | HOST_FOUND_LOCAL. We do not need to scan for duplicate IP addresses here, | |
2260 | because set_address_from_dns() removes them. */ | |
2261 | ||
2262 | if (rc == HOST_FOUND) | |
2263 | rc = host_scan_for_local_hosts(host, &last, removed); | |
2264 | else | |
2265 | if (rc == HOST_IGNORED) rc = HOST_FIND_FAILED; /* No special action */ | |
2266 | ||
d8ef3577 PH |
2267 | /* When running in the test harness, sort into the order of addresses so as |
2268 | to get repeatability. */ | |
2269 | ||
2270 | if (running_in_test_harness) sort_addresses(host, last); | |
2271 | ||
059ec3d9 PH |
2272 | DEBUG(D_host_lookup) |
2273 | { | |
2274 | host_item *h; | |
2275 | if (host->address != NULL) | |
2276 | { | |
2277 | if (fully_qualified_name != NULL) | |
2278 | debug_printf("fully qualified name = %s\n", *fully_qualified_name); | |
2279 | for (h = host; h != last->next; h = h->next) | |
2280 | debug_printf("%s %s mx=%d sort=%d %s\n", h->name, | |
2281 | (h->address == NULL)? US"<null>" : h->address, h->mx, h->sort_key, | |
2282 | (h->status >= hstatus_unusable)? US"*" : US""); | |
2283 | } | |
2284 | } | |
2285 | ||
2286 | return rc; | |
2287 | } | |
2288 | ||
2289 | /* We have found one or more MX or SRV records. Sort them according to | |
2290 | precedence. Put the data for the first one into the existing host block, and | |
2291 | insert new host_item blocks into the chain for the remainder. For equal | |
2292 | precedences one is supposed to randomize the order. To make this happen, the | |
2293 | sorting is actually done on the MX value * 1000 + a random number. This is put | |
2294 | into a host field called sort_key. | |
2295 | ||
2296 | In the case of hosts with both IPv6 and IPv4 addresses, we want to choose the | |
2297 | IPv6 address in preference. At this stage, we don't know what kind of address | |
2298 | the host has. We choose a random number < 500; if later we find an A record | |
2299 | first, we add 500 to the random number. Then for any other address records, we | |
2300 | use random numbers in the range 0-499 for AAAA records and 500-999 for A | |
2301 | records. | |
2302 | ||
2303 | At this point we remove any duplicates that point to the same host, retaining | |
2304 | only the one with the lowest precedence. We cannot yet check for precedence | |
2305 | greater than that of the local host, because that test cannot be properly done | |
2306 | until the addresses have been found - an MX record may point to a name for this | |
2307 | host which is not the primary hostname. */ | |
2308 | ||
2309 | last = NULL; /* Indicates that not even the first item is filled yet */ | |
2310 | ||
2311 | for (rr = dns_next_rr(&dnsa, &dnss, RESET_ANSWERS); | |
2312 | rr != NULL; | |
2313 | rr = dns_next_rr(&dnsa, &dnss, RESET_NEXT)) | |
2314 | { | |
2315 | int precedence; | |
2316 | int weight = 0; /* For SRV records */ | |
2317 | int port = PORT_NONE; /* For SRV records */ | |
2318 | uschar *s; /* MUST be unsigned for GETSHORT */ | |
2319 | uschar data[256]; | |
2320 | ||
2321 | if (rr->type != ind_type) continue; | |
2322 | s = rr->data; | |
2323 | GETSHORT(precedence, s); /* Pointer s is advanced */ | |
2324 | ||
2325 | /* For MX records, we use a random "weight" which causes multiple records of | |
2326 | the same precedence to sort randomly. */ | |
2327 | ||
2328 | if (ind_type == T_MX) | |
2329 | { | |
2330 | weight = random_number(500); | |
2331 | } | |
2332 | ||
2333 | /* SRV records are specified with a port and a weight. The weight is used | |
2334 | in a special algorithm. However, to start with, we just use it to order the | |
2335 | records of equal priority (precedence). */ | |
2336 | ||
2337 | else | |
2338 | { | |
2339 | GETSHORT(weight, s); | |
2340 | GETSHORT(port, s); | |
2341 | } | |
2342 | ||
2343 | /* Get the name of the host pointed to. */ | |
2344 | ||
2345 | (void)dn_expand(dnsa.answer, dnsa.answer + dnsa.answerlen, s, | |
2346 | (DN_EXPAND_ARG4_TYPE)data, sizeof(data)); | |
2347 | ||
2348 | /* Check that we haven't already got this host on the chain; if we have, | |
2349 | keep only the lower precedence. This situation shouldn't occur, but you | |
2350 | never know what junk might get into the DNS (and this case has been seen on | |
2351 | more than one occasion). */ | |
2352 | ||
2353 | if (last != NULL) /* This is not the first record */ | |
2354 | { | |
2355 | host_item *prev = NULL; | |
2356 | ||
2357 | for (h = host; h != last->next; prev = h, h = h->next) | |
2358 | { | |
2359 | if (strcmpic(h->name, data) == 0) | |
2360 | { | |
2361 | DEBUG(D_host_lookup) | |
2362 | debug_printf("discarded duplicate host %s (MX=%d)\n", data, | |
2363 | (precedence > h->mx)? precedence : h->mx); | |
2364 | if (precedence >= h->mx) goto NEXT_MX_RR; /* Skip greater precedence */ | |
2365 | if (h == host) /* Override first item */ | |
2366 | { | |
2367 | h->mx = precedence; | |
2368 | host->sort_key = precedence * 1000 + weight; | |
2369 | goto NEXT_MX_RR; | |
2370 | } | |
2371 | ||
2372 | /* Unwanted host item is not the first in the chain, so we can get | |
2373 | get rid of it by cutting it out. */ | |
2374 | ||
2375 | prev->next = h->next; | |
2376 | if (h == last) last = prev; | |
2377 | break; | |
2378 | } | |
2379 | } | |
2380 | } | |
2381 | ||
2382 | /* If this is the first MX or SRV record, put the data into the existing host | |
2383 | block. Otherwise, add a new block in the correct place; if it has to be | |
2384 | before the first block, copy the first block's data to a new second block. */ | |
2385 | ||
2386 | if (last == NULL) | |
2387 | { | |
2388 | host->name = string_copy_dnsdomain(data); | |
2389 | host->address = NULL; | |
2390 | host->port = port; | |
2391 | host->mx = precedence; | |
2392 | host->sort_key = precedence * 1000 + weight; | |
2393 | host->status = hstatus_unknown; | |
2394 | host->why = hwhy_unknown; | |
2395 | last = host; | |
2396 | } | |
2397 | ||
2398 | /* Make a new host item and seek the correct insertion place */ | |
2399 | ||
2400 | else | |
2401 | { | |
2402 | int sort_key = precedence * 1000 + weight; | |
2403 | host_item *next = store_get(sizeof(host_item)); | |
2404 | next->name = string_copy_dnsdomain(data); | |
2405 | next->address = NULL; | |
2406 | next->port = port; | |
2407 | next->mx = precedence; | |
2408 | next->sort_key = sort_key; | |
2409 | next->status = hstatus_unknown; | |
2410 | next->why = hwhy_unknown; | |
2411 | next->last_try = 0; | |
2412 | ||
2413 | /* Handle the case when we have to insert before the first item. */ | |
2414 | ||
2415 | if (sort_key < host->sort_key) | |
2416 | { | |
2417 | host_item htemp; | |
2418 | htemp = *host; | |
2419 | *host = *next; | |
2420 | *next = htemp; | |
2421 | host->next = next; | |
2422 | if (last == host) last = next; | |
2423 | } | |
2424 | ||
2425 | /* Else scan down the items we have inserted as part of this exercise; | |
2426 | don't go further. */ | |
2427 | ||
2428 | else | |
2429 | { | |
2430 | for (h = host; h != last; h = h->next) | |
2431 | { | |
2432 | if (sort_key < h->next->sort_key) | |
2433 | { | |
2434 | next->next = h->next; | |
2435 | h->next = next; | |
2436 | break; | |
2437 | } | |
2438 | } | |
2439 | ||
2440 | /* Join on after the last host item that's part of this | |
2441 | processing if we haven't stopped sooner. */ | |
2442 | ||
2443 | if (h == last) | |
2444 | { | |
2445 | next->next = last->next; | |
2446 | last->next = next; | |
2447 | last = next; | |
2448 | } | |
2449 | } | |
2450 | } | |
2451 | ||
2452 | NEXT_MX_RR: continue; | |
2453 | } | |
2454 | ||
2455 | /* If the list of hosts was obtained from SRV records, there are two things to | |
2456 | do. First, if there is only one host, and it's name is ".", it means there is | |
2457 | no SMTP service at this domain. Otherwise, we have to sort the hosts of equal | |
2458 | priority according to their weights, using an algorithm that is defined in RFC | |
2459 | 2782. The hosts are currently sorted by priority and weight. For each priority | |
2460 | group we have to pick off one host and put it first, and then repeat for any | |
2461 | remaining in the same priority group. */ | |
2462 | ||
2463 | if (ind_type == T_SRV) | |
2464 | { | |
2465 | host_item **pptr; | |
2466 | ||
2467 | if (host == last && host->name[0] == 0) | |
2468 | { | |
2469 | DEBUG(D_host_lookup) debug_printf("the single SRV record is \".\"\n"); | |
2470 | return HOST_FIND_FAILED; | |
2471 | } | |
2472 | ||
2473 | DEBUG(D_host_lookup) | |
2474 | { | |
2475 | debug_printf("original ordering of hosts from SRV records:\n"); | |
2476 | for (h = host; h != last->next; h = h->next) | |
2477 | debug_printf(" %s P=%d W=%d\n", h->name, h->mx, h->sort_key % 1000); | |
2478 | } | |
2479 | ||
2480 | for (pptr = &host, h = host; h != last; pptr = &(h->next), h = h->next) | |
2481 | { | |
2482 | int sum = 0; | |
2483 | host_item *hh; | |
2484 | ||
2485 | /* Find the last following host that has the same precedence. At the same | |
2486 | time, compute the sum of the weights and the running totals. These can be | |
2487 | stored in the sort_key field. */ | |
2488 | ||
2489 | for (hh = h; hh != last; hh = hh->next) | |
2490 | { | |
2491 | int weight = hh->sort_key % 1000; /* was precedence * 1000 + weight */ | |
2492 | sum += weight; | |
2493 | hh->sort_key = sum; | |
2494 | if (hh->mx != hh->next->mx) break; | |
2495 | } | |
2496 | ||
2497 | /* If there's more than one host at this precedence (priority), we need to | |
2498 | pick one to go first. */ | |
2499 | ||
2500 | if (hh != h) | |
2501 | { | |
2502 | host_item *hhh; | |
2503 | host_item **ppptr; | |
2504 | int randomizer = random_number(sum + 1); | |
2505 | ||
2506 | for (ppptr = pptr, hhh = h; | |
2507 | hhh != hh; | |
2508 | ppptr = &(hhh->next), hhh = hhh->next) | |
2509 | { | |
2510 | if (hhh->sort_key >= randomizer) break; | |
2511 | } | |
2512 | ||
2513 | /* hhh now points to the host that should go first; ppptr points to the | |
2514 | place that points to it. Unfortunately, if the start of the minilist is | |
2515 | the start of the entire list, we can't just swap the items over, because | |
2516 | we must not change the value of host, since it is passed in from outside. | |
2517 | One day, this could perhaps be changed. | |
2518 | ||
2519 | The special case is fudged by putting the new item *second* in the chain, | |
2520 | and then transferring the data between the first and second items. We | |
2521 | can't just swap the first and the chosen item, because that would mean | |
2522 | that an item with zero weight might no longer be first. */ | |
2523 | ||
2524 | if (hhh != h) | |
2525 | { | |
2526 | *ppptr = hhh->next; /* Cuts it out of the chain */ | |
2527 | ||
2528 | if (h == host) | |
2529 | { | |
2530 | host_item temp = *h; | |
2531 | *h = *hhh; | |
2532 | *hhh = temp; | |
2533 | hhh->next = temp.next; | |
2534 | h->next = hhh; | |
2535 | } | |
2536 | ||
2537 | else | |
2538 | { | |
2539 | hhh->next = h; /* The rest of the chain follows it */ | |
2540 | *pptr = hhh; /* It takes the place of h */ | |
2541 | h = hhh; /* It's now the start of this minilist */ | |
2542 | } | |
2543 | } | |
2544 | } | |
2545 | ||
2546 | /* A host has been chosen to be first at this priority and h now points | |
2547 | to this host. There may be others at the same priority, or others at a | |
2548 | different priority. Before we leave this host, we need to put back a sort | |
2549 | key of the traditional MX kind, in case this host is multihomed, because | |
2550 | the sort key is used for ordering the multiple IP addresses. We do not need | |
2551 | to ensure that these new sort keys actually reflect the order of the hosts, | |
2552 | however. */ | |
2553 | ||
2554 | h->sort_key = h->mx * 1000 + random_number(500); | |
2555 | } /* Move on to the next host */ | |
2556 | } | |
2557 | ||
2558 | /* Now we have to ensure addresses exist for all the hosts. We have ensured | |
2559 | above that the names in the host items are all unique. The addresses may have | |
2560 | been returned in the additional data section of the DNS query. Because it is | |
2561 | more expensive to scan the returned DNS records (because you have to expand the | |
2562 | names) we do a single scan over them, and multiple scans of the chain of host | |
2563 | items (which is typically only 3 or 4 long anyway.) Add extra host items for | |
2564 | multi-homed hosts. */ | |
2565 | ||
2566 | for (rr = dns_next_rr(&dnsa, &dnss, RESET_ADDITIONAL); | |
2567 | rr != NULL; | |
2568 | rr = dns_next_rr(&dnsa, &dnss, RESET_NEXT)) | |
2569 | { | |
2570 | dns_address *da; | |
2571 | int status = hstatus_unknown; | |
2572 | int why = hwhy_unknown; | |
2573 | int randoffset; | |
2574 | ||
2575 | if (rr->type != T_A | |
2576 | #if HAVE_IPV6 | |
2577 | && rr->type != T_AAAA | |
2578 | #ifdef SUPPORT_A6 | |
2579 | && rr->type != T_A6 | |
2580 | #endif | |
2581 | #endif | |
2582 | ) continue; | |
2583 | ||
2584 | /* Find the first host that matches this record's name. If there isn't | |
2585 | one, move on to the next RR. */ | |
2586 | ||
2587 | for (h = host; h != last->next; h = h->next) | |
2588 | { if (strcmpic(h->name, rr->name) == 0) break; } | |
2589 | if (h == last->next) continue; | |
2590 | ||
2591 | /* For IPv4 addresses, add 500 to the random part of the sort key, to ensure | |
2592 | they sort after IPv6 addresses. */ | |
2593 | ||
2594 | randoffset = (rr->type == T_A)? 500 : 0; | |
2595 | ||
2596 | /* Get the list of textual addresses for this RR. There may be more than one | |
2597 | if it is an A6 RR. Then loop to handle multiple addresses from an A6 record. | |
2598 | If there are none, nothing will get done - the record is ignored. */ | |
2599 | ||
2600 | for (da = dns_address_from_rr(&dnsa, rr); da != NULL; da = da->next) | |
2601 | { | |
2602 | /* Set status for an ignorable host. */ | |
2603 | ||
2604 | #ifndef STAND_ALONE | |
2605 | if (ignore_target_hosts != NULL && | |
2606 | verify_check_this_host(&ignore_target_hosts, NULL, h->name, | |
2607 | da->address, NULL) == OK) | |
2608 | { | |
2609 | DEBUG(D_host_lookup) | |
2610 | debug_printf("ignored host %s [%s]\n", h->name, da->address); | |
2611 | status = hstatus_unusable; | |
2612 | why = hwhy_ignored; | |
2613 | } | |
2614 | #endif | |
2615 | ||
2616 | /* If the address is already set for this host, it may be that | |
2617 | we just have a duplicate DNS record. Alternatively, this may be | |
2618 | a multi-homed host. Search all items with the same host name | |
2619 | (they will all be together) and if this address is found, skip | |
2620 | to the next RR. */ | |
2621 | ||
2622 | if (h->address != NULL) | |
2623 | { | |
2624 | int new_sort_key; | |
2625 | host_item *thishostlast; | |
2626 | host_item *hh = h; | |
2627 | ||
2628 | do | |
2629 | { | |
2630 | if (hh->address != NULL && Ustrcmp(CS da->address, hh->address) == 0) | |
2631 | goto DNS_NEXT_RR; /* Need goto to escape from inner loop */ | |
2632 | thishostlast = hh; | |
2633 | hh = hh->next; | |
2634 | } | |
2635 | while (hh != last->next && strcmpic(hh->name, rr->name) == 0); | |
2636 | ||
2637 | /* We have a multi-homed host, since we have a new address for | |
2638 | an existing name. Create a copy of the current item, and give it | |
2639 | the new address. RRs can be in arbitrary order, but one is supposed | |
2640 | to randomize the addresses of multi-homed hosts, so compute a new | |
2641 | sorting key and do that. [Latest SMTP RFC says not to randomize multi- | |
2642 | homed hosts, but to rely on the resolver. I'm not happy about that - | |
2643 | caching in the resolver will not rotate as often as the name server | |
2644 | does.] */ | |
2645 | ||
2646 | new_sort_key = h->mx * 1000 + random_number(500) + randoffset; | |
2647 | hh = store_get(sizeof(host_item)); | |
2648 | ||
2649 | /* New address goes first: insert the new block after the first one | |
2650 | (so as not to disturb the original pointer) but put the new address | |
2651 | in the original block. */ | |
2652 | ||
2653 | if (new_sort_key < h->sort_key) | |
2654 | { | |
2655 | *hh = *h; /* Note: copies the port */ | |
2656 | h->next = hh; | |
2657 | h->address = da->address; | |
2658 | h->sort_key = new_sort_key; | |
2659 | h->status = status; | |
2660 | h->why = why; | |
2661 | } | |
2662 | ||
2663 | /* Otherwise scan down the addresses for this host to find the | |
2664 | one to insert after. */ | |
2665 | ||
2666 | else | |
2667 | { | |
2668 | while (h != thishostlast) | |
2669 | { | |
2670 | if (new_sort_key < h->next->sort_key) break; | |
2671 | h = h->next; | |
2672 | } | |
2673 | *hh = *h; /* Note: copies the port */ | |
2674 | h->next = hh; | |
2675 | hh->address = da->address; | |
2676 | hh->sort_key = new_sort_key; | |
2677 | hh->status = status; | |
2678 | hh->why = why; | |
2679 | } | |
2680 | ||
2681 | if (h == last) last = hh; /* Inserted after last */ | |
2682 | } | |
2683 | ||
2684 | /* The existing item doesn't have its address set yet, so just set it. | |
2685 | Ensure that an IPv4 address gets its sort key incremented in case an IPv6 | |
2686 | address is found later. */ | |
2687 | ||
2688 | else | |
2689 | { | |
2690 | h->address = da->address; /* Port should be set already */ | |
2691 | h->status = status; | |
2692 | h->why = why; | |
2693 | h->sort_key += randoffset; | |
2694 | } | |
2695 | } /* Loop for addresses extracted from one RR */ | |
2696 | ||
2697 | /* Carry on to the next RR. It would be nice to be able to be able to stop | |
2698 | when every host on the list has an address, but we can't be sure there won't | |
2699 | be an additional address for a multi-homed host further down the list, so | |
2700 | we have to continue to the end. */ | |
2701 | ||
2702 | DNS_NEXT_RR: continue; | |
2703 | } | |
2704 | ||
2705 | /* Set the default yield to failure */ | |
2706 | ||
2707 | yield = HOST_FIND_FAILED; | |
2708 | ||
2709 | /* If we haven't found all the addresses in the additional section, we | |
2710 | need to search for A or AAAA records explicitly. The names shouldn't point to | |
2711 | CNAMES, but we use the general lookup function that handles them, just | |
2712 | in case. If any lookup gives a soft error, change the default yield. | |
2713 | ||
2714 | For these DNS lookups, we must disable qualify_single and search_parents; | |
2715 | otherwise invalid host names obtained from MX or SRV records can cause trouble | |
2716 | if they happen to match something local. */ | |
2717 | ||
2718 | dns_init(FALSE, FALSE); | |
2719 | ||
2720 | for (h = host; h != last->next; h = h->next) | |
2721 | { | |
2722 | if (h->address != NULL || h->status == hstatus_unusable) continue; | |
2723 | rc = set_address_from_dns(h, &last, ignore_target_hosts, allow_mx_to_ip, NULL); | |
2724 | if (rc != HOST_FOUND) | |
2725 | { | |
2726 | h->status = hstatus_unusable; | |
2727 | if (rc == HOST_FIND_AGAIN) | |
2728 | { | |
2729 | yield = rc; | |
2730 | h->why = hwhy_deferred; | |
2731 | } | |
2732 | else | |
2733 | h->why = (rc == HOST_IGNORED)? hwhy_ignored : hwhy_failed; | |
2734 | } | |
2735 | } | |
2736 | ||
2737 | /* Scan the list for any hosts that are marked unusable because they have | |
2738 | been explicitly ignored, and remove them from the list, as if they did not | |
2739 | exist. If we end up with just a single, ignored host, flatten its fields as if | |
2740 | nothing was found. */ | |
2741 | ||
2742 | if (ignore_target_hosts != NULL) | |
2743 | { | |
2744 | host_item *prev = NULL; | |
2745 | for (h = host; h != last->next; h = h->next) | |
2746 | { | |
2747 | REDO: | |
2748 | if (h->why != hwhy_ignored) /* Non ignored host, just continue */ | |
2749 | prev = h; | |
2750 | else if (prev == NULL) /* First host is ignored */ | |
2751 | { | |
2752 | if (h != last) /* First is not last */ | |
2753 | { | |
2754 | if (h->next == last) last = h; /* Overwrite it with next */ | |
2755 | *h = *(h->next); /* and reprocess it. */ | |
2756 | goto REDO; /* C should have redo, like Perl */ | |
2757 | } | |
2758 | } | |
2759 | else /* Ignored host is not first - */ | |
2760 | { /* cut it out */ | |
2761 | prev->next = h->next; | |
2762 | if (h == last) last = prev; | |
2763 | } | |
2764 | } | |
2765 | ||
2766 | if (host->why == hwhy_ignored) host->address = NULL; | |
2767 | } | |
2768 | ||
2769 | /* There is still one complication in the case of IPv6. Although the code above | |
2770 | arranges that IPv6 addresses take precedence over IPv4 addresses for multihomed | |
2771 | hosts, it doesn't do this for addresses that apply to different hosts with the | |
2772 | same MX precedence, because the sorting on MX precedence happens first. So we | |
2773 | have to make another pass to check for this case. We ensure that, within a | |
2774 | single MX preference value, IPv6 addresses come first. This can separate the | |
2775 | addresses of a multihomed host, but that should not matter. */ | |
2776 | ||
2777 | #if HAVE_IPV6 | |
2778 | if (h != last) | |
2779 | { | |
2780 | for (h = host; h != last; h = h->next) | |
2781 | { | |
2782 | host_item temp; | |
2783 | host_item *next = h->next; | |
2784 | if (h->mx != next->mx || /* If next is different MX value */ | |
2785 | (h->sort_key % 1000) < 500 || /* OR this one is IPv6 */ | |
2786 | (next->sort_key % 1000) >= 500) /* OR next is IPv4 */ | |
2787 | continue; /* move on to next */ | |
2788 | temp = *h; | |
2789 | temp.next = next->next; | |
2790 | *h = *next; | |
2791 | h->next = next; | |
2792 | *next = temp; | |
2793 | } | |
2794 | } | |
2795 | #endif | |
2796 | ||
2797 | /* When running in the test harness, we want the hosts always to be in the same | |
2798 | order so that the debugging output is the same and can be compared. Having a | |
2799 | fixed set of "random" numbers doesn't actually achieve this, because the RRs | |
2800 | come back from the resolver in a random order, so the non-random random numbers | |
2801 | get used in a different order. We therefore have to sort the hosts that have | |
2802 | the same MX values. We chose do to this by their name and then by IP address. | |
2803 | The fact that the sort is slow matters not - this is testing only! */ | |
2804 | ||
2805 | if (running_in_test_harness) | |
2806 | { | |
2807 | BOOL done; | |
2808 | do | |
2809 | { | |
2810 | done = TRUE; | |
2811 | for (h = host; h != last; h = h->next) | |
2812 | { | |
2813 | int c = Ustrcmp(h->name, h->next->name); | |
2814 | if (c == 0) c = Ustrcmp(h->address, h->next->address); | |
2815 | if (h->mx == h->next->mx && c > 0) | |
2816 | { | |
2817 | host_item *next = h->next; | |
2818 | host_item temp = *h; | |
2819 | temp.next = next->next; | |
2820 | *h = *next; | |
2821 | h->next = next; | |
2822 | *next = temp; | |
2823 | done = FALSE; | |
2824 | } | |
2825 | } | |
2826 | } | |
2827 | while (!done); | |
2828 | } | |
2829 | ||
2830 | /* Remove any duplicate IP addresses and then scan the list of hosts for any | |
2831 | whose IP addresses are on the local host. If any are found, all hosts with the | |
2832 | same or higher MX values are removed. However, if the local host has the lowest | |
2833 | numbered MX, then HOST_FOUND_LOCAL is returned. Otherwise, if at least one host | |
2834 | with an IP address is on the list, HOST_FOUND is returned. Otherwise, | |
2835 | HOST_FIND_FAILED is returned, but in this case do not update the yield, as it | |
2836 | might have been set to HOST_FIND_AGAIN just above here. If not, it will already | |
2837 | be HOST_FIND_FAILED. */ | |
2838 | ||
2839 | host_remove_duplicates(host, &last); | |
2840 | rc = host_scan_for_local_hosts(host, &last, removed); | |
2841 | if (rc != HOST_FIND_FAILED) yield = rc; | |
2842 | ||
2843 | DEBUG(D_host_lookup) | |
2844 | { | |
2845 | if (fully_qualified_name != NULL) | |
2846 | debug_printf("fully qualified name = %s\n", *fully_qualified_name); | |
2847 | debug_printf("host_find_bydns yield = %s (%d); returned hosts:\n", | |
2848 | (yield == HOST_FOUND)? "HOST_FOUND" : | |
2849 | (yield == HOST_FOUND_LOCAL)? "HOST_FOUND_LOCAL" : | |
2850 | (yield == HOST_FIND_AGAIN)? "HOST_FIND_AGAIN" : | |
2851 | (yield == HOST_FIND_FAILED)? "HOST_FIND_FAILED" : "?", | |
2852 | yield); | |
2853 | for (h = host; h != last->next; h = h->next) | |
2854 | { | |
2855 | debug_printf(" %s %s MX=%d ", h->name, | |
2856 | (h->address == NULL)? US"<null>" : h->address, h->mx); | |
2857 | if (h->port != PORT_NONE) debug_printf("port=%d ", h->port); | |
2858 | if (h->status >= hstatus_unusable) debug_printf("*"); | |
2859 | debug_printf("\n"); | |
2860 | } | |
2861 | } | |
2862 | ||
2863 | return yield; | |
2864 | } | |
2865 | ||
2866 | ||
2867 | ||
2868 | ||
2869 | /************************************************* | |
2870 | ************************************************** | |
2871 | * Stand-alone test program * | |
2872 | ************************************************** | |
2873 | *************************************************/ | |
2874 | ||
2875 | #ifdef STAND_ALONE | |
2876 | ||
2877 | BOOL alldigits(uschar *buffer) | |
2878 | { | |
2879 | if (!isdigit(*buffer)) return FALSE; | |
2880 | if (*buffer == '0' && buffer[1] == 'x') | |
2881 | { | |
2882 | buffer++; | |
2883 | while (isxdigit(*(++buffer))); | |
2884 | } | |
2885 | else while (isdigit(*(++buffer))); | |
2886 | return (*buffer == 0); | |
2887 | } | |
2888 | ||
2889 | int main(int argc, char **cargv) | |
2890 | { | |
2891 | host_item h; | |
2892 | int whichrrs = HOST_FIND_BY_MX | HOST_FIND_BY_A; | |
2893 | BOOL byname = FALSE; | |
2894 | BOOL qualify_single = TRUE; | |
2895 | BOOL search_parents = FALSE; | |
2896 | uschar **argv = USS cargv; | |
2897 | uschar buffer[256]; | |
2898 | ||
2899 | primary_hostname = US""; | |
2900 | store_pool = POOL_MAIN; | |
2901 | debug_selector = D_host_lookup|D_interface; | |
2902 | debug_file = stdout; | |
2903 | debug_fd = fileno(debug_file); | |
2904 | ||
2905 | printf("Exim stand-alone host functions test\n"); | |
2906 | ||
2907 | host_find_interfaces(); | |
2908 | debug_selector = D_host_lookup | D_dns; | |
2909 | ||
2910 | if (argc > 1) primary_hostname = argv[1]; | |
2911 | ||
2912 | /* So that debug level changes can be done first */ | |
2913 | ||
2914 | dns_init(qualify_single, search_parents); | |
2915 | ||
2916 | printf("Testing host lookup\n"); | |
2917 | printf("> "); | |
2918 | while (Ufgets(buffer, 256, stdin) != NULL) | |
2919 | { | |
2920 | int rc; | |
2921 | int len = Ustrlen(buffer); | |
2922 | uschar *fully_qualified_name; | |
2923 | ||
2924 | while (len > 0 && isspace(buffer[len-1])) len--; | |
2925 | buffer[len] = 0; | |
2926 | ||
2927 | if (Ustrcmp(buffer, "q") == 0) break; | |
2928 | ||
2929 | if (Ustrcmp(buffer, "byname") == 0) byname = TRUE; | |
2930 | else if (Ustrcmp(buffer, "no_byname") == 0) byname = FALSE; | |
2931 | else if (Ustrcmp(buffer, "a_only") == 0) whichrrs = HOST_FIND_BY_A; | |
2932 | else if (Ustrcmp(buffer, "mx_only") == 0) whichrrs = HOST_FIND_BY_MX; | |
2933 | else if (Ustrcmp(buffer, "srv_only") == 0) whichrrs = HOST_FIND_BY_SRV; | |
2934 | else if (Ustrcmp(buffer, "srv+a") == 0) | |
2935 | whichrrs = HOST_FIND_BY_SRV | HOST_FIND_BY_A; | |
2936 | else if (Ustrcmp(buffer, "srv+mx") == 0) | |
2937 | whichrrs = HOST_FIND_BY_SRV | HOST_FIND_BY_MX; | |
2938 | else if (Ustrcmp(buffer, "srv+mx+a") == 0) | |
2939 | whichrrs = HOST_FIND_BY_SRV | HOST_FIND_BY_MX | HOST_FIND_BY_A; | |
2940 | else if (Ustrcmp(buffer, "qualify_single") == 0) qualify_single = TRUE; | |
2941 | else if (Ustrcmp(buffer, "no_qualify_single") == 0) qualify_single = FALSE; | |
2942 | else if (Ustrcmp(buffer, "search_parents") == 0) search_parents = TRUE; | |
2943 | else if (Ustrcmp(buffer, "no_search_parents") == 0) search_parents = FALSE; | |
2944 | else if (Ustrncmp(buffer, "retrans", 7) == 0) | |
2945 | { | |
2946 | sscanf(CS(buffer+8), "%d", &dns_retrans); | |
2947 | _res.retrans = dns_retrans; | |
2948 | } | |
2949 | else if (Ustrncmp(buffer, "retry", 5) == 0) | |
2950 | { | |
2951 | sscanf(CS(buffer+6), "%d", &dns_retry); | |
2952 | _res.retry = dns_retry; | |
2953 | } | |
2954 | else if (alldigits(buffer)) | |
2955 | { | |
2956 | debug_selector = Ustrtol(buffer, NULL, 0); | |
2957 | _res.options &= ~RES_DEBUG; | |
2958 | DEBUG(D_resolver) _res.options |= RES_DEBUG; | |
2959 | } | |
2960 | else | |
2961 | { | |
2962 | int flags = whichrrs; | |
2963 | ||
2964 | h.name = buffer; | |
2965 | h.next = NULL; | |
2966 | h.mx = MX_NONE; | |
2967 | h.port = PORT_NONE; | |
2968 | h.status = hstatus_unknown; | |
2969 | h.why = hwhy_unknown; | |
2970 | h.address = NULL; | |
2971 | ||
2972 | if (qualify_single) flags |= HOST_FIND_QUALIFY_SINGLE; | |
2973 | if (search_parents) flags |= HOST_FIND_SEARCH_PARENTS; | |
2974 | ||
2975 | rc = byname? | |
2976 | host_find_byname(&h, NULL, &fully_qualified_name, TRUE) | |
2977 | : | |
2978 | host_find_bydns(&h, NULL, flags, US"smtp", NULL, NULL, | |
2979 | &fully_qualified_name, NULL); | |
2980 | ||
2981 | if (rc == HOST_FIND_FAILED) printf("Failed\n"); | |
2982 | else if (rc == HOST_FIND_AGAIN) printf("Again\n"); | |
2983 | else if (rc == HOST_FOUND_LOCAL) printf("Local\n"); | |
2984 | } | |
2985 | ||
2986 | printf("\n> "); | |
2987 | } | |
2988 | ||
2989 | printf("Testing host_aton\n"); | |
2990 | printf("> "); | |
2991 | while (Ufgets(buffer, 256, stdin) != NULL) | |
2992 | { | |
2993 | int i; | |
2994 | int x[4]; | |
2995 | int len = Ustrlen(buffer); | |
2996 | ||
2997 | while (len > 0 && isspace(buffer[len-1])) len--; | |
2998 | buffer[len] = 0; | |
2999 | ||
3000 | if (Ustrcmp(buffer, "q") == 0) break; | |
3001 | ||
3002 | len = host_aton(buffer, x); | |
3003 | printf("length = %d ", len); | |
3004 | for (i = 0; i < len; i++) | |
3005 | { | |
3006 | printf("%04x ", (x[i] >> 16) & 0xffff); | |
3007 | printf("%04x ", x[i] & 0xffff); | |
3008 | } | |
3009 | printf("\n> "); | |
3010 | } | |
3011 | ||
3012 | printf("\n"); | |
3013 | ||
3014 | printf("Testing host_name_lookup\n"); | |
3015 | printf("> "); | |
3016 | while (Ufgets(buffer, 256, stdin) != NULL) | |
3017 | { | |
3018 | int len = Ustrlen(buffer); | |
3019 | while (len > 0 && isspace(buffer[len-1])) len--; | |
3020 | buffer[len] = 0; | |
3021 | if (Ustrcmp(buffer, "q") == 0) break; | |
3022 | sender_host_address = buffer; | |
3023 | sender_host_name = NULL; | |
3024 | sender_host_aliases = NULL; | |
3025 | host_lookup_msg = US""; | |
3026 | host_lookup_failed = FALSE; | |
3027 | if (host_name_lookup() == FAIL) /* Debug causes printing */ | |
3028 | printf("Lookup failed:%s\n", host_lookup_msg); | |
3029 | printf("\n> "); | |
3030 | } | |
3031 | ||
3032 | printf("\n"); | |
3033 | ||
3034 | return 0; | |
3035 | } | |
3036 | #endif /* STAND_ALONE */ | |
3037 | ||
3038 | /* End of host.c */ |