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