1 /* 2 * ++Copyright++ 1983, 1989, 1993 3 * - 4 * Copyright (c) 1983, 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * - 35 * Portions Copyright (c) 1993 by Digital Equipment Corporation. 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, and that 40 * the name of Digital Equipment Corporation not be used in advertising or 41 * publicity pertaining to distribution of the document or software without 42 * specific, written prior permission. 43 * 44 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL 45 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES 46 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT 47 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL 48 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR 49 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS 50 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS 51 * SOFTWARE. 52 * - 53 * --Copyright-- 54 */ 55 56 /* 57 * @(#)nameser.h 8.1 (Berkeley) 6/2/93 58 * nameser.h,v 1.2 1995/05/06 14:23:54 hjl Exp 59 */ 60 61 #ifndef _NAMESER_H_ 62 #define _NAMESER_H_ 63 64 #ifndef WIN32 65 #include <sys/param.h> 66 #if (!defined(BSD)) || (BSD < 199306) 67 # include <sys/bitypes.h> 68 #else 69 # include <sys/types.h> 70 #endif 71 #include <sys/cdefs.h> 72 #else 73 #include <pcap-stdinc.h> 74 #define __LITTLE_ENDIAN 1 75 #define __BYTE_ORDER __LITTLE_ENDIAN 76 #endif 77 78 /* 79 * revision information. this is the release date in YYYYMMDD format. 80 * it can change every day so the right thing to do with it is use it 81 * in preprocessor commands such as "#if (__BIND > 19931104)". do not 82 * compare for equality; rather, use it to determine whether your resolver 83 * is new enough to contain a certain feature. 84 */ 85 86 #define __BIND 19940417 /* interface version stamp */ 87 88 /* 89 * Define constants based on rfc883 90 */ 91 #define PACKETSZ 512 /* maximum packet size */ 92 #define MAXDNAME 256 /* maximum domain name */ 93 #define MAXCDNAME 255 /* maximum compressed domain name */ 94 #define MAXLABEL 63 /* maximum length of domain label */ 95 #define HFIXEDSZ 12 /* #/bytes of fixed data in header */ 96 #define QFIXEDSZ 4 /* #/bytes of fixed data in query */ 97 #define RRFIXEDSZ 10 /* #/bytes of fixed data in r record */ 98 #define INT32SZ 4 /* for systems without 32-bit ints */ 99 #define INT16SZ 2 /* for systems without 16-bit ints */ 100 #define INADDRSZ 4 /* for sizeof(struct inaddr) != 4 */ 101 102 /* 103 * Internet nameserver port number 104 */ 105 #define NAMESERVER_PORT 53 106 107 /* 108 * Currently defined opcodes 109 */ 110 #define QUERY 0x0 /* standard query */ 111 #define IQUERY 0x1 /* inverse query */ 112 #define STATUS 0x2 /* nameserver status query */ 113 /*#define xxx 0x3 *//* 0x3 reserved */ 114 #define NS_NOTIFY_OP 0x4 /* notify secondary of SOA change */ 115 #ifdef ALLOW_UPDATES 116 /* non standard - supports ALLOW_UPDATES stuff from Mike Schwartz */ 117 # define UPDATEA 0x9 /* add resource record */ 118 # define UPDATED 0xa /* delete a specific resource record */ 119 # define UPDATEDA 0xb /* delete all named resource record */ 120 # define UPDATEM 0xc /* modify a specific resource record */ 121 # define UPDATEMA 0xd /* modify all named resource record */ 122 # define ZONEINIT 0xe /* initial zone transfer */ 123 # define ZONEREF 0xf /* incremental zone referesh */ 124 #endif 125 126 /* 127 * Currently defined response codes 128 */ 129 #ifdef HAVE_ADDRINFO 130 #define NOERROR 0 /* no error */ 131 #endif /* HAVE_ADDRINFO */ 132 #define FORMERR 1 /* format error */ 133 #define SERVFAIL 2 /* server failure */ 134 #define NXDOMAIN 3 /* non existent domain */ 135 #define NOTIMP 4 /* not implemented */ 136 #define REFUSED 5 /* query refused */ 137 #ifdef ALLOW_UPDATES 138 /* non standard */ 139 # define NOCHANGE 0xf /* update failed to change db */ 140 #endif 141 142 /* 143 * Type values for resources and queries 144 */ 145 #define T_A 1 /* host address */ 146 #define T_NS 2 /* authoritative server */ 147 #define T_MD 3 /* mail destination */ 148 #define T_MF 4 /* mail forwarder */ 149 #define T_CNAME 5 /* canonical name */ 150 #define T_SOA 6 /* start of authority zone */ 151 #define T_MB 7 /* mailbox domain name */ 152 #define T_MG 8 /* mail group member */ 153 #define T_MR 9 /* mail rename name */ 154 #define T_NULL 10 /* null resource record */ 155 #define T_WKS 11 /* well known service */ 156 #define T_PTR 12 /* domain name pointer */ 157 #define T_HINFO 13 /* host information */ 158 #define T_MINFO 14 /* mailbox information */ 159 #define T_MX 15 /* mail routing information */ 160 #define T_TXT 16 /* text strings */ 161 #define T_RP 17 /* responsible person */ 162 #define T_AFSDB 18 /* AFS cell database */ 163 #define T_X25 19 /* X_25 calling address */ 164 #define T_ISDN 20 /* ISDN calling address */ 165 #define T_RT 21 /* router */ 166 #define T_NSAP 22 /* NSAP address */ 167 #define T_NSAP_PTR 23 /* reverse NSAP lookup (deprecated) */ 168 #define T_SIG 24 /* security signature */ 169 #define T_KEY 25 /* security key */ 170 #define T_PX 26 /* X.400 mail mapping */ 171 #define T_GPOS 27 /* geographical position (withdrawn) */ 172 #define T_AAAA 28 /* IP6 Address */ 173 #define T_LOC 29 /* Location Information */ 174 /* non standard */ 175 #define T_UINFO 100 /* user (finger) information */ 176 #define T_UID 101 /* user ID */ 177 #define T_GID 102 /* group ID */ 178 #define T_UNSPEC 103 /* Unspecified format (binary data) */ 179 /* Query type values which do not appear in resource records */ 180 #define T_AXFR 252 /* transfer zone of authority */ 181 #define T_MAILB 253 /* transfer mailbox records */ 182 #define T_MAILA 254 /* transfer mail agent records */ 183 #define T_ANY 255 /* wildcard match */ 184 185 /* 186 * Values for class field 187 */ 188 189 #define C_IN 1 /* the arpa internet */ 190 #define C_CHAOS 3 /* for chaos net (MIT) */ 191 #define C_HS 4 /* for Hesiod name server (MIT) (XXX) */ 192 /* Query class values which do not appear in resource records */ 193 #define C_ANY 255 /* wildcard match */ 194 195 /* 196 * Status return codes for T_UNSPEC conversion routines 197 */ 198 #define CONV_SUCCESS 0 199 #define CONV_OVERFLOW (-1) 200 #define CONV_BADFMT (-2) 201 #define CONV_BADCKSUM (-3) 202 #define CONV_BADBUFLEN (-4) 203 204 #ifndef __BYTE_ORDER 205 #if (BSD >= 199103) 206 # include <machine/endian.h> 207 #else 208 #ifdef linux 209 # include <endian.h> 210 #else 211 #define __LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */ 212 #define __BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */ 213 #define __PDP_ENDIAN 3412 /* LSB first in word, MSW first in long (pdp)*/ 214 215 #if defined(vax) || defined(ns32000) || defined(sun386) || defined(i386) || \ 216 defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \ 217 defined(__alpha__) || defined(__alpha) 218 #define __BYTE_ORDER __LITTLE_ENDIAN 219 #endif 220 221 #if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \ 222 defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \ 223 defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\ 224 defined(apollo) || defined(__convex__) || defined(_CRAY) || \ 225 defined(__hppa) || defined(__hp9000) || \ 226 defined(__hp9000s300) || defined(__hp9000s700) || \ 227 defined (BIT_ZERO_ON_LEFT) || defined(m68k) 228 #define __BYTE_ORDER __BIG_ENDIAN 229 #endif 230 #endif /* linux */ 231 #endif /* BSD */ 232 #endif /* __BYTE_ORDER */ 233 234 #if !defined(__BYTE_ORDER) || \ 235 (__BYTE_ORDER != __BIG_ENDIAN && __BYTE_ORDER != __LITTLE_ENDIAN && \ 236 __BYTE_ORDER != __PDP_ENDIAN) 237 /* you must determine what the correct bit order is for 238 * your compiler - the next line is an intentional error 239 * which will force your compiles to bomb until you fix 240 * the above macros. 241 */ 242 error "Undefined or invalid __BYTE_ORDER"; 243 #endif 244 245 /* 246 * Structure for query header. The order of the fields is machine- and 247 * compiler-dependent, depending on the byte/bit order and the layout 248 * of bit fields. We use bit fields only in int variables, as this 249 * is all ANSI requires. This requires a somewhat confusing rearrangement. 250 */ 251 252 typedef struct { 253 unsigned id :16; /* query identification number */ 254 #if __BYTE_ORDER == __BIG_ENDIAN 255 /* fields in third byte */ 256 unsigned qr: 1; /* response flag */ 257 unsigned opcode: 4; /* purpose of message */ 258 unsigned aa: 1; /* authoritive answer */ 259 unsigned tc: 1; /* truncated message */ 260 unsigned rd: 1; /* recursion desired */ 261 /* fields in fourth byte */ 262 unsigned ra: 1; /* recursion available */ 263 unsigned pr: 1; /* primary server req'd (!standard) */ 264 unsigned unused :2; /* unused bits (MBZ as of 4.9.3a3) */ 265 unsigned rcode :4; /* response code */ 266 #endif 267 #if __BYTE_ORDER == __LITTLE_ENDIAN || __BYTE_ORDER == __PDP_ENDIAN 268 /* fields in third byte */ 269 unsigned rd :1; /* recursion desired */ 270 unsigned tc :1; /* truncated message */ 271 unsigned aa :1; /* authoritive answer */ 272 unsigned opcode :4; /* purpose of message */ 273 unsigned qr :1; /* response flag */ 274 /* fields in fourth byte */ 275 unsigned rcode :4; /* response code */ 276 unsigned unused :2; /* unused bits (MBZ as of 4.9.3a3) */ 277 unsigned pr :1; /* primary server req'd (!standard) */ 278 unsigned ra :1; /* recursion available */ 279 #endif 280 /* remaining bytes */ 281 unsigned qdcount :16; /* number of question entries */ 282 unsigned ancount :16; /* number of answer entries */ 283 unsigned nscount :16; /* number of authority entries */ 284 unsigned arcount :16; /* number of resource entries */ 285 } HEADER; 286 287 /* 288 * Defines for handling compressed domain names 289 */ 290 #define INDIR_MASK 0xc0 291 292 /* 293 * Structure for passing resource records around. 294 */ 295 struct rrec { 296 int16_t r_zone; /* zone number */ 297 int16_t r_class; /* class number */ 298 int16_t r_type; /* type number */ 299 u_int32_t r_ttl; /* time to live */ 300 int r_size; /* size of data area */ 301 char *r_data; /* pointer to data */ 302 }; 303 304 //extern u_int16_t _getshort __P((const u_char *)); 305 //extern u_int32_t _getlong __P((const u_char *)); 306 307 /* 308 * Inline versions of get/put short/long. Pointer is advanced. 309 * 310 * These macros demonstrate the property of C whereby it can be 311 * portable or it can be elegant but rarely both. 312 */ 313 #define GETSHORT(s, cp) { \ 314 register u_char *t_cp = (u_char *)(cp); \ 315 (s) = ((u_int16_t)t_cp[0] << 8) \ 316 | ((u_int16_t)t_cp[1]) \ 317 ; \ 318 (cp) += INT16SZ; \ 319 } 320 321 #define GETLONG(l, cp) { \ 322 register u_char *t_cp = (u_char *)(cp); \ 323 (l) = ((u_int32_t)t_cp[0] << 24) \ 324 | ((u_int32_t)t_cp[1] << 16) \ 325 | ((u_int32_t)t_cp[2] << 8) \ 326 | ((u_int32_t)t_cp[3]) \ 327 ; \ 328 (cp) += INT32SZ; \ 329 } 330 331 #define PUTSHORT(s, cp) { \ 332 register u_int16_t t_s = (u_int16_t)(s); \ 333 register u_char *t_cp = (u_char *)(cp); \ 334 *t_cp++ = t_s >> 8; \ 335 *t_cp = t_s; \ 336 (cp) += INT16SZ; \ 337 } 338 339 #define PUTLONG(l, cp) { \ 340 register u_int32_t t_l = (u_int32_t)(l); \ 341 register u_char *t_cp = (u_char *)(cp); \ 342 *t_cp++ = t_l >> 24; \ 343 *t_cp++ = t_l >> 16; \ 344 *t_cp++ = t_l >> 8; \ 345 *t_cp = t_l; \ 346 (cp) += INT32SZ; \ 347 } 348 349 #endif /* !_NAMESER_H_ */ 350
