[mirror_edk2.git] / StdLib / Include / resolv.h

/*-\r
 * Copyright (c) 1983, 1987, 1989, 1993\r
 *	The Regents of the University of California.  All rights reserved.\r
 *\r
 * Redistribution and use in source and binary forms, with or without\r
 * modification, are permitted provided that the following conditions\r
 * are met:\r
 * 1. Redistributions of source code must retain the above copyright\r
 *    notice, this list of conditions and the following disclaimer.\r
 * 2. Redistributions in binary form must reproduce the above copyright\r
 *    notice, this list of conditions and the following disclaimer in the\r
 *    documentation and/or other materials provided with the distribution.\r
 * 3. All advertising materials mentioning features or use of this software\r
 *    must display the following acknowledgement:\r
 *	This product includes software developed by the University of\r
 *	California, Berkeley and its contributors.\r
 * 4. Neither the name of the University nor the names of its contributors\r
 *    may be used to endorse or promote products derived from this software\r
 *    without specific prior written permission.\r
 *\r
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\r
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\r
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
 * SUCH DAMAGE.\r
 */\r
\r
/*\r
 * Portions Copyright (c) 1996 by Internet Software Consortium.\r
 *\r
 * Permission to use, copy, modify, and distribute this software for any\r
 * purpose with or without fee is hereby granted, provided that the above\r
 * copyright notice and this permission notice appear in all copies.\r
 *\r
 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS\r
 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES\r
 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE\r
 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\r
 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\r
 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS\r
 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS\r
 * SOFTWARE.\r
 */\r
\r
/*\r
 *	@(#)resolv.h	8.1 (Berkeley) 6/2/93\r
 *	From Id: resolv.h,v 8.12 1998/04/28 19:36:46 halley Exp $\r
 *	$Id: resolv.h,v 1.1.1.1 2003/11/19 01:48:35 kyu3 Exp $\r
 */\r
\r
#ifndef _RESOLV_H_\r
#define	_RESOLV_H_\r
\r
#include <arpa/nameser.h>\r
#include <sys/param.h>\r
#include <sys/types.h>\r
#include <sys/cdefs.h>\r
#include <stdio.h>\r
#include <paths.h>\r
\r
#ifndef __P\r
#define __P(x)      x\r
#endif  //  __P\r
\r
/*\r
 * Revision information.  This is the release date in YYYYMMDD format.\r
 * It can change every day so the right thing to do with it is use it\r
 * in preprocessor commands such as "#if (__RES > 19931104)".  Do not\r
 * compare for equality; rather, use it to determine whether your resolver\r
 * is new enough to contain a certain feature.\r
 */\r
\r
#define	__RES	19960801\r
\r
/*\r
 * Global defines and variables for resolver stub.\r
 */\r
#define	MAXNS			3	/* max # name servers we'll track */\r
#define	MAXDFLSRCH		3	/* # default domain levels to try */\r
#define	MAXDNSRCH		6	/* max # domains in search path */\r
#define	LOCALDOMAINPARTS	2	/* min levels in name that is "local" */\r
\r
#define	RES_TIMEOUT		5	/* min. seconds between retries */\r
#define	MAXRESOLVSORT		10	/* number of net to sort on */\r
#define	RES_MAXNDOTS		15	/* should reflect bit field size */\r
\r
struct __res_state {\r
	int	retrans;	 	/* retransmition time interval */\r
	int	retry;			/* number of times to retransmit */\r
	u_long	options;		/* option flags - see below. */\r
	int	nscount;		/* number of name servers */\r
	struct sockaddr_in\r
		nsaddr_list[MAXNS];	/* address of name server */\r
#define	nsaddr	nsaddr_list[0]		/* for backward compatibility */\r
	u_short	id;			/* current message id */\r
	char	*dnsrch[MAXDNSRCH+1];	/* components of domain to search */\r
	char	defdname[256];		/* default domain (deprecated) */\r
	u_long	pfcode;			/* RES_PRF_ flags - see below. */\r
	unsigned ndots:4;		/* threshold for initial abs. query */\r
	unsigned nsort:4;		/* number of elements in sort_list[] */\r
	char	unused[3];\r
	struct {\r
		struct in_addr	addr;\r
		u_int32_t	mask;\r
	} sort_list[MAXRESOLVSORT];\r
	char	pad[72];		/* on an i386 this means 512b total */\r
};\r
\r
/*\r
 * Resolver options (keep these in synch with res_debug.c, please)\r
 */\r
