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 24644 2008-03-29 12:37:05Z bonefish $ 36 */ 37 38 #ifndef _ARPA_NAMESER_COMPAT_ 39 #define _ARPA_NAMESER_COMPAT_ 40 41 #define __BIND 19950621 /* (DEAD) interface version stamp. */ 42 43 #include <endian.h> 44 45 #if !defined(BYTE_ORDER) || \ 46 (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \ 47 BYTE_ORDER != PDP_ENDIAN) 48 /* you must determine what the correct bit order is for 49 * your compiler - the next line is an intentional error 50 * which will force your compiles to bomb until you fix 51 * the above macros. 52 */ 53 error "Undefined or invalid BYTE_ORDER"; 54 #endif 55 56 /* 57 * Structure for query header. The order of the fields is machine- and 58 * compiler-dependent, depending on the byte/bit order and the layout 59 * of bit fields. We use bit fields only in int variables, as this 60 * is all ANSI requires. This requires a somewhat confusing rearrangement. 61 */ 62 63 typedef struct { 64 unsigned id :16; /* query identification number */ 65 #if BYTE_ORDER == BIG_ENDIAN 66 /* fields in third byte */ 67 unsigned qr: 1; /* response flag */ 68 unsigned opcode: 4; /* purpose of message */ 69 unsigned aa: 1; /* authoritive answer */ 70 unsigned tc: 1; /* truncated message */ 71 unsigned rd: 1; /* recursion desired */ 72 /* fields in fourth byte */ 73 unsigned ra: 1; /* recursion available */ 74 unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */ 75 unsigned ad: 1; /* authentic data from named */ 76 unsigned cd: 1; /* checking disabled by resolver */ 77 unsigned rcode :4; /* response code */ 78 #endif 79 #if BYTE_ORDER == LITTLE_ENDIAN || BYTE_ORDER == PDP_ENDIAN 80 /* fields in third byte */ 81 unsigned rd :1; /* recursion desired */ 82 unsigned tc :1; /* truncated message */ 83 unsigned aa :1; /* authoritive answer */ 84 unsigned opcode :4; /* purpose of message */ 85 unsigned qr :1; /* response flag */ 86 /* fields in fourth byte */ 87 unsigned rcode :4; /* response code */ 88 unsigned cd: 1; /* checking disabled by resolver */ 89 unsigned ad: 1; /* authentic data from named */ 90 unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */ 91 unsigned ra :1; /* recursion available */ 92 #endif 93 /* remaining bytes */ 94 unsigned qdcount :16; /* number of question entries */ 95 unsigned ancount :16; /* number of answer entries */ 96 unsigned nscount :16; /* number of authority entries */ 97 unsigned arcount :16; /* number of resource entries */ 98 } HEADER; 99 100 #define PACKETSZ NS_PACKETSZ 101 #define MAXDNAME NS_MAXDNAME 102 #define MAXCDNAME NS_MAXCDNAME 103 #define MAXLABEL NS_MAXLABEL 104 #define HFIXEDSZ NS_HFIXEDSZ 105 #define QFIXEDSZ NS_QFIXEDSZ 106 #define RRFIXEDSZ NS_RRFIXEDSZ 107 #define INT32SZ NS_INT32SZ 108 #define INT16SZ NS_INT16SZ 109 #define INT8SZ NS_INT8SZ 110 #define INADDRSZ NS_INADDRSZ 111 #define IN6ADDRSZ NS_IN6ADDRSZ 112 #define INDIR_MASK NS_CMPRSFLGS 113 #define NAMESERVER_PORT NS_DEFAULTPORT 114 115 #define S_ZONE ns_s_zn 116 #define S_PREREQ ns_s_pr 117 #define S_UPDATE ns_s_ud 118 #define S_ADDT ns_s_ar 119 120 #define QUERY ns_o_query 121 #define IQUERY ns_o_iquery 122 #define STATUS ns_o_status 123 #define NS_NOTIFY_OP ns_o_notify 124 #define NS_UPDATE_OP ns_o_update 125 126 #define NOERROR ns_r_noerror 127 #define FORMERR ns_r_formerr 128 #define SERVFAIL ns_r_servfail 129 #define NXDOMAIN ns_r_nxdomain 130 #define NOTIMP ns_r_notimpl 131 #define REFUSED ns_r_refused 132 #define YXDOMAIN ns_r_yxdomain 133 #define YXRRSET ns_r_yxrrset 134 #define NXRRSET ns_r_nxrrset 135 #define NOTAUTH ns_r_notauth 136 #define NOTZONE ns_r_notzone 137 /*#define BADSIG ns_r_badsig*/ 138 /*#define BADKEY ns_r_badkey*/ 139 /*#define BADTIME ns_r_badtime*/ 140 141 142 #define DELETE ns_uop_delete 143 #define ADD ns_uop_add 144 145 #define T_A ns_t_a 146 #define T_NS ns_t_ns 147 #define T_MD ns_t_md 148 #define T_MF ns_t_mf 149 #define T_CNAME ns_t_cname 150 #define T_SOA ns_t_soa 151 #define T_MB ns_t_mb 152 #define T_MG ns_t_mg 153 #define T_MR ns_t_mr 154 #define T_NULL ns_t_null 155 #define T_WKS ns_t_wks 156 #define T_PTR ns_t_ptr 157 #define T_HINFO ns_t_hinfo 158 #define T_MINFO ns_t_minfo 159 #define T_MX ns_t_mx 160 #define T_TXT ns_t_txt 161 #define T_RP ns_t_rp 162 #define T_AFSDB ns_t_afsdb 163 #define T_X25 ns_t_x25 164 #define T_ISDN ns_t_isdn 165 #define T_RT ns_t_rt 166 #define T_NSAP ns_t_nsap 167 #define T_NSAP_PTR ns_t_nsap_ptr 168 #define T_SIG ns_t_sig 169 #define T_KEY ns_t_key 170 #define T_PX ns_t_px 171 #define T_GPOS ns_t_gpos 172 #define T_AAAA ns_t_aaaa 173 #define T_LOC ns_t_loc 174 #define T_NXT ns_t_nxt 175 #define T_EID ns_t_eid 176 #define T_NIMLOC ns_t_nimloc 177 #define T_SRV ns_t_srv 178 #define T_ATMA ns_t_atma 179 #define T_NAPTR ns_t_naptr 180 #define T_A6 ns_t_a6 181 #define T_TSIG ns_t_tsig 182 #define T_IXFR ns_t_ixfr 183 #define T_AXFR ns_t_axfr 184 #define T_MAILB ns_t_mailb 185 #define T_MAILA ns_t_maila 186 #define T_ANY ns_t_any 187 188 #define C_IN ns_c_in 189 #define C_CHAOS ns_c_chaos 190 #define C_HS ns_c_hs 191 /* BIND_UPDATE */ 192 #define C_NONE ns_c_none 193 #define C_ANY ns_c_any 194 195 #define GETSHORT NS_GET16 196 #define GETLONG NS_GET32 197 #define PUTSHORT NS_PUT16 198 #define PUTLONG NS_PUT32 199 200 #endif /* _ARPA_NAMESER_COMPAT_ */ 201