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