#define RES_INIT	0x00000001	/* address initialized */\r
#define RES_DEBUG	0x00000002	/* print debug messages */\r
#define RES_AAONLY	0x00000004	/* authoritative answers only (!IMPL)*/\r
#define RES_USEVC	0x00000008	/* use virtual circuit */\r
#define RES_PRIMARY	0x00000010	/* query primary server only (!IMPL) */\r
#define RES_IGNTC	0x00000020	/* ignore truncation errors */\r
#define RES_RECURSE	0x00000040	/* recursion desired */\r
#define RES_DEFNAMES	0x00000080	/* use default domain name */\r
#define RES_STAYOPEN	0x00000100	/* Keep TCP socket open */\r
#define RES_DNSRCH	0x00000200	/* search up local domain tree */\r
#define	RES_INSECURE1	0x00000400	/* type 1 security disabled */\r
#define	RES_INSECURE2	0x00000800	/* type 2 security disabled */\r
#define	RES_NOALIASES	0x00001000	/* shuts off HOSTALIASES feature */\r
#define	RES_USE_INET6	0x00002000	/* use/map IPv6 in gethostbyname() */\r
#define	RES_NOTLDQUERY	0x00004000	/* Don't query TLD names */\r
\r
#define RES_DEFAULT	(RES_RECURSE | RES_DEFNAMES | RES_DNSRCH)\r
\r
/*\r
 * Resolver "pfcode" values.  Used by dig.\r
 */\r
#define	RES_PRF_STATS	0x00000001\r
#define	RES_PRF_UPDATE	0x00000002\r
#define	RES_PRF_CLASS   0x00000004\r
#define	RES_PRF_CMD	0x00000008\r
#define	RES_PRF_QUES	0x00000010\r
#define	RES_PRF_ANS	0x00000020\r
#define	RES_PRF_AUTH	0x00000040\r
#define	RES_PRF_ADD	0x00000080\r
#define	RES_PRF_HEAD1	0x00000100\r
#define	RES_PRF_HEAD2	0x00000200\r
#define	RES_PRF_TTLID	0x00000400\r
#define	RES_PRF_HEADX	0x00000800\r
#define	RES_PRF_QUERY	0x00001000\r
#define	RES_PRF_REPLY	0x00002000\r
#define	RES_PRF_INIT    0x00004000\r
/*			0x00008000	*/\r
\r
typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error }\r
	res_sendhookact;\r
\r
typedef res_sendhookact (*res_send_qhook)__P((struct sockaddr_in * const *ns,\r
					      const u_char **query,\r
					      int *querylen,\r
					      u_char *ans,\r
					      int anssiz,\r
					      int *resplen));\r
\r
typedef res_sendhookact (*res_send_rhook)__P((const struct sockaddr_in *ns,\r
					      const u_char *query,\r
					      int querylen,\r
					      u_char *ans,\r
					      int anssiz,\r
					      int *resplen));\r
