blob: 6faa504202e0224418ec1b8480a17e301b630a18 [file] [log] [blame]
Bernie Innocenti55864192018-08-30 04:05:20 +09001/* $NetBSD: res_query.c,v 1.7 2006/01/24 17:41:25 christos Exp $ */
2
3/*
4 * Copyright (c) 1988, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
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.
22 *
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
33 * SUCH DAMAGE.
34 */
35
36/*
37 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
38 *
39 * Permission to use, copy, modify, and distribute this software for any
40 * purpose with or without fee is hereby granted, provided that the above
41 * copyright notice and this permission notice appear in all copies, and that
42 * the name of Digital Equipment Corporation not be used in advertising or
43 * publicity pertaining to distribution of the document or software without
44 * specific, written prior permission.
45 *
46 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
47 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
48 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
49 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
50 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
51 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
52 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
53 * SOFTWARE.
54 */
55
56/*
57 * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
58 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
59 *
60 * Permission to use, copy, modify, and distribute this software for any
61 * purpose with or without fee is hereby granted, provided that the above
62 * copyright notice and this permission notice appear in all copies.
63 *
64 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
65 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
66 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
67 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
68 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
69 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
70 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
71 */
72
Bernie Innocenti55864192018-08-30 04:05:20 +090073#include <arpa/inet.h>
74#include <arpa/nameser.h>
75#include <ctype.h>
76#include <errno.h>
77#include <netdb.h>
Bernie Innocentif12d5bb2018-08-31 14:09:46 +090078#include <netinet/in.h>
79#include <sys/param.h>
80#include <sys/types.h>
Bernie Innocenti55864192018-08-30 04:05:20 +090081#include <stdio.h>
82#include <stdlib.h>
Bernie Innocenti55864192018-08-30 04:05:20 +090083#include <string.h>
Bernie Innocentif12d5bb2018-08-31 14:09:46 +090084#include <unistd.h>
Bernie Innocenti55864192018-08-30 04:05:20 +090085
Bernie Innocenti189eb502018-10-01 23:10:18 +090086#include "resolv_cache.h"
87#include "resolv_private.h"
88
Bernie Innocenti55864192018-08-30 04:05:20 +090089/* Options. Leave them on. */
90#ifndef DEBUG
91#define DEBUG
92#endif
93
94#if PACKETSZ > 1024
Bernie Innocentif12d5bb2018-08-31 14:09:46 +090095#define MAXPACKET PACKETSZ
Bernie Innocenti55864192018-08-30 04:05:20 +090096#else
Bernie Innocentif12d5bb2018-08-31 14:09:46 +090097#define MAXPACKET 1024
Bernie Innocenti55864192018-08-30 04:05:20 +090098#endif
99
100/*
101 * Formulate a normal query, send, and await answer.
102 * Returned answer is placed in supplied buffer "answer".
103 * Perform preliminary check of answer, returning success only
104 * if no error is indicated and the answer count is nonzero.
105 * Return the size of the response on success, -1 on error.
106 * Error number is left in H_ERRNO.
107 *
108 * Caller must parse answer and determine whether it answers the question.
109 */
Mike Yu69615f62018-11-06 15:42:36 +0800110int res_nquery(res_state statp, const char* name, // domain name
111 int cl, int type, // class and type of query
112 u_char* answer, // buffer to put answer
113 int anslen, // size of answer buffer
114 int* ai_error) // error will be set based on rcode
Bernie Innocenti55864192018-08-30 04:05:20 +0900115{
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900116 u_char buf[MAXPACKET];
117 HEADER* hp = (HEADER*) (void*) answer;
118 int n;
119 u_int oflags;
Mike Yu69615f62018-11-06 15:42:36 +0800120 int rcode = NOERROR;
Bernie Innocenti55864192018-08-30 04:05:20 +0900121
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900122 oflags = statp->_flags;
Bernie Innocenti55864192018-08-30 04:05:20 +0900123
124again:
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900125 hp->rcode = NOERROR; /* default */
Bernie Innocenti55864192018-08-30 04:05:20 +0900126
127#ifdef DEBUG
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900128 if (statp->options & RES_DEBUG) printf(";; res_query(%s, %d, %d)\n", name, cl, type);
Bernie Innocenti55864192018-08-30 04:05:20 +0900129#endif
130
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900131 n = res_nmkquery(statp, QUERY, name, cl, type, NULL, 0, NULL, buf, sizeof(buf));
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900132 if (n > 0 && (statp->_flags & RES_F_EDNS0ERR) == 0 &&
133 (statp->options & (RES_USE_EDNS0 | RES_USE_DNSSEC)) != 0U)
134 n = res_nopt(statp, n, buf, sizeof(buf), anslen);
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900135 if (n <= 0) {
Bernie Innocenti55864192018-08-30 04:05:20 +0900136#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900137 if (statp->options & RES_DEBUG) printf(";; res_query: mkquery failed\n");
Bernie Innocenti55864192018-08-30 04:05:20 +0900138#endif
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900139 RES_SET_H_ERRNO(statp, NO_RECOVERY);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900140 return n;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900141 }
Mike Yu69615f62018-11-06 15:42:36 +0800142 n = res_nsend(statp, buf, n, answer, anslen, &rcode);
143 *ai_error = rcodeToAiError(rcode);
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900144 if (n < 0) {
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900145 /* if the query choked with EDNS0, retry without EDNS0 */
146 if ((statp->options & (RES_USE_EDNS0 | RES_USE_DNSSEC)) != 0U &&
147 ((oflags ^ statp->_flags) & RES_F_EDNS0ERR) != 0) {
148 statp->_flags |= RES_F_EDNS0ERR;
149 if (statp->options & RES_DEBUG) printf(";; res_nquery: retry without EDNS0\n");
150 goto again;
151 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900152#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900153 if (statp->options & RES_DEBUG) printf(";; res_query: send error\n");
Bernie Innocenti55864192018-08-30 04:05:20 +0900154#endif
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900155 RES_SET_H_ERRNO(statp, TRY_AGAIN);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900156 return n;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900157 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900158
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900159 if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) {
Bernie Innocenti55864192018-08-30 04:05:20 +0900160#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900161 if (statp->options & RES_DEBUG)
162 printf(";; rcode = (%s), counts = an:%d ns:%d ar:%d\n", p_rcode(hp->rcode),
163 ntohs(hp->ancount), ntohs(hp->nscount), ntohs(hp->arcount));
Bernie Innocenti55864192018-08-30 04:05:20 +0900164#endif
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900165 switch (hp->rcode) {
166 case NXDOMAIN:
167 RES_SET_H_ERRNO(statp, HOST_NOT_FOUND);
168 break;
169 case SERVFAIL:
170 RES_SET_H_ERRNO(statp, TRY_AGAIN);
171 break;
172 case NOERROR:
173 RES_SET_H_ERRNO(statp, NO_DATA);
174 break;
175 case FORMERR:
176 case NOTIMP:
177 case REFUSED:
178 default:
179 RES_SET_H_ERRNO(statp, NO_RECOVERY);
180 break;
181 }
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900182 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900183 }
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900184 return n;
Bernie Innocenti55864192018-08-30 04:05:20 +0900185}
186
187/*
188 * Formulate a normal query, send, and retrieve answer in supplied buffer.
189 * Return the size of the response on success, -1 on error.
190 * If enabled, implement search rules until answer or unrecoverable failure
191 * is detected. Error code, if any, is left in H_ERRNO.
192 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900193int res_nsearch(res_state statp, const char* name, /* domain name */
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900194 int cl, int type, /* class and type of query */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900195 u_char* answer, /* buffer to put answer */
Mike Yu69615f62018-11-06 15:42:36 +0800196 int anslen, /* size of answer */
197 int* ai_error) /* error will be set based on rcode*/
Bernie Innocenti55864192018-08-30 04:05:20 +0900198{
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900199 const char *cp, *const *domain;
200 HEADER* hp = (HEADER*) (void*) answer;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900201 u_int dots;
202 int trailing_dot, ret, saved_herrno;
203 int got_nodata = 0, got_servfail = 0, root_on_list = 0;
204 int tried_as_is = 0;
205 int searched = 0;
Bernie Innocenti55864192018-08-30 04:05:20 +0900206
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900207 errno = 0;
208 RES_SET_H_ERRNO(statp, HOST_NOT_FOUND); /* True if we never query. */
Bernie Innocenti55864192018-08-30 04:05:20 +0900209
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900210 dots = 0;
211 for (cp = name; *cp != '\0'; cp++) dots += (*cp == '.');
212 trailing_dot = 0;
213 if (cp > name && *--cp == '.') trailing_dot++;
Bernie Innocenti55864192018-08-30 04:05:20 +0900214
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900215 /*
216 * If there are enough dots in the name, let's just give it a
217 * try 'as is'. The threshold can be set with the "ndots" option.
218 * Also, query 'as is', if there is a trailing dot in the name.
219 */
220 saved_herrno = -1;
221 if (dots >= statp->ndots || trailing_dot) {
Mike Yu69615f62018-11-06 15:42:36 +0800222 ret = res_nquerydomain(statp, name, NULL, cl, type, answer, anslen, ai_error);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900223 if (ret > 0 || trailing_dot) return ret;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900224 saved_herrno = statp->res_h_errno;
225 tried_as_is++;
226 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900227
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900228 /*
229 * We do at least one level of search if
230 * - there is no dot and RES_DEFNAME is set, or
231 * - there is at least one dot, there is no trailing dot,
232 * and RES_DNSRCH is set.
233 */
234 if ((!dots && (statp->options & RES_DEFNAMES) != 0U) ||
235 (dots && !trailing_dot && (statp->options & RES_DNSRCH) != 0U)) {
236 int done = 0;
Bernie Innocenti55864192018-08-30 04:05:20 +0900237
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900238 /* Unfortunately we need to load network-specific info
239 * (dns servers, search domains) before
240 * the domain stuff is tried. Will have a better
241 * fix after thread pools are used as this will
242 * be loaded once for the thread instead of each
243 * time a query is tried.
244 */
245 _resolv_populate_res_for_net(statp);
Bernie Innocenti55864192018-08-30 04:05:20 +0900246
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900247 for (domain = (const char* const*) statp->dnsrch; *domain && !done; domain++) {
248 searched = 1;
Bernie Innocenti55864192018-08-30 04:05:20 +0900249
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900250 if (domain[0][0] == '\0' || (domain[0][0] == '.' && domain[0][1] == '\0'))
251 root_on_list++;
Bernie Innocenti55864192018-08-30 04:05:20 +0900252
Mike Yu69615f62018-11-06 15:42:36 +0800253 ret = res_nquerydomain(statp, name, *domain, cl, type, answer, anslen, ai_error);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900254 if (ret > 0) return ret;
Bernie Innocenti55864192018-08-30 04:05:20 +0900255
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900256 /*
257 * If no server present, give up.
258 * If name isn't found in this domain,
259 * keep trying higher domains in the search list
260 * (if that's enabled).
261 * On a NO_DATA error, keep trying, otherwise
262 * a wildcard entry of another type could keep us
263 * from finding this entry higher in the domain.
264 * If we get some other error (negative answer or
265 * server failure), then stop searching up,
266 * but try the input name below in case it's
267 * fully-qualified.
268 */
269 if (errno == ECONNREFUSED) {
270 RES_SET_H_ERRNO(statp, TRY_AGAIN);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900271 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900272 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900273
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900274 switch (statp->res_h_errno) {
275 case NO_DATA:
276 got_nodata++;
Bernie Innocenti11cd0202018-10-12 21:27:45 +0900277 break;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900278 case HOST_NOT_FOUND:
279 /* keep trying */
280 break;
281 case TRY_AGAIN:
282 if (hp->rcode == SERVFAIL) {
283 /* try next search element, if any */
284 got_servfail++;
285 break;
286 }
Bernie Innocenti8bb94ba2018-10-10 22:30:12 +0900287 [[fallthrough]];
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900288 default:
289 /* anything else implies that we're done */
290 done++;
291 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900292
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900293 /* if we got here for some reason other than DNSRCH,
294 * we only wanted one iteration of the loop, so stop.
295 */
296 if ((statp->options & RES_DNSRCH) == 0U) done++;
297 }
298 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900299
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900300 /*
301 * If the query has not already been tried as is then try it
302 * unless RES_NOTLDQUERY is set and there were no dots.
303 */
304 if ((dots || !searched || (statp->options & RES_NOTLDQUERY) == 0U) &&
305 !(tried_as_is || root_on_list)) {
Mike Yu69615f62018-11-06 15:42:36 +0800306 ret = res_nquerydomain(statp, name, NULL, cl, type, answer, anslen, ai_error);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900307 if (ret > 0) return ret;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900308 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900309
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900310 /* if we got here, we didn't satisfy the search.
311 * if we did an initial full query, return that query's H_ERRNO
312 * (note that we wouldn't be here if that query had succeeded).
313 * else if we ever got a nodata, send that back as the reason.
314 * else send back meaningless H_ERRNO, that being the one from
315 * the last DNSRCH we did.
316 */
317 if (saved_herrno != -1)
318 RES_SET_H_ERRNO(statp, saved_herrno);
319 else if (got_nodata)
320 RES_SET_H_ERRNO(statp, NO_DATA);
321 else if (got_servfail)
322 RES_SET_H_ERRNO(statp, TRY_AGAIN);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900323 return -1;
Bernie Innocenti55864192018-08-30 04:05:20 +0900324}
325
326/*
327 * Perform a call on res_query on the concatenation of name and domain,
328 * removing a trailing dot from name if domain is NULL.
329 */
Mike Yu69615f62018-11-06 15:42:36 +0800330int res_nquerydomain(res_state statp, const char* name, const char* domain, int cl,
331 int type, /* class and type of query */
332 u_char* answer, /* buffer to put answer */
333 int anslen, /* size of answer */
334 int* ai_error) /* error will be set based on rcode*/
Bernie Innocenti55864192018-08-30 04:05:20 +0900335{
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900336 char nbuf[MAXDNAME];
337 const char* longname = nbuf;
338 int n, d;
Bernie Innocenti55864192018-08-30 04:05:20 +0900339
340#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900341 if (statp->options & RES_DEBUG)
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900342 printf(";; res_nquerydomain(%s, %s, %d, %d)\n", name, domain ? domain : "<Nil>", cl,
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900343 type);
Bernie Innocenti55864192018-08-30 04:05:20 +0900344#endif
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900345 if (domain == NULL) {
346 /*
347 * Check for trailing '.';
348 * copy without '.' if present.
349 */
350 n = strlen(name);
351 if (n >= MAXDNAME) {
352 RES_SET_H_ERRNO(statp, NO_RECOVERY);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900353 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900354 }
355 n--;
356 if (n >= 0 && name[n] == '.') {
357 strncpy(nbuf, name, (size_t) n);
358 nbuf[n] = '\0';
359 } else
360 longname = name;
361 } else {
362 n = strlen(name);
363 d = strlen(domain);
364 if (n + d + 1 >= MAXDNAME) {
365 RES_SET_H_ERRNO(statp, NO_RECOVERY);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900366 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900367 }
368 snprintf(nbuf, sizeof(nbuf), "%s.%s", name, domain);
369 }
Mike Yu69615f62018-11-06 15:42:36 +0800370 return res_nquery(statp, longname, cl, type, answer, anslen, ai_error);
Bernie Innocenti55864192018-08-30 04:05:20 +0900371}