2 * Copyright (c) 2008-2014, Simon Schubert <2@0x2c.org>.
3 * Copyright (c) 2008 The DragonFly Project. All rights reserved.
5 * This code is derived from software contributed to The DragonFly Project
6 * by Simon Schubert <2@0x2c.org>.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
18 * 3. Neither the name of The DragonFly Project nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific, prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
30 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
31 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 #include <sys/types.h>
37 #include <netinet/in.h>
38 #include <arpa/inet.h>
39 #include <arpa/nameser.h>
49 sort_pref(const void *a, const void *b)
51 const struct mx_hostentry *ha = a, *hb = b;
54 /* sort increasing by preference primarily */
55 v = ha->pref - hb->pref;
59 /* sort PF_INET6 before PF_INET */
60 v = - (ha->ai.ai_family - hb->ai.ai_family);
65 add_host(int pref, const char *host, int port, struct mx_hostentry **he, size_t *ps)
67 struct addrinfo hints, *res, *res0 = NULL;
69 struct mx_hostentry *p;
70 const int count_inc = 10;
73 memset(&hints, 0, sizeof(hints));
74 hints.ai_family = PF_UNSPEC;
75 hints.ai_socktype = SOCK_STREAM;
76 hints.ai_protocol = IPPROTO_TCP;
78 snprintf(servname, sizeof(servname), "%d", port);
79 err = getaddrinfo(host, servname, &hints, &res0);
81 return (err == EAI_AGAIN ? 1 : -1);
83 for (res = res0; res != NULL; res = res->ai_next) {
84 if (*ps + 1 >= roundup(*ps, count_inc)) {
85 size_t newsz = roundup(*ps + 2, count_inc);
86 *he = reallocf(*he, newsz * sizeof(**he));
92 strlcpy(p->host, host, sizeof(p->host));
96 bcopy(res->ai_addr, &p->sa, p->ai.ai_addrlen);
98 getnameinfo((struct sockaddr *)&p->sa, p->ai.ai_addrlen,
99 p->addr, sizeof(p->addr),
100 NULL, 0, NI_NUMERICHOST);
115 dns_get_mx_list(const char *host, int port, struct mx_hostentry **he, int no_mx)
117 char outname[MAXDNAME];
120 const char *searchhost;
121 const unsigned char *cp;
123 struct mx_hostentry *hosts = NULL;
145 err = res_search(searchhost, ns_c_in, ns_t_mx, ans, anssz);
150 * Host exists, but no MX (or CNAME) entry.
151 * Not an error, use host name instead.
155 /* transient error */
165 if (!ns_initparse(ans, anssz, &msg))
168 switch (ns_msg_getflag(msg, ns_f_rcode)) {
177 for (i = 0; i < ns_msg_count(msg, ns_s_an); i++) {
178 if (ns_parserr(&msg, ns_s_an, i, &rr))
181 cp = ns_rr_rdata(rr);
183 switch (ns_rr_type(rr)) {
188 err = ns_name_uncompress(ns_msg_base(msg), ns_msg_end(msg),
189 cp, outname, sizeof(outname));
193 err = add_host(pref, outname, port, &hosts, &nhosts);
199 err = ns_name_uncompress(ns_msg_base(msg), ns_msg_end(msg),
200 cp, outname, sizeof(outname));
204 /* Prevent a CNAME loop */
205 if (cname_recurse++ > 10)
208 searchhost = outname;
233 * If we didn't find any MX, use the hostname instead.
235 err = add_host(0, host, port, &hosts, &nhosts);
236 } else if (nhosts == 0) {
238 * We did get MX, but couldn't resolve any of them
239 * due to transient errors.
246 qsort(hosts, nhosts, sizeof(*hosts), sort_pref);
248 *hosts[nhosts].host = 0;
266 main(int argc, char **argv)
268 struct mx_hostentry *he, *p;
271 err = dns_get_mx_list(argv[1], 53, &he, 0);
275 for (p = he; *p->host != 0; p++) {
276 printf("%d\t%s\t%s\n", p->pref, p->host, p->addr);