\r
struct res_sym {\r
	int	number;		/* Identifying number, like T_MX */\r
	char *	name;		/* Its symbolic name, like "MX" */\r
	char *	humanname;	/* Its fun name, like "mail exchanger" */\r
};\r
\r
extern struct __res_state _res;\r
extern const struct res_sym __p_class_syms[];\r
extern const struct res_sym __p_type_syms[];\r
\r
/* Private routines shared between libc/net, named, nslookup and others. */\r
#define	res_hnok	__res_hnok\r
#define	res_ownok	__res_ownok\r
#define	res_mailok	__res_mailok\r
#define	res_dnok	__res_dnok\r
#define	sym_ston	__sym_ston\r
#define	sym_ntos	__sym_ntos\r
#define	sym_ntop	__sym_ntop\r
#define	b64_ntop	__b64_ntop\r
#define	b64_pton	__b64_pton\r
#define	loc_ntoa	__loc_ntoa\r
#define	loc_aton	__loc_aton\r
#define	fp_resstat	__fp_resstat\r
#define	p_query		__p_query\r
#define	dn_skipname	__dn_skipname\r
#define	fp_resstat	__fp_resstat\r
#define	fp_query	__fp_query\r
#define	fp_nquery	__fp_nquery\r
#define	hostalias	__hostalias\r
#define	putlong		__putlong\r
#define	putshort	__putshort\r
#define	p_class		__p_class\r
#define	p_time		__p_time\r
#define	p_type		__p_type\r
#define	p_query		__p_query\r
#define	p_cdnname	__p_cdnname\r
#define	p_section	__p_section\r
#define	p_cdname	__p_cdname\r
#define	p_fqnname	__p_fqnname\r
#define	p_fqname	__p_fqname\r
#define	p_option	__p_option\r
#define	p_secstodate	__p_secstodate\r
#define	dn_count_labels	__dn_count_labels\r
#define	dn_comp		__dn_comp\r
#define	dn_expand	__dn_expand\r
#define	res_init	__res_init\r
#define	res_randomid	__res_randomid\r
#define	res_query	__res_query\r
#define	res_search	__res_search\r
#define	res_querydomain	__res_querydomain\r
#define	res_mkquery	__res_mkquery\r
#define	res_send	__res_send\r
#define	res_isourserver	__res_isourserver\r
#define	res_nameinquery	__res_nameinquery\r
#define	res_queriesmatch __res_queriesmatch\r
#define	res_close	__res_close\r
#define	res_mkupdate	__res_mkupdate\r
#define	res_mkupdrec	__res_mkupdrec\r
#define	res_freeupdrec	__res_freeupdrec\r
\r
__BEGIN_DECLS\r
int		res_hnok __P((const char *));\r
int		res_ownok __P((const char *));\r
int		res_mailok __P((const char *));\r
int		res_dnok __P((const char *));\r
int		sym_ston __P((const struct res_sym *, const char *, int *));\r
const char *	sym_ntos __P((const struct res_sym *, int, int *));\r
const char *	sym_ntop __P((const struct res_sym *, int, int *));\r
int		b64_ntop __P((u_char const *, size_t, char *, size_t));\r
int		b64_pton __P((char const *, u_char *, size_t));\r
int		loc_aton __P((const char *, u_char *));\r
const char *	loc_ntoa __P((const u_char *, char *));\r
int		dn_skipname __P((const u_char *, const u_char *));\r
void		fp_resstat __P((struct __res_state *, FILE *));\r
void		fp_query __P((const u_char *, FILE *));\r
void		fp_nquery __P((const u_char *, int, FILE *));\r
const char *	hostalias __P((const char *));\r
void		putlong __P((u_int32_t, u_char *));\r
void		putshort __P((u_int16_t, u_char *));\r
const char *	p_class __P((int));\r
const char *	p_time __P((u_int32_t));\r
const char *	p_type __P((int));\r
void		p_query __P((const u_char *));\r
const u_char *	p_cdnname __P((const u_char *, const u_char *, int, FILE *));\r
const u_char *	p_cdname __P((const u_char *, const u_char *, FILE *));\r
const u_char *	p_fqnname __P((const u_char *, const u_char *,\r
			       int, char *, int));\r
const u_char *	p_fqname __P((const u_char *, const u_char *, FILE *));\r
const char *	p_option __P((u_long));\r
char *		p_secstodate __P((u_long));\r
int		dn_count_labels __P((const char *));\r
int		dn_comp __P((const char *, u_char *, int,\r
			     u_char **, u_char **));\r
