Home | History | Annotate | Line # | Download | only in resolv
res_query.c revision 1.1
      1 /*	$NetBSD: res_query.c,v 1.1 2004/05/20 17:18:54 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 
     73 #if defined(LIBC_SCCS) && !defined(lint)
     74 static const char sccsid[] = "@(#)res_query.c	8.1 (Berkeley) 6/4/93";
     75 static const char rcsid[] = "Id: res_query.c,v 1.2.2.3.4.2 2004/03/16 12:34:19 marka Exp";
     76 #endif /* LIBC_SCCS and not lint */
     77 
     78 #include "port_before.h"
     79 #include <sys/types.h>
     80 #include <sys/param.h>
     81 #include <netinet/in.h>
     82 #include <arpa/inet.h>
     83 #include <arpa/nameser.h>
     84 #include <ctype.h>
     85 #include <errno.h>
     86 #include <netdb.h>
     87 #include <resolv.h>
     88 #include <stdio.h>
     89 #include <stdlib.h>
     90 #include <string.h>
     91 #include "port_after.h"
     92 
     93 /* Options.  Leave them on. */
     94 #define DEBUG
     95 
     96 #if PACKETSZ > 1024
     97 #define MAXPACKET	PACKETSZ
     98 #else
     99 #define MAXPACKET	1024
    100 #endif
    101 
    102 /*
    103  * Formulate a normal query, send, and await answer.
    104  * Returned answer is placed in supplied buffer "answer".
    105  * Perform preliminary check of answer, returning success only
    106  * if no error is indicated and the answer count is nonzero.
    107  * Return the size of the response on success, -1 on error.
    108  * Error number is left in H_ERRNO.
    109  *
    110  * Caller must parse answer and determine whether it answers the question.
    111  */
    112 int
    113 res_nquery(res_state statp,
    114 	   const char *name,	/* domain name */
    115 	   int class, int type,	/* class and type of query */
    116 	   u_char *answer,	/* buffer to put answer */
    117 	   int anslen)		/* size of answer buffer */
    118 {
    119 	u_char buf[MAXPACKET];
    120 	HEADER *hp = (HEADER *) answer;
    121 	int n;
    122 	u_int oflags;
    123 
    124 	oflags = statp->_flags;
    125 
    126 again:
    127 	hp->rcode = NOERROR;	/* default */
    128 
    129 #ifdef DEBUG
    130 	if (statp->options & RES_DEBUG)
    131 		printf(";; res_query(%s, %d, %d)\n", name, class, type);
    132 #endif
    133 
    134 	n = res_nmkquery(statp, QUERY, name, class, type, NULL, 0, NULL,
    135 			 buf, sizeof(buf));
    136 #ifdef RES_USE_EDNS0
    137 	if (n > 0 && (statp->_flags & RES_F_EDNS0ERR) == 0 &&
    138 	    (statp->options & (RES_USE_EDNS0|RES_USE_DNSSEC)) != 0U)
    139 		n = res_nopt(statp, n, buf, sizeof(buf), anslen);
    140 #endif
    141 	if (n <= 0) {
    142 #ifdef DEBUG
    143 		if (statp->options & RES_DEBUG)
    144 			printf(";; res_query: mkquery failed\n");
    145 #endif
    146 		RES_SET_H_ERRNO(statp, NO_RECOVERY);
    147 		return (n);
    148 	}
    149 	n = res_nsend(statp, buf, n, answer, anslen);
    150 	if (n < 0) {
    151 #ifdef RES_USE_EDNS0
    152 		/* if the query choked with EDNS0, retry without EDNS0 */
    153 		if ((statp->options & (RES_USE_EDNS0|RES_USE_DNSSEC)) != 0U &&
    154 		    ((oflags ^ statp->_flags) & RES_F_EDNS0ERR) != 0) {
    155 			statp->_flags |= RES_F_EDNS0ERR;
    156 			if (statp->options & RES_DEBUG)
    157 				printf(";; res_nquery: retry without EDNS0\n");
    158 			goto again;
    159 		}
    160 #endif
    161 #ifdef DEBUG
    162 		if (statp->options & RES_DEBUG)
    163 			printf(";; res_query: send error\n");
    164 #endif
    165 		RES_SET_H_ERRNO(statp, TRY_AGAIN);
    166 		return (n);
    167 	}
    168 
    169 	if (hp->rcode != NOERROR || ntohs(hp->ancount) == 0) {
    170 #ifdef DEBUG
    171 		if (statp->options & RES_DEBUG)
    172 			printf(";; rcode = (%s), counts = an:%d ns:%d ar:%d\n",
    173 			       p_rcode(hp->rcode),
    174 			       ntohs(hp->ancount),
    175 			       ntohs(hp->nscount),
    176 			       ntohs(hp->arcount));
    177 #endif
    178 		switch (hp->rcode) {
    179 		case NXDOMAIN:
    180 			RES_SET_H_ERRNO(statp, HOST_NOT_FOUND);
    181 			break;
    182 		case SERVFAIL:
    183 			RES_SET_H_ERRNO(statp, TRY_AGAIN);
    184 			break;
    185 		case NOERROR:
    186 			RES_SET_H_ERRNO(statp, NO_DATA);
    187 			break;
    188 		case FORMERR:
    189 		case NOTIMP:
    190 		case REFUSED:
    191 		default:
    192 			RES_SET_H_ERRNO(statp, NO_RECOVERY);
    193 			break;
    194 		}
    195 		return (-1);
    196 	}
    197 	return (n);
    198 }
    199 
    200 /*
    201  * Formulate a normal query, send, and retrieve answer in supplied buffer.
    202  * Return the size of the response on success, -1 on error.
    203  * If enabled, implement search rules until answer or unrecoverable failure
    204  * is detected.  Error code, if any, is left in H_ERRNO.
    205  */
    206 int
    207 res_nsearch(res_state statp,
    208 	    const char *name,	/* domain name */
    209 	    int class, int type,	/* class and type of query */
    210 	    u_char *answer,	/* buffer to put answer */
    211 	    int anslen)		/* size of answer */
    212 {
    213 	const char *cp, * const *domain;
    214 	HEADER *hp = (HEADER *) answer;
    215 	char tmp[NS_MAXDNAME];
    216 	u_int dots;
    217 	int trailing_dot, ret, saved_herrno;
    218 	int got_nodata = 0, got_servfail = 0, root_on_list = 0;
    219 	int tried_as_is = 0;
    220 	int searched = 0;
    221 
    222 	errno = 0;
    223 	RES_SET_H_ERRNO(statp, HOST_NOT_FOUND);  /* True if we never query. */
    224 
    225 	dots = 0;
    226 	for (cp = name; *cp != '\0'; cp++)
    227 		dots += (*cp == '.');
    228 	trailing_dot = 0;
    229 	if (cp > name && *--cp == '.')
    230 		trailing_dot++;
    231 
    232 	/* If there aren't any dots, it could be a user-level alias. */
    233 	if (!dots && (cp = res_hostalias(statp, name, tmp, sizeof tmp))!= NULL)
    234 		return (res_nquery(statp, cp, class, type, answer, anslen));
    235 
    236 	/*
    237 	 * If there are enough dots in the name, let's just give it a
    238 	 * try 'as is'. The threshold can be set with the "ndots" option.
    239 	 * Also, query 'as is', if there is a trailing dot in the name.
    240 	 */
    241 	saved_herrno = -1;
    242 	if (dots >= statp->ndots || trailing_dot) {
    243 		ret = res_nquerydomain(statp, name, NULL, class, type,
    244 					 answer, anslen);
    245 		if (ret > 0 || trailing_dot)
    246 			return (ret);
    247 		saved_herrno = statp->res_h_errno;
    248 		tried_as_is++;
    249 	}
    250 
    251 	/*
    252 	 * We do at least one level of search if
    253 	 *	- there is no dot and RES_DEFNAME is set, or
    254 	 *	- there is at least one dot, there is no trailing dot,
    255 	 *	  and RES_DNSRCH is set.
    256 	 */
    257 	if ((!dots && (statp->options & RES_DEFNAMES) != 0U) ||
    258 	    (dots && !trailing_dot && (statp->options & RES_DNSRCH) != 0U)) {
    259 		int done = 0;
    260 
    261 		for (domain = (const char * const *)statp->dnsrch;
    262 		     *domain && !done;
    263 		     domain++) {
    264 			searched = 1;
    265 
    266 			if (domain[0][0] == '\0' ||
    267 			    (domain[0][0] == '.' && domain[0][1] == '\0'))
    268 				root_on_list++;
    269 
    270 			ret = res_nquerydomain(statp, name, *domain,
    271 					       class, type,
    272 					       answer, anslen);
    273 			if (ret > 0)
    274 				return (ret);
    275 
    276 			/*
    277 			 * If no server present, give up.
    278 			 * If name isn't found in this domain,
    279 			 * keep trying higher domains in the search list
    280 			 * (if that's enabled).
    281 			 * On a NO_DATA error, keep trying, otherwise
    282 			 * a wildcard entry of another type could keep us
    283 			 * from finding this entry higher in the domain.
    284 			 * If we get some other error (negative answer or
    285 			 * server failure), then stop searching up,
    286 			 * but try the input name below in case it's
    287 			 * fully-qualified.
    288 			 */
    289 			if (errno == ECONNREFUSED) {
    290 				RES_SET_H_ERRNO(statp, TRY_AGAIN);
    291 				return (-1);
    292 			}
    293 
    294 			switch (statp->res_h_errno) {
    295 			case NO_DATA:
    296 				got_nodata++;
    297 				/* FALLTHROUGH */
    298 			case HOST_NOT_FOUND:
    299 				/* keep trying */
    300 				break;
    301 			case TRY_AGAIN:
    302 				if (hp->rcode == SERVFAIL) {
    303 					/* try next search element, if any */
    304 					got_servfail++;
    305 					break;
    306 				}
    307 				/* FALLTHROUGH */
    308 			default:
    309 				/* anything else implies that we're done */
    310 				done++;
    311 			}
    312 
    313 			/* if we got here for some reason other than DNSRCH,
    314 			 * we only wanted one iteration of the loop, so stop.
    315 			 */
    316 			if ((statp->options & RES_DNSRCH) == 0U)
    317 				done++;
    318 		}
    319 	}
    320 
    321 	/*
    322 	 * If the query has not already been tried as is then try it
    323 	 * unless RES_NOTLDQUERY is set and there were no dots.
    324 	 */
    325 	if ((dots || !searched || (statp->options & RES_NOTLDQUERY) == 0U) &&
    326 	    !(tried_as_is || root_on_list)) {
    327 		ret = res_nquerydomain(statp, name, NULL, class, type,
    328 				       answer, anslen);
    329 		if (ret > 0)
    330 			return (ret);
    331 	}
    332 
    333 	/* if we got here, we didn't satisfy the search.
    334 	 * if we did an initial full query, return that query's H_ERRNO
    335 	 * (note that we wouldn't be here if that query had succeeded).
    336 	 * else if we ever got a nodata, send that back as the reason.
    337 	 * else send back meaningless H_ERRNO, that being the one from
    338 	 * the last DNSRCH we did.
    339 	 */
    340 	if (saved_herrno != -1)
    341 		RES_SET_H_ERRNO(statp, saved_herrno);
    342 	else if (got_nodata)
    343 		RES_SET_H_ERRNO(statp, NO_DATA);
    344 	else if (got_servfail)
    345 		RES_SET_H_ERRNO(statp, TRY_AGAIN);
    346 	return (-1);
    347 }
    348 
    349 /*
    350  * Perform a call on res_query on the concatenation of name and domain,
    351  * removing a trailing dot from name if domain is NULL.
    352  */
    353 int
    354 res_nquerydomain(res_state statp,
    355 	    const char *name,
    356 	    const char *domain,
    357 	    int class, int type,	/* class and type of query */
    358 	    u_char *answer,		/* buffer to put answer */
    359 	    int anslen)		/* size of answer */
    360 {
    361 	char nbuf[MAXDNAME];
    362 	const char *longname = nbuf;
    363 	int n, d;
    364 
    365 #ifdef DEBUG
    366 	if (statp->options & RES_DEBUG)
    367 		printf(";; res_nquerydomain(%s, %s, %d, %d)\n",
    368 		       name, domain?domain:"<Nil>", class, type);
    369 #endif
    370 	if (domain == NULL) {
    371 		/*
    372 		 * Check for trailing '.';
    373 		 * copy without '.' if present.
    374 		 */
    375 		n = strlen(name);
    376 		if (n >= MAXDNAME) {
    377 			RES_SET_H_ERRNO(statp, NO_RECOVERY);
    378 			return (-1);
    379 		}
    380 		n--;
    381 		if (n >= 0 && name[n] == '.') {
    382 			strncpy(nbuf, name, n);
    383 			nbuf[n] = '\0';
    384 		} else
    385 			longname = name;
    386 	} else {
    387 		n = strlen(name);
    388 		d = strlen(domain);
    389 		if (n + d + 1 >= MAXDNAME) {
    390 			RES_SET_H_ERRNO(statp, NO_RECOVERY);
    391 			return (-1);
    392 		}
    393 		sprintf(nbuf, "%s.%s", name, domain);
    394 	}
    395 	return (res_nquery(statp, longname, class, type, answer, anslen));
    396 }
    397 
    398 const char *
    399 res_hostalias(const res_state statp, const char *name, char *dst, size_t siz) {
    400 	char *file, *cp1, *cp2;
    401 	char buf[BUFSIZ];
    402 	FILE *fp;
    403 
    404 	if (statp->options & RES_NOALIASES)
    405 		return (NULL);
    406 	file = getenv("HOSTALIASES");
    407 	if (file == NULL || (fp = fopen(file, "r")) == NULL)
    408 		return (NULL);
    409 	setbuf(fp, NULL);
    410 	buf[sizeof(buf) - 1] = '\0';
    411 	while (fgets(buf, sizeof(buf), fp)) {
    412 		for (cp1 = buf; *cp1 && !isspace((unsigned char)*cp1); ++cp1)
    413 			;
    414 		if (!*cp1)
    415 			break;
    416 		*cp1 = '\0';
    417 		if (ns_samename(buf, name) == 1) {
    418 			while (isspace((unsigned char)*++cp1))
    419 				;
    420 			if (!*cp1)
    421 				break;
    422 			for (cp2 = cp1 + 1; *cp2 &&
    423 			     !isspace((unsigned char)*cp2); ++cp2)
    424 				;
    425 			*cp2 = '\0';
    426 			strncpy(dst, cp1, siz - 1);
    427 			dst[siz - 1] = '\0';
    428 			fclose(fp);
    429 			return (dst);
    430 		}
    431 	}
    432 	fclose(fp);
    433 	return (NULL);
    434 }
    435