[termux-packages] / packages / finch / arpa / nameser_compat.h

/*	$NetBSD: nameser_compat.h,v 1.1.1.2 2004/11/07 01:28:27 christos Exp $	*/

/* Copyright (c) 1983, 1989
 *    The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 * 	This product includes software developed by the University of
 * 	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

/*
 *      from nameser.h	8.1 (Berkeley) 6/2/93
 *	Id: nameser_compat.h,v 1.1.2.3.4.2 2004/07/01 04:43:41 marka Exp
 */

/*
 * This version of this file is derived from Android 2.3 "Gingerbread",
 * which contains uncredited changes by Android/Google developers.  It has
 * been modified in 2011 for use in the Android build of Mozilla Firefox by
 * Mozilla contributors (including Michael Edwards <m.k.edwards@gmail.com>,
 * and Steve Workman <sjhworkman@gmail.com>).
 * These changes are offered under the same license as the original NetBSD
 * file, whose copyright and license are unchanged above.
 */

#ifndef _ARPA_NAMESER_COMPAT_
#define	_ARPA_NAMESER_COMPAT_

#define	__BIND		19950621	/* (DEAD) interface version stamp. */

#include <endian.h>

#ifndef BYTE_ORDER
#if (BSD >= 199103)
# include <machine/endian.h>
#else
#ifdef __linux
# include <endian.h>
#else
#define	LITTLE_ENDIAN	1234	/* least-significant byte first (vax, pc) */
#define	BIG_ENDIAN	4321	/* most-significant byte first (IBM, net) */
#define	PDP_ENDIAN	3412	/* LSB first in word, MSW first in long (pdp)*/

#if defined(vax) || defined(ns32000) || defined(sun386) || defined(i386) || \
    defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \
    defined(__alpha__) || defined(__alpha) || \
    (defined(__Lynx__) && defined(__x86__))
#define BYTE_ORDER	LITTLE_ENDIAN
#endif

#if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \
    defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \
    defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\
    defined(apollo) || defined(__convex__) || defined(_CRAY) || \
    defined(__hppa) || defined(__hp9000) || \
    defined(__hp9000s300) || defined(__hp9000s700) || \
    defined(__hp3000s900) || defined(__hpux) || defined(MPE) || \
    defined (BIT_ZERO_ON_LEFT) || defined(m68k) || defined(__sparc) ||  \
    (defined(__Lynx__) && \
     (defined(__68k__) || defined(__sparc__) || defined(__powerpc__)))
#define BYTE_ORDER	BIG_ENDIAN
#endif
#endif /* __linux */
#endif /* BSD */
#endif /* BYTE_ORDER */

#if !defined(BYTE_ORDER) || \
    (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \
    BYTE_ORDER != PDP_ENDIAN)
	/* you must determine what the correct bit order is for
	 * your compiler - the next line is an intentional error
	 * which will force your compiles to bomb until you fix
	 * the above macros.
	 */
  #error "Undefined or invalid BYTE_ORDER";
#endif

/*
 * Structure for query header.  The order of the fields is machine- and
 * compiler-dependent, depending on the byte/bit order and the layout
 * of bit fields.  We use bit fields only in int variables, as this
 * is all ANSI requires.  This requires a somewhat confusing rearrangement.
 */

typedef struct {
	unsigned	id :16;		/* query identification number */
#if BYTE_ORDER == BIG_ENDIAN
			/* fields in third byte */
	unsigned	qr: 1;		/* response flag */
	unsigned	opcode: 4;	/* purpose of message */
	unsigned	aa: 1;		/* authoritive answer */
	unsigned	tc: 1;		/* truncated message */
	unsigned	rd: 1;		/* recursion desired */
			/* fields in fourth byte */
	unsigned	ra: 1;		/* recursion available */
	unsigned	unused :1;	/* unused bits (MBZ as of 4.9.3a3) */
	unsigned	ad: 1;		/* authentic data from named */
	unsigned	cd: 1;		/* checking disabled by resolver */
	unsigned	rcode :4;	/* response code */
#endif
#if BYTE_ORDER == LITTLE_ENDIAN || BYTE_ORDER == PDP_ENDIAN
			/* fields in third byte */
	unsigned	rd :1;		/* recursion desired */
	unsigned	tc :1;		/* truncated message */
	unsigned	aa :1;		/* authoritive answer */
	unsigned	opcode :4;	/* purpose of message */
	unsigned	qr :1;		/* response flag */
			/* fields in fourth byte */
	unsigned	rcode :4;	/* response code */
	unsigned	cd: 1;		/* checking disabled by resolver */
	unsigned	ad: 1;		/* authentic data from named */
	unsigned	unused :1;	/* unused bits (MBZ as of 4.9.3a3) */
	unsigned	ra :1;		/* recursion available */
#endif
			/* remaining bytes */
	unsigned	qdcount :16;	/* number of question entries */
	unsigned	ancount :16;	/* number of answer entries */
	unsigned	nscount :16;	/* number of authority entries */
	unsigned	arcount :16;	/* number of resource entries */
} HEADER;

