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 $ 54 * $Id: resolv.h,v 1.1.1.1 2003/11/19 01:48:35 kyu3 Exp $ 55 */ 56 57 #ifndef _RESOLV_H_ 58 #define _RESOLV_H_ 59 60 #include <arpa/nameser.h> 61 #include <sys/param.h> 62 #include <sys/types.h> 63 #include <sys/cdefs.h> 64 #include <stdio.h> 65 #include <paths.h> 66 67 #ifndef __P 68 #define __P(x) x 69 #endif // __P 70 71 /* 72 * Revision information. This is the release date in YYYYMMDD format. 73 * It can change every day so the right thing to do with it is use it 74 * in preprocessor commands such as "#if (__RES > 19931104)". Do not 75 * compare for equality; rather, use it to determine whether your resolver 76 * is new enough to contain a certain feature. 77 */ 78 79 #define __RES 19960801 80 81 /* 82 * Global defines and variables for resolver stub. 83 */ 84 #define MAXNS 3 /* max # name servers we'll track */ 85 #define MAXDFLSRCH 3 /* # default domain levels to try */ 86 #define MAXDNSRCH 6 /* max # domains in search path */ 87 #define LOCALDOMAINPARTS 2 /* min levels in name that is "local" */ 88 89 #define RES_TIMEOUT 5 /* min. seconds between retries */ 90 #define MAXRESOLVSORT 10 /* number of net to sort on */ 91 #define RES_MAXNDOTS 15 /* should reflect bit field size */ 92 93 struct __res_state { 94 int retrans; /* retransmition time interval */ 95 int retry; /* number of times to retransmit */ 96 u_long options; /* option flags - see below. */ 97 int nscount; /* number of name servers */ 98 struct sockaddr_in 99 nsaddr_list[MAXNS]; /* address of name server */ 100 #define nsaddr nsaddr_list[0] /* for backward compatibility */ 101 u_short id; /* current message id */ 102 char *dnsrch[MAXDNSRCH+1]; /* components of domain to search */ 103 char defdname[256]; /* default domain (deprecated) */ 104 u_long pfcode; /* RES_PRF_ flags - see below. */ 105 unsigned ndots:4; /* threshold for initial abs. query */ 106 unsigned nsort:4; /* number of elements in sort_list[] */ 107 char unused[3]; 108 struct { 109 struct in_addr addr; 110 u_int32_t mask; 111 } sort_list[MAXRESOLVSORT]; 112 char pad[72]; /* on an i386 this means 512b total */ 113 }; 114 115 typedef struct __res_state *res_state; 116 117 /* 118 * Resolver options (keep these in synch with res_debug.c, please) 119 */ 120 #define RES_INIT 0x00000001 /* address initialized */ 121 #define RES_DEBUG 0x00000002 /* print debug messages */ 122 #define RES_AAONLY 0x00000004 /* authoritative answers only (!IMPL)*/ 123 #define RES_USEVC 0x00000008 /* use virtual circuit */ 124 #define RES_PRIMARY 0x00000010 /* query primary server only (!IMPL) */ 125 #define RES_IGNTC 0x00000020 /* ignore truncation errors */ 126 #define RES_RECURSE 0x00000040 /* recursion desired */ 127 #define RES_DEFNAMES 0x00000080 /* use default domain name */ 128 #define RES_STAYOPEN 0x00000100 /* Keep TCP socket open */ 129 #define RES_DNSRCH 0x00000200 /* search up local domain tree */ 130 #define RES_INSECURE1 0x00000400 /* type 1 security disabled */ 131 #define RES_INSECURE2 0x00000800 /* type 2 security disabled */ 132 #define RES_NOALIASES 0x00001000 /* shuts off HOSTALIASES feature */ 133 #define RES_USE_INET6 0x00002000 /* use/map IPv6 in gethostbyname() */ 134 #define RES_NOTLDQUERY 0x00004000 /* Don't query TLD names */ 135 136 #define RES_DEFAULT (RES_RECURSE | RES_DEFNAMES | RES_DNSRCH) 137 138 /* 139 * Resolver "pfcode" values. Used by dig. 140 */ 141 #define RES_PRF_STATS 0x00000001 142 #define RES_PRF_UPDATE 0x00000002 143 #define RES_PRF_CLASS 0x00000004 144 #define RES_PRF_CMD 0x00000008 145 #define RES_PRF_QUES 0x00000010 146 #define RES_PRF_ANS 0x00000020 147 #define RES_PRF_AUTH 0x00000040 148 #define RES_PRF_ADD 0x00000080 149 #define RES_PRF_HEAD1 0x00000100 150 #define RES_PRF_HEAD2 0x00000200 151 #define RES_PRF_TTLID 0x00000400 152 #define RES_PRF_HEADX 0x00000800 153 #define RES_PRF_QUERY 0x00001000 154 #define RES_PRF_REPLY 0x00002000 155 #define RES_PRF_INIT 0x00004000 156 /* 0x00008000 */ 157 158 typedef enum { res_goahead, res_nextns, res_modified, res_done, res_error } 159 res_sendhookact; 160 161 typedef res_sendhookact (*res_send_qhook)__P((struct sockaddr_in * const *ns, 162 const u_char **query, 163 int *querylen, 164 u_char *ans, 165 int anssiz, 166 int *resplen)); 167 168 typedef res_sendhookact (*res_send_rhook)__P((const struct sockaddr_in *ns, 169 const u_char *query, 170 int querylen, 171 u_char *ans, 172 int anssiz, 173 int *resplen)); 174 175 struct res_sym { 176 int number; /* Identifying number, like T_MX */ 177 char * name; /* Its symbolic name, like "MX" */ 178 char * humanname; /* Its fun name, like "mail exchanger" */ 179 }; 180 181 extern struct __res_state _res; 182 extern const struct res_sym __p_class_syms[]; 183 extern const struct res_sym __p_type_syms[]; 184 185 /* Private routines shared between libc/net, named, nslookup and others. */ 186 #define res_hnok __res_hnok 187 #define res_ownok __res_ownok 188 #define res_mailok __res_mailok 189 #define res_dnok __res_dnok 190 #define sym_ston __sym_ston 191 #define sym_ntos __sym_ntos 192 #define sym_ntop __sym_ntop 193 #define b64_ntop __b64_ntop 194 #define b64_pton __b64_pton 195 #define loc_ntoa __loc_ntoa 196 #define loc_aton __loc_aton 197 #define fp_resstat __fp_resstat 198 #define p_query __p_query 199 #define dn_skipname __dn_skipname 200 #define fp_resstat __fp_resstat 201 #define fp_query __fp_query 202 #define fp_nquery __fp_nquery 203 #define hostalias __hostalias 204 #define putlong __putlong 205 #define putshort __putshort 206 uint16_t _getshort(const u_char *); 207 #define p_class __p_class 208 #define p_time __p_time 209 #define p_type __p_type 210 #define p_query __p_query 211 #define p_cdnname __p_cdnname 212 #define p_section __p_section 213 #define p_cdname __p_cdname 214 #define p_fqnname __p_fqnname 215 #define p_fqname __p_fqname 216 #define p_option __p_option 217 #define p_secstodate __p_secstodate 218 #define dn_count_labels __dn_count_labels 219 #define dn_comp __dn_comp 220 #define dn_expand __dn_expand 221 #define res_init __res_init 222 #define res_randomid __res_randomid 223 #define res_query __res_query 224 #define res_search __res_search 225 #define res_querydomain __res_querydomain 226 #define res_mkquery __res_mkquery 227 #define res_send __res_send 228 #define res_isourserver __res_isourserver 229 #define res_nameinquery __res_nameinquery 230 #define res_queriesmatch __res_queriesmatch 231 #define res_close __res_close 232 #define res_mkupdate __res_mkupdate 233 #define res_mkupdrec __res_mkupdrec 234 #define res_freeupdrec __res_freeupdrec 235 236 __BEGIN_DECLS 237 int res_hnok __P((const char *)); 238 int res_ownok __P((const char *)); 239 int res_mailok __P((const char *)); 240 int res_dnok __P((const char *)); 241 int sym_ston __P((const struct res_sym *, const char *, int *)); 242 const char * sym_ntos __P((const struct res_sym *, int, int *)); 243 const char * sym_ntop __P((const struct res_sym *, int, int *)); 244 int b64_ntop __P((u_char const *, size_t, char *, size_t)); 245 int b64_pton __P((char const *, u_char *, size_t)); 246 int loc_aton __P((const char *, u_char *)); 247 const char * loc_ntoa __P((const u_char *, char *)); 248 int dn_skipname __P((const u_char *, const u_char *)); 249 void fp_resstat __P((struct __res_state *, FILE *)); 250 void fp_query __P((const u_char *, FILE *)); 251 void fp_nquery __P((const u_char *, int, FILE *)); 252 const char * hostalias __P((const char *)); 253 void putlong __P((u_int32_t, u_char *)); 254 void putshort __P((u_int16_t, u_char *)); 255 const char * p_class __P((int)); 256 const char * p_time __P((u_int32_t)); 257 const char * p_type __P((int)); 258 void p_query __P((const u_char *)); 259 const u_char * p_cdnname __P((const u_char *, const u_char *, int, FILE *)); 260 const u_char * p_cdname __P((const u_char *, const u_char *, FILE *)); 261 const u_char * p_fqnname __P((const u_char *, const u_char *, 262 int, char *, int)); 263 const u_char * p_fqname __P((const u_char *, const u_char *, FILE *)); 264 const char * p_option __P((u_long)); 265 char * p_secstodate __P((u_long)); 266 int dn_count_labels __P((const char *)); 267 int dn_comp __P((const char *, u_char *, int, 268 u_char **, u_char **)); 269 int dn_expand __P((const u_char *, const u_char *, const u_char *, 270 char *, int)); 271 int res_init __P((void)); 272 u_int res_randomid __P((void)); 273 int res_query __P((const char *, int, int, u_char *, int)); 274 int res_search __P((const char *, int, int, u_char *, int)); 275 int res_querydomain __P((const char *, const char *, int, int, 276 u_char *, int)); 277 int res_mkquery __P((int, const char *, int, int, const u_char *, 278 int, const u_char *, u_char *, int)); 279 int res_send __P((const u_char *, int, u_char *, int)); 280 int res_isourserver __P((const struct sockaddr_in *)); 281 int res_nameinquery __P((const char *, int, int, 282 const u_char *, const u_char *)); 283 int res_queriesmatch __P((const u_char *, const u_char *, 284 const u_char *, const u_char *)); 285 void res_close __P((void)); 286 const char * p_section __P((int, int)); 287 /* XXX The following depend on the ns_updrec typedef in arpa/nameser.h */ 288 #ifdef _ARPA_NAMESER_H_ 289 int res_update __P((ns_updrec *)); 290 int res_mkupdate __P((ns_updrec *, u_char *, int)); 291 ns_updrec * res_mkupdrec __P((int, const char *, u_int, u_int, u_long)); 292 void res_freeupdrec __P((ns_updrec *)); 293 #endif 294 295 __END_DECLS 296 297 #endif /* !_RESOLV_H_ */ 298
