1 |
30 |
unneback |
/*
|
2 |
|
|
* Copyright (c) 1985, 1993
|
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. All advertising materials mentioning features or use of this software
|
14 |
|
|
* must display the following acknowledgement:
|
15 |
|
|
* This product includes software developed by the University of
|
16 |
|
|
* California, Berkeley and its contributors.
|
17 |
|
|
* 4. Neither the name of the University nor the names of its contributors
|
18 |
|
|
* may be used to endorse or promote products derived from this software
|
19 |
|
|
* without specific prior written permission.
|
20 |
|
|
*
|
21 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
22 |
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
23 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
24 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
25 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
26 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
27 |
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
28 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
29 |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
30 |
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
31 |
|
|
* SUCH DAMAGE.
|
32 |
|
|
*/
|
33 |
|
|
|
34 |
|
|
/*
|
35 |
|
|
* Portions Copyright (c) 1993 by Digital Equipment Corporation.
|
36 |
|
|
*
|
37 |
|
|
* Permission to use, copy, modify, and distribute this software for any
|
38 |
|
|
* purpose with or without fee is hereby granted, provided that the above
|
39 |
|
|
* copyright notice and this permission notice appear in all copies, and that
|
40 |
|
|
* the name of Digital Equipment Corporation not be used in advertising or
|
41 |
|
|
* publicity pertaining to distribution of the document or software without
|
42 |
|
|
* specific, written prior permission.
|
43 |
|
|
*
|
44 |
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
|
45 |
|
|
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
|
46 |
|
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
|
47 |
|
|
* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
48 |
|
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
49 |
|
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
50 |
|
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
51 |
|
|
* SOFTWARE.
|
52 |
|
|
*/
|
53 |
|
|
|
54 |
|
|
/*
|
55 |
|
|
* Portions Copyright (c) 1996 by Internet Software Consortium.
|
56 |
|
|
*
|
57 |
|
|
* Permission to use, copy, modify, and distribute this software for any
|
58 |
|
|
* purpose with or without fee is hereby granted, provided that the above
|
59 |
|
|
* copyright notice and this permission notice appear in all copies.
|
60 |
|
|
*
|
61 |
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
62 |
|
|
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
63 |
|
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
64 |
|
|
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
65 |
|
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
66 |
|
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
67 |
|
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
68 |
|
|
* SOFTWARE.
|
69 |
|
|
*/
|
70 |
|
|
|
71 |
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
72 |
|
|
static char sccsid[] = "@(#)res_comp.c 8.1 (Berkeley) 6/4/93";
|
73 |
|
|
static char orig_rcsid[] = "From: Id: res_comp.c,v 8.11 1997/05/21 19:31:04 halley Exp $";
|
74 |
|
|
static char rcsid[] = "$Id: res_comp.c,v 1.2 2001-09-27 12:01:53 chris Exp $";
|
75 |
|
|
#endif /* LIBC_SCCS and not lint */
|
76 |
|
|
|
77 |
|
|
#include <sys/types.h>
|
78 |
|
|
#include <sys/param.h>
|
79 |
|
|
#include <netinet/in.h>
|
80 |
|
|
#include <arpa/nameser.h>
|
81 |
|
|
#include <ctype.h>
|
82 |
|
|
#include <resolv.h>
|
83 |
|
|
#include <stdio.h>
|
84 |
|
|
#include <string.h>
|
85 |
|
|
#include <unistd.h>
|
86 |
|
|
|
87 |
|
|
#define BIND_4_COMPAT
|
88 |
|
|
|
89 |
|
|
/*
|
90 |
|
|
* Expand compressed domain name 'comp_dn' to full domain name.
|
91 |
|
|
* 'msg' is a pointer to the begining of the message,
|
92 |
|
|
* 'eomorig' points to the first location after the message,
|
93 |
|
|
* 'exp_dn' is a pointer to a buffer of size 'length' for the result.
|
94 |
|
|
* Return size of compressed name or -1 if there was an error.
|
95 |
|
|
*/
|
96 |
|
|
int
|
97 |
|
|
dn_expand(const u_char *msg, const u_char *eom, const u_char *src,
|
98 |
|
|
char *dst, int dstsiz)
|
99 |
|
|
{
|
100 |
|
|
int n = ns_name_uncompress(msg, eom, src, dst, (size_t)dstsiz);
|
101 |
|
|
|
102 |
|
|
if (n > 0 && dst[0] == '.')
|
103 |
|
|
dst[0] = '\0';
|
104 |
|
|
return (n);
|
105 |
|
|
}
|
106 |
|
|
|
107 |
|
|
/*
|
108 |
|
|
* Pack domain name 'exp_dn' in presentation form into 'comp_dn'.
|
109 |
|
|
* Return the size of the compressed name or -1.
|
110 |
|
|
* 'length' is the size of the array pointed to by 'comp_dn'.
|
111 |
|
|
*/
|
112 |
|
|
int
|
113 |
|
|
dn_comp(const char *src, u_char *dst, int dstsiz,
|
114 |
|
|
u_char **dnptrs, u_char **lastdnptr)
|
115 |
|
|
{
|
116 |
|
|
return (ns_name_compress(src, dst, (size_t)dstsiz,
|
117 |
|
|
(const u_char **)dnptrs,
|
118 |
|
|
(const u_char **)lastdnptr));
|
119 |
|
|
}
|
120 |
|
|
|
121 |
|
|
/*
|
122 |
|
|
* Skip over a compressed domain name. Return the size or -1.
|
123 |
|
|
*/
|
124 |
|
|
int
|
125 |
|
|
dn_skipname(const u_char *ptr, const u_char *eom) {
|
126 |
|
|
const u_char *saveptr = ptr;
|
127 |
|
|
|
128 |
|
|
if (ns_name_skip(&ptr, eom) == -1)
|
129 |
|
|
return (-1);
|
130 |
|
|
return (ptr - saveptr);
|
131 |
|
|
}
|
132 |
|
|
|
133 |
|
|
/*
|
134 |
|
|
* Verify that a domain name uses an acceptable character set.
|
135 |
|
|
*/
|
136 |
|
|
|
137 |
|
|
/*
|
138 |
|
|
* Note the conspicuous absence of ctype macros in these definitions. On
|
139 |
|
|
* non-ASCII hosts, we can't depend on string literals or ctype macros to
|
140 |
|
|
* tell us anything about network-format data. The rest of the BIND system
|
141 |
|
|
* is not careful about this, but for some reason, we're doing it right here.
|
142 |
|
|
*/
|
143 |
|
|
#define PERIOD 0x2e
|
144 |
|
|
#define hyphenchar(c) ((c) == 0x2d)
|
145 |
|
|
#define bslashchar(c) ((c) == 0x5c)
|
146 |
|
|
#define periodchar(c) ((c) == PERIOD)
|
147 |
|
|
#define asterchar(c) ((c) == 0x2a)
|
148 |
|
|
#define alphachar(c) (((c) >= 0x41 && (c) <= 0x5a) \
|
149 |
|
|
|| ((c) >= 0x61 && (c) <= 0x7a))
|
150 |
|
|
#define digitchar(c) ((c) >= 0x30 && (c) <= 0x39)
|
151 |
|
|
|
152 |
|
|
#define borderchar(c) (alphachar(c) || digitchar(c))
|
153 |
|
|
#define middlechar(c) (borderchar(c) || hyphenchar(c))
|
154 |
|
|
#define domainchar(c) ((c) > 0x20 && (c) < 0x7f)
|
155 |
|
|
|
156 |
|
|
int
|
157 |
|
|
res_hnok(dn)
|
158 |
|
|
const char *dn;
|
159 |
|
|
{
|
160 |
|
|
int ppch = '\0', pch = PERIOD, ch = *dn++;
|
161 |
|
|
|
162 |
|
|
while (ch != '\0') {
|
163 |
|
|
int nch = *dn++;
|
164 |
|
|
|
165 |
|
|
if (periodchar(ch)) {
|
166 |
|
|
(void)NULL;
|
167 |
|
|
} else if (periodchar(pch)) {
|
168 |
|
|
if (!borderchar(ch))
|
169 |
|
|
return (0);
|
170 |
|
|
} else if (periodchar(nch) || nch == '\0') {
|
171 |
|
|
if (!borderchar(ch))
|
172 |
|
|
return (0);
|
173 |
|
|
} else {
|
174 |
|
|
if (!middlechar(ch))
|
175 |
|
|
return (0);
|
176 |
|
|
}
|
177 |
|
|
ppch = pch, pch = ch, ch = nch;
|
178 |
|
|
}
|
179 |
|
|
return (1);
|
180 |
|
|
}
|
181 |
|
|
|
182 |
|
|
/*
|
183 |
|
|
* hostname-like (A, MX, WKS) owners can have "*" as their first label
|
184 |
|
|
* but must otherwise be as a host name.
|
185 |
|
|
*/
|
186 |
|
|
int
|
187 |
|
|
res_ownok(dn)
|
188 |
|
|
const char *dn;
|
189 |
|
|
{
|
190 |
|
|
if (asterchar(dn[0])) {
|
191 |
|
|
if (periodchar(dn[1]))
|
192 |
|
|
return (res_hnok(dn+2));
|
193 |
|
|
if (dn[1] == '\0')
|
194 |
|
|
return (1);
|
195 |
|
|
}
|
196 |
|
|
return (res_hnok(dn));
|
197 |
|
|
}
|
198 |
|
|
|
199 |
|
|
/*
|
200 |
|
|
* SOA RNAMEs and RP RNAMEs can have any printable character in their first
|
201 |
|
|
* label, but the rest of the name has to look like a host name.
|
202 |
|
|
*/
|
203 |
|
|
int
|
204 |
|
|
res_mailok(dn)
|
205 |
|
|
const char *dn;
|
206 |
|
|
{
|
207 |
|
|
int ch, escaped = 0;
|
208 |
|
|
|
209 |
|
|
/* "." is a valid missing representation */
|
210 |
|
|
if (*dn == '\0')
|
211 |
|
|
return (1);
|
212 |
|
|
|
213 |
|
|
/* otherwise <label>.<hostname> */
|
214 |
|
|
while ((ch = *dn++) != '\0') {
|
215 |
|
|
if (!domainchar(ch))
|
216 |
|
|
return (0);
|
217 |
|
|
if (!escaped && periodchar(ch))
|
218 |
|
|
break;
|
219 |
|
|
if (escaped)
|
220 |
|
|
escaped = 0;
|
221 |
|
|
else if (bslashchar(ch))
|
222 |
|
|
escaped = 1;
|
223 |
|
|
}
|
224 |
|
|
if (periodchar(ch))
|
225 |
|
|
return (res_hnok(dn));
|
226 |
|
|
return (0);
|
227 |
|
|
}
|
228 |
|
|
|
229 |
|
|
/*
|
230 |
|
|
* This function is quite liberal, since RFC 1034's character sets are only
|
231 |
|
|
* recommendations.
|
232 |
|
|
*/
|
233 |
|
|
int
|
234 |
|
|
res_dnok(dn)
|
235 |
|
|
const char *dn;
|
236 |
|
|
{
|
237 |
|
|
int ch;
|
238 |
|
|
|
239 |
|
|
while ((ch = *dn++) != '\0')
|
240 |
|
|
if (!domainchar(ch))
|
241 |
|
|
return (0);
|
242 |
|
|
return (1);
|
243 |
|
|
}
|
244 |
|
|
|
245 |
|
|
#ifdef BIND_4_COMPAT
|
246 |
|
|
/*
|
247 |
|
|
* This module must export the following externally-visible symbols:
|
248 |
|
|
* ___putlong
|
249 |
|
|
* ___putshort
|
250 |
|
|
* __getlong
|
251 |
|
|
* __getshort
|
252 |
|
|
* Note that one _ comes from C and the others come from us.
|
253 |
|
|
*/
|
254 |
|
|
void __putlong(u_int32_t src, u_char *dst) { ns_put32(src, dst); }
|
255 |
|
|
void __putshort(u_int16_t src, u_char *dst) { ns_put16(src, dst); }
|
256 |
|
|
u_int32_t _getlong(const u_char *src) { return (ns_get32(src)); }
|
257 |
|
|
u_int16_t _getshort(const u_char *src) { return (ns_get16(src)); }
|
258 |
|
|
#endif /*BIND_4_COMPAT*/
|