Home | History | Annotate | Line # | Download | only in include
resolv.h revision 1.10
      1 /*
      2  * ++Copyright++ 1983, 1987, 1989, 1993
      3  * -
      4  * Copyright (c) 1983, 1987, 1989, 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  * Portions Copyright (c) 1993 by Digital Equipment Corporation.
     36  *
     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.
     43  *
     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
     51  * SOFTWARE.
     52  * -
     53  * --Copyright--
     54  */
     55 
     56 /*
     57  *	@(#)resolv.h	8.1 (Berkeley) 6/2/93
     58  *	$Id: resolv.h,v 1.10 1997/04/13 09:26:22 mrg Exp $
     59  */
     60 
     61 #ifndef _RESOLV_H_
     62 #define	_RESOLV_H_
     63 
     64 #include <sys/param.h>
     65 #if (!defined(BSD)) || (BSD < 199306)
     66 # include <sys/bitypes.h>
     67 #else
     68 # include <sys/types.h>
     69 #endif
     70 #include <sys/cdefs.h>
     71 #include <stdio.h>
     72 
     73 /*
     74  * Revision information.  This is the release date in YYYYMMDD format.
     75  * It can change every day so the right thing to do with it is use it
     76  * in preprocessor commands such as "#if (__RES > 19931104)".  Do not
     77  * compare for equality; rather, use it to determine whether your resolver
     78  * is new enough to contain a certain feature.
     79  */
     80 
     81 #define	__RES	19960801
     82 
     83 /*
     84  * Resolver configuration file.
     85  * Normally not present, but may contain the address of the
     86  * inital name server(s) to query and the domain search list.
     87  */
     88 
     89 #ifndef _PATH_RESCONF
     90 #define _PATH_RESCONF        "/etc/resolv.conf"
     91 #endif
     92 
     93 /*
     94  * Global defines and variables for resolver stub.
     95  */
     96 #define	MAXNS			3	/* max # name servers we'll track */
     97 #define	MAXDFLSRCH		3	/* # default domain levels to try */
     98 #define	MAXDNSRCH		6	/* max # domains in search path */
     99 #define	LOCALDOMAINPARTS	2	/* min levels in name that is "local" */
    100 #define	MAXDNSLUS		4	/* max # of host lookup types */
    101 
    102 #define	RES_TIMEOUT		5	/* min. seconds between retries */
    103 #define	MAXRESOLVSORT		10	/* number of net to sort on */
    104 #define	RES_MAXNDOTS		15	/* should reflect bit field size */
    105 
    106 struct __res_state {
    107 	int	retrans;	 	/* retransmition time interval */
    108 	int	retry;			/* number of times to retransmit */
    109 	u_long	options;		/* option flags - see below. */
    110 	int	nscount;		/* number of name servers */
    111 	struct sockaddr_in
    112 		nsaddr_list[MAXNS];	/* address of name server */
    113 #define	nsaddr	nsaddr_list[0]		/* for backward compatibility */
    114 	u_short	id;			/* current message id */
    115 	char	*dnsrch[MAXDNSRCH+1];	/* components of domain to search */
    116 	char	defdname[256];		/* default domain (deprecated) */
    117 	u_long	pfcode;			/* RES_PRF_ flags - see below. */
    118 	unsigned ndots:4;		/* threshold for initial abs. query */
    119 	unsigned nsort:4;		/* number of elements in sort_list[] */
    120 	char	unused[3];
    121 	struct {
    122 		struct in_addr	addr;
    123 		u_int32_t	mask;
    124 	} sort_list[MAXRESOLVSORT];
    125 	char	lookups[MAXDNSLUS];
    126 };
    127 
    128 /*
    129  * Resolver options (keep these in synch with res_debug.c, please)
    130  */
    131 #define RES_INIT	0x00000001	/* address initialized */
    132 #define RES_DEBUG	0x00000002	/* print debug messages */
    133 #define RES_AAONLY	0x00000004	/* authoritative answers only (!IMPL)*/
    134 #define RES_USEVC	0x00000008	/* use virtual circuit */
    135 #define RES_PRIMARY	0x00000010	/* query primary server only (!IMPL) */
    136 #define RES_IGNTC	0x00000020	/* ignore trucation errors */
    137 #define RES_RECURSE	0x00000040	/* recursion desired */
    138 #define RES_DEFNAMES	0x00000080	/* use default domain name */
    139 #define RES_STAYOPEN	0x00000100	/* Keep TCP socket open */
    140 #define RES_DNSRCH	0x00000200	/* search up local domain tree */
    141 #define	RES_INSECURE1	0x00000400	/* type 1 security disabled */
    142 #define	RES_INSECURE2	0x00000800	/* type 2 security disabled */
    143 #define	RES_NOALIASES	0x00001000	/* shuts off HOSTALIASES feature */
    144 #define	RES_USE_INET6	0x00002000	/* use/map IPv6 in gethostbyname() */
    145 
    146 #define RES_DEFAULT	(RES_RECURSE | RES_DEFNAMES | RES_DNSRCH)
    147 
    148 /*
    149  * Resolver "pfcode" values.  Used by dig.
    150  */
    151 #define RES_PRF_STATS	0x00000001
    152 /*			0x00000002	*/
    153 #define RES_PRF_CLASS   0x00000004
    154 #define RES_PRF_CMD	0x00000008
    155 #define RES_PRF_QUES	0x00000010
    156 #define RES_PRF_ANS	0x00000020
    157 #define RES_PRF_AUTH	0x00000040
    158 #define RES_PRF_ADD	0x00000080
    159 #define RES_PRF_HEAD1	0x00000100
    160 #define RES_PRF_HEAD2	0x00000200
    161 #define RES_PRF_TTLID	0x00000400
    162 #define RES_PRF_HEADX	0x00000800
    163 #define RES_PRF_QUERY	0x00001000
    164 #define RES_PRF_REPLY	0x00002000
    165 #define RES_PRF_INIT    0x00004000
    166 /*			0x00008000	*/
    167 
    168 /* hooks are still experimental as of 4.9.2 */
    169 typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error }
    170 	res_sendhookact;
    171 
    172 typedef res_sendhookact (*res_send_qhook)__P((struct sockaddr_in * const *ns,
    173 					      const u_char **query,
    174 					      int *querylen,
    175 					      u_char *ans,
    176 					      int anssiz,
    177 					      int *resplen));
    178 
    179 typedef res_sendhookact (*res_send_rhook)__P((const struct sockaddr_in *ns,
    180 					      const u_char *query,
    181 					      int querylen,
    182 					      u_char *ans,
    183 					      int anssiz,
    184 					      int *resplen));
    185 
    186 struct res_sym {
    187 	int	number;		/* Identifying number, like T_MX */
    188 	char *	name;		/* Its symbolic name, like "MX" */
    189 	char *	humanname;	/* Its fun name, like "mail exchanger" */
    190 };
    191 
    192 extern struct __res_state _res;
    193 extern const struct res_sym __p_class_syms[];
    194 extern const struct res_sym __p_type_syms[];
    195 
    196 /* Private routines shared between libc/net, named, nslookup and others. */
    197 #define	res_hnok	__res_hnok
    198 #define	res_ownok	__res_ownok
    199 #define	res_mailok	__res_mailok
    200 #define	res_dnok	__res_dnok
    201 #define	sym_ston	__sym_ston
    202 #define	sym_ntos	__sym_ntos
    203 #define	sym_ntop	__sym_ntop
    204 #define b64_ntop	__b64_ntop
    205 #define	b64_pton	__b64_pton
    206 #define	loc_ntoa	__loc_ntoa
    207 #define	loc_aton	__loc_aton
    208 #define	dn_skipname	__dn_skipname
    209 #define	fp_resstat	__fp_resstat
    210 #define	fp_query	__fp_query
    211 #define	fp_nquery	__fp_nquery
    212 #define	hostalias	__hostalias
    213 #define	putlong		__putlong
    214 #define	putshort	__putshort
    215 #define p_class		__p_class
    216 #define p_time		__p_time
    217 #define p_type		__p_type
    218 #define	p_query		__p_query
    219 #define	p_cdnname	__p_cdnname
    220 #define	p_cdname	__p_cdname
    221 #define	p_fqnname	__p_fqnname
    222 #define	p_fqname	__p_fqname
    223 #define	p_rr		__p_rr
    224 #define	p_option	__p_option
    225 #define	p_secstodate	__p_secstodate
    226 #define	dn_count_labels	__dn_count_labels
    227 #define	dn_comp		__dn_comp
    228 #define	res_randomid	__res_randomid
    229 #define	res_send	__res_send
    230 #define	res_isourserver	__res_isourserver
    231 #define	res_nameinquery	__res_nameinquery
    232 #define	res_queriesmatch __res_queriesmatch
    233 #define	res_close	__res_close
    234 
    235 #ifdef BIND_RES_POSIX3
    236 #define	dn_expand	__dn_expand
    237 #define	res_init	__res_init
    238 #define	res_query	__res_query
    239 #define	res_search	__res_search
    240 #define	res_querydomain	__res_querydomain
    241 #define	res_mkquery	__res_mkquery
    242 #endif
    243 
    244 __BEGIN_DECLS
    245 int		res_hnok __P((const char *));
    246 int		res_ownok __P((const char *));
    247 int		res_mailok __P((const char *));
    248 int		res_dnok __P((const char *));
    249 int		sym_ston __P((const struct res_sym *, char *, int *));
    250 const char *	sym_ntos __P((const struct res_sym *, int, int *));
    251 const char *	sym_ntop __P((const struct res_sym *, int, int *));
    252 int		b64_ntop __P((u_char const *, size_t, char *, size_t));
    253 int		b64_pton __P((char const *, u_char *, size_t));
    254 int		loc_aton __P((const char *, u_char *));
    255 const char *	loc_ntoa __P((const u_char *, char *));
    256 int		dn_skipname __P((const u_char *, const u_char *));
    257 void		fp_resstat __P((struct __res_state *, FILE *));
    258 void		fp_query __P((const u_char *, FILE *));
    259 void		fp_nquery __P((const u_char *, int, FILE *));
    260 const char *	hostalias __P((const char *));
    261 void		putlong __P((u_int32_t, u_char *));
    262 void		putshort __P((u_int16_t, u_char *));
    263 const char *	p_class __P((int));
    264 const char *	p_time __P((u_int32_t));
    265 const char *	p_type __P((int));
    266 void		p_query __P((const u_char *));
    267 const u_char *	p_cdnname __P((const u_char *, const u_char *, int, FILE *));
    268 const u_char *	p_cdname __P((const u_char *, const u_char *, FILE *));
    269 const u_char *	p_fqnname __P((const u_char *cp, const u_char *msg,
    270 			       int, char *, int));
    271 const u_char *	p_fqname __P((const u_char *, const u_char *, FILE *));
    272 const u_char *	p_rr __P((const u_char *, const u_char *, FILE *));
    273 const char *	p_option __P((u_long option));
    274 char *		p_secstodate __P((u_long));
    275 int		dn_count_labels __P((char *));
    276 int		dn_comp __P((const char *, u_char *, int,
    277 			     u_char **, u_char **));
    278 int		dn_expand __P((const u_char *, const u_char *, const u_char *,
    279 			       char *, int));
    280 int		res_init __P((void));
    281 u_int		res_randomid __P((void));
    282 int		res_query __P((const char *, int, int, u_char *, int));
    283 int		res_search __P((const char *, int, int, u_char *, int));
    284 int		res_querydomain __P((const char *, const char *, int, int,
    285 				     u_char *, int));
    286 int		res_mkquery __P((int, const char *, int, int, const u_char *, int,
    287 				 const u_char *, u_char *, int));
    288 int		res_send __P((const u_char *, int, u_char *, int));
    289 int		res_isourserver __P((const struct sockaddr_in *));
    290 int		res_nameinquery __P((const char *, int, int,
    291 				     const u_char *, const u_char *));
    292 int		res_queriesmatch __P((const u_char *, const u_char *,
    293 				      const u_char *, const u_char *));
    294 void		res_close __P((void));
    295 __END_DECLS
    296 
    297 #endif /* !_RESOLV_H_ */
    298