Print this page
remove support for non-ANSI compilation
Split |
Close |
Expand all |
Collapse all |
--- old/usr/src/head/resolv.h
+++ new/usr/src/head/resolv.h
1 1 /*
2 + * Copyright 2014 Garrett D'Amore <garrett@damore.org>
3 + *
2 4 * Copyright 2009 Sun Microsystems, Inc. All rights reserved.
3 5 * Use is subject to license terms.
4 6 *
5 7 * Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T
6 8 * All Rights Reserved
7 9 *
8 10 * Portions of this source code were derived from Berkeley
9 11 * 4.3 BSD under license from the regents of the University of
10 12 * California.
11 13 */
12 14
13 15 /*
14 16 * BIND 4.9.4:
15 17 */
16 18
17 19 /*
18 20 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
19 21 *
20 22 * Permission to use, copy, modify, and distribute this software for any
21 23 * purpose with or without fee is hereby granted, provided that the above
22 24 * copyright notice and this permission notice appear in all copies, and that
23 25 * the name of Digital Equipment Corporation not be used in advertising or
24 26 * publicity pertaining to distribution of the document or software without
25 27 * specific, written prior permission.
26 28 *
27 29 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
28 30 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
29 31 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
30 32 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
31 33 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
32 34 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
33 35 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
34 36 * SOFTWARE.
35 37 * --Copyright--
36 38 *
37 39 * End BIND 4.9.4
38 40 */
39 41
40 42 /*
41 43 * Copyright (c) 1983, 1987, 1989
42 44 * The Regents of the University of California. All rights reserved.
43 45 *
44 46 * Redistribution and use in source and binary forms, with or without
45 47 * modification, are permitted provided that the following conditions
46 48 * are met:
47 49 * 1. Redistributions of source code must retain the above copyright
48 50 * notice, this list of conditions and the following disclaimer.
49 51 * 2. Redistributions in binary form must reproduce the above copyright
50 52 * notice, this list of conditions and the following disclaimer in the
51 53 * documentation and/or other materials provided with the distribution.
52 54 * 3. All advertising materials mentioning features or use of this software
53 55 * must display the following acknowledgement:
54 56 * This product includes software developed by the University of
55 57 * California, Berkeley and its contributors.
56 58 * 4. Neither the name of the University nor the names of its contributors
57 59 * may be used to endorse or promote products derived from this software
58 60 * without specific prior written permission.
59 61 *
60 62 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
61 63 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
62 64 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
63 65 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
64 66 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
65 67 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
66 68 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
67 69 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
68 70 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
69 71 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
70 72 * SUCH DAMAGE.
71 73 */
72 74
73 75 /*
74 76 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
75 77 *
76 78 * Permission to use, copy, modify, and distribute this software for any
77 79 * purpose with or without fee is hereby granted, provided that the above
78 80 * copyright notice and this permission notice appear in all copies.
79 81 *
80 82 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
81 83 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
82 84 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
83 85 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
84 86 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
85 87 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
86 88 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
87 89 * SOFTWARE.
88 90 */
89 91
90 92 /*
91 93 * @(#)resolv.h 8.1 (Berkeley) 6/2/93
92 94 * $Id: resolv.h,v 8.52 2003/04/29 02:27:03 marka Exp $
93 95 */
94 96
95 97 #ifndef _RESOLV_H_
96 98 #define _RESOLV_H_
97 99
98 100 #include <sys/param.h>
99 101
100 102 #include <stdio.h>
101 103 #include <arpa/nameser.h>
102 104 #include <sys/socket.h>
103 105
104 106 #ifdef __cplusplus
105 107 extern "C" {
106 108 #endif
107 109
108 110 /*
109 111 * Revision information. This is the release date in YYYYMMDD format.
110 112 * It can change every day so the right thing to do with it is use it
111 113 * in preprocessor commands such as "#if (__RES > 19931104)". Do not
112 114 * compare for equality; rather, use it to determine whether your resolver
113 115 * is new enough to contain a certain feature.
114 116 */
115 117
116 118 #define __RES 20090302
117 119
118 120 #define RES_SET_H_ERRNO(r, x) __h_errno_set(r, x)
119 121 struct __res_state; /* forward */
120 122
121 123 void __h_errno_set(struct __res_state *res, int err);
122 124
↓ open down ↓ |
111 lines elided |
↑ open up ↑ |
123 125 /*
124 126 * Resolver configuration file.
125 127 * Normally not present, but may contain the address of the
126 128 * initial name server(s) to query and the domain search list.
127 129 */
128 130
129 131 #ifndef _PATH_RESCONF
130 132 #define _PATH_RESCONF "/etc/resolv.conf"
131 133 #endif
132 134
133 -#ifdef __STDC__
134 135 #ifndef __P
135 136 #define __P(x) x
136 137 #endif
137 -#else
138 -#ifndef __P
139 -#define __P(x) ()
140 -#endif
141 -#endif /* __STDC__ */
142 138
143 139 typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error }
144 140 res_sendhookact;
145 141
146 142 typedef res_sendhookact (*res_send_qhook)__P((struct sockaddr * const *ns,
147 143 const uchar_t **query,
148 144 int *querylen,
149 145 uchar_t *ans,
150 146 int anssiz,
151 147 int *resplen));
152 148
153 149 typedef res_sendhookact (*res_send_rhook)__P((const struct sockaddr *ns,
154 150 const uchar_t *query,
155 151 int querylen,
156 152 uchar_t *ans,
157 153 int anssiz,
158 154 int *resplen));
159 155
160 156 struct res_sym {
161 157 int number; /* Identifying number, like T_MX */
162 158 const char *name; /* Its symbolic name, like "MX" */
163 159 const char *humanname; /* Its fun name, like "mail exchanger" */
164 160 };
165 161
166 162 /*
167 163 * Global defines and variables for resolver stub.
168 164 */
169 165 /* ADDRSORT and MAXADDR retained for compatibility; not used */
170 166 #define ADDRSORT 1 /* enable the address-sorting option */
171 167 #define MAXADDR 10 /* max # addresses to sort by */
172 168
173 169 #define MAXNS 3 /* max # name servers we'll track */
174 170 #define MAXDFLSRCH 3 /* # default domain levels to try */
175 171 #define MAXDNSRCH 6 /* max # domains in search path */
176 172 #define LOCALDOMAINPARTS 2 /* min levels in name that is "local" */
177 173
178 174 #define RES_TIMEOUT 5 /* min. seconds between retries */
179 175 #define MAXRESOLVSORT 10 /* number of net to sort on */
180 176 #define RES_MAXNDOTS 15 /* should reflect bit field size */
181 177 #define RES_MAXRETRANS 30 /* only for resolv.conf/RES_OPTIONS */
182 178 #define RES_MAXRETRY 5 /* only for resolv.conf/RES_OPTIONS */
183 179 #define RES_DFLRETRY 2 /* Default #/tries. */
184 180 #define RES_MAXTIME 65535 /* Infinity, in milliseconds. */
185 181
186 182 struct __res_state_ext;
187 183
188 184 struct __res_state {
189 185 int retrans; /* retransmission time interval */
190 186 int retry; /* number of times to retransmit */
191 187 #ifdef __sun
192 188 uint_t options; /* option flags - see below. */
193 189 #else
194 190 ulong_t options; /* option flags - see below. */
195 191 #endif
196 192 int nscount; /* number of name servers */
197 193 struct sockaddr_in
198 194 nsaddr_list[MAXNS]; /* address of name server */
199 195 #define nsaddr nsaddr_list[0] /* for backward compatibility */
200 196 ushort_t id; /* current packet id */
201 197 char *dnsrch[MAXDNSRCH+1]; /* components of domain to search */
202 198 char defdname[256]; /* default domain (deprecated) */
203 199 #ifdef __sun
204 200 uint_t pfcode; /* RES_PRF_ flags - see below. */
205 201 #else
206 202 ulong_t pfcode; /* RES_PRF_ flags - see below. */
207 203 #endif
208 204 unsigned ndots:4; /* threshold for initial abs. query */
209 205 unsigned nsort:4; /* number of elements in sort_list[] */
210 206 char unused[3];
211 207 struct {
212 208 struct in_addr addr;
213 209 unsigned int mask;
214 210 } sort_list[MAXRESOLVSORT];
215 211 res_send_qhook qhook; /* query hook */
216 212 res_send_rhook rhook; /* response hook */
217 213 int res_h_errno; /* last one set for this context */
218 214 int _vcsock; /* PRIVATE: for res_send VC i/o */
219 215 uint_t _flags; /* PRIVATE: see below */
220 216 uint_t _pad; /* make _u 64 bit aligned */
221 217 union {
222 218 /* On an 32-bit arch this means 512b total. */
223 219 char pad[72 - 4*sizeof (int) - 2*sizeof (void *)];
224 220 struct {
225 221 uint16_t nscount;
226 222 uint16_t nstimes[MAXNS]; /* ms. */
227 223 int nssocks[MAXNS];
228 224 struct __res_state_ext *ext; /* extention for IPv6 */
229 225 uchar_t _rnd[16]; /* PRIVATE: random state */
230 226 } _ext;
231 227 } _u;
232 228 };
233 229
234 230 typedef struct __res_state *res_state;
235 231
236 232 union res_sockaddr_union {
237 233 struct sockaddr_in sin;
238 234 #ifdef IN6ADDR_ANY_INIT
239 235 struct sockaddr_in6 sin6;
240 236 #endif
241 237 #ifdef ISC_ALIGN64
242 238 int64_t __align64; /* 64bit alignment */
243 239 #else
244 240 int32_t __align32; /* 32bit alignment */
245 241 #endif
246 242 char __space[128]; /* max size */
247 243 };
248 244
249 245 /*
250 246 * Resolver flags (used to be discrete per-module statics ints).
251 247 */
252 248 #define RES_F_VC 0x00000001 /* socket is TCP */
253 249 #define RES_F_CONN 0x00000002 /* socket is connected */
254 250 #define RES_F_EDNS0ERR 0x00000004 /* EDNS0 caused errors */
255 251 #define RES_F__UNUSED 0x00000008 /* (unused) */
256 252 #define RES_F_LASTMASK 0x000000F0 /* ordinal server of last res_nsend */
257 253 #define RES_F_LASTSHIFT 4 /* bit position of LASTMASK "flag" */
258 254 #define RES_GETLAST(res) (((res)._flags & RES_F_LASTMASK) >> RES_F_LASTSHIFT)
259 255
260 256 /* res_findzonecut2() options */
261 257 #define RES_EXHAUSTIVE 0x00000001 /* always do all queries */
262 258 #define RES_IPV4ONLY 0x00000002 /* IPv4 only */
263 259 #define RES_IPV6ONLY 0x00000004 /* IPv6 only */
264 260
265 261 /*
266 262 * Resolver options (keep these in synch with res_debug.c, please)
267 263 */
268 264 #define RES_INIT 0x00000001 /* address initialized */
269 265 #define RES_DEBUG 0x00000002 /* print debug messages */
270 266 #define RES_AAONLY 0x00000004 /* authoritative answers only (!IMPL) */
271 267 #define RES_USEVC 0x00000008 /* use virtual circuit */
272 268 #define RES_PRIMARY 0x00000010 /* query primary server only (!IMPL) */
273 269 #define RES_IGNTC 0x00000020 /* ignore trucation errors */
274 270 #define RES_RECURSE 0x00000040 /* recursion desired */
275 271 #define RES_DEFNAMES 0x00000080 /* use default domain name */
276 272 #define RES_STAYOPEN 0x00000100 /* Keep TCP socket open */
277 273 #define RES_DNSRCH 0x00000200 /* search up local domain tree */
278 274 #define RES_INSECURE1 0x00000400 /* type 1 security disabled */
279 275 #define RES_INSECURE2 0x00000800 /* type 2 security disabled */
280 276 #define RES_NOALIASES 0x00001000 /* shuts off HOSTALIASES feature */
281 277 #define RES_USE_INET6 0x00002000 /* use/map IPv6 in gethostbyname() */
282 278 #define RES_ROTATE 0x00004000 /* rotate ns list after each query */
283 279 #define RES_NOCHECKNAME 0x00008000 /* do not check names for sanity. */
284 280 #define RES_KEEPTSIG 0x00010000 /* do not strip TSIG records */
285 281 #define RES_BLAST 0x00020000 /* blast all recursive servers */
286 282 #define RES_NO_NIBBLE 0x00040000 /* disable IPv6 nibble mode reverse */
287 283 #define RES_NO_BITSTRING 0x00080000 /* disable IPv6 bitstring mode revrse */
288 284 #define RES_NOTLDQUERY 0x00100000 /* don't unqualified name as a tld */
289 285 #define RES_USE_DNSSEC 0x00200000 /* use DNSSEC using OK bit in OPT */
290 286 /* KAME extensions: use higher bit to avoid conflict with ISC use */
291 287 #define RES_USE_DNAME 0x10000000 /* use DNAME */
292 288 #define RES_USE_EDNS0 0x40000000 /* use EDNS0 if configured */
293 289 #define RES_NO_NIBBLE2 0x80000000 /* disable alternate nibble lookup */
294 290
295 291 #define RES_DEFAULT (RES_RECURSE | RES_DEFNAMES | RES_DNSRCH)
296 292
297 293 /*
298 294 * Resolver "pfcode" values. Used by dig.
299 295 */
300 296 #define RES_PRF_STATS 0x00000001
301 297 #define RES_PRF_UPDATE 0x00000002
302 298 #define RES_PRF_CLASS 0x00000004
303 299 #define RES_PRF_CMD 0x00000008
304 300 #define RES_PRF_QUES 0x00000010
305 301 #define RES_PRF_ANS 0x00000020
306 302 #define RES_PRF_AUTH 0x00000040
307 303 #define RES_PRF_ADD 0x00000080
308 304 #define RES_PRF_HEAD1 0x00000100
309 305 #define RES_PRF_HEAD2 0x00000200
310 306 #define RES_PRF_TTLID 0x00000400
311 307 #define RES_PRF_HEADX 0x00000800
312 308 #define RES_PRF_QUERY 0x00001000
313 309 #define RES_PRF_REPLY 0x00002000
314 310 #define RES_PRF_INIT 0x00004000
315 311 #define RES_PRF_TRUNC 0x00008000
316 312 /* 0x00010000 */
317 313
318 314 /* Things involving an internal (static) resolver context. */
319 315 #ifdef _REENTRANT
320 316 extern struct __res_state *__res_state(void);
321 317 #define _res (*__res_state())
322 318 #else
323 319 #ifndef __BIND_NOSTATIC
324 320 extern struct __res_state _res;
325 321 #endif
326 322 #endif
327 323
328 324 #ifndef __BIND_NOSTATIC
329 325 void fp_nquery __P((const uchar_t *, int, FILE *));
330 326 void fp_query __P((const uchar_t *, FILE *));
331 327 const char *hostalias __P((const char *));
332 328 void p_query __P((const uchar_t *));
333 329 void res_close __P((void));
334 330 int res_init __P((void));
335 331 int res_isourserver __P((const struct sockaddr_in *));
336 332 int res_mkquery __P((int, const char *, int, int, const uchar_t *,
337 333 int, const uchar_t *, uchar_t *, int));
338 334 int res_query __P((const char *, int, int, uchar_t *, int));
339 335 int res_querydomain __P((const char *, const char *, int, int,
340 336 uchar_t *, int));
341 337 int res_search __P((const char *, int, int, uchar_t *, int));
342 338 int res_send __P((const uchar_t *, int, uchar_t *, int));
343 339 int res_sendsigned __P((const uchar_t *, int, ns_tsig_key *,
344 340 uchar_t *, int));
345 341 #endif /* __BIND_NOSTATIC */
346 342
347 343 extern const struct res_sym __p_key_syms[];
348 344 extern const struct res_sym __p_cert_syms[];
349 345 extern const struct res_sym __p_class_syms[];
350 346 extern const struct res_sym __p_type_syms[];
351 347 extern const struct res_sym __p_rcode_syms[];
352 348
353 349 int res_hnok __P((const char *));
354 350 int res_ownok __P((const char *));
355 351 int res_mailok __P((const char *));
356 352 int res_dnok __P((const char *));
357 353 int sym_ston __P((const struct res_sym *, const char *, int *));
358 354 const char *sym_ntos __P((const struct res_sym *, int, int *));
359 355 const char *sym_ntop __P((const struct res_sym *, int, int *));
360 356 int b64_ntop __P((uchar_t const *, size_t, char *, size_t));
361 357 int b64_pton __P((char const *, uchar_t *, size_t));
362 358 int loc_aton __P((const char *ascii, uchar_t *binary));
363 359 const char *loc_ntoa __P((const uchar_t *binary, char *ascii));
364 360 int dn_skipname __P((const uchar_t *, const uchar_t *));
365 361 void putlong __P((unsigned int, uchar_t *));
366 362 void putshort __P((unsigned short, uchar_t *));
367 363 const char *p_class __P((int));
368 364 const char *p_time __P((unsigned int));
369 365 const char *p_type __P((int));
370 366 const char *p_rcode __P((int));
371 367 const char *p_sockun __P((union res_sockaddr_union, char *, size_t));
372 368 const uchar_t *p_cdnname __P((const uchar_t *, const uchar_t *, int,
373 369 FILE *));
374 370 const uchar_t *p_cdname __P((const uchar_t *, const uchar_t *, FILE *));
375 371 const uchar_t *p_fqnname __P((const uchar_t *cp, const uchar_t *msg,
376 372 int, char *, int));
377 373 const uchar_t *p_fqname __P((const uchar_t *, const uchar_t *, FILE *));
378 374 const char *p_option __P((uint_t option));
379 375 char *p_secstodate __P((uint_t));
380 376 int dn_count_labels __P((const char *));
381 377 int dn_comp __P((const char *, uchar_t *, int,
382 378 uchar_t **, uchar_t **));
383 379 int dn_expand __P((const uchar_t *, const uchar_t *,
384 380 const uchar_t *, char *, int));
385 381 void res_rndinit __P((res_state));
386 382 uint_t res_randomid __P((void));
387 383 uint_t res_nrandomid __P((res_state));
388 384 int res_nameinquery __P((const char *, int, int,
389 385 const uchar_t *, const uchar_t *));
390 386 int res_queriesmatch __P((const uchar_t *, const uchar_t *,
391 387 const uchar_t *, const uchar_t *));
392 388 const char *p_section __P((int section, int opcode));
393 389
394 390
395 391 /* Things involving a resolver context. */
396 392 int res_ninit __P((res_state));
397 393 int res_nisourserver __P((const res_state,
398 394 const struct sockaddr_in *));
399 395 void fp_resstat __P((const res_state, FILE *));
400 396 void res_pquery __P((const res_state, const uchar_t *, int, FILE *));
401 397 const char *res_hostalias __P((const res_state, const char *,
402 398 char *, size_t));
403 399 int res_nquery __P((res_state,
404 400 const char *, int, int, uchar_t *, int));
405 401 int res_nsearch __P((res_state, const char *, int,
406 402 int, uchar_t *, int));
407 403 int res_nquerydomain __P((res_state,
408 404 const char *, const char *, int, int,
409 405 uchar_t *, int));
410 406 int res_nmkquery __P((res_state,
411 407 int, const char *, int, int, const uchar_t *,
412 408 int, const uchar_t *, uchar_t *, int));
413 409 int res_nsend __P((res_state, const uchar_t *, int, uchar_t *,
414 410 int));
415 411 int res_nsendsigned __P((res_state, const uchar_t *, int,
416 412 ns_tsig_key *, uchar_t *, int));
417 413 int res_findzonecut __P((res_state, const char *, ns_class, int,
418 414 char *, size_t, struct in_addr *, int));
419 415 int res_findzonecut2 __P((res_state, const char *, ns_class, int,
420 416 char *, size_t, union res_sockaddr_union *,
421 417 int));
422 418 void res_nclose __P((res_state));
423 419 int res_nopt __P((res_state, int, uchar_t *, int, int));
424 420 int res_nopt_rdata __P((res_state, int, uchar_t *, int, uchar_t *,
425 421 ushort_t, ushort_t, uchar_t *));
426 422 void res_send_setqhook __P((res_send_qhook hook));
427 423 void res_send_setrhook __P((res_send_rhook hook));
428 424 int __res_vinit __P((res_state, int));
429 425 void res_destroyservicelist __P((void));
430 426 const char *res_servicename __P((uint16_t port, const char *proto));
431 427 const char *res_protocolname __P((int num));
432 428 void res_destroyprotolist __P((void));
433 429 void res_buildprotolist __P((void));
434 430 const char *res_get_nibblesuffix __P((res_state));
435 431 const char *res_get_nibblesuffix2 __P((res_state));
436 432 void res_ndestroy __P((res_state));
437 433 uint16_t res_nametoclass __P((const char *buf, int *success));
438 434 uint16_t res_nametotype __P((const char *buf, int *success));
439 435 void res_setservers __P((res_state,
440 436 const union res_sockaddr_union *, int));
441 437 int res_getservers __P((res_state,
442 438 union res_sockaddr_union *, int));
443 439
444 440
445 441 #ifdef __cplusplus
446 442 }
447 443 #endif
448 444
449 445 #endif /* !_RESOLV_H_ */
↓ open down ↓ |
298 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX