e8bdbb413db55a5e6c4b40bfe10a1351a7bee891
2 * copyright (c) 2001-2011 Emil Mikulic.
4 * dns.c: synchronous DNS in a child process.
6 * You may use, modify and redistribute this file under the terms of the
7 * GNU General Public License version 2. (see COPYING.GPL)
19 #include "bsd.h" /* for setproctitle, strlcpy */
21 #include <sys/param.h>
22 #include <sys/socket.h>
32 static void dns_main(void) _noreturn_
; /* the child process runs this */
34 #define CHILD 0 /* child process uses this socket */
37 static pid_t pid
= -1;
41 int error
; /* for gai_strerror(), or 0 if no error */
42 char name
[256]; /* http://tools.ietf.org/html/rfc1034#section-3.1 */
46 dns_init(const char *privdrop_user
)
48 if (socketpair(AF_UNIX
, SOCK_STREAM
, 0, sock
) == -1)
56 /* We are the child. */
57 privdrop(NULL
/* don't chroot */, privdrop_user
);
60 daemonize_finish(); /* drop our copy of the lifeline! */
61 if (signal(SIGUSR1
, SIG_IGN
) == SIG_ERR
)
62 errx(1, "signal(SIGUSR1, ignore) failed");
64 verbosef("fell out of dns_main()");
67 /* We are the parent. */
70 fd_set_nonblock(sock
[PARENT
]);
71 verbosef("DNS child has PID %d", pid
);
79 return; /* no child was started */
81 if (kill(pid
, SIGINT
) == -1)
83 verbosef("dns_stop() waiting for child");
84 if (waitpid(pid
, NULL
, 0) == -1)
86 verbosef("dns_stop() done waiting for child");
90 RB_ENTRY(tree_rec
) ptree
;
95 tree_cmp(struct tree_rec
*a
, struct tree_rec
*b
)
97 if (a
->ip
.family
!= b
->ip
.family
)
98 /* Sort IPv4 to the left of IPv6. */
99 return ((a
->ip
.family
== IPv4
) ? -1 : +1);
101 if (a
->ip
.family
== IPv4
)
102 return (memcmp(&a
->ip
.ip
.v4
, &b
->ip
.ip
.v4
, sizeof(a
->ip
.ip
.v4
)));
104 assert(a
->ip
.family
== IPv6
);
105 return (memcmp(&a
->ip
.ip
.v6
, &b
->ip
.ip
.v6
, sizeof(a
->ip
.ip
.v6
)));
109 static RB_HEAD(tree_t
, tree_rec
) ip_tree
= RB_INITIALIZER(&tree_rec
);
110 /* Quiet warnings. */
111 static struct tree_rec
* tree_t_RB_NEXT(struct tree_rec
*elm
)
113 static struct tree_rec
* tree_t_RB_MINMAX(struct tree_t
*head
, int val
)
115 RB_GENERATE(tree_t
, tree_rec
, ptree
, tree_cmp
)
118 dns_queue(const struct addr
*const ipaddr
)
120 struct tree_rec
*rec
;
124 return; /* no child was started - we're not doing any DNS */
126 if ((ipaddr
->family
!= IPv4
) && (ipaddr
->family
!= IPv6
)) {
127 verbosef("dns_queue() for unknown family %d", ipaddr
->family
);
131 rec
= xmalloc(sizeof(*rec
));
132 memcpy(&rec
->ip
, ipaddr
, sizeof(rec
->ip
));
134 if (RB_INSERT(tree_t
, &ip_tree
, rec
) != NULL
) {
135 /* Already queued - this happens seldom enough that we don't care about
136 * the performance hit of needlessly malloc()ing. */
137 verbosef("already queued %s", addr_to_str(ipaddr
));
142 num_w
= write(sock
[PARENT
], ipaddr
, sizeof(*ipaddr
)); /* won't block */
144 warnx("dns_queue: write: ignoring end of file");
145 else if (num_w
== -1)
146 warn("dns_queue: ignoring write error");
147 else if (num_w
!= sizeof(*ipaddr
))
148 err(1, "dns_queue: wrote %zu instead of %zu", num_w
, sizeof(*ipaddr
));
152 dns_unqueue(const struct addr
*const ipaddr
)
154 struct tree_rec tmp
, *rec
;
156 memcpy(&tmp
.ip
, ipaddr
, sizeof(tmp
.ip
));
157 if ((rec
= RB_FIND(tree_t
, &ip_tree
, &tmp
)) != NULL
) {
158 RB_REMOVE(tree_t
, &ip_tree
, rec
);
162 verbosef("couldn't unqueue %s - not in queue!", addr_to_str(ipaddr
));
166 * Returns non-zero if result waiting, stores IP and name into given pointers
167 * (name buffer is allocated by dns_poll)
170 dns_get_result(struct addr
*ipaddr
, char **name
)
172 struct dns_reply reply
;
175 numread
= read(sock
[PARENT
], &reply
, sizeof(reply
));
178 return (0); /* no input waiting */
183 goto error
; /* EOF */
184 if (numread
!= sizeof(reply
))
185 errx(1, "dns_get_result read got %zu, expected %zu",
186 numread
, sizeof(reply
));
188 /* Return successful reply. */
189 memcpy(ipaddr
, &reply
.addr
, sizeof(*ipaddr
));
190 if (reply
.error
!= 0) {
191 /* Identify common special cases. */
192 const char *type
= "none";
194 if (reply
.addr
.family
== IPv6
) {
195 if (IN6_IS_ADDR_LINKLOCAL(&reply
.addr
.ip
.v6
))
197 else if (IN6_IS_ADDR_SITELOCAL(&reply
.addr
.ip
.v6
))
199 else if (IN6_IS_ADDR_MULTICAST(&reply
.addr
.ip
.v6
))
202 assert(reply
.addr
.family
== IPv4
);
203 if (IN_MULTICAST(htonl(reply
.addr
.ip
.v4
)))
206 xasprintf(name
, "(%s)", type
);
208 else /* Correctly resolved name. */
209 *name
= xstrdup(reply
.name
);
211 dns_unqueue(&reply
.addr
);
215 warn("dns_get_result: ignoring read error");
216 /* FIXME: re-align to stream? restart dns child? */
227 return; /* no child was started - we're not doing any DNS */
229 while (dns_get_result(&ip
, &name
)) {
230 /* push into hosts_db */
231 struct bucket
*b
= host_find(&ip
);
234 verbosef("resolved %s to %s but it's not in the DB!",
235 addr_to_str(&ip
), name
);
238 if (b
->u
.host
.dns
!= NULL
) {
239 verbosef("resolved %s to %s but it's already in the DB!",
240 addr_to_str(&ip
), name
);
243 b
->u
.host
.dns
= name
;
247 /* ------------------------------------------------------------------------ */
250 STAILQ_ENTRY(qitem
) entries
;
254 STAILQ_HEAD(qhead
, qitem
) queue
= STAILQ_HEAD_INITIALIZER(queue
);
257 enqueue(const struct addr
*const ip
)
261 i
= xmalloc(sizeof(*i
));
262 memcpy(&i
->ip
, ip
, sizeof(i
->ip
));
263 STAILQ_INSERT_TAIL(&queue
, i
, entries
);
264 verbosef("DNS: enqueued %s", addr_to_str(ip
));
267 /* Return non-zero and populate <ip> pointer if queue isn't empty. */
269 dequeue(struct addr
*ip
)
273 i
= STAILQ_FIRST(&queue
);
276 STAILQ_REMOVE_HEAD(&queue
, entries
);
277 memcpy(ip
, &i
->ip
, sizeof(*ip
));
279 verbosef("DNS: dequeued %s", addr_to_str(ip
));
284 xwrite(const int d
, const void *buf
, const size_t nbytes
)
286 ssize_t ret
= write(d
, buf
, nbytes
);
290 if (ret
!= (ssize_t
)nbytes
)
291 err(1, "wrote %d bytes instead of all %d bytes", (int)ret
, (int)nbytes
);
299 setproctitle("DNS child");
300 fd_set_nonblock(sock
[CHILD
]);
301 verbosef("DNS child entering main DNS loop");
305 if (STAILQ_EMPTY(&queue
)) {
307 fd_set_block(sock
[CHILD
]);
308 verbosef("entering blocking read loop");
311 fd_set_nonblock(sock
[CHILD
]);
312 verbosef("non-blocking poll");
315 /* While we have input to process... */
316 ssize_t numread
= read(sock
[CHILD
], &ip
, sizeof(ip
));
318 exit(0); /* end of file, nothing more to do here. */
320 if (!blocking
&& (errno
== EAGAIN
))
321 break; /* ran out of input */
323 err(1, "DNS: read failed");
325 if (numread
!= sizeof(ip
))
326 err(1, "DNS: read got %zu bytes, expecting %zu",
327 numread
, sizeof(ip
));
330 /* After one blocking read, become non-blocking so that when we
331 * run out of input we fall through to queue processing.
334 fd_set_nonblock(sock
[CHILD
]);
340 struct dns_reply reply
;
341 struct sockaddr_in sin
;
342 struct sockaddr_in6 sin6
;
344 char host
[NI_MAXHOST
];
354 sin
.sin_family
= AF_INET
;
355 sin
.sin_addr
.s_addr
= ip
.ip
.v4
;
356 ret
= getnameinfo((struct sockaddr
*) &sin
, sizeof(sin
),
357 host
, sizeof(host
), NULL
, 0, flags
);
358 if (ret
== EAI_FAMILY
) {
359 verbosef("getnameinfo error %s, trying gethostbyname",
361 he
= gethostbyaddr(&sin
.sin_addr
.s_addr
,
362 sizeof(sin
.sin_addr
.s_addr
), sin
.sin_family
);
365 verbosef("gethostbyname error %s", hstrerror(h_errno
));
368 strlcpy(host
, he
->h_name
, sizeof(host
));
373 sin6
.sin6_family
= AF_INET6
;
374 memcpy(&sin6
.sin6_addr
, &ip
.ip
.v6
, sizeof(sin6
.sin6_addr
));
375 ret
= getnameinfo((struct sockaddr
*) &sin6
, sizeof(sin6
),
376 host
, sizeof(host
), NULL
, 0, flags
);
383 reply
.name
[0] = '\0';
386 assert(sizeof(reply
.name
) > sizeof(char *)); /* not just a ptr */
387 strlcpy(reply
.name
, host
, sizeof(reply
.name
));
390 fd_set_block(sock
[CHILD
]);
391 xwrite(sock
[CHILD
], &reply
, sizeof(reply
));
392 verbosef("DNS: %s is \"%s\".", addr_to_str(&reply
.addr
),
393 (ret
== 0) ? reply
.name
: gai_strerror(ret
));
398 /* vim:set ts=3 sw=3 tw=78 expandtab: */