blob: feda71b866b63f196d2b84e0830a002d11519c6e [file] [log] [blame]
Bernie Innocenti318ed2d2018-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
Ken Chen5471dca2019-04-15 15:25:35 +080073#define LOG_TAG "resolv"
Bernie Innocenti3952ccc2019-03-03 19:39:53 +090074
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090075#include <arpa/inet.h>
76#include <arpa/nameser.h>
77#include <ctype.h>
78#include <errno.h>
79#include <netdb.h>
Bernie Innocenti8ad893f2018-08-31 14:09:46 +090080#include <netinet/in.h>
81#include <sys/param.h>
82#include <sys/types.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090083#include <stdlib.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090084#include <string.h>
Bernie Innocenti8ad893f2018-08-31 14:09:46 +090085#include <unistd.h>
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090086
chenbruceacb832c2019-02-20 19:45:50 +080087#include <android-base/logging.h>
88
Bernie Innocentiac18b122018-10-01 23:10:18 +090089#include "resolv_cache.h"
90#include "resolv_private.h"
91
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090092#if PACKETSZ > 1024
Bernie Innocenti8ad893f2018-08-31 14:09:46 +090093#define MAXPACKET PACKETSZ
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090094#else
Bernie Innocenti8ad893f2018-08-31 14:09:46 +090095#define MAXPACKET 1024
Bernie Innocenti318ed2d2018-08-30 04:05:20 +090096#endif
97
98/*
99 * Formulate a normal query, send, and await answer.
100 * Returned answer is placed in supplied buffer "answer".
101 * Perform preliminary check of answer, returning success only
102 * if no error is indicated and the answer count is nonzero.
103 * Return the size of the response on success, -1 on error.
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800104 * Error number is left in *herrno.
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900105 *
106 * Caller must parse answer and determine whether it answers the question.
107 */
Mike Yubfb1b342018-11-06 15:42:36 +0800108int res_nquery(res_state statp, const char* name, // domain name
109 int cl, int type, // class and type of query
110 u_char* answer, // buffer to put answer
111 int anslen, // size of answer buffer
Hungming Chen947aab02018-12-27 18:33:19 +0800112 int* herrno) // legacy and extended h_errno
113 // NETD_RESOLV_H_ERRNO_EXT_*
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900114{
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900115 u_char buf[MAXPACKET];
116 HEADER* hp = (HEADER*) (void*) answer;
117 int n;
Mike Yubfb1b342018-11-06 15:42:36 +0800118 int rcode = NOERROR;
Ken Chen0a015532019-01-02 14:59:38 +0800119 bool retried = false;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900120
121again:
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900122 hp->rcode = NOERROR; /* default */
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900123
Ken Chenffc224a2019-03-19 17:41:28 +0800124 LOG(DEBUG) << __func__ << ": (" << cl << ", " << type << ")";
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900125
Bernie Innocenti9c575932018-09-07 21:10:25 +0900126 n = res_nmkquery(statp, QUERY, name, cl, type, NULL, 0, NULL, buf, sizeof(buf));
Ken Chen0a015532019-01-02 14:59:38 +0800127 if (n > 0 && (statp->options & (RES_USE_EDNS0 | RES_USE_DNSSEC)) != 0U && !retried)
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900128 n = res_nopt(statp, n, buf, sizeof(buf), anslen);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900129 if (n <= 0) {
Ken Chenffc224a2019-03-19 17:41:28 +0800130 LOG(DEBUG) << __func__ << ": mkquery failed";
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800131 *herrno = NO_RECOVERY;
Bernie Innocenti9c575932018-09-07 21:10:25 +0900132 return n;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900133 }
Luke Huangba7bef92018-12-26 16:53:03 +0800134 n = res_nsend(statp, buf, n, answer, anslen, &rcode, 0);
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900135 if (n < 0) {
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900136 /* if the query choked with EDNS0, retry without EDNS0 */
137 if ((statp->options & (RES_USE_EDNS0 | RES_USE_DNSSEC)) != 0U &&
Ken Chen0a015532019-01-02 14:59:38 +0800138 (statp->_flags & RES_F_EDNS0ERR) && !retried) {
Ken Chenffc224a2019-03-19 17:41:28 +0800139 LOG(DEBUG) << __func__ << ": retry without EDNS0";
Ken Chen0a015532019-01-02 14:59:38 +0800140 retried = true;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900141 goto again;
142 }
Ken Chenffc224a2019-03-19 17:41:28 +0800143 LOG(DEBUG) << __func__ << ": send error";
chenbruceacb832c2019-02-20 19:45:50 +0800144
Hungming Chen947aab02018-12-27 18:33:19 +0800145 // Note that rcodes SERVFAIL, NOTIMP, REFUSED may cause res_nquery() to return a general
146 // error code EAI_AGAIN, but mapping the error code from rcode as res_queryN() does for
147 // getaddrinfo(). Different rcodes trigger different behaviors:
148 //
149 // - SERVFAIL, NOTIMP, REFUSED
150 // These result in send_dg() returning 0, causing res_nsend() to try the next
151 // nameserver. After all nameservers failed, res_nsend() returns -ETIMEDOUT, causing
152 // res_nquery() to return EAI_AGAIN here regardless of the rcode from the DNS response.
153 //
154 // - NXDOMAIN, FORMERR
155 // These rcodes may cause res_nsend() to return successfully (i.e. the result is a
156 // positive integer). In this case, res_nquery() returns error number by referring
157 // the rcode from the DNS response.
158 switch (rcode) {
159 case RCODE_TIMEOUT: // Not defined in RFC.
160 // DNS metrics monitors DNS query timeout.
161 *herrno = NETD_RESOLV_H_ERRNO_EXT_TIMEOUT; // extended h_errno.
162 break;
163 default:
164 *herrno = TRY_AGAIN;
165 break;
166 }
Bernie Innocenti9c575932018-09-07 21:10:25 +0900167 return n;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900168 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900169
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900170 if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) {
Ken Chenffc224a2019-03-19 17:41:28 +0800171 LOG(DEBUG) << __func__ << ": rcode = (" << p_rcode(hp->rcode)
chenbruceacb832c2019-02-20 19:45:50 +0800172 << "), counts = an:" << ntohs(hp->ancount) << " ns:" << ntohs(hp->nscount)
173 << " ar:" << ntohs(hp->arcount);
174
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900175 switch (hp->rcode) {
176 case NXDOMAIN:
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800177 *herrno = HOST_NOT_FOUND;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900178 break;
179 case SERVFAIL:
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800180 *herrno = TRY_AGAIN;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900181 break;
182 case NOERROR:
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800183 *herrno = NO_DATA;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900184 break;
185 case FORMERR:
186 case NOTIMP:
187 case REFUSED:
188 default:
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800189 *herrno = NO_RECOVERY;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900190 break;
191 }
Bernie Innocenti9c575932018-09-07 21:10:25 +0900192 return -1;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900193 }
Bernie Innocenti9c575932018-09-07 21:10:25 +0900194 return n;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900195}
196
197/*
198 * Formulate a normal query, send, and retrieve answer in supplied buffer.
199 * Return the size of the response on success, -1 on error.
200 * If enabled, implement search rules until answer or unrecoverable failure
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800201 * is detected. Error code, if any, is left in *herrno.
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900202 */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900203int res_nsearch(res_state statp, const char* name, /* domain name */
Bernie Innocenti9c575932018-09-07 21:10:25 +0900204 int cl, int type, /* class and type of query */
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900205 u_char* answer, /* buffer to put answer */
Mike Yubfb1b342018-11-06 15:42:36 +0800206 int anslen, /* size of answer */
Hungming Chen947aab02018-12-27 18:33:19 +0800207 int* herrno) /* legacy and extended
208 h_errno NETD_RESOLV_H_ERRNO_EXT_* */
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900209{
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900210 const char *cp, *const *domain;
211 HEADER* hp = (HEADER*) (void*) answer;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900212 u_int dots;
213 int trailing_dot, ret, saved_herrno;
214 int got_nodata = 0, got_servfail = 0, root_on_list = 0;
215 int tried_as_is = 0;
216 int searched = 0;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900217
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900218 errno = 0;
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800219 *herrno = HOST_NOT_FOUND; /* True if we never query. */
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900220
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900221 dots = 0;
222 for (cp = name; *cp != '\0'; cp++) dots += (*cp == '.');
223 trailing_dot = 0;
224 if (cp > name && *--cp == '.') trailing_dot++;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900225
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900226 /*
227 * If there are enough dots in the name, let's just give it a
228 * try 'as is'. The threshold can be set with the "ndots" option.
229 * Also, query 'as is', if there is a trailing dot in the name.
230 */
231 saved_herrno = -1;
232 if (dots >= statp->ndots || trailing_dot) {
Hungming Chen947aab02018-12-27 18:33:19 +0800233 ret = res_nquerydomain(statp, name, NULL, cl, type, answer, anslen, herrno);
Bernie Innocenti9c575932018-09-07 21:10:25 +0900234 if (ret > 0 || trailing_dot) return ret;
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800235 saved_herrno = *herrno;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900236 tried_as_is++;
237 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900238
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900239 /*
240 * We do at least one level of search if
241 * - there is no dot and RES_DEFNAME is set, or
242 * - there is at least one dot, there is no trailing dot,
243 * and RES_DNSRCH is set.
244 */
245 if ((!dots && (statp->options & RES_DEFNAMES) != 0U) ||
246 (dots && !trailing_dot && (statp->options & RES_DNSRCH) != 0U)) {
247 int done = 0;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900248
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900249 /* Unfortunately we need to load network-specific info
250 * (dns servers, search domains) before
251 * the domain stuff is tried. Will have a better
252 * fix after thread pools are used as this will
253 * be loaded once for the thread instead of each
254 * time a query is tried.
255 */
256 _resolv_populate_res_for_net(statp);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900257
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900258 for (domain = (const char* const*) statp->dnsrch; *domain && !done; domain++) {
259 searched = 1;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900260
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900261 if (domain[0][0] == '\0' || (domain[0][0] == '.' && domain[0][1] == '\0'))
262 root_on_list++;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900263
Hungming Chen947aab02018-12-27 18:33:19 +0800264 ret = res_nquerydomain(statp, name, *domain, cl, type, answer, anslen, herrno);
Bernie Innocenti9c575932018-09-07 21:10:25 +0900265 if (ret > 0) return ret;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900266
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900267 /*
268 * If no server present, give up.
269 * If name isn't found in this domain,
270 * keep trying higher domains in the search list
271 * (if that's enabled).
272 * On a NO_DATA error, keep trying, otherwise
273 * a wildcard entry of another type could keep us
274 * from finding this entry higher in the domain.
275 * If we get some other error (negative answer or
276 * server failure), then stop searching up,
277 * but try the input name below in case it's
278 * fully-qualified.
279 */
280 if (errno == ECONNREFUSED) {
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800281 *herrno = TRY_AGAIN;
Bernie Innocenti9c575932018-09-07 21:10:25 +0900282 return -1;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900283 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900284
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800285 switch (*herrno) {
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900286 case NO_DATA:
287 got_nodata++;
Bernie Innocenti3a4002e2018-10-12 21:27:45 +0900288 break;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900289 case HOST_NOT_FOUND:
290 /* keep trying */
291 break;
292 case TRY_AGAIN:
293 if (hp->rcode == SERVFAIL) {
294 /* try next search element, if any */
295 got_servfail++;
296 break;
297 }
Bernie Innocentif40b3bd2018-10-10 22:30:12 +0900298 [[fallthrough]];
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900299 default:
300 /* anything else implies that we're done */
301 done++;
302 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900303
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900304 /* if we got here for some reason other than DNSRCH,
305 * we only wanted one iteration of the loop, so stop.
306 */
307 if ((statp->options & RES_DNSRCH) == 0U) done++;
308 }
309 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900310
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900311 /*
312 * If the query has not already been tried as is then try it
313 * unless RES_NOTLDQUERY is set and there were no dots.
314 */
315 if ((dots || !searched || (statp->options & RES_NOTLDQUERY) == 0U) &&
316 !(tried_as_is || root_on_list)) {
Hungming Chen947aab02018-12-27 18:33:19 +0800317 ret = res_nquerydomain(statp, name, NULL, cl, type, answer, anslen, herrno);
Bernie Innocenti9c575932018-09-07 21:10:25 +0900318 if (ret > 0) return ret;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900319 }
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900320
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900321 /* if we got here, we didn't satisfy the search.
322 * if we did an initial full query, return that query's H_ERRNO
323 * (note that we wouldn't be here if that query had succeeded).
324 * else if we ever got a nodata, send that back as the reason.
325 * else send back meaningless H_ERRNO, that being the one from
326 * the last DNSRCH we did.
327 */
328 if (saved_herrno != -1)
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800329 *herrno = saved_herrno;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900330 else if (got_nodata)
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800331 *herrno = NO_DATA;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900332 else if (got_servfail)
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800333 *herrno = TRY_AGAIN;
Bernie Innocenti9c575932018-09-07 21:10:25 +0900334 return -1;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900335}
336
337/*
338 * Perform a call on res_query on the concatenation of name and domain,
339 * removing a trailing dot from name if domain is NULL.
340 */
Mike Yubfb1b342018-11-06 15:42:36 +0800341int res_nquerydomain(res_state statp, const char* name, const char* domain, int cl,
342 int type, /* class and type of query */
343 u_char* answer, /* buffer to put answer */
344 int anslen, /* size of answer */
Hungming Chen947aab02018-12-27 18:33:19 +0800345 int* herrno) /* legacy and extended h_errno NETD_RESOLV_H_ERRNO_EXT_* */
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900346{
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900347 char nbuf[MAXDNAME];
348 const char* longname = nbuf;
349 int n, d;
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900350
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900351 if (domain == NULL) {
Ken Chenffc224a2019-03-19 17:41:28 +0800352 LOG(DEBUG) << __func__ << ": (null, " << cl << ", " << type << ")";
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900353 /*
354 * Check for trailing '.';
355 * copy without '.' if present.
356 */
357 n = strlen(name);
358 if (n >= MAXDNAME) {
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800359 *herrno = NO_RECOVERY;
Bernie Innocenti9c575932018-09-07 21:10:25 +0900360 return -1;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900361 }
362 n--;
363 if (n >= 0 && name[n] == '.') {
364 strncpy(nbuf, name, (size_t) n);
365 nbuf[n] = '\0';
366 } else
367 longname = name;
368 } else {
Ken Chenffc224a2019-03-19 17:41:28 +0800369 LOG(DEBUG) << __func__ << ": (" << cl << ", " << type << ")";
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900370 n = strlen(name);
371 d = strlen(domain);
372 if (n + d + 1 >= MAXDNAME) {
Hungming Chen6c84a3d2018-12-26 16:14:17 +0800373 *herrno = NO_RECOVERY;
Bernie Innocenti9c575932018-09-07 21:10:25 +0900374 return -1;
Bernie Innocenti8ad893f2018-08-31 14:09:46 +0900375 }
376 snprintf(nbuf, sizeof(nbuf), "%s.%s", name, domain);
377 }
Hungming Chen947aab02018-12-27 18:33:19 +0800378 return res_nquery(statp, longname, cl, type, answer, anslen, herrno);
Bernie Innocenti318ed2d2018-08-30 04:05:20 +0900379}