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