1 /* Copyright (c) 1983, 1989 2 * The Regents of the University of California. All rights reserved. 3 * 4 * Redistribution and use in source and binary forms, with or without 5 * modification, are permitted provided that the following conditions 6 * are met: 7 * 1. Redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer. 9 * 2. Redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution. 12 * 3. All advertising materials mentioning features or use of this software 13 * must display the following acknowledgement: 14 * This product includes software developed by the University of 15 * California, Berkeley and its contributors. 16 * 4. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 /* 34 * from nameser.h 8.1 (Berkeley) 6/2/93 35 * $Id: nameser_compat.h,v 1.5.18.3 2006/05/19 02:36:00 marka Exp $ 36 * $FreeBSD: src/include/arpa/nameser_compat.h,v 1.7 2007/06/03 17:20:25 ume Exp $ 37 * $DragonFly: src/include/arpa/nameser_compat.h,v 1.2 2003/06/17 04:25:58 dillon Exp $ 38 */ 39 40 #ifndef _ARPA_NAMESER_COMPAT_ 41 #define _ARPA_NAMESER_COMPAT_ 42 43 #define __BIND 19950621 /* (DEAD) interface version stamp. */ 44 45 #include <machine/endian.h> 46 47 #if !defined(_BYTE_ORDER) || \ 48 (_BYTE_ORDER != _BIG_ENDIAN && _BYTE_ORDER != _LITTLE_ENDIAN && \ 49 _BYTE_ORDER != _PDP_ENDIAN) 50 /* you must determine what the correct bit order is for 51 * your compiler - the next line is an intentional error 52 * which will force your compiles to bomb until you fix 53 * the above macros. 54 */ 55 #error "Undefined or invalid _BYTE_ORDER"; 56 #endif 57 58 /* 59 * Structure for query header. The order of the fields is machine- and 60 * compiler-dependent, depending on the byte/bit order and the layout 61 * of bit fields. We use bit fields only in int variables, as this 62 * is all ANSI requires. This requires a somewhat confusing rearrangement. 63 */ 64 65 typedef struct { 66 unsigned id :16; /* query identification number */ 67 #if _BYTE_ORDER == _BIG_ENDIAN 68 /* fields in third byte */ 69 unsigned qr: 1; /* response flag */ 70 unsigned opcode: 4; /* purpose of message */ 71 unsigned aa: 1; /* authoritive answer */ 72 unsigned tc: 1; /* truncated message */ 73 unsigned rd: 1; /* recursion desired */ 74 /* fields in fourth byte */ 75 unsigned ra: 1; /* recursion available */ 76 unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */ 77 unsigned ad: 1; /* authentic data from named */ 78 unsigned cd: 1; /* checking disabled by resolver */ 79 unsigned rcode :4; /* response code */ 80 #endif 81 #if _BYTE_ORDER == _LITTLE_ENDIAN || _BYTE_ORDER == _PDP_ENDIAN 82 /* fields in third byte */ 83 unsigned rd :1; /* recursion desired */ 84 unsigned tc :1; /* truncated message */ 85 unsigned aa :1; /* authoritive answer */ 86 unsigned opcode :4; /* purpose of message */ 87 unsigned qr :1; /* response flag */ 88 /* fields in fourth byte */ 89 unsigned rcode :4; /* response code */ 90 unsigned cd: 1; /* checking disabled by resolver */ 91 unsigned ad: 1; /* authentic data from named */ 92 unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */ 93 unsigned ra :1; /* recursion available */ 94 #endif 95 /* remaining bytes */ 96 unsigned qdcount :16; /* number of question entries */ 97 unsigned ancount :16; /* number of answer entries */ 98 unsigned nscount :16; /* number of authority entries */ 99 unsigned arcount :16; /* number of resource entries */ 100 } HEADER; 101 102 #define PACKETSZ NS_PACKETSZ 103 #define MAXDNAME NS_MAXDNAME 104 #define MAXCDNAME NS_MAXCDNAME 105 #define MAXLABEL NS_MAXLABEL 106 #define HFIXEDSZ NS_HFIXEDSZ 107 #define QFIXEDSZ NS_QFIXEDSZ 108 #define RRFIXEDSZ NS_RRFIXEDSZ 109 #define INT32SZ NS_INT32SZ 110 #define INT16SZ NS_INT16SZ 111 #define INT8SZ NS_INT8SZ 112 #define INADDRSZ NS_INADDRSZ 113 #define IN6ADDRSZ NS_IN6ADDRSZ 114 #define INDIR_MASK NS_CMPRSFLGS 115 #define NAMESERVER_PORT NS_DEFAULTPORT 116 117 #define S_ZONE ns_s_zn 118 #define S_PREREQ ns_s_pr 119 #define S_UPDATE ns_s_ud 120 #define S_ADDT ns_s_ar 121 122 #define QUERY ns_o_query 123 #define IQUERY ns_o_iquery 124 #define STATUS ns_o_status 125 #define NS_NOTIFY_OP ns_o_notify 126 #define NS_UPDATE_OP ns_o_update 127 128 #define NOERROR ns_r_noerror 129 #define FORMERR ns_r_formerr 130 #define SERVFAIL ns_r_servfail 131 #define NXDOMAIN ns_r_nxdomain 132 #define NOTIMP ns_r_notimpl 133 #define REFUSED ns_r_refused 134 #define YXDOMAIN ns_r_yxdomain 135 #define YXRRSET ns_r_yxrrset 136 #define NXRRSET ns_r_nxrrset 137 #define NOTAUTH ns_r_notauth 138 #define NOTZONE ns_r_notzone 139 /*#define BADSIG ns_r_badsig*/ 140 /*#define BADKEY ns_r_badkey*/ 141 /*#define BADTIME ns_r_badtime*/ 142 143 144 #define DELETE ns_uop_delete 145 #define ADD ns_uop_add 146 147 #define T_A ns_t_a 148 #define T_NS ns_t_ns 149 #define T_MD ns_t_md 150 #define T_MF ns_t_mf 151 #define T_CNAME ns_t_cname 152 #define T_SOA ns_t_soa 153 #define T_MB ns_t_mb 154 #define T_MG ns_t_mg 155 #define T_MR ns_t_mr 156 #define T_NULL ns_t_null 157 #define T_WKS ns_t_wks 158 #define T_PTR ns_t_ptr 159 #define T_HINFO ns_t_hinfo 160 #define T_MINFO ns_t_minfo 161 #define T_MX ns_t_mx 162 #define T_TXT ns_t_txt 163 #define T_RP ns_t_rp 164 #define T_AFSDB ns_t_afsdb 165 #define T_X25 ns_t_x25 166 #define T_ISDN ns_t_isdn 167 #define T_RT ns_t_rt 168 #define T_NSAP ns_t_nsap 169 #define T_NSAP_PTR ns_t_nsap_ptr 170 #define T_SIG ns_t_sig 171 #define T_KEY ns_t_key 172 #define T_PX ns_t_px 173 #define T_GPOS ns_t_gpos 174 #define T_AAAA ns_t_aaaa 175 #define T_LOC ns_t_loc 176 #define T_NXT ns_t_nxt 177 #define T_EID ns_t_eid 178 #define T_NIMLOC ns_t_nimloc 179 #define T_SRV ns_t_srv 180 #define T_ATMA ns_t_atma 181 #define T_NAPTR ns_t_naptr 182 #define T_A6 ns_t_a6 183 #define T_OPT ns_t_opt 184 #define T_TSIG ns_t_tsig 185 #define T_IXFR ns_t_ixfr 186 #define T_AXFR ns_t_axfr 187 #define T_MAILB ns_t_mailb 188 #define T_MAILA ns_t_maila 189 #define T_ANY ns_t_any 190 191 #define C_IN ns_c_in 192 #define C_CHAOS ns_c_chaos 193 #define C_HS ns_c_hs 194 /* BIND_UPDATE */ 195 #define C_NONE ns_c_none 196 #define C_ANY ns_c_any 197 198 #define GETSHORT NS_GET16 199 #define GETLONG NS_GET32 200 #define PUTSHORT NS_PUT16 201 #define PUTLONG NS_PUT32 202 203 #endif /* _ARPA_NAMESER_COMPAT_ */ 204