248 lines
8.3 KiB
C
248 lines
8.3 KiB
C
/*
|
|
* Copyright (c) 1983, 1989 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 5.25 (Berkeley) 4/3/91
|
|
* $Id: nameser.h,v 1.5 1994/04/07 06:59:03 deraadt Exp $
|
|
*/
|
|
|
|
#ifndef _NAMESER_H_
|
|
#define _NAMESER_H_
|
|
|
|
#include <machine/endian.h>
|
|
#include <sys/cdefs.h>
|
|
|
|
/*
|
|
* Define constants based on rfc883
|
|
*/
|
|
#define PACKETSZ 512 /* maximum packet size */
|
|
#define MAXDNAME 256 /* maximum domain name */
|
|
#define MAXCDNAME 255 /* maximum compressed domain name */
|
|
#define MAXLABEL 63 /* maximum length of domain label */
|
|
/* Number of bytes of fixed size data in query structure */
|
|
#define QFIXEDSZ 4
|
|
/* number of bytes of fixed size data in resource record */
|
|
#define RRFIXEDSZ 10
|
|
|
|
/*
|
|
* Internet nameserver port number
|
|
*/
|
|
#define NAMESERVER_PORT 53
|
|
|
|
/*
|
|
* Currently defined opcodes
|
|
*/
|
|
#define QUERY 0x0 /* standard query */
|
|
#define IQUERY 0x1 /* inverse query */
|
|
#define STATUS 0x2 /* nameserver status query */
|
|
/*#define xxx 0x3 /* 0x3 reserved */
|
|
/* non standard */
|
|
#define UPDATEA 0x9 /* add resource record */
|
|
#define UPDATED 0xa /* delete a specific resource record */
|
|
#define UPDATEDA 0xb /* delete all named resource record */
|
|
#define UPDATEM 0xc /* modify a specific resource record */
|
|
#define UPDATEMA 0xd /* modify all named resource record */
|
|
|
|
#define ZONEINIT 0xe /* initial zone transfer */
|
|
#define ZONEREF 0xf /* incremental zone referesh */
|
|
|
|
/*
|
|
* Currently defined response codes
|
|
*/
|
|
#define NOERROR 0 /* no error */
|
|
#define FORMERR 1 /* format error */
|
|
#define SERVFAIL 2 /* server failure */
|
|
#define NXDOMAIN 3 /* non existent domain */
|
|
#define NOTIMP 4 /* not implemented */
|
|
#define REFUSED 5 /* query refused */
|
|
/* non standard */
|
|
#define NOCHANGE 0xf /* update failed to change db */
|
|
|
|
/*
|
|
* Type values for resources and queries
|
|
*/
|
|
#define T_A 1 /* host address */
|
|
#define T_NS 2 /* authoritative server */
|
|
#define T_MD 3 /* mail destination */
|
|
#define T_MF 4 /* mail forwarder */
|
|
#define T_CNAME 5 /* connonical name */
|
|
#define T_SOA 6 /* start of authority zone */
|
|
#define T_MB 7 /* mailbox domain name */
|
|
#define T_MG 8 /* mail group member */
|
|
#define T_MR 9 /* mail rename name */
|
|
#define T_NULL 10 /* null resource record */
|
|
#define T_WKS 11 /* well known service */
|
|
#define T_PTR 12 /* domain name pointer */
|
|
#define T_HINFO 13 /* host information */
|
|
#define T_MINFO 14 /* mailbox information */
|
|
#define T_MX 15 /* mail routing information */
|
|
#define T_TXT 16 /* text strings */
|
|
#define T_RP 17 /* responsible person */
|
|
#define T_AFSDB 18 /* AFS cell database */
|
|
#define T_NSAP 22 /* NSAP address */
|
|
#define T_NSAP_PTR 23 /* reverse lookup for NSAP */
|
|
/* non standard */
|
|
#define T_UINFO 100 /* user (finger) information */
|
|
#define T_UID 101 /* user ID */
|
|
#define T_GID 102 /* group ID */
|
|
#define T_UNSPEC 103 /* Unspecified format (binary data) */
|
|
#define T_SA 200 /* shuffle address */
|
|
/* Query type values which do not appear in resource records */
|
|
#define T_AXFR 252 /* transfer zone of authority */
|
|
#define T_MAILB 253 /* transfer mailbox records */
|
|
#define T_MAILA 254 /* transfer mail agent records */
|
|
#define T_ANY 255 /* wildcard match */
|
|
|
|
/*
|
|
* Values for class field
|
|
*/
|
|
#define C_IN 1 /* the arpa internet */
|
|
#define C_CHAOS 3 /* for chaos net at MIT */
|
|
#define C_HS 4 /* for Hesiod name server at MIT */
|
|
/* Query class values which do not appear in resource records */
|
|
#define C_ANY 255 /* wildcard match */
|
|
|
|
/*
|
|
* Status return codes for T_UNSPEC conversion routines
|
|
*/
|
|
#define CONV_SUCCESS 0
|
|
#define CONV_OVERFLOW -1
|
|
#define CONV_BADFMT -2
|
|
#define CONV_BADCKSUM -3
|
|
#define CONV_BADBUFLEN -4
|
|
|
|
/*
|
|
* Structure for query header, the order of the fields is machine and
|
|
* compiler dependent, in our case, the bits within a byte are assignd
|
|
* least significant first, while the order of transmition is most
|
|
* significant first. This requires a somewhat confusing rearrangement.
|
|
*/
|
|
typedef struct {
|
|
u_short id; /* query identification number */
|
|
#if BYTE_ORDER == BIG_ENDIAN
|
|
/* fields in third byte */
|
|
u_char qr:1; /* response flag */
|
|
u_char opcode:4; /* purpose of message */
|
|
u_char aa:1; /* authoritive answer */
|
|
u_char tc:1; /* truncated message */
|
|
u_char rd:1; /* recursion desired */
|
|
/* fields in fourth byte */
|
|
u_char ra:1; /* recursion available */
|
|
u_char pr:1; /* primary server required (non standard) */
|
|
u_char unused:2; /* unused bits */
|
|
u_char rcode:4; /* response code */
|
|
#endif
|
|
#if BYTE_ORDER == LITTLE_ENDIAN || BYTE_ORDER == PDP_ENDIAN
|
|
/* fields in third byte */
|
|
u_char rd:1; /* recursion desired */
|
|
u_char tc:1; /* truncated message */
|
|
u_char aa:1; /* authoritive answer */
|
|
u_char opcode:4; /* purpose of message */
|
|
u_char qr:1; /* response flag */
|
|
/* fields in fourth byte */
|
|
u_char rcode:4; /* response code */
|
|
u_char unused:2; /* unused bits */
|
|
u_char pr:1; /* primary server required (non standard) */
|
|
u_char ra:1; /* recursion available */
|
|
#endif
|
|
/* remaining bytes */
|
|
u_short qdcount; /* number of question entries */
|
|
u_short ancount; /* number of answer entries */
|
|
u_short nscount; /* number of authority entries */
|
|
u_short arcount; /* number of resource entries */
|
|
} HEADER;
|
|
|
|
/*
|
|
* Defines for handling compressed domain names
|
|
*/
|
|
#define INDIR_MASK 0xc0
|
|
|
|
/*
|
|
* Structure for passing resource records around.
|
|
*/
|
|
struct rrec {
|
|
short r_zone; /* zone number */
|
|
short r_class; /* class number */
|
|
short r_type; /* type number */
|
|
u_long r_ttl; /* time to live */
|
|
int r_size; /* size of data area */
|
|
char *r_data; /* pointer to data */
|
|
};
|
|
|
|
extern u_short _getshort();
|
|
extern u_long _getlong();
|
|
|
|
/*
|
|
* Inline versions of get/put short/long.
|
|
* Pointer is advanced; we assume that both arguments
|
|
* are lvalues and will already be in registers.
|
|
* cp MUST be u_char *.
|
|
*/
|
|
#define GETSHORT(s, cp) { \
|
|
register u_char *t_cp = (u_char *)(cp); \
|
|
(s) = ((u_short)t_cp[0] << 8) \
|
|
| ((u_short)t_cp[1]) ;\
|
|
(cp) += 2; \
|
|
}
|
|
|
|
#define GETLONG(l, cp) { \
|
|
register u_char *t_cp = (u_char *)(cp); \
|
|
(l) = ((u_long)t_cp[0] << 24) \
|
|
| ((u_long)t_cp[1] << 16) \
|
|
| ((u_long)t_cp[2] << 8) \
|
|
| ((u_long)t_cp[3]) ;\
|
|
(cp) += 4; \
|
|
}
|
|
|
|
#define PUTSHORT(s, cp) { \
|
|
register u_short t_s = (u_short)(s); \
|
|
register u_char *t_cp = (u_char *)(cp); \
|
|
*t_cp++ = t_s >> 8; \
|
|
*t_cp = t_s; \
|
|
(cp) += 2; \
|
|
}
|
|
|
|
/*
|
|
* Warning: PUTLONG --no-longer-- destroys its first argument. if you
|
|
* were depending on this "feature", you will lose.
|
|
*/
|
|
#define PUTLONG(l, cp) { \
|
|
register u_long t_l = (u_long)(l); \
|
|
register u_char *t_cp = (u_char *)(cp); \
|
|
*t_cp++ = t_l >> 24; \
|
|
*t_cp++ = t_l >> 16; \
|
|
*t_cp++ = t_l >> 8; \
|
|
*t_cp = t_l; \
|
|
(cp) += 4; \
|
|
}
|
|
|
|
#endif /* !_NAMESER_H_ */
|