2 * ++Copyright++ 1988, 1993
4 * Copyright (c) 1988, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
37 * Permission to use, copy, modify, and distribute this software for any
38 * purpose with or without fee is hereby granted, provided that the above
39 * copyright notice and this permission notice appear in all copies, and that
40 * the name of Digital Equipment Corporation not be used in advertising or
41 * publicity pertaining to distribution of the document or software without
42 * specific, written prior permission.
44 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
45 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
46 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
47 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
48 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
49 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
50 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
56 #if defined(LIBC_SCCS) && !defined(lint)
57 static char sccsid[] = "@(#)res_query.c 8.1 (Berkeley) 6/4/93";
58 static char rcsid[] = "$Id$";
59 #endif /* LIBC_SCCS and not lint */
61 #include <sys/param.h>
62 #include <netinet/in.h>
63 #include <arpa/inet.h>
64 #include <arpa/nameser.h>
71 #if defined(BSD) && (BSD >= 199306)
75 # include "../conf/portability.h"
78 #if defined(USE_OPTIONS_H)
79 # include <../conf/options.h>
83 #define MAXPACKET PACKETSZ
85 #define MAXPACKET 1024
88 char *__hostalias __P((const char *));
92 * Formulate a normal query, send, and await answer.
93 * Returned answer is placed in supplied buffer "answer".
94 * Perform preliminary check of answer, returning success only
95 * if no error is indicated and the answer count is nonzero.
96 * Return the size of the response on success, -1 on error.
97 * Error number is left in h_errno.
99 * Caller must parse answer and determine whether it answers the question.
102 res_query(name, class, type, answer, anslen)
103 const char *name; /* domain name */
104 int class, type; /* class and type of query */
105 u_char *answer; /* buffer to put answer */
106 int anslen; /* size of answer buffer */
108 u_char buf[MAXPACKET];
109 register HEADER *hp = (HEADER *) answer;
112 hp->rcode = NOERROR; /* default */
114 if ((_res.options & RES_INIT) == 0 && res_init() == -1)
117 if (_res.options & RES_DEBUG)
118 printf(";; res_query(%s, %d, %d)\n", name, class, type);
121 n = res_mkquery(QUERY, name, class, type, NULL, 0, NULL,
125 if (_res.options & RES_DEBUG)
126 printf(";; res_query: mkquery failed\n");
128 h_errno = NO_RECOVERY;
131 n = res_send(buf, n, answer, anslen);
134 if (_res.options & RES_DEBUG)
135 printf(";; res_query: send error\n");
141 if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) {
143 if (_res.options & RES_DEBUG)
144 printf(";; rcode = %d, ancount=%d\n", hp->rcode,
149 h_errno = HOST_NOT_FOUND;
161 h_errno = NO_RECOVERY;
170 * Formulate a normal query, send, and retrieve answer in supplied buffer.
171 * Return the size of the response on success, -1 on error.
172 * If enabled, implement search rules until answer or unrecoverable failure
173 * is detected. Error code, if any, is left in h_errno.
176 res_search(name, class, type, answer, anslen)
177 const char *name; /* domain name */
178 int class, type; /* class and type of query */
179 u_char *answer; /* buffer to put answer */
180 int anslen; /* size of answer */
182 register const char *cp, * const *domain;
183 HEADER *hp = (HEADER *) answer;
185 int trailing_dot, ret, saved_herrno;
186 int got_nodata = 0, got_servfail = 0, tried_as_is = 0;
188 if ((_res.options & RES_INIT) == 0 && res_init() == -1)
192 h_errno = HOST_NOT_FOUND; /* default, if we never query */
194 for (cp = name; *cp; cp++)
195 dots += (*cp == '.');
197 if ((cp > name) && (*--cp == '.'))
201 * if there aren't any dots, it could be a user-level alias
203 if ((!dots) && (cp = __hostalias(name)))
204 return (res_query(cp, class, type, answer, anslen));
207 * If there are dots in the name already, let's just give it a try
208 * 'as is'. The threshold can be set with the "ndots" option.
211 if (dots >= _res.ndots) {
212 ret = res_querydomain(name, NULL, class, type, answer, anslen);
215 saved_herrno = h_errno;
220 * We do at least one level of search if
221 * - there is no dot and RES_DEFNAME is set, or
222 * - there is at least one dot, there is no trailing dot,
223 * and RES_DNSRCH is set.
225 if (((!dots) && _res.options & RES_DEFNAMES) ||
226 (dots && (!trailing_dot) && _res.options & RES_DNSRCH)
230 for (domain = (const char * const *)_res.dnsrch;
234 ret = res_querydomain(name, *domain, class, type,
240 * If no server present, give up.
241 * If name isn't found in this domain,
242 * keep trying higher domains in the search list
243 * (if that's enabled).
244 * On a NO_DATA error, keep trying, otherwise
245 * a wildcard entry of another type could keep us
246 * from finding this entry higher in the domain.
247 * If we get some other error (negative answer or
248 * server failure), then stop searching up,
249 * but try the input name below in case it's
252 if (errno == ECONNREFUSED) {
265 if (hp->rcode == SERVFAIL) {
266 /* try next search element, if any */
272 /* anything else implies that we're done */
276 /* if we got here for some reason other than DNSRCH,
277 * we only wanted one iteration of the loop, so stop.
279 if (!(_res.options & RES_DNSRCH))
284 /* if we have not already tried the name "as is", do that now.
285 * note that we do this regardless of how many dots were in the
286 * name or whether it ends with a dot.
289 ret = res_querydomain(name, NULL, class, type, answer, anslen);
292 saved_herrno = h_errno;
295 /* if we got here, we didn't satisfy the search.
296 * if we did an initial full query, return that query's h_errno
297 * (note that we wouldn't be here if that query had succeeded).
298 * else if we ever got a nodata, send that back as the reason.
299 * else send back meaningless h_errno, that being the one from
300 * the last DNSRCH we did.
302 if (saved_herrno != -1)
303 h_errno = saved_herrno;
306 else if (got_servfail)
312 * Perform a call on res_query on the concatenation of name and domain,
313 * removing a trailing dot from name if domain is NULL.
316 res_querydomain(name, domain, class, type, answer, anslen)
317 const char *name, *domain;
318 int class, type; /* class and type of query */
319 u_char *answer; /* buffer to put answer */
320 int anslen; /* size of answer */
322 char nbuf[2*MAXDNAME+2];
323 const char *longname = nbuf;
327 if (_res.options & RES_DEBUG)
328 printf(";; res_querydomain(%s, %s, %d, %d)\n",
329 name, domain?domain:"<Nil>", class, type);
331 if (domain == NULL) {
333 * Check for trailing '.';
334 * copy without '.' if present.
336 n = strlen(name) - 1;
337 if (n != (0 - 1) && name[n] == '.' && n < sizeof(nbuf) - 1) {
338 bcopy(name, nbuf, n);
343 sprintf(nbuf, "%.*s.%.*s",
344 MAXDNAME, name, MAXDNAME, domain);
347 return (res_query(longname, class, type, answer, anslen));
352 register const char *name;
354 register char *cp1, *cp2;
358 static char abuf[MAXDNAME];
360 file = getenv("HOSTALIASES");
361 if (file == NULL || (fp = fopen(file, "r")) == NULL)
363 buf[sizeof(buf) - 1] = '\0';
364 while (fgets(buf, sizeof(buf), fp)) {
365 for (cp1 = buf; *cp1 && !isspace(*cp1); ++cp1);
369 if (!strcasecmp(buf, name)) {
370 while (isspace(*++cp1));
373 for (cp2 = cp1 + 1; *cp2 && !isspace(*cp2); ++cp2);
374 abuf[sizeof(abuf) - 1] = *cp2 = '\0';
375 (void)strncpy(abuf, cp1, sizeof(abuf) - 1);