blob: 513c1db182f9659ee863d2510d63d28c7d3bf9cc [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.
Hungming Chen56273d72018-12-26 16:14:17 +0800106 * Error number is left in *herrno.
Bernie Innocenti55864192018-08-30 04:05:20 +0900107 *
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
Hungming Chen56273d72018-12-26 16:14:17 +0800114 int* ai_error, // error will be set based on rcode
115 int* herrno) // legacy h_errno
Bernie Innocenti55864192018-08-30 04:05:20 +0900116{
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900117 u_char buf[MAXPACKET];
118 HEADER* hp = (HEADER*) (void*) answer;
119 int n;
120 u_int oflags;
Mike Yu69615f62018-11-06 15:42:36 +0800121 int rcode = NOERROR;
Bernie Innocenti55864192018-08-30 04:05:20 +0900122
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900123 oflags = statp->_flags;
Bernie Innocenti55864192018-08-30 04:05:20 +0900124
125again:
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900126 hp->rcode = NOERROR; /* default */
Bernie Innocenti55864192018-08-30 04:05:20 +0900127
128#ifdef DEBUG
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900129 if (statp->options & RES_DEBUG) printf(";; res_query(%s, %d, %d)\n", name, cl, type);
Bernie Innocenti55864192018-08-30 04:05:20 +0900130#endif
131
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900132 n = res_nmkquery(statp, QUERY, name, cl, type, NULL, 0, NULL, buf, sizeof(buf));
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900133 if (n > 0 && (statp->_flags & RES_F_EDNS0ERR) == 0 &&
134 (statp->options & (RES_USE_EDNS0 | RES_USE_DNSSEC)) != 0U)
135 n = res_nopt(statp, n, buf, sizeof(buf), anslen);
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900136 if (n <= 0) {
Bernie Innocenti55864192018-08-30 04:05:20 +0900137#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900138 if (statp->options & RES_DEBUG) printf(";; res_query: mkquery failed\n");
Bernie Innocenti55864192018-08-30 04:05:20 +0900139#endif
Hungming Chen56273d72018-12-26 16:14:17 +0800140 *herrno = NO_RECOVERY;
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900141 return n;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900142 }
Mike Yu69615f62018-11-06 15:42:36 +0800143 n = res_nsend(statp, buf, n, answer, anslen, &rcode);
144 *ai_error = rcodeToAiError(rcode);
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900145 if (n < 0) {
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900146 /* if the query choked with EDNS0, retry without EDNS0 */
147 if ((statp->options & (RES_USE_EDNS0 | RES_USE_DNSSEC)) != 0U &&
148 ((oflags ^ statp->_flags) & RES_F_EDNS0ERR) != 0) {
149 statp->_flags |= RES_F_EDNS0ERR;
150 if (statp->options & RES_DEBUG) printf(";; res_nquery: retry without EDNS0\n");
151 goto again;
152 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900153#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900154 if (statp->options & RES_DEBUG) printf(";; res_query: send error\n");
Bernie Innocenti55864192018-08-30 04:05:20 +0900155#endif
Hungming Chen56273d72018-12-26 16:14:17 +0800156 *herrno = TRY_AGAIN;
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900157 return n;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900158 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900159
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900160 if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) {
Bernie Innocenti55864192018-08-30 04:05:20 +0900161#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900162 if (statp->options & RES_DEBUG)
163 printf(";; rcode = (%s), counts = an:%d ns:%d ar:%d\n", p_rcode(hp->rcode),
164 ntohs(hp->ancount), ntohs(hp->nscount), ntohs(hp->arcount));
Bernie Innocenti55864192018-08-30 04:05:20 +0900165#endif
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900166 switch (hp->rcode) {
167 case NXDOMAIN:
Hungming Chen56273d72018-12-26 16:14:17 +0800168 *herrno = HOST_NOT_FOUND;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900169 break;
170 case SERVFAIL:
Hungming Chen56273d72018-12-26 16:14:17 +0800171 *herrno = TRY_AGAIN;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900172 break;
173 case NOERROR:
Hungming Chen56273d72018-12-26 16:14:17 +0800174 *herrno = NO_DATA;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900175 break;
176 case FORMERR:
177 case NOTIMP:
178 case REFUSED:
179 default:
Hungming Chen56273d72018-12-26 16:14:17 +0800180 *herrno = NO_RECOVERY;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900181 break;
182 }
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900183 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900184 }
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900185 return n;
Bernie Innocenti55864192018-08-30 04:05:20 +0900186}
187
188/*
189 * Formulate a normal query, send, and retrieve answer in supplied buffer.
190 * Return the size of the response on success, -1 on error.
191 * If enabled, implement search rules until answer or unrecoverable failure
Hungming Chen56273d72018-12-26 16:14:17 +0800192 * is detected. Error code, if any, is left in *herrno.
Bernie Innocenti55864192018-08-30 04:05:20 +0900193 */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900194int res_nsearch(res_state statp, const char* name, /* domain name */
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900195 int cl, int type, /* class and type of query */
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900196 u_char* answer, /* buffer to put answer */
Mike Yu69615f62018-11-06 15:42:36 +0800197 int anslen, /* size of answer */
Hungming Chen56273d72018-12-26 16:14:17 +0800198 int* ai_error, /* error will be set based on rcode */
199 int* herrno) /* legacy h_errno */
Bernie Innocenti55864192018-08-30 04:05:20 +0900200{
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900201 const char *cp, *const *domain;
202 HEADER* hp = (HEADER*) (void*) answer;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900203 u_int dots;
204 int trailing_dot, ret, saved_herrno;
205 int got_nodata = 0, got_servfail = 0, root_on_list = 0;
206 int tried_as_is = 0;
207 int searched = 0;
Bernie Innocenti55864192018-08-30 04:05:20 +0900208
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900209 errno = 0;
Hungming Chen56273d72018-12-26 16:14:17 +0800210 *herrno = HOST_NOT_FOUND; /* True if we never query. */
Bernie Innocenti55864192018-08-30 04:05:20 +0900211
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900212 dots = 0;
213 for (cp = name; *cp != '\0'; cp++) dots += (*cp == '.');
214 trailing_dot = 0;
215 if (cp > name && *--cp == '.') trailing_dot++;
Bernie Innocenti55864192018-08-30 04:05:20 +0900216
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900217 /*
218 * If there are enough dots in the name, let's just give it a
219 * try 'as is'. The threshold can be set with the "ndots" option.
220 * Also, query 'as is', if there is a trailing dot in the name.
221 */
222 saved_herrno = -1;
223 if (dots >= statp->ndots || trailing_dot) {
Hungming Chen56273d72018-12-26 16:14:17 +0800224 ret = res_nquerydomain(statp, name, NULL, cl, type, answer, anslen, ai_error, herrno);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900225 if (ret > 0 || trailing_dot) return ret;
Hungming Chen56273d72018-12-26 16:14:17 +0800226 saved_herrno = *herrno;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900227 tried_as_is++;
228 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900229
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900230 /*
231 * We do at least one level of search if
232 * - there is no dot and RES_DEFNAME is set, or
233 * - there is at least one dot, there is no trailing dot,
234 * and RES_DNSRCH is set.
235 */
236 if ((!dots && (statp->options & RES_DEFNAMES) != 0U) ||
237 (dots && !trailing_dot && (statp->options & RES_DNSRCH) != 0U)) {
238 int done = 0;
Bernie Innocenti55864192018-08-30 04:05:20 +0900239
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900240 /* Unfortunately we need to load network-specific info
241 * (dns servers, search domains) before
242 * the domain stuff is tried. Will have a better
243 * fix after thread pools are used as this will
244 * be loaded once for the thread instead of each
245 * time a query is tried.
246 */
247 _resolv_populate_res_for_net(statp);
Bernie Innocenti55864192018-08-30 04:05:20 +0900248
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900249 for (domain = (const char* const*) statp->dnsrch; *domain && !done; domain++) {
250 searched = 1;
Bernie Innocenti55864192018-08-30 04:05:20 +0900251
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900252 if (domain[0][0] == '\0' || (domain[0][0] == '.' && domain[0][1] == '\0'))
253 root_on_list++;
Bernie Innocenti55864192018-08-30 04:05:20 +0900254
Hungming Chen56273d72018-12-26 16:14:17 +0800255 ret = res_nquerydomain(statp, name, *domain, cl, type, answer, anslen, ai_error,
256 herrno);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900257 if (ret > 0) return ret;
Bernie Innocenti55864192018-08-30 04:05:20 +0900258
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900259 /*
260 * If no server present, give up.
261 * If name isn't found in this domain,
262 * keep trying higher domains in the search list
263 * (if that's enabled).
264 * On a NO_DATA error, keep trying, otherwise
265 * a wildcard entry of another type could keep us
266 * from finding this entry higher in the domain.
267 * If we get some other error (negative answer or
268 * server failure), then stop searching up,
269 * but try the input name below in case it's
270 * fully-qualified.
271 */
272 if (errno == ECONNREFUSED) {
Hungming Chen56273d72018-12-26 16:14:17 +0800273 *herrno = TRY_AGAIN;
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900274 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900275 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900276
Hungming Chen56273d72018-12-26 16:14:17 +0800277 switch (*herrno) {
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900278 case NO_DATA:
279 got_nodata++;
Bernie Innocenti11cd0202018-10-12 21:27:45 +0900280 break;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900281 case HOST_NOT_FOUND:
282 /* keep trying */
283 break;
284 case TRY_AGAIN:
285 if (hp->rcode == SERVFAIL) {
286 /* try next search element, if any */
287 got_servfail++;
288 break;
289 }
Bernie Innocenti8bb94ba2018-10-10 22:30:12 +0900290 [[fallthrough]];
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900291 default:
292 /* anything else implies that we're done */
293 done++;
294 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900295
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900296 /* if we got here for some reason other than DNSRCH,
297 * we only wanted one iteration of the loop, so stop.
298 */
299 if ((statp->options & RES_DNSRCH) == 0U) done++;
300 }
301 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900302
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900303 /*
304 * If the query has not already been tried as is then try it
305 * unless RES_NOTLDQUERY is set and there were no dots.
306 */
307 if ((dots || !searched || (statp->options & RES_NOTLDQUERY) == 0U) &&
308 !(tried_as_is || root_on_list)) {
Hungming Chen56273d72018-12-26 16:14:17 +0800309 ret = res_nquerydomain(statp, name, NULL, cl, type, answer, anslen, ai_error, herrno);
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900310 if (ret > 0) return ret;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900311 }
Bernie Innocenti55864192018-08-30 04:05:20 +0900312
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900313 /* if we got here, we didn't satisfy the search.
314 * if we did an initial full query, return that query's H_ERRNO
315 * (note that we wouldn't be here if that query had succeeded).
316 * else if we ever got a nodata, send that back as the reason.
317 * else send back meaningless H_ERRNO, that being the one from
318 * the last DNSRCH we did.
319 */
320 if (saved_herrno != -1)
Hungming Chen56273d72018-12-26 16:14:17 +0800321 *herrno = saved_herrno;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900322 else if (got_nodata)
Hungming Chen56273d72018-12-26 16:14:17 +0800323 *herrno = NO_DATA;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900324 else if (got_servfail)
Hungming Chen56273d72018-12-26 16:14:17 +0800325 *herrno = TRY_AGAIN;
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900326 return -1;
Bernie Innocenti55864192018-08-30 04:05:20 +0900327}
328
329/*
330 * Perform a call on res_query on the concatenation of name and domain,
331 * removing a trailing dot from name if domain is NULL.
332 */
Mike Yu69615f62018-11-06 15:42:36 +0800333int res_nquerydomain(res_state statp, const char* name, const char* domain, int cl,
334 int type, /* class and type of query */
335 u_char* answer, /* buffer to put answer */
336 int anslen, /* size of answer */
Hungming Chen56273d72018-12-26 16:14:17 +0800337 int* ai_error, /* error will be set based on rcode */
338 int* herrno) /* legacy h_errno */
Bernie Innocenti55864192018-08-30 04:05:20 +0900339{
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900340 char nbuf[MAXDNAME];
341 const char* longname = nbuf;
342 int n, d;
Bernie Innocenti55864192018-08-30 04:05:20 +0900343
344#ifdef DEBUG
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900345 if (statp->options & RES_DEBUG)
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900346 printf(";; res_nquerydomain(%s, %s, %d, %d)\n", name, domain ? domain : "<Nil>", cl,
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900347 type);
Bernie Innocenti55864192018-08-30 04:05:20 +0900348#endif
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900349 if (domain == NULL) {
350 /*
351 * Check for trailing '.';
352 * copy without '.' if present.
353 */
354 n = strlen(name);
355 if (n >= MAXDNAME) {
Hungming Chen56273d72018-12-26 16:14:17 +0800356 *herrno = NO_RECOVERY;
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900357 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900358 }
359 n--;
360 if (n >= 0 && name[n] == '.') {
361 strncpy(nbuf, name, (size_t) n);
362 nbuf[n] = '\0';
363 } else
364 longname = name;
365 } else {
366 n = strlen(name);
367 d = strlen(domain);
368 if (n + d + 1 >= MAXDNAME) {
Hungming Chen56273d72018-12-26 16:14:17 +0800369 *herrno = NO_RECOVERY;
Bernie Innocenti1f4a9fd2018-09-07 21:10:25 +0900370 return -1;
Bernie Innocentif12d5bb2018-08-31 14:09:46 +0900371 }
372 snprintf(nbuf, sizeof(nbuf), "%s.%s", name, domain);
373 }
Hungming Chen56273d72018-12-26 16:14:17 +0800374 return res_nquery(statp, longname, cl, type, answer, anslen, ai_error, herrno);
Bernie Innocenti55864192018-08-30 04:05:20 +0900375}