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