1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
|
/*
* Copyright (c) 1995, 1996, 1997 Kungliga Tekniska Hvgskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* 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 Kungliga Tekniska
* Hvgskolan and its contributors.
*
* 4. Neither the name of the Institute 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 INSTITUTE 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 INSTITUTE 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.
*/
#include "config.h"
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <netinet/in.h>
#include <arpa/nameser.h>
#include <string.h>
#ifdef HAVE_STRINGS_H
#include <strings.h>
#endif
#include <resolv.h>
#include "resolve.h"
static char rcsId[] = "$Id: resolve.c,v 2.8 2002/01/17 18:53:50 lukeh Exp $";
#if defined(HAVE_RES_SEARCH) && defined(HAVE_DN_EXPAND)
#define DECL(X) {#X, T_##X}
static struct stot
{
char *name;
int type;
}
stot[] =
{
DECL (A),
DECL (NS),
DECL (CNAME), DECL (PTR), DECL (MX), DECL (TXT), DECL (AFSDB), DECL (SRV),
{
NULL, 0}
};
static int
string_to_type (const char *name)
{
struct stot *p = stot;
for (p = stot; p->name; p++)
if (strcasecmp (name, p->name) == 0)
return p->type;
return -1;
}
#if 0
static char *
type_to_string (int type)
{
struct stot *p = stot;
for (p = stot; p->name; p++)
if (type == p->type)
return p->name;
return NULL;
}
#endif
void
dns_free_data (struct dns_reply *r)
{
struct resource_record *rr;
if (r->q.domain)
free (r->q.domain);
for (rr = r->head; rr;)
{
struct resource_record *tmp = rr;
if (rr->domain)
free (rr->domain);
if (rr->u.data)
free (rr->u.data);
rr = rr->next;
free (tmp);
}
free (r);
}
static struct dns_reply *
parse_reply (unsigned char *data, int len)
{
unsigned char *p;
char host[128];
int status;
struct dns_reply *r;
struct resource_record **rr;
r = (struct dns_reply *) malloc (sizeof (struct dns_reply));
#ifdef NeXT
bzero (r, sizeof (struct dns_reply));
#else
memset (r, 0, sizeof (struct dns_reply));
#endif
p = data;
#ifdef NeXT
bcopy (p, &r->h, sizeof (HEADER));
#else
memcpy (&r->h, p, sizeof (HEADER));
#endif
p += sizeof (HEADER);
status = dn_expand (data, data + len, p, host, sizeof (host));
if (status < 0)
{
dns_free_data (r);
return NULL;
}
r->q.domain = strdup (host);
p += status;
r->q.type = (p[0] << 8 | p[1]);
p += 2;
r->q.class = (p[0] << 8 | p[1]);
p += 2;
rr = &r->head;
while (p < data + len)
{
int type, class, ttl, size;
status = dn_expand (data, data + len, p, host, sizeof (host));
if (status < 0)
{
dns_free_data (r);
return NULL;
}
p += status;
type = (p[0] << 8) | p[1];
p += 2;
class = (p[0] << 8) | p[1];
p += 2;
ttl = (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3];
p += 4;
size = (p[0] << 8) | p[1];
p += 2;
*rr = (struct resource_record *) calloc (1,
sizeof (struct
resource_record));
(*rr)->domain = strdup (host);
(*rr)->type = type;
(*rr)->class = class;
(*rr)->ttl = ttl;
(*rr)->size = size;
switch (type)
{
case T_NS:
case T_CNAME:
case T_PTR:
status = dn_expand (data, data + len, p, host, sizeof (host));
if (status < 0)
{
dns_free_data (r);
return NULL;
}
(*rr)->u.txt = strdup (host);
break;
case T_MX:
case T_AFSDB:
{
status = dn_expand (data, data + len, p + 2, host, sizeof (host));
if (status < 0)
{
dns_free_data (r);
return NULL;
}
(*rr)->u.mx =
(struct mx_record *) malloc (sizeof (struct mx_record) +
strlen (host));
(*rr)->u.mx->preference = (p[0] << 8) | p[1];
strcpy ((*rr)->u.mx->domain, host);
break;
}
case T_SRV:
{
status = dn_expand (data, data + len, p + 6, host, sizeof (host));
if (status < 0)
{
dns_free_data (r);
return NULL;
}
(*rr)->u.srv =
(struct srv_record *) malloc (sizeof (struct srv_record) +
strlen (host));
(*rr)->u.srv->priority = (p[0] << 8) | p[1];
(*rr)->u.srv->weight = (p[2] << 8) | p[3];
(*rr)->u.srv->port = (p[4] << 8) | p[5];
strcpy ((*rr)->u.srv->target, host);
break;
}
case T_TXT:
{
(*rr)->u.txt = (char *) malloc (size + 1);
strncpy ((*rr)->u.txt, (char *) p + 1, *p);
(*rr)->u.txt[*p] = 0;
break;
}
default:
(*rr)->u.data = (unsigned char *) malloc (size);
#ifdef NeXT
bcopy (p, (*rr)->u.data, size);
#else
memcpy ((*rr)->u.data, p, size);
#endif
}
p += size;
rr = &(*rr)->next;
}
*rr = NULL;
return r;
}
struct dns_reply *
dns_lookup (const char *domain, const char *type_name)
{
unsigned char reply[1024];
int len;
int type;
struct dns_reply *r = NULL;
type = string_to_type (type_name);
len = res_search (domain, C_IN, type, reply, sizeof (reply));
if (len >= 0)
r = parse_reply (reply, len);
return r;
}
#else /* defined(HAVE_RES_SEARCH) && defined(HAVE_DN_EXPAND) */
struct dns_reply *
dns_lookup (const char *domain, const char *type_name)
{
return NULL;
}
void
dns_free_data (struct dns_reply *r)
{
}
#endif
#ifdef TEST
int
main (int argc, char **argv)
{
struct dns_reply *r;
struct resource_record *rr;
r = dns_lookup (argv[1], argv[2]);
if (r == NULL)
{
printf ("No reply.\n");
return 1;
}
for (rr = r->head; rr; rr = rr->next)
{
printf ("%s %s %d ", rr->domain, type_to_string (rr->type), rr->ttl);
switch (rr->type)
{
case T_NS:
printf ("%s\n", (char *) rr->data);
break;
case T_A:
printf ("%d.%d.%d.%d\n",
((unsigned char *) rr->data)[0],
((unsigned char *) rr->data)[1],
((unsigned char *) rr->data)[2],
((unsigned char *) rr->data)[3]);
break;
case T_MX:
case T_AFSDB:
{
struct mx_record *mx = (struct mx_record *) rr->data;
printf ("%d %s\n", mx->preference, mx->domain);
break;
}
case T_SRV:
{
struct srv_record *srv = (struct srv_record *) rr->data;
printf ("%d %d %d %s\n", srv->priority, srv->weight,
srv->port, srv->target);
break;
}
default:
printf ("\n");
break;
}
}
return 0;
}
#endif
|