#define PACKETSZ	NS_PACKETSZ
#define MAXDNAME	NS_MAXDNAME
#define MAXCDNAME	NS_MAXCDNAME
#define MAXLABEL	NS_MAXLABEL
#define	HFIXEDSZ	NS_HFIXEDSZ
#define QFIXEDSZ	NS_QFIXEDSZ
#define RRFIXEDSZ	NS_RRFIXEDSZ
#define	INT32SZ		NS_INT32SZ
#define	INT16SZ		NS_INT16SZ
#define	INT8SZ		NS_INT8SZ
#define	INADDRSZ	NS_INADDRSZ
#define	IN6ADDRSZ	NS_IN6ADDRSZ
#define	INDIR_MASK	NS_CMPRSFLGS
#define NAMESERVER_PORT	NS_DEFAULTPORT

#define S_ZONE		ns_s_zn
#define S_PREREQ	ns_s_pr
#define S_UPDATE	ns_s_ud
#define S_ADDT		ns_s_ar

#define QUERY		ns_o_query
#define IQUERY		ns_o_iquery
#define STATUS		ns_o_status
#define	NS_NOTIFY_OP	ns_o_notify
#define	NS_UPDATE_OP	ns_o_update

#define NOERROR		ns_r_noerror
#define FORMERR		ns_r_formerr
#define SERVFAIL	ns_r_servfail
#define NXDOMAIN	ns_r_nxdomain
#define NOTIMP		ns_r_notimpl
#define REFUSED		ns_r_refused
#define YXDOMAIN	ns_r_yxdomain
#define YXRRSET		ns_r_yxrrset
#define NXRRSET		ns_r_nxrrset
#define NOTAUTH		ns_r_notauth
#define NOTZONE		ns_r_notzone
/*#define BADSIG		ns_r_badsig*/
/*#define BADKEY		ns_r_badkey*/
/*#define BADTIME		ns_r_badtime*/


#define DELETE		ns_uop_delete
#define ADD		ns_uop_add

#define T_A		ns_t_a
#define T_NS		ns_t_ns
#define T_MD		ns_t_md
#define T_MF		ns_t_mf
#define T_CNAME		ns_t_cname
#define T_SOA		ns_t_soa
#define T_MB		ns_t_mb
#define T_MG		ns_t_mg
#define T_MR		ns_t_mr
#define T_NULL		ns_t_null
#define T_WKS		ns_t_wks
#define T_PTR		ns_t_ptr
#define T_HINFO		ns_t_hinfo
#define T_MINFO		ns_t_minfo
#define T_MX		ns_t_mx
#define T_TXT		ns_t_txt
#define	T_RP		ns_t_rp
#define T_AFSDB		ns_t_afsdb
#define T_X25		ns_t_x25
#define T_ISDN		ns_t_isdn
#define T_RT		ns_t_rt
#define T_NSAP		ns_t_nsap
#define T_NSAP_PTR	ns_t_nsap_ptr
#define	T_SIG		ns_t_sig
#define	T_KEY		ns_t_key
#define	T_PX		ns_t_px
#define	T_GPOS		ns_t_gpos
#define	T_AAAA		ns_t_aaaa
#define	T_LOC		ns_t_loc
#define	T_NXT		ns_t_nxt
#define	T_EID		ns_t_eid
#define	T_NIMLOC	ns_t_nimloc
#define	T_SRV		ns_t_srv
#define T_ATMA		ns_t_atma
#define T_NAPTR		ns_t_naptr
#define T_A6		ns_t_a6
#define	T_TSIG		ns_t_tsig
#define	T_IXFR		ns_t_ixfr
#define T_AXFR		ns_t_axfr
#define T_MAILB		ns_t_mailb
#define T_MAILA		ns_t_maila
#define T_ANY		ns_t_any

#define C_IN		ns_c_in
#define C_CHAOS		ns_c_chaos
#define C_HS		ns_c_hs
/* BIND_UPDATE */
#define C_NONE		ns_c_none
#define C_ANY		ns_c_any

#define	GETSHORT		NS_GET16
#define	GETLONG			NS_GET32
#define	PUTSHORT		NS_PUT16
#define	PUTLONG			NS_PUT32