int		dn_expand __P((const u_char *, const u_char *, const u_char *,\r
			       char *, int));\r
int		res_init __P((void));\r
u_int		res_randomid __P((void));\r
int		res_query __P((const char *, int, int, u_char *, int));\r
int		res_search __P((const char *, int, int, u_char *, int));\r
int		res_querydomain __P((const char *, const char *, int, int,\r
				     u_char *, int));\r
int		res_mkquery __P((int, const char *, int, int, const u_char *,\r
				 int, const u_char *, u_char *, int));\r
int		res_send __P((const u_char *, int, u_char *, int));\r
int		res_isourserver __P((const struct sockaddr_in *));\r
int		res_nameinquery __P((const char *, int, int,\r
				     const u_char *, const u_char *));\r
int		res_queriesmatch __P((const u_char *, const u_char *,\r
				      const u_char *, const u_char *));\r
void		res_close __P((void));\r
const char *	p_section __P((int, int));\r
/* XXX The following depend on the ns_updrec typedef in arpa/nameser.h */\r
#ifdef _ARPA_NAMESER_H_\r
int		res_update __P((ns_updrec *));\r
int		res_mkupdate __P((ns_updrec *, u_char *, int));\r
ns_updrec *	res_mkupdrec __P((int, const char *, u_int, u_int, u_long));\r
void		res_freeupdrec __P((ns_updrec *));\r
#endif\r
__END_DECLS\r
\r
#endif /* !_RESOLV_H_ */\r
Commit	Line	Data
d7ce7006	1	/*-\r
	2	* Copyright (c) 1983, 1987, 1989, 1993\r
	3	* The Regents of the University of California. All rights reserved.\r
	4	*\r
	5	* Redistribution and use in source and binary forms, with or without\r
	6	* modification, are permitted provided that the following conditions\r
	7	* are met:\r
	8	* 1. Redistributions of source code must retain the above copyright\r
	9	* notice, this list of conditions and the following disclaimer.\r
	10	* 2. Redistributions in binary form must reproduce the above copyright\r
	11	* notice, this list of conditions and the following disclaimer in the\r
	12	* documentation and/or other materials provided with the distribution.\r
	13	* 3. All advertising materials mentioning features or use of this software\r
	14	* must display the following acknowledgement:\r
	15	* This product includes software developed by the University of\r
	16	* California, Berkeley and its contributors.\r
	17	* 4. Neither the name of the University nor the names of its contributors\r
	18	* may be used to endorse or promote products derived from this software\r
	19	* without specific prior written permission.\r
	20	*\r
	21	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\r
	22	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
	23	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
	24	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\r
	25	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
	26	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
	27	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
	28	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
	29	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
	30	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
	31	* SUCH DAMAGE.\r
	32	*/\r
	33	\r
	34	/*\r
	35	* Portions Copyright (c) 1996 by Internet Software Consortium.\r
	36	*\r
	37	* Permission to use, copy, modify, and distribute this software for any\r
	38	* purpose with or without fee is hereby granted, provided that the above\r
	39	* copyright notice and this permission notice appear in all copies.\r
	40	*\r
	41	* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS\r
	42	* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES\r
	43	* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE\r
	44	* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\r
	45	* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\r
	46	* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS\r
	47	* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS\r
	48	* SOFTWARE.\r
	49	*/\r
	50	\r
	51	/*\r
	52	* @(#)resolv.h 8.1 (Berkeley) 6/2/93\r
	53	* From Id: resolv.h,v 8.12 1998/04/28 19:36:46 halley Exp $\r
	54	* $Id: resolv.h,v 1.1.1.1 2003/11/19 01:48:35 kyu3 Exp $\r
	55	*/\r
	56	\r
	57	#ifndef _RESOLV_H_\r
	58	#define _RESOLV_H_\r
	59	\r
	60	#include <arpa/nameser.h>\r
	61	#include <sys/param.h>\r
	62	#include <sys/types.h>\r
	63	#include <sys/cdefs.h>\r
	64	#include <stdio.h>\r
