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