#endif /* _ARPA_NAMESER_COMPAT_ */
Commit	Line	Data
59f0d218 FF	1	/* $NetBSD: nameser_compat.h,v 1.1.1.2 2004/11/07 01:28:27 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.2 2004/07/01 04:43:41 marka Exp
	38	*/
	39
	40	/*
	41	* This version of this file is derived from Android 2.3 "Gingerbread",
	42	* which contains uncredited changes by Android/Google developers. It has
	43	* been modified in 2011 for use in the Android build of Mozilla Firefox by
	44	* Mozilla contributors (including Michael Edwards <m.k.edwards@gmail.com>,
	45	* and Steve Workman <sjhworkman@gmail.com>).
	46	* These changes are offered under the same license as the original NetBSD
	47	* file, whose copyright and license are unchanged above.
	48	*/
	49
	50	#ifndef _ARPA_NAMESER_COMPAT_
	51	#define _ARPA_NAMESER_COMPAT_
	52
	53	#define __BIND 19950621 /* (DEAD) interface version stamp. */
	54
	55	#include <endian.h>
	56
	57	#ifndef BYTE_ORDER
	58	#if (BSD >= 199103)
	59	# include <machine/endian.h>
	60	#else
	61	#ifdef __linux
	62	# include <endian.h>
	63	#else
	64	#define LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */
65	#define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */
66	#define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long (pdp)*/
67
68	#if defined(vax) \|\| defined(ns32000) \|\| defined(sun386) \|\| defined(i386) \|\| \
69	defined(MIPSEL) \|\| defined(_MIPSEL) \|\| defined(BIT_ZERO_ON_RIGHT) \|\| \
70	defined(__alpha__) \|\| defined(__alpha) \|\| \
71	(defined(__Lynx__) && defined(__x86__))
72	#define BYTE_ORDER LITTLE_ENDIAN
73	#endif
74
75	#if defined(sel) \|\| defined(pyr) \|\| defined(mc68000) \|\| defined(sparc) \|\| \
76	defined(is68k) \|\| defined(tahoe) \|\| defined(ibm032) \|\| defined(ibm370) \|\| \
77	defined(MIPSEB) \|\| defined(_MIPSEB) \|\| defined(_IBMR2) \|\| defined(DGUX) \|\|\
78	defined(apollo) \|\| defined(__convex__) \|\| defined(_CRAY) \|\| \
79	defined(__hppa) \|\| defined(__hp9000) \|\| \
80	defined(__hp9000s300) \|\| defined(__hp9000s700) \|\| \
81	defined(__hp3000s900) \|\| defined(__hpux) \|\| defined(MPE) \|\| \
82	defined (BIT_ZERO_ON_LEFT) \|\| defined(m68k) \|\| defined(__sparc) \|\| \
83	(defined(__Lynx__) && \
84	(defined(__68k__) \|\| defined(__sparc__) \|\| defined(__powerpc__)))
85	#define BYTE_ORDER BIG_ENDIAN
86	#endif
87	#endif /* __linux */
88	#endif /* BSD */
89	#endif /* BYTE_ORDER */
90
91	#if !defined(BYTE_ORDER) \|\| \
92	(BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \
93	BYTE_ORDER != PDP_ENDIAN)
94	/* you must determine what the correct bit order is for
95	* your compiler - the next line is an intentional error
96	* which will force your compiles to bomb until you fix
97	* the above macros.
98	*/
99	#error "Undefined or invalid BYTE_ORDER";
100	#endif
101
102	/*
103	* Structure for query header. The order of the fields is machine- and
104	* compiler-dependent, depending on the byte/bit order and the layout
105	* of bit fields. We use bit fields only in int variables, as this
106	* is all ANSI requires. This requires a somewhat confusing rearrangement.
107	*/
108
109	typedef struct {
110	unsigned id :16; /* query identification number */
111	#if BYTE_ORDER == BIG_ENDIAN
112	/* fields in third byte */
113	unsigned qr: 1; /* response flag */
114	unsigned opcode: 4; /* purpose of message */
115	unsigned aa: 1; /* authoritive answer */
116	unsigned tc: 1; /* truncated message */
117	unsigned rd: 1; /* recursion desired */
118	/* fields in fourth byte */
119	unsigned ra: 1; /* recursion available */
120	unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */
121	unsigned ad: 1; /* authentic data from named */
122	unsigned cd: 1; /* checking disabled by resolver */
123	unsigned rcode :4; /* response code */
124	#endif
125	#if BYTE_ORDER == LITTLE_ENDIAN \|\| BYTE_ORDER == PDP_ENDIAN
126	/* fields in third byte */
127	unsigned rd :1; /* recursion desired */
128	unsigned tc :1; /* truncated message */
129	unsigned aa :1; /* authoritive answer */
130	unsigned opcode :4; /* purpose of message */
131	unsigned qr :1; /* response flag */
132	/* fields in fourth byte */
133	unsigned rcode :4; /* response code */
134	unsigned cd: 1; /* checking disabled by resolver */
135	unsigned ad: 1; /* authentic data from named */
136	unsigned unused :1; /* unused bits (MBZ as of 4.9.3a3) */
137	unsigned ra :1; /* recursion available */
138	#endif
139	/* remaining bytes */
140	unsigned qdcount :16; /* number of question entries */
141	unsigned ancount :16; /* number of answer entries */
142	unsigned nscount :16; /* number of authority entries */
143	unsigned arcount :16; /* number of resource entries */
144	} HEADER;
145
146	#define PACKETSZ NS_PACKETSZ
147	#define MAXDNAME NS_MAXDNAME
148	#define MAXCDNAME NS_MAXCDNAME
149	#define MAXLABEL NS_MAXLABEL
150	#define HFIXEDSZ NS_HFIXEDSZ
151	#define QFIXEDSZ NS_QFIXEDSZ
152	#define RRFIXEDSZ NS_RRFIXEDSZ
153	#define INT32SZ NS_INT32SZ
154	#define INT16SZ NS_INT16SZ
155	#define INT8SZ NS_INT8SZ
156	#define INADDRSZ NS_INADDRSZ
157	#define IN6ADDRSZ NS_IN6ADDRSZ
158	#define INDIR_MASK NS_CMPRSFLGS
159	#define NAMESERVER_PORT NS_DEFAULTPORT
160
161	#define S_ZONE ns_s_zn
162	#define S_PREREQ ns_s_pr
163	#define S_UPDATE ns_s_ud
164	#define S_ADDT ns_s_ar
165
166	#define QUERY ns_o_query
167	#define IQUERY ns_o_iquery
168	#define STATUS ns_o_status
169	#define NS_NOTIFY_OP ns_o_notify
170	#define NS_UPDATE_OP ns_o_update
171
172	#define NOERROR ns_r_noerror
173	#define FORMERR ns_r_formerr
174	#define SERVFAIL ns_r_servfail
175	#define NXDOMAIN ns_r_nxdomain
176	#define NOTIMP ns_r_notimpl
177	#define REFUSED ns_r_refused
178	#define YXDOMAIN ns_r_yxdomain
179	#define YXRRSET ns_r_yxrrset
180	#define NXRRSET ns_r_nxrrset
181	#define NOTAUTH ns_r_notauth
182	#define NOTZONE ns_r_notzone
183	/#define BADSIG ns_r_badsig/
184	/#define BADKEY ns_r_badkey/
185	/#define BADTIME ns_r_badtime/
186
187
188	#define DELETE ns_uop_delete
189	#define ADD ns_uop_add
190
191	#define T_A ns_t_a
192	#define T_NS ns_t_ns
193	#define T_MD ns_t_md
194	#define T_MF ns_t_mf
195	#define T_CNAME ns_t_cname
196	#define T_SOA ns_t_soa
197	#define T_MB ns_t_mb
198	#define T_MG ns_t_mg
199	#define T_MR ns_t_mr
200	#define T_NULL ns_t_null
201	#define T_WKS ns_t_wks
202	#define T_PTR ns_t_ptr
203	#define T_HINFO ns_t_hinfo
204	#define T_MINFO ns_t_minfo
205	#define T_MX ns_t_mx
206	#define T_TXT ns_t_txt
207	#define T_RP ns_t_rp
208	#define T_AFSDB ns_t_afsdb
209	#define T_X25 ns_t_x25
210	#define T_ISDN ns_t_isdn
211	#define T_RT ns_t_rt
212	#define T_NSAP ns_t_nsap
213	#define T_NSAP_PTR ns_t_nsap_ptr
214	#define T_SIG ns_t_sig
215	#define T_KEY ns_t_key
216	#define T_PX ns_t_px
217	#define T_GPOS ns_t_gpos
218	#define T_AAAA ns_t_aaaa
219	#define T_LOC ns_t_loc
220	#define T_NXT ns_t_nxt
221	#define T_EID ns_t_eid
222	#define T_NIMLOC ns_t_nimloc
223	#define T_SRV ns_t_srv
224	#define T_ATMA ns_t_atma
225	#define T_NAPTR ns_t_naptr
226	#define T_A6 ns_t_a6
227	#define T_TSIG ns_t_tsig
228	#define T_IXFR ns_t_ixfr
229	#define T_AXFR ns_t_axfr
230	#define T_MAILB ns_t_mailb
231	#define T_MAILA ns_t_maila
232	#define T_ANY ns_t_any
233
234	#define C_IN ns_c_in
235	#define C_CHAOS ns_c_chaos
236	#define C_HS ns_c_hs
237	/* BIND_UPDATE */
238	#define C_NONE ns_c_none
239	#define C_ANY ns_c_any
240
241	#define GETSHORT NS_GET16
242	#define GETLONG NS_GET32
243	#define PUTSHORT NS_PUT16
244	#define PUTLONG NS_PUT32
245
246	#endif /* _ARPA_NAMESER_COMPAT_ */