65	#include <paths.h>\r
66	\r
67	#ifndef __P\r
68	#define __P(x) x\r
69	#endif // __P\r
70	\r
71	/*\r
72	* Revision information. This is the release date in YYYYMMDD format.\r
73	* It can change every day so the right thing to do with it is use it\r
74	* in preprocessor commands such as "#if (__RES > 19931104)". Do not\r
75	* compare for equality; rather, use it to determine whether your resolver\r
76	* is new enough to contain a certain feature.\r
77	*/\r
78	\r
79	#define __RES 19960801\r
80	\r
81	/*\r
82	* Global defines and variables for resolver stub.\r
83	*/\r
84	#define MAXNS 3 /* max # name servers we'll track */\r
85	#define MAXDFLSRCH 3 /* # default domain levels to try */\r
86	#define MAXDNSRCH 6 /* max # domains in search path */\r
87	#define LOCALDOMAINPARTS 2 /* min levels in name that is "local" */\r
88	\r
89	#define RES_TIMEOUT 5 /* min. seconds between retries */\r
90	#define MAXRESOLVSORT 10 /* number of net to sort on */\r
91	#define RES_MAXNDOTS 15 /* should reflect bit field size */\r
92	\r
93	struct __res_state {\r
94	int retrans; /* retransmition time interval */\r
95	int retry; /* number of times to retransmit */\r
96	u_long options; /* option flags - see below. */\r
97	int nscount; /* number of name servers */\r
98	struct sockaddr_in\r
99	nsaddr_list[MAXNS]; /* address of name server */\r
100	#define nsaddr nsaddr_list[0] /* for backward compatibility */\r
101	u_short id; /* current message id */\r
102	char dnsrch[MAXDNSRCH+1]; / components of domain to search */\r
103	char defdname[256]; /* default domain (deprecated) */\r
104	u_long pfcode; /* RES_PRF_ flags - see below. */\r
105	unsigned ndots:4; /* threshold for initial abs. query */\r
106	unsigned nsort:4; /* number of elements in sort_list[] */\r
107	char unused[3];\r
108	struct {\r
109	struct in_addr addr;\r
110	u_int32_t mask;\r
111	} sort_list[MAXRESOLVSORT];\r
112	char pad[72]; /* on an i386 this means 512b total */\r
113	};\r
114	\r
115	/*\r
116	* Resolver options (keep these in synch with res_debug.c, please)\r
117	*/\r
118	#define RES_INIT 0x00000001 /* address initialized */\r
119	#define RES_DEBUG 0x00000002 /* print debug messages */\r
120	#define RES_AAONLY 0x00000004 /* authoritative answers only (!IMPL)*/\r
121	#define RES_USEVC 0x00000008 /* use virtual circuit */\r
122	#define RES_PRIMARY 0x00000010 /* query primary server only (!IMPL) */\r
123	#define RES_IGNTC 0x00000020 /* ignore truncation errors */\r
124	#define RES_RECURSE 0x00000040 /* recursion desired */\r
125	#define RES_DEFNAMES 0x00000080 /* use default domain name */\r
126	#define RES_STAYOPEN 0x00000100 /* Keep TCP socket open */\r
127	#define RES_DNSRCH 0x00000200 /* search up local domain tree */\r
128	#define RES_INSECURE1 0x00000400 /* type 1 security disabled */\r
129	#define RES_INSECURE2 0x00000800 /* type 2 security disabled */\r
130	#define RES_NOALIASES 0x00001000 /* shuts off HOSTALIASES feature */\r
131	#define RES_USE_INET6 0x00002000 /* use/map IPv6 in gethostbyname() */\r
132	#define RES_NOTLDQUERY 0x00004000 /* Don't query TLD names */\r
133	\r
134	#define RES_DEFAULT (RES_RECURSE \| RES_DEFNAMES \| RES_DNSRCH)\r
135	\r
136	/*\r
137	* Resolver "pfcode" values. Used by dig.\r
138	*/\r
139	#define RES_PRF_STATS 0x00000001\r
140	#define RES_PRF_UPDATE 0x00000002\r
141	#define RES_PRF_CLASS 0x00000004\r
142	#define RES_PRF_CMD 0x00000008\r
143	#define RES_PRF_QUES 0x00000010\r
144	#define RES_PRF_ANS 0x00000020\r
145	#define RES_PRF_AUTH 0x00000040\r
146	#define RES_PRF_ADD 0x00000080\r
147	#define RES_PRF_HEAD1 0x00000100\r
148	#define RES_PRF_HEAD2 0x00000200\r
149	#define RES_PRF_TTLID 0x00000400\r
150	#define RES_PRF_HEADX 0x00000800\r
151	#define RES_PRF_QUERY 0x00001000\r
152	#define RES_PRF_REPLY 0x00002000\r
153	#define RES_PRF_INIT 0x00004000\r
154	/* 0x00008000 */\r
155	\r
156	typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error }\r
157	res_sendhookact;\r
158	\r
159	typedef res_sendhookact (res_send_qhook)__P((struct sockaddr_in const *ns,\r
160	const u_char **query,\r
161	int *querylen,\r
162	u_char *ans,\r
163	int anssiz,\r
164	int *resplen));\r
165	\r
166	typedef res_sendhookact (res_send_rhook)__P((const struct sockaddr_in ns,\r
167	const u_char *query,\r
168	int querylen,\r
169	u_char *ans,\r
170	int anssiz,\r
171	int *resplen));\r
172	\r
173	struct res_sym {\r
174	int number; /* Identifying number, like T_MX */\r
175	char * name; /* Its symbolic name, like "MX" */\r
176	char * humanname; /* Its fun name, like "mail exchanger" */\r
177	};\r
178	\r
179	extern struct __res_state _res;\r
180	extern const struct res_sym __p_class_syms[];\r
181	extern const struct res_sym __p_type_syms[];\r
182	\r
183	/* Private routines shared between libc/net, named, nslookup and others. */\r
184	#define res_hnok __res_hnok\r
185	#define res_ownok __res_ownok\r
186	#define res_mailok __res_mailok\r
187	#define res_dnok __res_dnok\r
188	#define sym_ston __sym_ston\r
189	#define sym_ntos __sym_ntos\r
190	#define sym_ntop __sym_ntop\r
191	#define b64_ntop __b64_ntop\r
192	#define b64_pton __b64_pton\r
193	#define loc_ntoa __loc_ntoa\r
194	#define loc_aton __loc_aton\r
195	#define fp_resstat __fp_resstat\r
196	#define p_query __p_query\r
197	#define dn_skipname __dn_skipname\r
198	#define fp_resstat __fp_resstat\r
199	#define fp_query __fp_query\r
200	#define fp_nquery __fp_nquery\r
201	#define hostalias __hostalias\r
202	#define putlong __putlong\r
203	#define putshort __putshort\r
204	#define p_class __p_class\r
205	#define p_time __p_time\r
206	#define p_type __p_type\r
207	#define p_query __p_query\r
208	#define p_cdnname __p_cdnname\r
209	#define p_section __p_section\r
210	#define p_cdname __p_cdname\r
211	#define p_fqnname __p_fqnname\r
212	#define p_fqname __p_fqname\r
213	#define p_option __p_option\r
214	#define p_secstodate __p_secstodate\r
215	#define dn_count_labels __dn_count_labels\r
216	#define dn_comp __dn_comp\r
217	#define dn_expand __dn_expand\r
218	#define res_init __res_init\r
219	#define res_randomid __res_randomid\r
220	#define res_query __res_query\r
221	#define res_search __res_search\r
222	#define res_querydomain __res_querydomain\r
223	#define res_mkquery __res_mkquery\r
224	#define res_send __res_send\r
225	#define res_isourserver __res_isourserver\r
226	#define res_nameinquery __res_nameinquery\r
227	#define res_queriesmatch __res_queriesmatch\r
228	#define res_close __res_close\r
229	#define res_mkupdate __res_mkupdate\r
230	#define res_mkupdrec __res_mkupdrec\r
231	#define res_freeupdrec __res_freeupdrec\r
232	\r
233	__BEGIN_DECLS\r
234	int res_hnok __P((const char *));\r
235	int res_ownok __P((const char *));\r
236	int res_mailok __P((const char *));\r
237	int res_dnok __P((const char *));\r
238	int sym_ston __P((const struct res_sym , const char , int *));\r
239	const char * sym_ntos __P((const struct res_sym , int, int ));\r
240	const char * sym_ntop __P((const struct res_sym , int, int ));\r
241	int b64_ntop __P((u_char const , size_t, char , size_t));\r
242	int b64_pton __P((char const , u_char , size_t));\r
243	int loc_aton __P((const char , u_char ));\r
244	const char * loc_ntoa __P((const u_char , char ));\r
245	int dn_skipname __P((const u_char , const u_char ));\r
246	void fp_resstat __P((struct __res_state , FILE ));\r
247	void fp_query __P((const u_char , FILE ));\r
248	void fp_nquery __P((const u_char , int, FILE ));\r
249	const char * hostalias __P((const char *));\r
250	void putlong __P((u_int32_t, u_char *));\r
251	void putshort __P((u_int16_t, u_char *));\r
252	const char * p_class __P((int));\r
253	const char * p_time __P((u_int32_t));\r
254	const char * p_type __P((int));\r
255	void p_query __P((const u_char *));\r
256	const u_char * p_cdnname __P((const u_char , const u_char , int, FILE *));\r
257	const u_char * p_cdname __P((const u_char , const u_char , FILE *));\r
258	const u_char * p_fqnname __P((const u_char , const u_char ,\r
259	int, char *, int));\r
260	const u_char * p_fqname __P((const u_char , const u_char , FILE *));\r
261	const char * p_option __P((u_long));\r
262	char * p_secstodate __P((u_long));\r
263	int dn_count_labels __P((const char *));\r
264	int dn_comp __P((const char , u_char , int,\r
265	u_char , u_char ));\r
266	int dn_expand __P((const u_char , const u_char , const u_char *,\r
267	char *, int));\r
268	int res_init __P((void));\r
269	u_int res_randomid __P((void));\r
270	int res_query __P((const char , int, int, u_char , int));\r
271	int res_search __P((const char , int, int, u_char , int));\r
272	int res_querydomain __P((const char , const char , int, int,\r
273	u_char *, int));\r
274	int res_mkquery __P((int, const char , int, int, const u_char ,\r
275	int, const u_char , u_char , int));\r
276	int res_send __P((const u_char , int, u_char , int));\r
277	int res_isourserver __P((const struct sockaddr_in *));\r
278	int res_nameinquery __P((const char *, int, int,\r
279	const u_char , const u_char ));\r
280	int res_queriesmatch __P((const u_char , const u_char ,\r
281	const u_char , const u_char ));\r
282	void res_close __P((void));\r
283	const char * p_section __P((int, int));\r
284	/* XXX The following depend on the ns_updrec typedef in arpa/nameser.h */\r
285	#ifdef _ARPA_NAMESER_H_\r
286	int res_update __P((ns_updrec *));\r
287	int res_mkupdate __P((ns_updrec , u_char , int));\r
288	ns_updrec * res_mkupdrec __P((int, const char *, u_int, u_int, u_long));\r
289	void res_freeupdrec __P((ns_updrec *));\r
290	#endif\r
291	__END_DECLS\r
292	\r
293	#endif /* !_RESOLV_H_ */\r