|
|
1.1 root 1: /*
2: * Copyright (c) 1983 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that the above copyright notice and this paragraph are
7: * duplicated in all such forms and that any documentation,
8: * advertising materials, and other materials related to such
9: * distribution and use acknowledge that the software was developed
10: * by the University of California, Berkeley. The name of the
11: * University may not be used to endorse or promote products derived
12: * from this software without specific prior written permission.
13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
16: *
17: * @(#)nameser.h 5.18 (Berkeley) 6/27/88
18: */
19:
20: /*
21: * Define constants based on rfc883
22: */
23: #define PACKETSZ 512 /* maximum packet size */
24: #define MAXDNAME 256 /* maximum domain name */
25: #define MAXCDNAME 255 /* maximum compressed domain name */
26: #define MAXLABEL 63 /* maximum length of domain label */
27: /* Number of bytes of fixed size data in query structure */
28: #define QFIXEDSZ 4
29: /* number of bytes of fixed size data in resource record */
30: #define RRFIXEDSZ 10
31:
32: /*
33: * Internet nameserver port number
34: */
35: #define NAMESERVER_PORT 53
36:
37: /*
38: * Currently defined opcodes
39: */
40: #define QUERY 0x0 /* standard query */
41: #define IQUERY 0x1 /* inverse query */
42: #define STATUS 0x2 /* nameserver status query */
43: /*#define xxx 0x3 /* 0x3 reserved */
44: /* non standard */
45: #define UPDATEA 0x9 /* add resource record */
46: #define UPDATED 0xa /* delete a specific resource record */
47: #define UPDATEDA 0xb /* delete all nemed resource record */
48: #define UPDATEM 0xc /* modify a specific resource record */
49: #define UPDATEMA 0xd /* modify all named resource record */
50:
51: #define ZONEINIT 0xe /* initial zone transfer */
52: #define ZONEREF 0xf /* incremental zone referesh */
53:
54: /*
55: * Currently defined response codes
56: */
57: #define NOERROR 0 /* no error */
58: #define FORMERR 1 /* format error */
59: #define SERVFAIL 2 /* server failure */
60: #define NXDOMAIN 3 /* non existent domain */
61: #define NOTIMP 4 /* not implemented */
62: #define REFUSED 5 /* query refused */
63: /* non standard */
64: #define NOCHANGE 0xf /* update failed to change db */
65:
66: /*
67: * Type values for resources and queries
68: */
69: #define T_A 1 /* host address */
70: #define T_NS 2 /* authoritative server */
71: #define T_MD 3 /* mail destination */
72: #define T_MF 4 /* mail forwarder */
73: #define T_CNAME 5 /* connonical name */
74: #define T_SOA 6 /* start of authority zone */
75: #define T_MB 7 /* mailbox domain name */
76: #define T_MG 8 /* mail group member */
77: #define T_MR 9 /* mail rename name */
78: #define T_NULL 10 /* null resource record */
79: #define T_WKS 11 /* well known service */
80: #define T_PTR 12 /* domain name pointer */
81: #define T_HINFO 13 /* host information */
82: #define T_MINFO 14 /* mailbox information */
83: #define T_MX 15 /* mail routing information */
84: /* non standard */
85: #define T_UINFO 100 /* user (finger) information */
86: #define T_UID 101 /* user ID */
87: #define T_GID 102 /* group ID */
88: #define T_UNSPEC 103 /* Unspecified format (binary data) */
89: /* Query type values which do not appear in resource records */
90: #define T_AXFR 252 /* transfer zone of authority */
91: #define T_MAILB 253 /* transfer mailbox records */
92: #define T_MAILA 254 /* transfer mail agent records */
93: #define T_ANY 255 /* wildcard match */
94:
95: /*
96: * Values for class field
97: */
98:
99: #define C_IN 1 /* the arpa internet */
100: #define C_CHAOS 3 /* for chaos net at MIT */
101: /* Query class values which do not appear in resource records */
102: #define C_ANY 255 /* wildcard match */
103:
104: /*
105: * Status return codes for T_UNSPEC conversion routines
106: */
107: #define CONV_SUCCESS 0
108: #define CONV_OVERFLOW -1
109: #define CONV_BADFMT -2
110: #define CONV_BADCKSUM -3
111: #define CONV_BADBUFLEN -4
112:
113: /*
114: * Structure for query header, the order of the fields is machine and
115: * compiler dependent, in our case, the bits within a byte are assignd
116: * least significant first, while the order of transmition is most
117: * significant first. This requires a somewhat confusing rearrangement.
118: */
119:
120: typedef struct {
121: u_short id; /* query identification number */
122: #if defined (sun) || defined (sel) || defined (pyr) || defined (is68k) \
123: || defined (tahoe) || defined (BIT_ZERO_ON_LEFT)
124: /* Bit zero on left: Gould and similar architectures */
125: /* fields in third byte */
126: u_char qr:1; /* response flag */
127: u_char opcode:4; /* purpose of message */
128: u_char aa:1; /* authoritive answer */
129: u_char tc:1; /* truncated message */
130: u_char rd:1; /* recursion desired */
131: /* fields in fourth byte */
132: u_char ra:1; /* recursion available */
133: u_char pr:1; /* primary server required (non standard) */
134: u_char unused:2; /* unused bits */
135: u_char rcode:4; /* response code */
136: #else
137: #if defined (vax) || defined(ns32000) || defined (BIT_ZERO_ON_RIGHT)
138: /* Bit zero on right: VAX */
139: /* fields in third byte */
140: u_char rd:1; /* recursion desired */
141: u_char tc:1; /* truncated message */
142: u_char aa:1; /* authoritive answer */
143: u_char opcode:4; /* purpose of message */
144: u_char qr:1; /* response flag */
145: /* fields in fourth byte */
146: u_char rcode:4; /* response code */
147: u_char unused:2; /* unused bits */
148: u_char pr:1; /* primary server required (non standard) */
149: u_char ra:1; /* recursion available */
150: #else
151: /* you must determine what the correct bit order is for your compiler */
152: UNDEFINED_BIT_ORDER;
153: #endif
154: #endif
155: /* remaining bytes */
156: u_short qdcount; /* number of question entries */
157: u_short ancount; /* number of answer entries */
158: u_short nscount; /* number of authority entries */
159: u_short arcount; /* number of resource entries */
160: } HEADER;
161:
162: /*
163: * Defines for handling compressed domain names
164: */
165: #define INDIR_MASK 0xc0
166:
167: /*
168: * Structure for passing resource records around.
169: */
170: struct rrec {
171: short r_zone; /* zone number */
172: short r_class; /* class number */
173: short r_type; /* type number */
174: u_long r_ttl; /* time to live */
175: int r_size; /* size of data area */
176: char *r_data; /* pointer to data */
177: };
178:
179: extern u_short _getshort();
180: extern u_long _getlong();
181:
182: /*
183: * Inline versions of get/put short/long.
184: * Pointer is advanced; we assume that both arguments
185: * are lvalues and will already be in registers.
186: * cp MUST be u_char *.
187: */
188: #define GETSHORT(s, cp) { \
189: (s) = *(cp)++ << 8; \
190: (s) |= *(cp)++; \
191: }
192:
193: #define GETLONG(l, cp) { \
194: (l) = *(cp)++ << 8; \
195: (l) |= *(cp)++; (l) <<= 8; \
196: (l) |= *(cp)++; (l) <<= 8; \
197: (l) |= *(cp)++; \
198: }
199:
200:
201: #define PUTSHORT(s, cp) { \
202: *(cp)++ = (s) >> 8; \
203: *(cp)++ = (s); \
204: }
205:
206: /*
207: * Warning: PUTLONG destroys its first argument.
208: */
209: #define PUTLONG(l, cp) { \
210: (cp)[3] = l; \
211: (cp)[2] = (l >>= 8); \
212: (cp)[1] = (l >>= 8); \
213: (cp)[0] = l >> 8; \
214: (cp) += sizeof(u_long); \
215: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.