]>
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 | |
3bdf9aae | 115 | typedef struct __res_state *res_state;\r |
116 | \r | |
d7ce7006 | 117 | /*\r |
118 | * Resolver options (keep these in synch with res_debug.c, please)\r | |
119 | */\r | |
120 | #define RES_INIT 0x00000001 /* address initialized */\r | |
121 | #define RES_DEBUG 0x00000002 /* print debug messages */\r | |
122 | #define RES_AAONLY 0x00000004 /* authoritative answers only (!IMPL)*/\r | |
123 | #define RES_USEVC 0x00000008 /* use virtual circuit */\r | |
124 | #define RES_PRIMARY 0x00000010 /* query primary server only (!IMPL) */\r | |
125 | #define RES_IGNTC 0x00000020 /* ignore truncation errors */\r | |
126 | #define RES_RECURSE 0x00000040 /* recursion desired */\r | |
127 | #define RES_DEFNAMES 0x00000080 /* use default domain name */\r | |
128 | #define RES_STAYOPEN 0x00000100 /* Keep TCP socket open */\r | |
129 | #define RES_DNSRCH 0x00000200 /* search up local domain tree */\r | |
130 | #define RES_INSECURE1 0x00000400 /* type 1 security disabled */\r | |
131 | #define RES_INSECURE2 0x00000800 /* type 2 security disabled */\r | |
132 | #define RES_NOALIASES 0x00001000 /* shuts off HOSTALIASES feature */\r | |
133 | #define RES_USE_INET6 0x00002000 /* use/map IPv6 in gethostbyname() */\r | |
134 | #define RES_NOTLDQUERY 0x00004000 /* Don't query TLD names */\r | |
135 | \r | |
136 | #define RES_DEFAULT (RES_RECURSE | RES_DEFNAMES | RES_DNSRCH)\r | |
137 | \r | |
138 | /*\r | |
139 | * Resolver "pfcode" values. Used by dig.\r | |
140 | */\r | |
141 | #define RES_PRF_STATS 0x00000001\r | |
142 | #define RES_PRF_UPDATE 0x00000002\r | |
143 | #define RES_PRF_CLASS 0x00000004\r | |
144 | #define RES_PRF_CMD 0x00000008\r | |
145 | #define RES_PRF_QUES 0x00000010\r | |
146 | #define RES_PRF_ANS 0x00000020\r | |
147 | #define RES_PRF_AUTH 0x00000040\r | |
148 | #define RES_PRF_ADD 0x00000080\r | |
149 | #define RES_PRF_HEAD1 0x00000100\r | |
150 | #define RES_PRF_HEAD2 0x00000200\r | |
151 | #define RES_PRF_TTLID 0x00000400\r | |
152 | #define RES_PRF_HEADX 0x00000800\r | |
153 | #define RES_PRF_QUERY 0x00001000\r | |
154 | #define RES_PRF_REPLY 0x00002000\r | |
155 | #define RES_PRF_INIT 0x00004000\r | |
156 | /* 0x00008000 */\r | |
157 | \r | |
158 | typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error }\r | |
159 | res_sendhookact;\r | |
160 | \r | |
161 | typedef res_sendhookact (*res_send_qhook)__P((struct sockaddr_in * const *ns,\r | |
162 | const u_char **query,\r | |
163 | int *querylen,\r | |
164 | u_char *ans,\r | |
165 | int anssiz,\r | |
166 | int *resplen));\r | |
167 | \r | |
168 | typedef res_sendhookact (*res_send_rhook)__P((const struct sockaddr_in *ns,\r | |
169 | const u_char *query,\r | |
170 | int querylen,\r | |
171 | u_char *ans,\r | |
172 | int anssiz,\r | |
173 | int *resplen));\r | |
174 | \r | |
175 | struct res_sym {\r | |
176 | int number; /* Identifying number, like T_MX */\r | |
177 | char * name; /* Its symbolic name, like "MX" */\r | |
178 | char * humanname; /* Its fun name, like "mail exchanger" */\r | |
179 | };\r | |
180 | \r | |
181 | extern struct __res_state _res;\r | |
182 | extern const struct res_sym __p_class_syms[];\r | |
183 | extern const struct res_sym __p_type_syms[];\r | |
184 | \r | |
185 | /* Private routines shared between libc/net, named, nslookup and others. */\r | |
186 | #define res_hnok __res_hnok\r | |
187 | #define res_ownok __res_ownok\r | |
188 | #define res_mailok __res_mailok\r | |
189 | #define res_dnok __res_dnok\r | |
190 | #define sym_ston __sym_ston\r | |
191 | #define sym_ntos __sym_ntos\r | |
192 | #define sym_ntop __sym_ntop\r | |
193 | #define b64_ntop __b64_ntop\r | |
194 | #define b64_pton __b64_pton\r | |
195 | #define loc_ntoa __loc_ntoa\r | |
196 | #define loc_aton __loc_aton\r | |
197 | #define fp_resstat __fp_resstat\r | |
198 | #define p_query __p_query\r | |
199 | #define dn_skipname __dn_skipname\r | |
200 | #define fp_resstat __fp_resstat\r | |
201 | #define fp_query __fp_query\r | |
202 | #define fp_nquery __fp_nquery\r | |
203 | #define hostalias __hostalias\r | |
204 | #define putlong __putlong\r | |
205 | #define putshort __putshort\r | |
3bdf9aae | 206 | uint16_t _getshort(const u_char *);\r |
d7ce7006 | 207 | #define p_class __p_class\r |
208 | #define p_time __p_time\r | |
209 | #define p_type __p_type\r | |
210 | #define p_query __p_query\r | |
211 | #define p_cdnname __p_cdnname\r | |
212 | #define p_section __p_section\r | |
213 | #define p_cdname __p_cdname\r | |
214 | #define p_fqnname __p_fqnname\r | |
215 | #define p_fqname __p_fqname\r | |
216 | #define p_option __p_option\r | |
217 | #define p_secstodate __p_secstodate\r | |
218 | #define dn_count_labels __dn_count_labels\r | |
219 | #define dn_comp __dn_comp\r | |
220 | #define dn_expand __dn_expand\r | |
221 | #define res_init __res_init\r | |
222 | #define res_randomid __res_randomid\r | |
223 | #define res_query __res_query\r | |
224 | #define res_search __res_search\r | |
225 | #define res_querydomain __res_querydomain\r | |
226 | #define res_mkquery __res_mkquery\r | |
227 | #define res_send __res_send\r | |
228 | #define res_isourserver __res_isourserver\r | |
229 | #define res_nameinquery __res_nameinquery\r | |
230 | #define res_queriesmatch __res_queriesmatch\r | |
231 | #define res_close __res_close\r | |
232 | #define res_mkupdate __res_mkupdate\r | |
233 | #define res_mkupdrec __res_mkupdrec\r | |
234 | #define res_freeupdrec __res_freeupdrec\r | |
235 | \r | |
236 | __BEGIN_DECLS\r | |
237 | int res_hnok __P((const char *));\r | |
238 | int res_ownok __P((const char *));\r | |
239 | int res_mailok __P((const char *));\r | |
240 | int res_dnok __P((const char *));\r | |
241 | int sym_ston __P((const struct res_sym *, const char *, int *));\r | |
242 | const char * sym_ntos __P((const struct res_sym *, int, int *));\r | |
243 | const char * sym_ntop __P((const struct res_sym *, int, int *));\r | |
244 | int b64_ntop __P((u_char const *, size_t, char *, size_t));\r | |
245 | int b64_pton __P((char const *, u_char *, size_t));\r | |
246 | int loc_aton __P((const char *, u_char *));\r | |
247 | const char * loc_ntoa __P((const u_char *, char *));\r | |
248 | int dn_skipname __P((const u_char *, const u_char *));\r | |
249 | void fp_resstat __P((struct __res_state *, FILE *));\r | |
250 | void fp_query __P((const u_char *, FILE *));\r | |
251 | void fp_nquery __P((const u_char *, int, FILE *));\r | |
252 | const char * hostalias __P((const char *));\r | |
253 | void putlong __P((u_int32_t, u_char *));\r | |
254 | void putshort __P((u_int16_t, u_char *));\r | |
255 | const char * p_class __P((int));\r | |
256 | const char * p_time __P((u_int32_t));\r | |
257 | const char * p_type __P((int));\r | |
258 | void p_query __P((const u_char *));\r | |
259 | const u_char * p_cdnname __P((const u_char *, const u_char *, int, FILE *));\r | |
260 | const u_char * p_cdname __P((const u_char *, const u_char *, FILE *));\r | |
261 | const u_char * p_fqnname __P((const u_char *, const u_char *,\r | |
262 | int, char *, int));\r | |
263 | const u_char * p_fqname __P((const u_char *, const u_char *, FILE *));\r | |
264 | const char * p_option __P((u_long));\r | |
265 | char * p_secstodate __P((u_long));\r | |
266 | int dn_count_labels __P((const char *));\r | |
267 | int dn_comp __P((const char *, u_char *, int,\r | |
268 | u_char **, u_char **));\r | |
269 | int dn_expand __P((const u_char *, const u_char *, const u_char *,\r | |
270 | char *, int));\r | |
271 | int res_init __P((void));\r | |
272 | u_int res_randomid __P((void));\r | |
273 | int res_query __P((const char *, int, int, u_char *, int));\r | |
274 | int res_search __P((const char *, int, int, u_char *, int));\r | |
275 | int res_querydomain __P((const char *, const char *, int, int,\r | |
276 | u_char *, int));\r | |
277 | int res_mkquery __P((int, const char *, int, int, const u_char *,\r | |
278 | int, const u_char *, u_char *, int));\r | |
279 | int res_send __P((const u_char *, int, u_char *, int));\r | |
280 | int res_isourserver __P((const struct sockaddr_in *));\r | |
281 | int res_nameinquery __P((const char *, int, int,\r | |
282 | const u_char *, const u_char *));\r | |
283 | int res_queriesmatch __P((const u_char *, const u_char *,\r | |
284 | const u_char *, const u_char *));\r | |
285 | void res_close __P((void));\r | |
286 | const char * p_section __P((int, int));\r | |
287 | /* XXX The following depend on the ns_updrec typedef in arpa/nameser.h */\r | |
288 | #ifdef _ARPA_NAMESER_H_\r | |
289 | int res_update __P((ns_updrec *));\r | |
290 | int res_mkupdate __P((ns_updrec *, u_char *, int));\r | |
291 | ns_updrec * res_mkupdrec __P((int, const char *, u_int, u_int, u_long));\r | |
292 | void res_freeupdrec __P((ns_updrec *));\r | |
293 | #endif\r | |
3bdf9aae | 294 | \r |
d7ce7006 | 295 | __END_DECLS\r |
296 | \r | |
297 | #endif /* !_RESOLV_H_ */\r |